Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (239 pages, 1133 entries) |
Automatic refresh from the published result pages (239 pages, 1142 entries) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
== Summary == | == Summary == | ||
* 239 result pages; 238 of them list at least one public follow-up. | * 239 result pages; 238 of them list at least one public follow-up. | ||
* | * 1142 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 400 | ||
** Formalizations: 30 | ** Formalizations: 30 | ||
** Reviews and verifications: | ** Reviews and verifications: 552 | ||
** Critiques and corrections: 14 | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: 146 | ** Catalogue entries, citations and exposition: 146 | ||
| Line 19: | Line 19: | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 14 || 9 || 0 || 0 || 1 || 4 || 2026-10-17 | ||
|- | |||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 11 || 5 || 0 || 5 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-21 | | [[The Unique Games Conjecture]] || Computational complexity || 10 || 5 || 1 || 2 || 0 || 2 || 2026-10-21 | ||
| Line 24: | Line 26: | ||
| [[The irrationality exponent of π is 2]] || Number theory || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-21 | | [[The irrationality exponent of π is 2]] || Number theory || 10 || 8 || 0 || 2 || 0 || 0 || 2026-10-21 | ||
|- | |- | ||
| [[ | | [[Derandomization of logarithmic space]] || Computational complexity || 10 || 1 || 0 || 3 || 1 || 5 || 2026-10-20 | ||
|- | |- | ||
| [[ | | [[Rapid mixing of the switch chain for every degree sequence]] || Algorithms || 10 || 5 || 0 || 5 || 0 || 0 || 2026-10-19 | ||
|- | |- | ||
| [[The Snaky achievement game]] || Combinatorics || 10 || 6 || 0 || 4 || 0 || 0 || 2026-10-19 | | [[The Snaky achievement game]] || Combinatorics || 10 || 6 || 0 || 4 || 0 || 0 || 2026-10-19 | ||
| Line 49: | Line 51: | ||
|- | |- | ||
| [[Integer multiplication below n log n]] || Algorithms || 9 || 7 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Integer multiplication below n log n]] || Algorithms || 9 || 7 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The Falconer distance conjecture]] || Harmonic analysis || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-22 | | [[The Falconer distance conjecture]] || Harmonic analysis || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-22 | ||
| Line 81: | Line 81: | ||
|- | |- | ||
| [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | | [[Approximate counting and entropy of perfect matchings]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-19 | ||
|- | |||
| [[Heilbronn's triangle problem]] || Discrete geometry || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | | [[The Harary–Hill and Zarankiewicz crossing-number conjectures]] || Combinatorics || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-18 | ||
| Line 115: | Line 117: | ||
|- | |- | ||
| [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | | [[Worst-case Subset Sum below the meet-in-the-middle bound]] || Computational complexity || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-20 | ||
|- | |||
| [[One-sample matroid prophet inequalities]] || Algorithms || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-19 | |||
|- | |||
| [[The Gotsman–Linial conjecture]] || Computational complexity || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | |||
|- | |||
| [[The Laughlin spectral gap]] || Mathematical physics || 6 || 5 || 0 || 1 || 0 || 0 || 2026-10-19 | |||
|- | |- | ||
| [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | | [[The triangular Hilbert transform at the symmetric point]] || Harmonic analysis || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-19 | ||
| Line 121: | Line 129: | ||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Lech's multiplicity conjecture]] || Algebra || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Lech's multiplicity conjecture]] || Algebra || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 145: | Line 151: | ||
|- | |- | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 6 || 3 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Gaussian moat problem]] || Number theory || 6 || 3 || 0 || 1 || 0 || 2 || 2026-10-12 | |||
|- | |||
| [[Petty's projection-volume conjecture]] || Convex geometry || 6 || 3 || 0 || 3 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | | [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | ||
| Line 161: | Line 171: | ||
|- | |- | ||
| [[Yau's nodal conjecture for smooth metrics]] || Differential geometry || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-20 | | [[Yau's nodal conjecture for smooth metrics]] || Differential geometry || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-20 | ||
|- | |||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 5 || 4 || 0 || 0 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | | [[The Barendregt–Geuvers–Klop conjecture]] || Mathematical logic || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-19 | ||
| Line 185: | Line 197: | ||
|- | |- | ||
| [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Naimark's problem]] || Operator algebras || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Rokhlin's multiple-mixing problem]] || Dynamical systems || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | | [[Rokhlin's multiple-mixing problem]] || Dynamical systems || 5 || 0 || 0 || 4 || 1 || 0 || 2026-10-16 | ||
| Line 201: | Line 211: | ||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[The Erdős similarity conjecture]] || Real analysis || 5 || 3 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The combinatorial invariance conjecture for Kazhdan–Lusztig polynomials]] || Algebra || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 225: | Line 231: | ||
|- | |- | ||
| [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | | [[The little finitistic dimension conjecture]] || Representation theory of algebras || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-14 | ||
|- | |- | ||
| [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-11 | ||
|- | |- | ||
| [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Hardness of coloring three-colorable graphs]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The 2-to-1 Games Conjecture]] || Computational complexity || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 283: | Line 285: | ||
|- | |- | ||
| [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | | [[Wall's D(2) problem]] || Homotopy theory || 4 || 2 || 1 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | | [[Threshold parallel repetition for entangled games]] || Quantum information || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-15 | ||
Latest revision as of 18:57, 22 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 23 October 2026. The table can be re-sorted by any column.
Summary
- 239 result pages; 238 of them list at least one public follow-up.
- 1142 follow-up entries in total:
- Research follow-ups: 400
- Formalizations: 30
- Reviews and verifications: 552
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 146
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 (15 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.
