Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (260 pages, 1632 entries) |
Automatic refresh from the published result pages (260 pages, 1640 entries) |
||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 260 result pages; 260 of them list at least one public follow-up. | * 260 result pages; 260 of them list at least one public follow-up. | ||
* | * 1640 follow-up entries in total: | ||
** Research follow-ups: 483 | ** Research follow-ups: 483 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: 652 | ** Reviews and verifications: 652 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 457 | ||
== Results == | == Results == | ||
| Line 45: | Line 45: | ||
|- | |- | ||
| [[The Falconer distance conjecture]] || Harmonic analysis || 11 || 6 || 0 || 3 || 0 || 2 || 2026-10-26 | | [[The Falconer distance conjecture]] || Harmonic analysis || 11 || 6 || 0 || 3 || 0 || 2 || 2026-10-26 | ||
|- | |||
| [[The Mahler conjectures]] || Convex geometry || 11 || 3 || 0 || 3 || 0 || 5 || 2026-10-25 | |||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 11 || 4 || 0 || 5 || 0 || 2 || 2026-10-24 | | [[Sidorenko's conjecture]] || Combinatorics || 11 || 4 || 0 || 5 || 0 || 2 || 2026-10-24 | ||
| Line 61: | Line 63: | ||
|- | |- | ||
| [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 11 || 1 || 0 || 4 || 0 || 6 || 2026-10-16 | | [[Superexponential growth of van der Waerden numbers]] || Combinatorics || 11 || 1 || 0 || 4 || 0 || 6 || 2026-10-16 | ||
|- | |||
| [[The Erdős similarity conjecture]] || Real analysis || 11 || 5 || 0 || 2 || 0 || 4 || 2026-10-16 | |||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-27 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 10 || 3 || 0 || 3 || 0 || 4 || 2026-10-27 | ||
|- | |- | ||
| [[ | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 10 || 2 || 0 || 4 || 0 || 4 || 2026-10-26 | ||
|- | |- | ||
| [[Heilbronn's triangle problem]] || Discrete geometry || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-22 | | [[Heilbronn's triangle problem]] || Discrete geometry || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-22 | ||
| Line 79: | Line 83: | ||
|- | |- | ||
| [[Hadwiger's conjecture]] || Combinatorics || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-16 | | [[Hadwiger's conjecture]] || Combinatorics || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-27 | | [[Squarefree values of quartics and power-free values of polynomials]] || Number theory || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-27 | ||
| Line 89: | Line 91: | ||
|- | |- | ||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-26 | | [[The Gotsman–Linial conjecture]] || Computational complexity || 9 || 4 || 0 || 3 || 0 || 2 || 2026-10-26 | ||
|- | |- | ||
| [[The generalized Lax conjecture]] || Convex geometry || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-25 | | [[The generalized Lax conjecture]] || Convex geometry || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-25 | ||
| Line 101: | Line 101: | ||
|- | |- | ||
| [[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 triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 9 || 3 || 0 || 3 || 0 || 3 || 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 | ||
|- | |- | ||
| [[The Hilbert–Smith conjecture]] || Geometric topology || 9 || 3 || 2 || 2 || 0 || 2 || 2026-10-18 | | [[The Hilbert–Smith conjecture]] || Geometric topology || 9 || 3 || 2 || 2 || 0 || 2 || 2026-10-18 | ||
|- | |||
| [[Petty's projection-volume conjecture]] || Convex geometry || 9 || 3 || 0 || 3 || 0 || 3 || 2026-10-17 | |||
|- | |- | ||
| [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-16 | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 9 || 1 || 0 || 5 || 0 || 3 || 2026-10-16 | ||
| Line 129: | Line 133: | ||
|- | |- | ||
| [[One-sample matroid prophet inequalities]] || Algorithms || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-19 | | [[One-sample matroid prophet inequalities]] || Algorithms || 8 || 2 || 0 || 4 || 0 || 2 || 2026-10-19 | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 8 || 2 || 4 || 0 || 0 || 2 || 2026-10-17 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 8 || 2 || 4 || 0 || 0 || 2 || 2026-10-17 | ||
|- | |- | ||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-17 | | [[Cylinder coverings below the half-area bound]] || Discrete geometry || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-17 | ||
|- | |- | ||
| [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | | [[Saxl's conjecture and the tensor square conjecture]] || Combinatorics || 8 || 1 || 1 || 5 || 1 || 0 || 2026-10-17 | ||
| Line 153: | Line 153: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 7 || 2 || 0 || 2 || 0 || 3 || 2026-10-27 | |||
|- | |- | ||
| [[The spin-one Haldane gap]] || Mathematical physics || 7 || 4 || 0 || 2 || 0 || 1 || 2026-10-27 | | [[The spin-one Haldane gap]] || Mathematical physics || 7 || 4 || 0 || 2 || 0 || 1 || 2026-10-27 | ||
| Line 197: | Line 199: | ||
|- | |- | ||
| [[The hyperinvariant subspace problem]] || Functional analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | | [[The hyperinvariant subspace problem]] || Functional analysis || 7 || 0 || 0 || 4 || 0 || 3 || 2026-10-16 | ||
|- | |||
| [[The GNRS conjecture for planar and bounded-treewidth graphs]] || Functional analysis || 7 || 1 || 1 || 3 || 0 || 2 || 2026-10-15 | |||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 7 || 4 || 0 || 1 || 0 || 2 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 7 || 4 || 0 || 1 || 0 || 2 || 2026-10-11 | ||
|- | |- | ||
| [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-27 | | [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-27 | ||
| Line 269: | Line 271: | ||
|- | |- | ||
| [[Threshold parallel repetition for entangled games]] || Quantum information || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | | [[Threshold parallel repetition for entangled games]] || Quantum information || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-15 | ||
|- | |- | ||
| [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-12 | | [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-12 | ||
| Line 383: | Line 383: | ||
|- | |- | ||
| [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-20 | | [[The Benson–Etingof–Ostrik conjecture for finite tensor categories]] || Algebra || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-20 | ||
|- | |||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-20 | |||
|- | |- | ||
| [[The p-adic section conjecture]] || Number theory || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | | [[The p-adic section conjecture]] || Number theory || 4 || 0 || 0 || 1 || 0 || 3 || 2026-10-18 | ||
| Line 439: | Line 441: | ||
|- | |- | ||
| [[The Campana–Peternell conjecture]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-23 | | [[The Campana–Peternell conjecture]] || Algebraic geometry || 3 || 0 || 0 || 2 || 0 || 1 || 2026-10-23 | ||
|- | |- | ||
| [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-19 | | [[Infinitely many closed geodesics on Riemannian spheres]] || Differential geometry || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-19 | ||
Revision as of 06:47, 27 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 27 October 2026. The table can be re-sorted by any column.
Summary
- 260 result pages; 260 of them list at least one public follow-up.
- 1640 follow-up entries in total:
- Research follow-ups: 483
- Formalizations: 31
- Reviews and verifications: 652
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 457
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 (18 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.
