The Verification Problem (On OpenAI's Erdős Disproof)
OpenAI's recent announcement claimed that its model had disproved Erdős's planar unit-distance conjecture, marking a significant achievement in mathematical problem-solving. However, a previous claim about solving ten Erdős problems was criticized for merely surfacing existing solutions rather than providing new insights. The verification of the latest result involved collaboration with mathematicians, highlighting the importance of rigorous proof in the field.
- ▪OpenAI's model was initially criticized for misrepresenting existing solutions to Erdős problems.
- ▪The recent disproof of the planar unit-distance conjecture was verified by nine mathematicians, including Thomas Bloom.
- ▪The model's approach utilized advanced algebraic number theory to achieve a polynomial improvement over previous beliefs.
Hacker News (Newest) files mainly under programming. We currently carry 5,306 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | Korbonits |
| Canonical URL | https://korbonits.com/blog/2026-05-23-the-verification-problem/ |
| Publication time | Sun, 24 May 2026 05:18:16 +0000 |
| Retrieval time | 2026-05-24T05:37:31.034Z |
| Last seen | 2026-05-24T05:37:31.034Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | dfRkbEJRHMk- |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
May 23, 2026 · 11 min read The Verification Problem aimathematicsverification Contents What the model actually did The texture of the reasoning Why verification was the expensive part The part the field isn’t ready for What it was really for Footnotes In October, OpenAI said its model had solved ten open Erdős problems. It hadn’t.1 The model had surfaced existing solutions buried in the literature and presented them as fresh conquests, and Thomas Bloom — who runs erdosproblems.com and would know — said so publicly and without much patience for the framing.2 Last week OpenAI announced that an internal model had disproved Erdős’s planar unit-distance conjecture.3 This time the announcement came with a companion paper written by nine mathematicians, and one of the nine was Thomas Bloom.4…
Excerpt limited to ~120 words for fair-use compliance. The full article is at Korbonits.
Discussion
0 commentsMore from Korbonits
