{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-11-01-graph-isomorphism-n-log-n-hajiaghayi-jafariraviz-astra-lean/","md":"https://postcutoff.com/e/2026-11-01-graph-isomorphism-n-log-n-hajiaghayi-jafariraviz-astra-lean/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-11-01-graph-isomorphism-n-log-n-hajiaghayi-jafariraviz-astra-lean","date":"2026-11-01","date_precision":"day","short_title":"Graph isomorphism in n^O(log n), with Lean","deck":null,"takeaway":"arXiv 2611.01399 claims a deterministic n^O(log d) algorithm for graphs of maximum degree d, hence n^O(log n) for all graphs, against the exp(O((log n)³)) bound in Helfgott's analysis of the corrected Babai algorithm. The AI statement says the work 'resulted from extensive interaction between the authors and OpenAI Astra'. A public Lean 4 library states and proves both theorems for an explicit machine model, using AxiomMath's Lean proof of the classification of finite simple groups. Not yet refereed; comparator not yet run; no expert reaction found by 20 Nov.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2611.01399: Deterministic n^O(log n) Graph Isomorphism Algorithm via Inherited Decompositions (Hajiaghayi, JafariRaviz)","url":"https://arxiv.org/abs/2611.01399","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"GraphIsomorphismLog2: Lean 4 formalization of Theorem 1.1 and Corollary 1.2 (GitHub)","url":"https://github.com/mahdi-jfri/GraphIsomorphismLog2","type":"code","group":"primary","domain":"github.com"},{"n":3,"title":"AxiomMath/CFSG: classification of finite simple groups in Lean (GitHub)","url":"https://github.com/AxiomMath/CFSG","type":"code","group":"primary","domain":"github.com"},{"n":4,"title":"Background: Babai, Graph Isomorphism in Quasipolynomial Time (arXiv 1512.03547)","url":"https://arxiv.org/abs/1512.03547","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"arXiv 2611.17292: The Submodular Secretary Problem: Tight 1−1/e for Monotone Objectives (Abdi, Banihashem, Hajiaghayi et al.)","url":"https://arxiv.org/abs/2611.17292","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"arXiv 2611.21294: Constant-Factor Matching-Size Estimation in Random-Order Streams (Farhadi, Hajiaghayi, Monemizadeh)","url":"https://arxiv.org/abs/2611.21294","type":"paper","group":"primary","domain":"arxiv.org"}],"official":6,"filed":"2026-11-20","updated":"2026-11-20","orgs":["University of Maryland","OpenAI"],"title":"Graph isomorphism in deterministic n^O(log n) time claimed by Hajiaghayi and JafariRaviz, improving the (log n)³ exponent of Babai's algorithm; developed with OpenAI Astra, with a full Lean proof that rests on the AI-built CFSG formalization","summary":"MohammadTaghi Hajiaghayi and Mahdi JafariRaviz (University of Maryland) posted arXiv 2611.01399 on 1 Nov 2026 (v2 10 Nov), claiming a deterministic algorithm that decides graph isomorphism in time n^O(log d) for maximum degree d, so n^O(log n) in general, the first such worst-case bound if correct. It keeps Babai's local certificates and colour refinement but retains the decomposition of each recursive instance. The paper's AI statement credits extensive interaction with OpenAI Astra (Gemini Argon helped with the text). The repo github.com/mahdi-jfri/GraphIsomorphismLog2 (31 Oct) gives a complete Lean 4 proof of both main theorems, with the algorithm written as a program for a log-cost RAM; it depends on AxiomMath's Lean CFSG and a Lean proof of Maróti's bound on primitive groups.","key_facts":["Claim (abstract): 'We give a deterministic n^O(log d)-time algorithm for isomorphism of graphs with n vertices and maximum degree d. Since d < n, this is an n^O(log n)-time algorithm for graph isomorphism. To our knowledge, this is the first proof of such a worst-case bound for general graphs'","Previous bounds named in the paper: exp(O((log n)³)) for the corrected Luks–Babai algorithm (Helfgott's analysis); n^O((log d)^c) for maximum degree d (Grohe, Neuen, Schweitzer). The paper's Appendix B argues that an earlier n^O(log n) claim (Wenxue Du, arXiv 1710.09526) fails on an infinite family of inputs","Output: decides isomorphism, returns one isomorphism and generators of the automorphism group; extends to string isomorphism. Canonization is not covered","AI statement (verbatim): 'This work resulted from extensive interaction between the authors and OpenAI Astra, with the authors providing suggestions and critically checking Astra's responses through iterative exchanges. OpenAI Astra was also used in writing and revising the manuscript through detailed prompts from the authors, with Gemini Argon assisting in some parts'","Lean (README): Theorem 1.1 and Corollary 1.2 stated in challenge files and proved in solution files; cost bound exp(C·(log(n+2))²) on a log-cost RAM with procedure calls; only the standard axioms propext, Classical.choice, Quot.sound; 'This version has not yet been checked with comparator. Its kernel check would have to replay all of CFSG'","Dependencies: AxiomMath/CFSG (classification of finite simple groups and Schreier's conjecture in Lean, see 2026-10-27 entry) and mahdi-jfri/MarotiOrdersOfPrimitiveGroups; one file imports about 75,000 CFSG modules and needs about 18 GB of memory","Same group, same weeks: about 20 arXiv papers by Hajiaghayi and coauthors since late October carry a near-identical OpenAI Astra statement, most with Lean archives in github.com/hajiaghayi (Bertrand networks 2611.22216, random-order matching size 2611.21294, submodular secretary 2611.17292, dynamic diameter 2611.17050, online survivable network design 2611.16521, prophet secretary for matroids/XOS 2611.06891, spanning-tree embeddings 2611.05189, among others)","Reactions: none found on HN, Mathstodon or blogs by 20 Nov; the repo surfaced in our sweep of watched GitHub accounts, not through an announcement"],"key_numbers":[],"tags":["math","computer-science","graph-isomorphism","complexity","algorithms","lean","formalization","gpt-6-astra","cfsg"],"science":{"field":"computer-science","subfield":"algorithms and complexity (graph isomorphism, permutation groups)","problem":"Worst-case complexity of graph isomorphism; the exponent of Babai's quasipolynomial bound","result":"Claimed deterministic n^O(log d) algorithm for graphs of maximum degree d, hence n^O(log n) for all graphs, with automorphism-group generators; both theorems proved in Lean for an explicit RAM model","open_since":"2015","ai_system":["OpenAI Astra","Gemini Argon"],"human_role":"Authors directed the work, made suggestions and checked Astra's responses through iterative exchanges; Astra also drafted the manuscript; Lean library method not stated in the README","verification":{"key":"lean","label":"Lean-verified","text":"Lean 4 proof (authors' report; comparator not yet run; depends on the Lean CFSG formalization); preprint, not refereed"},"status":"pending","shock":"Since Babai's 2015 breakthrough the best explicit exponent for general graphs had been cubic in log n; a quadratic one arriving with a machine-checked proof of the whole algorithm was not expected."},"body_md":"## What happened\n\nOn 1 November 2026 MohammadTaghi Hajiaghayi and Mahdi JafariRaviz posted a paper claiming that graph isomorphism can be decided\ndeterministically in time n^O(log n). The algorithm reuses the local certificates and colour refinement of Babai's quasipolynomial\nalgorithm but keeps the decomposition of each recursive instance, so that local tests can make progress without removing many vertices\nand auxiliary bipartite graphs can be handled inside the current instance. For maximum degree d the bound is n^O(log d).\n\nA day earlier JafariRaviz had published a Lean 4 library that writes the whole algorithm as a program for a log-cost RAM and proves\nthat it answers correctly within the stated cost. The proof imports AxiomMath's Lean formalization of the classification of finite\nsimple groups, which the group-theoretic steps need. The README says the comparator check has not been run yet. The repo was\nfound on 20 November through our watch of the authors' GitHub accounts, added after their Graph Minors formalization.\n\nThe paper's AI statement credits OpenAI Astra with most of the development. The same statement, nearly word for word, appears in\nabout twenty other papers Hajiaghayi has co-authored since late October, most with Lean archives.\n\n## Why it matters\n\nGraph isomorphism is one of the best-known problems not known to be in P or NP-complete. If the claim holds it lowers the exponent of\nBabai's bound from cubic to quadratic in log n and settles the bounded-degree case at n^O(log d). The Lean proof, if it passes\nindependent checking, would make this one of the first major algorithmic results to arrive together with a machine-checked proof\nof the full algorithm and its running time. No outside expert had commented by 20 November.","disputed":[{"label":"Verification","text":"Lean 4 proof (authors' report; comparator not yet run; depends on the Lean CFSG formalization); preprint, not refereed","sources":[]}],"related":[{"id":"2026-11-20-ai-assisted-results-november-20-listing","url":"https://postcutoff.com/e/2026-11-20-ai-assisted-results-november-20-listing/","date":"2026-11-20","date_precision":"day","short_title":"AI-assisted results, 20 Nov","deck":null,"takeaway":"The sweep listed 361 arXiv papers with AI statements (207 new on 20 Nov), 63 conjecture papers without one (9 new), 69 Hexagon works, 10 watched repos and 7 result-repo commits. Every new line was read and its AI statement checked in the PDF or the Hexagon provenance record. Six results got their own entries (two promoted from the 19 Nov listing), two existing entries were extended, and 97 arXiv papers and 62 Hexagon works where AI supplied proofs, constructions, code or Lean are listed here; 106 arXiv papers and 6 Hexagon works were dropped as editorial. All are unrefereed.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"partly","labels":["Partly confirmed"]},"sources":16,"official":13,"filed":"2026-11-20","updated":"2026-11-20","orgs":["OpenAI","Anthropic","Google DeepMind","various researchers"]},{"id":"2026-11-13-graph-minors-series-lean-formalization-hajiaghayi-jafariraviz","url":"https://postcutoff.com/e/2026-11-13-graph-minors-series-lean-formalization-hajiaghayi-jafariraviz/","date":"2026-11-13","date_precision":"day","short_title":"Graph Minors series in Lean","deck":null,"takeaway":"A public repo claims a sorry-free Lean 4 proof of every numbered result (838) of Robertson and Seymour's Graph Minors I–XXII, including the graph minor theorem, the structure theorem and the O(n³) disjoint-paths algorithm. The formalization found 30 statement mistakes, 60 proof gaps and 106 places needing a missing argument, none affecting a main result. A sibling repo by the same group (Strong Perfect Graph Theorem) says its Lean code 'was written with AI agents'; the Graph Minors README does not describe its method. Not yet reviewed by others.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":5,"official":4,"filed":"2026-11-19","updated":"2026-11-19","orgs":["University of Maryland"]},{"id":"2026-11-12-grid-minor-sixth-power-hajiaghayi-astra","url":"https://postcutoff.com/e/2026-11-12-grid-minor-sixth-power-hajiaghayi-astra/","date":"2026-11-12","date_precision":"day","short_title":"Grid-minor exponent 6 in polynomial time (Hajiaghayi with Astra)","deck":null,"takeaway":"Robertson and Seymour's grid-minor theorem is central to graph minors and bidimensionality; Chuzhoy and Tan's g⁹ bound (2021) was the best. Two AI-assisted claims now go below it: Édouard Bonnet's Lean-checked g⁸·polylog with Codex, and Hajiaghayi's g⁶·polylog with a polynomial-time algorithm, developed with OpenAI Astra.","category":"science","category_label":"Science & math","importance":3,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":3,"official":3,"filed":"2026-11-13","updated":"2026-11-13","orgs":["OpenAI","University of Maryland","various researchers"]},{"id":"2026-10-29-online-steiner-forest-greedy-log-k-loglog-k-gpt-astra-lean","url":"https://postcutoff.com/e/2026-10-29-online-steiner-forest-greedy-log-k-loglog-k-gpt-astra-lean/","date":"2026-10-29","date_precision":"day","short_title":"Online Steiner forest: greedy claimed Θ(log k log log k), with GPT Astra","deck":null,"takeaway":"In online Steiner forest, terminal pairs arrive one by one and must be connected at once. Awerbuch, Azar and Bartal proved in 1996 that the greedy algorithm is O(log² k)-competitive and conjectured O(log k). On 29 Oct a University of Maryland group led by MohammadTaghi Hajiaghayi posted matching bounds of Θ(log k log log k). If correct, that refutes the conjecture and separates greedy from the best online algorithm by a log log k factor. Some proofs 'were developed with the help of OpenAI's GPT Astra', with Gemini Argon assisting, and Lean files for the main theorem are on GitHub. It is a preprint, not refereed.","category":"science","category_label":"Science & math","importance":4,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":2,"official":2,"filed":"2026-10-30","updated":"2026-10-30","orgs":["OpenAI","Google DeepMind","University of Maryland"]},{"id":"2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean","url":"https://postcutoff.com/e/2026-10-27-axiom-cfsg-classification-finite-simple-groups-lean/","date":"2026-10-27","date_precision":"day","short_title":"Axiom: Classification of Finite Simple Groups formalized in Lean","deck":null,"takeaway":"On 27 Oct 2026 Axiom Math published a Lean 4 formalization of the Classification of Finite Simple Groups (CFSG). The proof was originally spread over hundreds of papers and an estimated 10,000–15,000 pages. Axiom says it is sorry-free, follows the first-generation proof, and was built by AI agents working with about 30 mathematicians and engineers. Press reports put the build time at 24 days. Along the way the team found a false step in one published route to the Unbalanced Group Theorem and wrote a replacement argument. The project is self-reviewed: outside experts have not yet re-run the build or checked that the Lean statement matches CFSG.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":15,"official":9,"filed":"2026-10-28","updated":"2026-11-17","orgs":["Axiom Math"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-20","type":"filed","text":"Created (science agent; arXiv PDF and repo README read)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-20","run":null,"sources_read":"Science agent; arXiv PDF and repo README read","updated":"2026-11-20","human_review":null,"version":{"date":"2026-11-20"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":154,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":124,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":215,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":154,"in_training_data":false}],"short_url":"https://postcutoff.com/s/graph-isomorphism-n-o"}