Source authenticated

The proper hat-guessing number of K7eK_7-e

We prove HGP(K7e)=12\mathrm{HG}_P(K_7-e)=12. One lower-bound proof uses two explicit block-disjoint S(5,6,12)S(5,6,12) Witt designs. A second uses orbit maps from an explicitly regenerated sharply five-transitive twelve-point permutation group, combining one set-symmetric and one order-sensitive rule. Both satisfy a general coordinate-line twin-completion criterion, and Hall's theorem completes the clique strategy. The release also proves a disjoint completion-design theorem, an even-nn obstruction scoped to set-symmetric line-permutation twins in this sufficient framework, and a prime-admissibility theorem for the design parameters. It does not solve the general KneK_n-e problem or K8eK_8-e.

Exact FrontierDelta

Prior state unknownproved

Scope and record

Occurred: Sep 3, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: announcement. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: The proper hat-guessing number of $K_7-e$ · $\mathrm{HG}_P(K_7-e)=12$

Confidence: Not scored

Registry verification: unreviewed · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT-5.6 Pro
model · ai model contributor · OpenAI

Artifacts and verifiers

Verifier, certificates and public disclosure

code · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

This event attributed to GPT-5.6 Pro

Public draft PR #2 and release record evidence for this event

We prove HGP(K7e)=12\mathrm{HG}_P(K_7-e)=12. One lower-bound proof uses two explicit block-disjoint S(5,6,12)S(5,6,12) Witt designs. A second uses orbit maps from an explicitly regenerated sharply five-transitive twelve-point permutation group, combining one set-symmetric and one order-sensitive rule. Both satisfy a general coordinate-line twin-completion criterion, and Hall's theorem completes the clique strategy. The release also proves a disjoint completion-design theorem, an even-nn obstruction scoped to set-symmetric line-permutation twins in this sufficient framework, and a prime-admissibility theorem for the design parameters. It does not solve the general KneK_n-e problem or K8eK_8-e. parent of this event

Verifier, certificates and public disclosure evidence for this event

The proper hat-guessing number of K7eK_7-e parent of this event

VibeMathed record: The proper hat-guessing number of K7eK_7-e evidence for this event

The proper hat-guessing number of K7eK_7-e evidence for this event

Four-page K7-e preprint source evidence for this event

Hat guessing with proper colorings (Adriaensen et al.) evidence for this event

Independent adversarial review acceptance evidence for this event

Act on this frontier

Verify, challenge, or extend the result.