What was already known
Cohn and Li’s 1,024-word extension established k(19)≥11,692.
AI involvement
Boon Suan Ho credits GPT-5.4 Pro with discovering the larger-code construction. Ho explains the Golay-code and Clebsch-graph lift and supplies the proof and exact checking package.
GPT-5.4 Pro is credited with discovering the retained larger-code construction, while Ho supplies the full written argument and finite verification package.
Importance
Raises the best stated dimension-19 lower bound by 256 points.
Limitations
This is a lower bound, not the exact kissing number. The exact configuration and construction checks are reported by Ho’s package; no independent human checker is named.
Technical verification
The supporting package reports an exact check of every norm and pairwise kissing condition for the deposited 11,948-point configuration; a second exact checker matches the paper’s 1,280 added vectors to its combinatorial construction.
Formal checking
exact arithmetic checks of norms, inner products, Hamming distance and construction data; source-reported.
- Checker
- Boon Suan Ho’s Python verification package
- Scope
- The deposited 11,948 vectors form a valid kissing configuration in R^19 and the final 1,280 vectors match the paper’s code
- Basis
- Reported by the linked checker
Checking a formal statement does not establish that it matches the original problem.
Human understanding
Ho explains how low-weight Golay words give a Clebsch-graph quotient and how a five-vertex independent set lifts to the 1,280-word code.
Correction and publication history
Raises the best stated dimension-19 lower bound by 256 points.
Read this published revision