What was already known
The critical form compares the first size from which every configuration wins with the first size from which every almost-stacked configuration wins. It differs from the printed pointwise formulation.
AI involvement
Fairfax-Ball set the direction and approved sessions. The project records Claude and Codex carrying out the mathematical work, certificate construction, independent agent rechecks and Lean development.
- The critical Almost Stacked Hypothesis fails on a nine-vertex graphThe critical Almost Stacked Hypothesis fails on a nine-vertex graph
Importance
An explicit finite graph separates two thresholds that the critical hypothesis predicts are equal.
Technical verification
The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.
Formal checking
The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.
- Checker
- John Fairfax-Ball, reporting Lean 4 verification
- Scope
- The pinned project reports Lean checking of the two refutations, exact certificate replay and Comparator verification with several kernels. One external checker was inconclusive under the memory limit.
- Basis
- Reported by the linked checker
- Pinned theorem, provenance and checking recordPinned theorem, provenance and checking record
Human understanding
The project publishes an argument for the critical stacking loser, but does not attribute that explanation to a human.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision