{"id":"openai-math/The-Exponential-Time-Hypothesis-is-False","pdf":"https://github.com/openai/math/blob/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026","score":0,"title":"The Exponential Time Hypothesis is False","domain":"Theoretical computer science","family":"378","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"cs.CC","summary":"OpenAI's October 25 manuscript claims deterministic exact #k-SAT in subexponential time and polynomial space, refuting ETH for k=3. The published Lean scope states an exponent O_k(n (log log n)^2 / sqrt(log n)); the manuscript gives sharper bounds with one log log n and a further sparse-input improvement. Those sharper bounds are not claimed here as Lean-verified. Released October 26 for independent examination.","category":"research","comments":1,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-10-25","reactions":{},"formalized":true,"family_title":"Disproof of the Exponential Time Hypothesis","formalizations":["https://github.com/openai/math/blob/main/lean/docs/378.md"]}