Claims

../

2022_01_14_white: Theorem 1 of White's paper (Acta Arith. 2023) that the minimum overlap constant is at least 0.379005, the site's record lower bound; refereed, with two printed-formula inconsistencies recorded on the library card.

2026_01_22_yuksekgonul_et_al: The 600-piece step function found by the TTT-Discover system of Yuksekgonul and ten coauthors (arXiv 2026) that bounds the minimum overlap constant above by 0.380876, the site's record; the certificate is not in the PDF, so claimed.

2026_06_30_kim_pilanci: The semidefinite strengthening of White's convex relaxation by Kim and Pilanci (arXiv 2026), found with AI agents and human review, which reports the lower bound 0.37912; a preprint without outside review, so claimed.

2026_07_12_russell: Russell's Zenodo paper (2026) certifying by exact rational evaluation of explicit step functions that the minimum overlap constant is below 0.38085906; self-published without outside review, so claimed.

2026_07_20_price: A partial proof claim on the site's proof-claims tab, submitted by Liam Price on 2026-07-20 and credited to GPT Pro, that the minimum overlap constant is at least 0.38055470; unexamined by the site, so claimed.

2026_09_19_drynshock: A partial proof claim on the site's proof-claims tab, submitted by the user Drynshock on 2026-09-19 and credited to GPT 6 Pro, that the minimum overlap constant exceeds 0.3805634; unexamined by the site, so claimed.

---