{"schema":"postcutoff/event@1","as_of":"2026-11-19T22:11:00+01:00","url":"https://postcutoff.com/e/2026-09-26-mubayi-zarankiewicz-astra/","md":"https://postcutoff.com/e/2026-09-26-mubayi-zarankiewicz-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-09-26-mubayi-zarankiewicz-astra","date":"2026-09-26","date_precision":"day","short_title":"GPT-6 Astra finds a proof improving the Kővári–Sós–Turán bound","deck":"Diagonal bipartite Ramsey numbers b(t,t) = O(2^t) (Mubayi)","takeaway":"On Sept 26, 2026 Dhruv Mubayi posted a proof that every bipartite graph with N vertices per side and at least N²/2 edges contains K_{t,t} once N ≥ c·2^t.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2609.32937: Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds","url":"https://arxiv.org/abs/2609.32937","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-01","updated":"2026-10-01","orgs":["University of Illinois Chicago","OpenAI"],"title":"GPT-6 Astra finds a proof improving the Kővári–Sós–Turán bound: diagonal bipartite Ramsey numbers b(t,t) = O(2^t) (Mubayi)","summary":"On Sept 26, 2026 Dhruv Mubayi posted a proof that every bipartite graph with N vertices per side and at least N²/2 edges contains K_{t,t} once N ≥ c·2^t. That improves the classical Kővári–Sós–Turán requirement of order t·2^t and cuts the diagonal bipartite Ramsey upper bound from Conlon's O(2^t log t) to O(2^t). The abstract says \"The proof was found by GPT-6 Astra\": an 8-page proof the author first found incomprehensible and then rewrote with the model.","key_facts":["arXiv 2609.32937 (math.CO), Dhruv Mubayi, 'Sharper Zarankiewicz and Diagonal Bipartite Ramsey Bounds', Sept 26, 2026","Result: density ≥ 1/2 bipartite graphs contain K_{t,t} when N ≥ c·2^t; hence b(t,t) = O(2^t), improving Conlon's O(2^t log t)","AI declaration: 'The proof of the main result was found by GPT-6 Astra after several guided prompts by the author. Astra first produced a proof that was only 8 pages long and was incomprehensible to the author'; later write-ups are largely the author's","Mubayi had earlier prompted Astra to extensions of the Erdős–Sós work (see 2026-09-03-erdos-sos-conjecture-proved-gpt-6-astra)"],"key_numbers":[],"tags":["math","combinatorics","ramsey-theory","zarankiewicz","gpt-6-astra"],"science":{"field":"mathematics","subfield":"extremal graph theory / Ramsey theory","problem":"Zarankiewicz problem at density 1/2 and diagonal bipartite Ramsey numbers b(t,t)","result":"b(t,t) = O(2^t); K_{t,t} guaranteed in balanced bipartite graphs of density 1/2 once N ≥ c·2^t.","open_since":"","ai_system":["GPT-6 Astra"],"human_role":"AI-found proof after guided prompting; human rewrote and takes responsibility","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint"},"status":"pending","shock":""},"body_md":"## What happened\n\nMubayi, a leading extremal combinatorialist, reports that GPT-6 Astra found a proof removing the log factor from the best bound on diagonal\nbipartite Ramsey numbers. The improvement over the 1954 Kővári–Sós–Turán counting bound comes from a new method that he says \"will probably have further applications\".\n\n## Why it matters\n\nIt is a quantitative improvement on a classical bound in a central area, credited outright to a model in the abstract. That kind of\ndisclosure was rare before September 2026.","disputed":[{"label":"Verification","text":"Unrefereed preprint","sources":[]}],"related":[{"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":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]},{"id":"2026-09-16-chvatal-conjecture-proved","url":"https://postcutoff.com/e/2026-09-16-chvatal-conjecture-proved/","date":"2026-09-16","date_precision":"day","short_title":"Chvátal's 1972 conjecture proved (Chang–Liu–Liu, ChatGPT-assisted), then a GPT-6 Astra 'proof from The Book' and a Codex-built Lean formalization","deck":null,"takeaway":"It is a clear example of the late-2026 pattern in mathematics.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":4,"official":4,"filed":"2026-10-01","updated":"2026-10-07","orgs":["Institute for Basic Science","OpenAI"]},{"id":"2026-09-03-erdos-sos-conjecture-proved-gpt-6-astra","url":"https://postcutoff.com/e/2026-09-03-erdos-sos-conjecture-proved-gpt-6-astra/","date":"2026-09-03","date_precision":"day","short_title":"GPT-6 Astra proves the Erdős–Sós conjecture with a short counting argument","deck":"Mathematicians race to simplify and extend it","takeaway":"Erdős–Sós is one of the best-known conjectures in extremal graph theory, and this is among the clearest cases of an AI finding a genuinely new, short idea that experts call \"ingenious\" and \"surprising\".","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":10,"official":9,"filed":"2026-09-30","updated":"2026-09-30","orgs":["OpenAI","Epoch AI"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-01","type":"filed","text":"Created"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-01","run":null,"sources_read":null,"updated":"2026-10-01","human_review":null,"version":{"date":"2026-10-04"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":118,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":88,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":179,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":118,"in_training_data":false}],"short_url":null}