A dated record of results from the author's research program on the contextuality degree of multi-qubit Pauli configurations, obtained on 20 October 2026. It gives statements and status labels only: lower bounds d(Q-(9,2)) ≥ 6,510 and d(W(9,2)) ≥ 28,830 (computer-assisted; not refereed); a characterization of the optimal assignments of Q+(7,2) as sign patterns of real Pauli-flat states, and a route to the Li-Gupta-Ganesh classification of its 240 optimal sets without computer enumeration (conditional on two cited classification results); a certification update for the four-qubit chain of record 10.5281/zenodo.23510634. Proofs, code and data are held privately. The record includes SHA-256 commitments to the evidence files and to a sealed document stating four further results. Not peer reviewed.
A dated record of results from the author's research program on the contextuality degree of multi-qubit Pauli configurations, obtained on 20 October 2026. It gives statements and status labels only: lower bounds d(Q-(9,2)) ≥ 6,510 and d(W(9,2)) ≥ 28,830 (computer-assisted; not refereed); a characterization of the optimal assignments of Q+(7,2) as sign patterns of real Pauli-flat states, and a route to the Li-Gupta-Ganesh classification of its 240 optimal sets without computer enumeration (conditional on two cited classification results); a certification update for the four-qubit chain of record 10.5281/zenodo.23510634. Proofs, code and data are held privately. The record includes SHA-256 commitments to the evidence files and to a sealed document stating four further results. Not peer reviewed.
Li, Gupta and Ganesh (arXiv:2610.26465) determined the contextuality degree of the four-qubit hyperbolic quadric Q+(7,2): it is 315. They asked for the degrees of the elliptic quadric Q-(7,2) and of W(7,2), and whether the five-qubit hyperbolic quadric Q+(9,2) has degree 4743. This note proves, with computer assistance, that every elliptic quadric Q-(7,2) has degree 315, hence d(W(7,2)) = 1575. A short argument by hand shows that each hyperplane section of Q+(9,2) by a point off the quadric is a sign-consistent copy of W(7,2). Together with an explicit assignment this gives d(Q+(9,2)) = 6975, so the answer to the five-qubit question is negative. The resulting noncontextuality inequalities have classical-to-quantum ratio 7/17. The underlying regenerated proof, with code and certificates, is Zenodo record 10.5281/zenodo.23510634. Not peer reviewed; the computer-assisted parts and their checks are described in Section 4 of the note.
We prove, computer-assisted, that every elliptic quadric Q−(7,2) of the four-qubit symplectic polar space W(7,2) has contextuality degree 315. Hence d(W(7,2)) = 1575, closing the published bracket 1071 ≤ d ≤ 1575 (Muller et al., J. Phys. A 58 (2025) 215302), and every five-qubit hyperbolic quadric has d(Q+(9,2)) = 6975. These results settle the first open problem of Li, Gupta and Ganesh (arXiv:2610.26465) and answer their question whether d(Q+(9,2)) = 4743 in the negative. The optimal assignments of Q−(7,2) (391,680 gauge classes), W(7,2) (1,175,040) and Q+(9,2) (2,350,080) each form a single orbit of the symmetry group. For the hyperbolic quadric Q+(7,2), the degree 315 and the 240 optimal classes (one orbit) were first proved by Li, Gupta and Ganesh; our independent count agrees. The note also proves a section–square law: for a quadric Q of the n-qubit space and a point d off it, the completion problem of a section carrier on Q ∩ d⊥ ≅ W(2n−3,2) is governed by the anticommutator action of the (n−1)-qubit carrier operator on the exterior square (elliptic Q) or symmetric square (hyperbolic Q), with spectrum {(μi + μj)/2}. At four qubits this explains the two tight carriers of Q−(7,2): the Hoggar carrier (spectrum {21, −3^7}; its optimal completions are exactly the 144 sign vectors of one eigenspace) and a second carrier with characteristic polynomial (t+3)^5 (t^3 − 15t^2 − 117t + 579). The proof is regenerated here with new code in intrinsic three-qubit coordinates, and every input is shipped. The package contains the exhaustive census program (C), 42 exact lower-bound certificates checked by integer Bareiss elimination, a standard-library Python verifier that rebuilds the Pauli algebra from 2×2 matrices (ALL CHECKS PASS in seconds; 13 single-input mutations rejected), the classification programs, every run record, and the report of an independent re-implementation (a separate AI agent writing its own code from the definitions) that reproduced the census, every completion minimum and all 42 certificates. A proof log for the census step (LRAT, checked with the formally verified checker cake_lpr) was produced separately and is not part of this record. Computer-assisted; not formally verified; not peer reviewed. Computations and drafting were carried out with an AI assistant (Claude, Anthropic) under the author's direction.
Preprint v0.3, not peer reviewed; the proofs were written with AI assistance and are AI-refereed (same model family), not formally verified. For n-qubit Pauli observables closed under products of commuting pairs we prove the operator identity A^2 = NI + 2K - 4V. For W(2n-1,2) and both quadric types, the spectral lower bound on the contextuality degree is attained exactly when some assignment is violation-regular with a simple (Kramers-simple) top eigenvalue; for n >= 2 this happens exactly for W(5,2), Q+(7,2), Q-(3,2) and Q-(5,2) (three by exact computation). For the four-qubit elliptic quadric, a hyperplane completion violates 378 - <sigma, h(X)> outside lines, h(X) being read off a Gram operator. With computer assistance, an odd count forces Gram rank 8, and Gram rank 2 forces counts divisible by 4. That every completion minimum is a multiple of 4 is false (computer-certified counterexamples, not proof-checked). Data are committed by SHA-256.
In the Kochen–Specker system of the E8 root system (120 rays, 2025 orthonormal bases), the largest number of bases containing exactly one selected ray is 1680, so every selection fails at least 345 bases. Every maximizer selects 14 rays whose orthogonality graph is seven disjoint edges; there are exactly 1080 maximizers, one for each antipodal pair of norm-4 vectors z of the E8 lattice (the rays r with |⟨r,z⟩| = 2). The proof combines a symmetry-reduced degree-4 Boolean moment relaxation with exact rational dual certificates, a certificate excluding induced three-vertex paths at the optimum, and a classification in the mod-2 quadratic space of E8. The upper bound, the classification, the certificates and two checking programs were produced with a GPT-based AI assistant in one session; these two programs are not independent review. An AI referee then checked that proof with its own code and reproduced every bound exactly. The certificate data are committed by SHA-256. Status: computer-assisted; exact rational certificates; AI-refereed (same model family as the coordinating assistant); not formally verified; not peer reviewed.