ai-mathematics

band: warmmomentum: stable score: 0.328

temperature history

Episodes (7)

Expert mathematical review will determine whether GPT-5.6 Sol's claimed counterexample to the Maxwell conjecture is valid and novel.

expirednovelscott: none

Expert mathematical review will determine whether an OpenAI model produced a valid and novel proof that non-sofic groups exist.

expirednovelscott: none

Publication and expert review will determine whether Claude Fable independently reproduced five of ten mathematical proofs reported from OpenAI's Astra effort.

expirednovelscott: none

Independent reproduction will determine whether the reported Codex-assisted SAT computation validly proves that 13 queens cannot dominate a 26-by-26 board.

expiredconvergesscott: medium

Expert review will determine whether Claude produced a valid new lowest-dimensional counterexample to Borsuk’s Conjecture.

expiredknownscott: low

Aniket Wathore claims the released Ramanujan workbench combines parallel multi-model research agents with isolated worktrees, literature provenance, and deterministic SymPy/Z3 checks, enabling inspectable computational-mathematics workflows rather than unchecked model consensus.

seedknownscott: low

Bizeul, Klartag, and Lehec present an arXiv proof of the ~31-year-old Kannan-Lovász-Simonovits conjecture and — per the Reddit relay — credit ChatGPT with most of the ideas and proofs; expert validation of the proof and confirmation of the AI-credit attribution would establish chatbot models as originators of the core of a decades-open mathematics result, while a flaw in the proof or an unsupported credit claim closes it.

watchingconvergesscott: high

Trajectory notes

2026-08-13T17:41:16Z: claude-borsuk-counterexample closed (faded) — The radar already tracks the Claude Fable mathematical-discovery and expert-review story on `radar:fable-astra-proof-replication`, alongside several substantially similar AI-generated proof claims. Although the proposed workflow ali
2026-08-10T00:31:17Z: codex-q26-queen-domination-proof closed (faded) — The independently reproduced, proof-producing SAT workflow converges directly with Scott’s position that agent outputs become load-bearing only through deterministic checks and mechanically different verification routes. It crea
2026-08-09T10:28:44Z: openai-connes-rigidity-disproof-review closed (faded) — No intersection found in Scott’s wikis or the radar. The supplied material also does not establish the alleged flaw, review outcome, or even whether OpenAI or an Amazon team made the original claim.
2026-08-07T18:32:08Z: openai-non-sofic-groups-proof closed (faded) — No intersection with Scott’s own wikis or existing radar pages was found. Moreover, the supplied grounding does not substantiate the central non-sofic-groups claim, so there is not yet a grounded development to assess against Scott
2026-08-07T17:49:58Z: gpt-5-6-maxwell-conjecture-counterexample closed (faded) — No intersection found in Scott’s wikis, and no radar page already tracks this claim. Its mathematical validity, novelty, and provenance also remain unestablished on the supplied evidence.
2026-08-04T03:23:27Z: fable-astra-proof-replication closed (faded) — No intersection with Scott’s documented positions, projects, or prior radar coverage was found. The central replication claim also remains unestablished pending publication and expert review.