Getting the (In)Formal Statement Right
Comments on “Getting the (In)Formal Statement Right”
Claim-checked. Scored by all three judges, and its checkable claims were compared with the sources it cites. How far stories are checked
An essay on autoformalization argues that a Lean-checked proof can still prove a different statement than the one intended, and that the mathematical meaning must be checked separately from proof correctness.
Why it ranked
No. 26 of 106 with a score of 0.66. The panel rated it highest on technical depth (0.91) and new information (0.84), lowest on audience breadth (0.54). Placed No. 26, No. 20 by score alone: the sixth AI & machine learning story of the day (−0.060). The placement terms move stories; they are not part of the score.
- AI judgeJudge 2claude-haiku-5-5
- Long, detailed essay on autoformalization in Lean with concrete examples and checks; highly relevant to AI and formal methods, substantive, somewhat long and opinionated, but distinct from the recent stories listed.
- AI judgeJudge 3gpt-5.6-luna
- A deeply technical analysis of semantic fidelity in AI-generated Lean formalizations, with concrete counterexamples, code, verification protocols, and implications for trustworthy mathematical and software artifacts.
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.66total under rubric v2.3
- Significance0.65
- Reader interest0.78
- Audience breadth0.54
- Practical relevance0.63
- Substantiated0.79
- Technical depth0.91
- New information0.84
- Counts against: Promotional0.05
- Counts against: Overclaim0.23
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) |
|---|---|---|---|---|---|---|---|
| SignificanceHow much does this change what people in tech know or can do? | 0.63 | 0.55 | 0.78 | 0.65 | 0.23 | +0.24 | +0.157 |
| Reader interestWould a well-informed senior engineer or tech founder want to read this today, and likely pass it on? | 0.65 | 0.80 | 0.88 | 0.78 | 0.23 | +0.26 | +0.202 |
| Audience breadthHow many people who build technology does it concern? | 0.61 | 0.50 | 0.52 | 0.54 | 0.11 | +0.13 | +0.071 |
| Practical relevanceHow useful is it to someone who builds software or tech products? | 0.63 | 0.55 | 0.72 | 0.63 | 0.17 | +0.22 | +0.139 |
| SubstantiatedHow well is it backed? Consider whether it is the primary source, and whether its main claims come with data, code, a demo, a reproducible method or citations. | 0.79 | 0.80 | 0.78 | 0.79 | 0.02 | +0.05 | +0.039 |
| Technical depthHow technically substantive is it? | 0.98 | 0.85 | 0.90 | 0.91 | 0.13 | +0.05 | +0.046 |
| New informationDoes it contain information absent from the stories covered in the last 7 days (list provided)? | 0.84 | 0.70 | 0.98 | 0.84 | 0.28 | +0.05 | +0.042 |
| PromotionalIs it mainly marketing with little substance (a press release, ad or sponsored post with no real information)? A launch post that carries real news is not promotional. | 0.07 | 0.05 | 0.04 | 0.05 | 0.03 | −0.19 | −0.010 |
| OverclaimDo the headline or conclusions claim more than the body supports? | 0.36 | 0.20 | 0.12 | 0.23 | 0.24 | −0.11 | −0.025 |
| Sum of contributions | +0.660 | ||||||
| Claim-check penalty | 0.000 | ||||||
| Total, as published | 0.660 | ||||||
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-11-12/26/"><img src="https://rubric.hrih.si/badge/2026-11-12/26.svg" alt="Ranked #26 on Rubric, 12 Nov 2026" width="245" height="28"></a>Claim check
Claim check: 1 matches source · 2 couldn’t check. Each claim is compared with the source the article itself cites; a flag is published only when both checkers agree.
Couldn’t checkNumber
Anthropic's model wrote about 13 million lines of Lean for Fermat's Last Theorem in 11 days.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “Anthropic's model wrote about 13 million lines of Lean for Fermat's Last Theorem in 11 days”
The source says No passage could be compared.
Source cited by the article: github.com/anthropics/fermats-last-theorem
Couldn’t checkDate
Another model formalized OpenAI's Navier–Stokes blowup proof in Lean 17 hours after the proof, as Quanta reported.
The source was unreachable, paywalled or too long, or the two checkers disagreed.
The article says “as Quanta reported, another model formalized the proof in Lean 17 hours later”
The source says No passage could be compared.
Source cited by the article: quantamagazine.org/ai-has-solved-one-of-maths-1-million-millennium-prize-problems-20260908
Matches sourceNumber
An ICML 2026 audit of variants of five standard Lean benchmarks raised 4,833 flags, 398 of which were machine-certified as counterexamples, vacuous theorems or unsound axioms.
The cited source says the same thing.
The article says “it raised 4,833 flags, and 398 of those were certified by machine as counterexamples, vacuous theorems or unsound axioms”
The source says “We audit five widely used Lean theorem-proving benchmarks and their forks, using corpus-scale static checkers to surface 4,833 findings, including 398 mechanically certified issues such as counterexamples, vacuous theorems, and…”
Source cited by the article: arxiv.org/abs/2606.29493
Also covered by
No other coverage was clustered with this story.
Elsewhere
Elsewhere: HN 2 pts, not on front page
Recorded for context only, checked 12 Nov 2026, 05:47 UTC. It played no part in the ranking.