{"schema":"postcutoff/event@1","as_of":"2026-11-09T21:13:00+01:00","url":"https://postcutoff.com/e/2026-11-01-ai-assisted-results-november-1-listing/","md":"https://postcutoff.com/e/2026-11-01-ai-assisted-results-november-1-listing/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-ai-assisted-results-november-1-listing","date":"2026-11-01","date_precision":"day","short_title":"AI-assisted results, 1 Nov: arXiv leftovers and result repos","deck":null,"takeaway":"The 1 Nov sweep listed 325 arXiv papers that mention AI (mostly already-skimmed submissions of 26–29 Oct) and 66 conjecture papers without an AI statement. No new result reached own-entry level. Listed here: Chao Liu's f(k) = k²/2 + O(k log k) for subset sums of zero-sum-free sets ('AI tools developed by OpenAI were used'), Bednorz–Łochowski's proof of the Das–Łochowski–Matsuda–Perkowski fBm conjecture with ChatGPT proof strategies, Gao–Zhao on Duke–Erdős–Rödl, and a Lean proof (drafted with Claude Code) of Long's ChatGPT-assisted Poisson conjecture counterexample.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2610.38373: logarithmic error term for subset sums of zero-sum-free sets (Chao Liu)","url":"https://arxiv.org/abs/2610.38373","type":"paper","group":"primary","domain":"arxiv.org"},{"n":2,"title":"arXiv 2610.38447: Davenport constants with growing binary rank (Chao Liu)","url":"https://arxiv.org/abs/2610.38447","type":"paper","group":"primary","domain":"arxiv.org"},{"n":3,"title":"arXiv 2610.38894: 1/H-variations of fractional Brownian motion conjecture (Bednorz, Łochowski)","url":"https://arxiv.org/abs/2610.38894","type":"paper","group":"primary","domain":"arxiv.org"},{"n":4,"title":"arXiv 2610.34307: Duke–Erdős–Rödl problems on cycle-connected subgraphs","url":"https://arxiv.org/abs/2610.34307","type":"paper","group":"primary","domain":"arxiv.org"},{"n":5,"title":"arXiv 2610.40032: Submodular decompositions","url":"https://arxiv.org/abs/2610.40032","type":"paper","group":"primary","domain":"arxiv.org"},{"n":6,"title":"arXiv 2610.40095: Erdős–Ginzburg–Ziv problem for Z_n^r","url":"https://arxiv.org/abs/2610.40095","type":"paper","group":"primary","domain":"arxiv.org"},{"n":7,"title":"arXiv 2610.34912: Dynamical Chowla conjecture for polynomials of several variables","url":"https://arxiv.org/abs/2610.34912","type":"paper","group":"primary","domain":"arxiv.org"},{"n":8,"title":"arXiv 2610.38751: Examples of rigid twistor D-modules","url":"https://arxiv.org/abs/2610.38751","type":"paper","group":"primary","domain":"arxiv.org"},{"n":9,"title":"arXiv 2610.38150: Homogenization theory of topological Anderson insulators (Bal)","url":"https://arxiv.org/abs/2610.38150","type":"paper","group":"primary","domain":"arxiv.org"},{"n":10,"title":"arXiv 2610.37817: The generalized Cartan–Hadamard conjecture","url":"https://arxiv.org/abs/2610.37817","type":"paper","group":"primary","domain":"arxiv.org"},{"n":11,"title":"formal-conjectures #7657: Poisson conjecture proof links","url":"https://github.com/google-deepmind/formal-conjectures/commit/a64e959c32c270df4dd0d96d2027481f15750534","type":"code","group":"primary","domain":"github.com"},{"n":12,"title":"formal-conjectures #7700: Erdős 675 test lemma","url":"https://github.com/google-deepmind/formal-conjectures/commit/b6939a3a0d89e5f999fa8c6483a6ef646c1e2923","type":"code","group":"primary","domain":"github.com"},{"n":13,"title":"oai-math-revised: ETH is False notes (30 Oct)","url":"https://github.com/mathcommunity/oai-math-revised/commit/c45f7d46249ec65319248a696f057e73c6045dc5","type":"code","group":"primary","domain":"github.com"}],"official":13,"filed":"2026-11-01","updated":"2026-11-01","orgs":["OpenAI","Anthropic","Google","various researchers"],"title":"AI-assisted results in the 1 Nov 2026 sweep: Olson constant asymptotics, a fractional Brownian motion conjecture, Duke–Erdős–Rödl, the Bérczi et al. submodular question, and the Poisson conjecture in Lean","summary":"Catalogue of AI-disclosing papers from the 1 Nov 2026 sweep not covered by earlier listings, plus the week's result-repository commits. All are unrefereed preprints; AI statements are quoted from the PDFs or abstracts' disclosure lines.","key_facts":["Additive combinatorics (Chao Liu; 2610.38373): the minimum number of nonempty subset sums of a zero-sum-free k-set over all finite abelian groups is k²/2 + O(k log k), so the Olson constant satisfies Ol(G) ≤ √(2|G|) + O(log|G|); companion paper on Davenport constants D(H ⊕ C₂^r) with a log₂ r correction (2610.38447). Both PDFs: 'AI tools developed by OpenAI were used in this work.'","Probability (W. M. Bednorz, R. M. Łochowski; 2610.38894): analytic proof of the comparison c_H > E|Z|^{1/H} for H < 1/2 (reversed for H > 1/2) conjectured by Das, Łochowski, Matsuda and Perkowski for the fractional Brownian level-crossing constant; 'The authors acknowledge the assistance of OpenAI's ChatGPT in developing proof strategies, deriving and checking intermediate estimates, verifying references'","Extremal graph theory (Guorong Gao, Run Zhao; 2610.34307): answers Duke–Erdős–Rödl's question on C₆-connected subgraphs (optimal range β ∈ (0, 2/3]) and finds the leading constant 1/(2e) for f₂; 'generative AI tools to assist in discussing proof strategies, checking proofs'","Combinatorial optimisation (Guoqing Wang, Linlin Wang, Jun Yue; 2610.40032): answers both questions of Bérczi, Gehér, Imolay, Lovász and Schwarcz (SIAM J. Discrete Math. 2026), negatively for bounded-variation set functions; an LLM assisted 'with mathematical exploration, checking arguments'","Also: Erdős–Ginzburg–Ziv for Z_n^r with 4^r n points (Han, Zhang; 2610.40095; ChatGPT suggested simplifications); dynamical Chowla for multivariate polynomials (Wang, Yang; 2610.34912; ChatGPT 'used to explore some of the proof strategies'); a proof in Hammer's rigid twistor D-modules 'obtained with the use of the Google Gemini LLM' (2610.38751); Guillaume Bal's homogenization theory of topological Anderson insulators with Claude Opus 5.5 drafting proofs and numerics (2610.38150)","No AI statement (checked): the generalized Cartan–Hadamard conjecture with rigidity (Agnoletto, Da Silva, Nardulli, Resende; 2610.37817; 'developed without the use of AI'); partial results on the Fasi–Higham positivity conjecture (Scardino; 2610.39051)","Result repositories: google-deepmind/formal-conjectures linked Lean proofs (zblore/fc-poisson-2; 'I used Claude Code to draft the Lean. I've checked every line myself') that the Poisson conjecture fails for every n ≥ 2 over any characteristic-zero field, following C. D. Long's counterexample (arXiv 2608.23777, built with ChatGPT 5.6 Sol on the Alpöge–Fable Jacobian core), PR #7657, 1 Nov; a five-line proof of an Erdős 675 test lemma (#7700); mathcommunity/oai-math-revised refined its 'ETH is False' notes and agent-notes tooling (30 Oct), no new family"],"key_numbers":[],"tags":["math","arxiv","catalogue","chatgpt","claude","claude-code","gemini","lean","formal-conjectures"],"science":{"field":"mathematics","subfield":"multiple (additive combinatorics, probability, graph theory, algebra)","problem":"See list","result":"Catalogue of AI-disclosing papers and repository results of the 1 Nov sweep","open_since":"","ai_system":["ChatGPT","Codex","Claude Opus 5.5","Claude Code","Gemini"],"human_role":"Human-led papers with AI for proof strategies, checks or Lean drafting","verification":{"key":"lean","label":"Lean-verified","text":"Unrefereed preprints; Lean for the Poisson counterexample"},"status":"pending","shock":"","verified_by":["preprint","lean"],"kind":"batch"},"body_md":"## What happened\n\nThe 1 Nov sweep re-listed many 26–29 Oct submissions already skimmed in the 30 and 31 Oct listings; we read the AI statements of the remainder and about a dozen abstracts and PDFs. Nothing reached own-entry level; the Poisson conjecture item was added to the Jacobian conjecture entry.","disputed":[{"label":"Verification","text":"Unrefereed preprints; Lean for the Poisson counterexample","sources":[]}],"related":[{"id":"2026-10-31-ai-assisted-results-october-31-listing","url":"https://postcutoff.com/e/2026-10-31-ai-assisted-results-october-31-listing/","date":"2026-10-31","date_precision":"day","short_title":"AI-assisted results, 31 Oct: arXiv of 30 Oct and Hexagon of 29–31 Oct","deck":null,"takeaway":"The 31 Oct sweep listed 344 arXiv papers that mention AI, 75 conjecture papers with no AI statement and 48 uncited Hexagon works. We skimmed every AI statement and read about 70 PDFs or Hexagon records. Seven results got their own entries. Two come from senior authors: Panchenko's Mézard–Parisi formula ('found by ChatGPT Astra') and Bhargava's positive-density cyclicity of elliptic curves, written with GPT-6. The other five are Tianchi Yang's count of C₄-free graphs, Kolpakov's sharp dimension bounds for right-angled hyperbolic polytopes, the generalized Lax conjecture (Kummer–Netzer's AI-found generic case and OpenAI's counterexample), Diening–Storn's AFEM optimality for every bulk parameter, and an unverified GPT-6 Astra claim on Onsager's hard rods. The rest are listed here, among them Pongrácz's R(5,6) ≤ 84 certificate with GPT-6 Astra and Bowler–Pitz's negative answers to Halin-type questions, where Claude found key lemmas.","category":"science","category_label":"Science & math","importance":2,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":44,"official":42,"filed":"2026-10-31","updated":"2026-10-31","orgs":["OpenAI","Anthropic","Google","various researchers"]},{"id":"2026-10-26-openai-eth-false-subexponential-sat-claim","url":"https://postcutoff.com/e/2026-10-26-openai-eth-false-subexponential-sat-claim/","date":"2026-10-26","date_precision":"day","short_title":"OpenAI claims ETH is false","deck":null,"takeaway":"Anthropic independently posted a different Lean-checked refutation the next day (separate entry). OpenAI's model output claims a deterministic algorithm that counts the satisfying assignments of any k-CNF in time 2^(n/(log n)^(1/2+o(1))). If correct, it refutes ETH, SETH, Gap-ETH and NSETH, the assumptions behind hundreds of fine-grained hardness results. OpenAI says the main theorem is formalized in Lean. A working group led by ETH's proposers, Russell Impagliazzo and Ramamohan Paturi, with Ryan Williams, will examine the proof. No expert has assessed it in public yet.","category":"science","category_label":"Science & math","importance":5,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":35,"official":11,"filed":"2026-10-26","updated":"2026-11-08","orgs":["OpenAI"]},{"id":"2026-07-20-jacobian-conjecture-counterexample","url":"https://postcutoff.com/e/2026-07-20-jacobian-conjecture-counterexample/","date":"2026-07-20","date_precision":"day","short_title":"Claude Fable 5 finds a counterexample to the Jacobian conjecture in dimension 3","deck":null,"takeaway":"The Jacobian conjecture is one of the most famous open problems in algebra.","category":"science","category_label":"Science & math","importance":5,"confidence":"high","status":{"key":"confirmed","labels":["Result confirmed"]},"sources":7,"official":4,"filed":"2026-09-29","updated":"2026-11-01","orgs":["Anthropic"]}],"people":[{"id":"levent-alpoge","name":"Levent Alpöge","url":"https://postcutoff.com/person/levent-alpoge/"}],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-11-01","type":"filed","text":"Created (science agent; arXiv abstracts and PDFs, GitHub commit API)"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-11-01","run":null,"sources_read":null,"updated":"2026-11-01","human_review":null,"version":{"date":"2026-11-01"}},"gaps":[{"model_id":"gpt-6-astra","name":"GPT-6 Astra","cutoff":"2026-04","days_after":185,"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-argon","name":"Gemini 4 Argon","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":null}