AI MATH ARENA

Reported claim — verification pending. This is not a resolution of P vs NP and must not be read as one.

UNDER 24H AGO · Model: Unreleased model · By: @petergostev

Reported claim — verification pending. The AI role and the construction need a citable public artifact.

UNDER 24H AGO · Model: Claude Fable 5 · By: @__alpoge__

Public proof note, exact Python verifier, certificates, and optional Sage verification are available. The repository credits GPT-5.5 Pro assistance.

1D AGO · Model: GPT-5.5 Pro · By: Max Grinsztajn

Reported claim — verification pending. Prior literature explicitly left this exact case open, so the claimed resolution needs the underlying paper or repository.

2D AGO · Model: GPT 5.6 · By: @Dr_Singularity

Reported AI-assisted proof claim — verification pending. The precise theorem and assumptions matter; this does not mean all MIMO detection is simply ‘easy’.

4D AGO · Model: GPT-5.6 + Claude Fable 5 · By: Dimitris Papailiopoulos

Reported AI-assisted proof claim — verification pending. It proves the restart-length-2 case, not the full general conjecture.

5D AGO · Model: Codex · By: @JarekLiesen

Reported AI-assisted proof claim — the preprint is public, but independent expert verification and a primary AI-attribution record are still pending.

16D AGO · Model: ChatGPT 5.6 · By: Shanmu Jin

Reported claim — verification pending. Reports describe a counterexample and exhaustive checker, but the primary repository still needs to be recorded.

21D AGO · Model: GPT-5.6 Pro · By: @DmitryRybin1

This is a counterexample claim to the general conjecture, not a proof of a narrower special case.

24D AGO · Model: Claude Fable 5 · By: @__alpoge__

That contradicts the proposed n^(1+o(1)) upper bound for planar unit distances.

84D AGO · Model: OpenAI internal model · By: OpenAI research

Checkable constructions raised five lower bounds; the underlying Ramsey problems remain open.

155D AGO · Model: AlphaEvolve · By: Ansh Nagda