AI refutes 30-year-old mathematical assumption in computer science
Comments on “AI refutes 30-year-old mathematical assumption in computer science”
3 judges. Scored by all three judges. Only the day’s top stories get the claim check. How far stories are checked
OpenAI claims its AI models have disproven the exponential time hypothesis, a 30-year-old assumption in computer science about how fast computers can solve certain logical puzzles.
Why it ranked
No. 52 of 155 with a score of 0.62. The panel rated it highest on new information (0.93) and significance (0.88), lowest on practical relevance (0.43). Overclaim counted against it (0.58).
- AI judgeJudge 2claude-haiku-5-5
- Major claimed AI-driven result overturning a foundational complexity assumption; significance high, but unverified claim, mostly secondhand reporting, and limited direct practical value for builders.
- AI judgeJudge 3gpt-5.6-luna
- Potentially landmark theoretical-computer-science results, with major implications for algorithms and AI-assisted mathematics. However, claims remain under independent review, formal verification requires semantic checking, and the headline overstates what the article establishes.
Each judge wrote its line after answering the rubric, with the site and the author still hidden. Every answer behind this is in the table under Score.
Score
0.62total under rubric v2.2
- Significance0.88
- Reader interest0.82
- Audience breadth0.71
- Practical relevance0.43
- Substantiated0.51
- Technical depth0.50
- New information0.93
- Counts against: Promotional0.11
- Counts against: Overclaim0.58
Each judge’s answer per question (0–1), their mean and spread, and what the question adds to the score (weight × mean).
| Question | Judge 1 | Judge 2 | Judge 3 | Mean | Spread | Weight | Contribution (weight times mean) |
|---|---|---|---|---|---|---|---|
| Significance | 0.90 | 0.80 | 0.95 | 0.88 | 0.15 | +0.24 | +0.212 |
| Reader interest | 0.58 | 0.90 | 0.97 | 0.82 | 0.39 | +0.26 | +0.212 |
| Audience breadth | 0.66 | 0.60 | 0.88 | 0.71 | 0.28 | +0.13 | +0.093 |
| Practical relevance | 0.31 | 0.30 | 0.67 | 0.43 | 0.37 | +0.22 | +0.094 |
| Substantiated | 0.36 | 0.55 | 0.62 | 0.51 | 0.26 | +0.05 | +0.026 |
| Technical depth | 0.51 | 0.40 | 0.58 | 0.50 | 0.18 | +0.05 | +0.025 |
| New information | 0.91 | 0.90 | 0.98 | 0.93 | 0.08 | +0.05 | +0.047 |
| Promotional | 0.15 | 0.10 | 0.08 | 0.11 | 0.07 | −0.19 | −0.021 |
| Overclaim | 0.57 | 0.45 | 0.72 | 0.58 | 0.27 | −0.11 | −0.064 |
| Sum of contributions | +0.623 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.623 | ||||||
Spread is the highest minus the lowest judge answer. marks a spread above 0.40: the judges disagree, and the story is marked contested.
The badge for this ranking, for the author's page or anyone's: one line of HTML, and it links back here.
<a href="https://rubric.hrih.si/editions/2026-10-28/52/"><img src="https://rubric.hrih.si/badge/2026-10-28/52.svg" alt="Ranked #52 on Rubric, 28 Oct 2026" width="245" height="28"></a>Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 4 pts, not on front page
Recorded for context only, checked 28 Oct 2026, 06:47 UTC. It played no part in the ranking.