Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (256 pages, 1402 entries) |
Automatic refresh from the published result pages (256 pages, 1410 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 256 result pages; 256 of them list at least one public follow-up. | * 256 result pages; 256 of them list at least one public follow-up. | ||
* | * 1410 follow-up entries in total: | ||
** Research follow-ups: 459 | ** Research follow-ups: 459 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: 641 | ** Reviews and verifications: 641 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 262 | ||
== Results == | == Results == | ||
| Line 21: | Line 21: | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 15 || 9 || 0 || 1 || 1 || 4 || 2026-10-17 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 15 || 9 || 0 || 1 || 1 || 4 || 2026-10-17 | ||
|- | |||
| [[The irrationality exponent of π is 2]] || Number theory || 13 || 9 || 0 || 2 || 0 || 2 || 2026-10-23 | |||
|- | |- | ||
| [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 13 || 7 || 0 || 2 || 0 || 4 || 2026-10-21 | | [[Classification of finite Euclidean Ramsey configurations]] || Discrete geometry || 13 || 7 || 0 || 2 || 0 || 4 || 2026-10-21 | ||
|- | |- | ||
| [[Integer multiplication below n log n]] || Algorithms || 12 || 10 || 0 || 1 || 0 || 1 || 2026-10-24 | | [[Integer multiplication below n log n]] || Algorithms || 12 || 10 || 0 || 1 || 0 || 1 || 2026-10-24 | ||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 12 || 5 || 1 || 3 || 0 || 3 || 2026-10-22 | | [[The Unique Games Conjecture]] || Computational complexity || 12 || 5 || 1 || 3 || 0 || 3 || 2026-10-22 | ||
| Line 69: | Line 69: | ||
|- | |- | ||
| [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 9 || 6 || 0 || 3 || 0 || 0 || 2026-10-22 | | [[Permanence of weakly reversible mass-action systems]] || Dynamical systems || 9 || 6 || 0 || 3 || 0 || 0 || 2026-10-22 | ||
|- | |||
| [[The Gaussian moat problem]] || Number theory || 9 || 3 || 0 || 2 || 0 || 4 || 2026-10-22 | |||
|- | |- | ||
| [[Erdős's conjecture on short Egyptian fractions]] || Number theory || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-21 | | [[Erdős's conjecture on short Egyptian fractions]] || Number theory || 9 || 1 || 0 || 4 || 0 || 4 || 2026-10-21 | ||
| Line 75: | Line 77: | ||
|- | |- | ||
| [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | | [[Pure-point spectrum of the two-dimensional Anderson model]] || Mathematical physics || 9 || 1 || 1 || 5 || 0 || 2 || 2026-10-20 | ||
|- | |||
| [[The Mahler conjectures]] || Convex geometry || 9 || 2 || 0 || 3 || 0 || 4 || 2026-10-19 | |||
|- | |- | ||
| [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Kaplansky's direct-finiteness conjecture]] || Group theory || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
| Line 82: | Line 86: | ||
| [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-26 | | [[The hot spots conjecture for simply connected planar domains]] || Partial differential equations || 8 || 5 || 0 || 1 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[ | | [[Donaldson's tamed-to-compatible conjecture]] || Differential geometry || 8 || 0 || 0 || 7 || 0 || 1 || 2026-10-24 | ||
|- | |- | ||
| [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-21 | | [[The Ajtai–Erdős–Komlós–Szemerédi independence conjecture]] || Combinatorics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-21 | ||
| Line 91: | Line 95: | ||
|- | |- | ||
| [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 8 || 2 || 0 || 5 || 0 || 1 || 2026-10-20 | | [[The logarithmic exponent of off-diagonal Ramsey numbers]] || Combinatorics || 8 || 2 || 0 || 5 || 0 || 1 || 2026-10-20 | ||
|- | |||
| [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 8 || 3 || 0 || 3 || 0 || 2 || 2026-10-19 | |||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 8 || 3 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 8 || 3 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
| Line 107: | Line 113: | ||
|- | |- | ||
| [[Sharp Hölder stability of Brenier maps]] || Partial differential equations || 8 || 2 || 0 || 4 || 1 || 1 || 2026-10-16 | | [[Sharp Hölder stability of Brenier maps]] || Partial differential equations || 8 || 2 || 0 || 4 || 1 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The finitely presented Burnside problem]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | | [[The finitely presented Burnside problem]] || Group theory || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-16 | ||
| Line 117: | Line 121: | ||
|- | |- | ||
| [[The Gaussian propeller conjecture]] || Probability || 7 || 3 || 0 || 2 || 0 || 2 || 2026-10-26 | | [[The Gaussian propeller conjecture]] || Probability || 7 || 3 || 0 || 2 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 7 || 5 || 0 || 2 || 0 || 0 || 2026-10-23 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 7 || 5 || 0 || 2 || 0 || 0 || 2026-10-23 | ||
| Line 141: | Line 143: | ||
|- | |- | ||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-19 | | [[The Gotsman–Linial conjecture]] || Computational complexity || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-19 | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 7 || 2 || 4 || 0 || 0 || 1 || 2026-10-17 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 7 || 2 || 4 || 0 || 0 || 1 || 2026-10-17 | ||
| Line 189: | Line 189: | ||
|- | |- | ||
| [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | | [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | ||
|- | |||
| [[The complete Crouzeix conjecture]] || Functional analysis || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-17 | |||
|- | |- | ||
| [[Connes' bicentralizer problem]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | | [[Connes' bicentralizer problem]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | ||
| Line 203: | Line 205: | ||
|- | |- | ||
| [[The Boone–Higman conjecture]] || Group theory || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The Boone–Higman conjecture]] || Group theory || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The hyperinvariant subspace problem]] || Functional analysis || 6 || 0 || 0 || 4 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[The optimal order of convex-body covering density]] || Convex geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The optimal order of convex-body covering density]] || Convex geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
| Line 267: | Line 271: | ||
|- | |- | ||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 5 || 0 || 1 || 2 || 0 || 2 || 2026-10-16 | | [[The hypercube Ramsey number has linear order]] || Combinatorics || 5 || 0 || 1 || 2 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The one-dimensional Lieb–Thirring conjecture]] || Mathematical physics || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 288: | Line 290: | ||
| [[Dixmier's unitarizability problem]] || Group theory || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-13 | | [[Dixmier's unitarizability problem]] || Group theory || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-13 | ||
|- | |- | ||
| [[The | | [[The entropy-rate dimension formula for self-similar measures]] || Dynamical systems || 5 || 2 || 0 || 2 || 0 || 1 || 2026-10-12 | ||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-11 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-11 | ||
| Line 375: | Line 377: | ||
|- | |- | ||
| [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The Sakoda–Sipser problem]] || Computational complexity || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
|- | |- | ||
| [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The stable coordinate and Abhyankar–Sathaye conjectures]] || Algebraic geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
Revision as of 05:12, 26 October 2026
This page lists every result page of this wiki with the number of public follow-up works recorded on it, from the most to the fewest. It is generated from the follow-up tables of the result pages as they stood on 26 October 2026. The table can be re-sorted by any column.
Summary
- 256 result pages; 256 of them list at least one public follow-up.
- 1410 follow-up entries in total:
- Research follow-ups: 459
- Formalizations: 31
- Reviews and verifications: 641
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 262
Results
How the counts are made
- Each row of a result page's follow-up table counts as one entry. A work that concerns several results appears on each of their pages and is counted once on each.
- Collection-wide efforts, such as the formal-statement review MathVet and the audit of the manuscripts without Lean, are counted on every page that lists them. They raise many counts by one or two.
- Rows that a page marks as earlier work, or as work cited by the original manuscript, are listed there for context and are not counted (16 rows at present).
- Entries are grouped by the relation stated in the table: extensions, uses and parallel work as research follow-ups; formalizations and implementations; reviews, verifications and replications; critiques and corrections; and catalogue entries, formal statements, citations, remarks and exposition.
- The counts describe what this wiki has recorded from public sources. They are not a measure of the importance or the correctness of a result, and a low count may only mean that follow-ups have not been found yet.
