Claude Mythos solves OpenAI's landmark Erdős problem with simple proof
Claude Mythos has reportedly solved OpenAI's Erdős problem with a straightforward proof. This achievement highlights the potential of AI in mathematical discoveries, as Mythos utilized a unique approach compared to OpenAI's model. Despite some critiques, the result signifies a significant advancement in AI-driven mathematics.
- ▪Claude Mythos solved OpenAI's Erdős problem with a 'cute, simple proof.'
- ▪Anthropic engineer Sholto Douglas noted that Mythos' approach indicates a 'serious overhang' in AI-driven math discoveries.
- ▪Mathematician Daniel Litt described Mythos' result as 'a bit worse' than OpenAI's, but acknowledged that Mythos also found OpenAI's solution.
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 | The Decoder |
| Canonical URL | https://the-decoder.com/claude-mythos-reportedly-solves-openais-landmark-erdos-problem-with-a-cute-simple-proof/ |
| Publication time | Sat, 30 May 2026 13:51:56 +0000 |
| Retrieval time | 2026-05-30T13:59:38.171Z |
| Last seen | 2026-05-30T13:59:38.171Z |
| 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 | 7bzqbLjn7wYU |
| 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
Short News Copy the url to clipboard Share this article Go to comment section Claude Mythos reportedly solves OpenAI's landmark Erdős problem with a "cute, simple proof" Matthias Bastian View the LinkedIn Profile of Matthias Bastian May 26, 2026 Anthropic employees say Claude Mythos can also solve OpenAI's "AI math milestone." OpenAI recently disproved the Erdős unit-distance conjecture, an open problem in combinatorial geometry since 1946. Anthropic engineer Sholto Douglas wrote on X that Mythos solves it with a "cute, simple proof," a sign of "serious overhang" in AI-driven math discoveries.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at The Decoder.
Discussion
0 commentsMore from The Decoder
