{"schema":"postcutoff/event@1","as_of":"2026-10-09T19:24:00+02:00","url":"https://postcutoff.com/e/2026-10-08-dualization-eth-lower-bound-gpt-6-astra/","md":"https://postcutoff.com/e/2026-10-08-dualization-eth-lower-bound-gpt-6-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"Adam Bicz","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-10-08-dualization-eth-lower-bound-gpt-6-astra","date":"2026-10-08","date_precision":"day","short_title":"GPT-6 Astra finds a 3SAT reduction showing monotone Dualization (minimal hypergraph transversals) has no polynomial algorithm under ETH","deck":null,"takeaway":"Whether monotone Boolean dualization, equivalently enumerating all minimal transversals of a hypergraph, can be done in output-polynomial time has been open since the 1990s. A short preprint says no, assuming the Exponential Time Hypothesis, and its authors say the proof 'was originally discovered by GPT-6 Astra'.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"Kobayashi, Kurita & Wasa: An ETH-based quasipolynomial lower bound for Dualization (arXiv 2610.11473)","url":"https://arxiv.org/abs/2610.11473","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-09","updated":"2026-10-09","orgs":["Hokkaido University","Okayama University","Hosei University","OpenAI"],"title":"GPT-6 Astra finds a 3SAT reduction showing monotone Dualization (minimal hypergraph transversals) has no polynomial algorithm under ETH","summary":"On 8 Oct 2026 Yasuaki Kobayashi, Kazuhiro Kurita and Kunihiro Wasa posted arXiv 2610.11473: a deterministic reduction from 3SAT with n variables to the complement of Dual, producing hypergraphs of size 2^O(n^(2/3) (log n)^(1/3)). Under the Exponential Time Hypothesis, neither Dual nor Dualization has an N^o(√(log N / log log N)) algorithm, so Dualization has no output-polynomial algorithm. The best known algorithm, Fredman–Khachiyan (1996), runs in quasipolynomial time N^O(log N / log log N). Disclosure: \"The proof of Theorem 1 was originally discovered by GPT-6 Astra (OpenAI). The authors subsequently reconstructed and revised the argument and rewrote its exposition.\"","key_facts":["Problem: Dual asks whether two monotone CNFs are mutually dual (equivalently whether L = Tr(H) for hypergraphs H, L); Dualization asks to enumerate all minimal transversals of H. Their output-polynomial solvability is a long-standing open problem; Fredman–Khachiyan's 1996 algorithm runs in N^O(log N / log log N)","Theorem 1: a deterministic algorithm maps a 3CNF with n variables to hypergraphs H, L with L ⊆ Tr(H), of size 2^O(n^(2/3)(log n)^(1/3)), such that the formula is satisfiable iff L ≠ Tr(H)","Consequence under ETH: no N^o(√(log N / log log N)) algorithm for Dual or Dualization, hence no polynomial-time algorithm for Dual and no output-polynomial enumeration for Dualization. It also rules out output-polynomial algorithms for the many problems known to be Dualization-hard (minimal dominating sets, which are 'polynomially equivalent', and others)","AI disclosure (verbatim): 'The proof of Theorem 1 was originally discovered by GPT-6 Astra (OpenAI). The authors subsequently reconstructed and revised the argument and rewrote its exposition. The same AI model was also used to prepare drafts of several parts of the manuscript. The authors have verified the correctness of the results and take full responsibility'","The paper is short (main text ends on page 9); unrefereed; no Lean formalization; no expert reactions found on X, HN or blogs as of 9 Oct","Not in OpenAI's 6 Oct catalogue (no Dualization or transversal family in CONTENTS.md)"],"key_numbers":[],"tags":["computer-science","complexity","enumeration","hypergraphs","eth","gpt-6-astra","unverified"],"science":{"field":"computer-science","subfield":"computational complexity / enumeration algorithms","problem":"Is monotone Boolean dualization (hypergraph transversal enumeration) solvable in output-polynomial time?","result":"No, under the Exponential Time Hypothesis: a 3SAT reduction rules out N^o(√(log N/log log N)) algorithms, leaving a gap only between √(log N) and log N in the exponent.","open_since":"","ai_system":["GPT-6 Astra"],"human_role":"AI found the proof of the main theorem; the authors reconstructed, revised and verified it and rewrote the exposition","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint; checked by the authors"},"status":"pending","shock":"A decades-old question in enumeration complexity, widely studied since Fredman–Khachiyan, gets a short conditional answer whose key reduction came from a chatbot.","short":"Dualization lower bound under ETH"},"body_md":"## What happened\n\nDualization of monotone Boolean functions appears in databases, data mining, AI and convex geometry, and many enumeration\nproblems are known to be exactly as hard. Fredman and Khachiyan showed in 1996 that it can be done in quasipolynomial time,\nand since then the question has been whether it can be done in output-polynomial time. Most work has found tractable\nspecial cases.\n\nKobayashi, Kurita and Wasa give a subexponential reduction from 3SAT: partial assignments to blocks of variables become\nvertices, and the formula is satisfiable exactly when a candidate list of minimal transversals is incomplete. With the\nExponential Time Hypothesis this rules out polynomial-time duality testing. The authors say GPT-6 Astra discovered the\nproof of the main theorem.\n\n## Why it matters\n\nIf it holds, it closes the main question about Dualization conditionally. The quasipolynomial algorithm is close to optimal\nand a whole family of enumeration problems inherits the lower bound. Because the argument is short and the claim is strong,\nexpert checking matters. Status: unrefereed.","disputed":[{"label":"Verification","text":"Unrefereed preprint; checked by the authors","sources":[]}],"related":[{"id":"2026-10-07-multiple-unicast-conjecture-false-gpt-6","url":"https://postcutoff.com/e/2026-10-07-multiple-unicast-conjecture-false-gpt-6/","date":"2026-10-07","date_precision":"day","short_title":"Braverman & He refute the 2004 undirected multiple-unicast (network coding) conjecture with a GPT-6-found counterexample on PG(2, 9)","deck":null,"takeaway":"A 22-year-old network coding conjecture is false: on undirected networks, coding can beat routing. The counterexample came from GPT-6, and the Princeton authors checked it with a standalone symbolic verifier.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":3,"official":3,"filed":"2026-10-08","updated":"2026-10-08","orgs":["Princeton University","OpenAI"]},{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":9,"official":4,"filed":"2026-09-30","updated":"2026-10-09","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-09","type":"filed","text":"Created from the arXiv PDF"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-09","run":null,"sources_read":"The arXiv PDF","updated":"2026-10-09","human_review":null,"version":null},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":161,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":100,"in_training_data":false},{"model_id":"gemini-3-8-flash","name":"Gemini 3.8 Flash","cutoff":"2026-03","days_after":191,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":130,"in_training_data":false}],"short_url":"https://postcutoff.com/s/gpt-6-astra-finds-3sat"}