Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (251 pages, 1255 entries) |
Automatic refresh from the published result pages (251 pages, 1263 entries) |
||
| Line 1: | Line 1: | ||
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 | 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 == | == Summary == | ||
* 251 result pages; 250 of them list at least one public follow-up. | * 251 result pages; 250 of them list at least one public follow-up. | ||
* | * 1263 follow-up entries in total: | ||
** Research follow-ups: 446 | ** Research follow-ups: 446 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: | ** Reviews and verifications: 610 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: 159 | ** Catalogue entries, citations and exposition: 159 | ||
| Line 20: | Line 20: | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 17 || 11 || 0 || 2 || 0 || 4 || 2026-10-21 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 17 || 11 || 0 || 2 || 0 || 4 || 2026-10-21 | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 15 || 9 || 0 || 1 || 1 || 4 || 2026-10-17 | ||
|- | |- | ||
| [[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 33: | Line 33: | ||
|- | |- | ||
| [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 10 || 5 || 0 || 1 || 4 || 0 || 2026-10-22 | | [[The rational Hodge conjecture for CM abelian varieties]] || Algebraic geometry || 10 || 5 || 0 || 1 || 4 || 0 || 2026-10-22 | ||
|- | |||
| [[The Erdős–Hall question on totient values]] || Number theory || 10 || 2 || 0 || 5 || 0 || 3 || 2026-10-21 | |||
|- | |- | ||
| [[Derandomization of logarithmic space]] || Computational complexity || 10 || 1 || 0 || 3 || 1 || 5 || 2026-10-20 | | [[Derandomization of logarithmic space]] || Computational complexity || 10 || 1 || 0 || 3 || 1 || 5 || 2026-10-20 | ||
| Line 43: | Line 45: | ||
|- | |- | ||
| [[Sidorenko's conjecture]] || Combinatorics || 9 || 4 || 0 || 4 || 0 || 1 || 2026-10-24 | | [[Sidorenko's conjecture]] || Combinatorics || 9 || 4 || 0 || 4 || 0 || 1 || 2026-10-24 | ||
|- | |||
| [[Largest prime factors of consecutive integers]] || Number theory || 9 || 2 || 0 || 5 || 0 || 2 || 2026-10-22 | |||
|- | |- | ||
| [[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 | ||
| Line 49: | Line 53: | ||
|- | |- | ||
| [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 2026-10-19 | | [[Primitive roots for every admissible integer base]] || Number theory || 9 || 7 || 1 || 1 || 0 || 0 || 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 63: | Line 65: | ||
|- | |- | ||
| [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-23 | | [[The Auslander–Reiten conjecture]] || Representation theory of algebras || 8 || 4 || 0 || 3 || 0 || 1 || 2026-10-23 | ||
|- | |||
| [[Heilbronn's triangle problem]] || Discrete geometry || 8 || 2 || 0 || 5 || 0 || 1 || 2026-10-22 | |||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Erdős's conjecture on short Egyptian fractions]] || Number theory || 8 || 1 || 0 || 4 || 0 || 3 || 2026-10-21 | |||
|- | |- | ||
| [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | | [[The Lane–Emden conjecture]] || Partial differential equations || 8 || 5 || 0 || 3 || 0 || 0 || 2026-10-20 | ||
| Line 72: | Line 78: | ||
| [[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 | ||
|- | |- | ||
| [[ | | [[Erdős's conjecture on arithmetic progressions]] || Combinatorics || 8 || 1 || 0 || 5 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 8 || 5 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The Erdős similarity conjecture]] || Real analysis || 8 || 5 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
| Line 95: | Line 101: | ||
|- | |- | ||
| [[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 | ||
|- | |- | ||
| [[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 105: | Line 109: | ||
|- | |- | ||
| [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Approximate counting of common bases of two matroids]] || Algorithms || 7 || 1 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Reconstruction thresholds for Potts broadcasting on trees]] || Probability || 7 || 2 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
| Line 121: | Line 123: | ||
|- | |- | ||
| [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-16 | | [[Ultraflat real Littlewood polynomials]] || Harmonic analysis || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-22 | | [[Bose–Einstein condensation in the dilute Bose gas]] || Mathematical physics || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-22 | ||
| Line 191: | Line 191: | ||
|- | |- | ||
| [[The Kollár–Pardon conjecture on semialgebraic universal covers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | | [[The Kollár–Pardon conjecture on semialgebraic universal covers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | ||
|- | |||
| [[Borsuk's conjecture]] || Discrete geometry || 5 || 1 || 0 || 2 || 0 || 2 || 2026-10-20 | |||
|- | |- | ||
| [[Bounded gaps between primes]] || Number theory || 5 || 3 || 0 || 0 || 0 || 2 || 2026-10-20 | | [[Bounded gaps between primes]] || Number theory || 5 || 3 || 0 || 0 || 0 || 2 || 2026-10-20 | ||
| Line 267: | Line 269: | ||
|- | |- | ||
| [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-10 | | [[The Zariski cancellation problem over the complex numbers]] || Algebraic geometry || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[Ostmann's inverse Goldbach conjecture]] || Number theory || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-23 | |||
|- | |- | ||
| [[Singular Bernoulli convolutions]] || Real analysis || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-23 | | [[Singular Bernoulli convolutions]] || Real analysis || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-23 | ||
| Line 275: | Line 279: | ||
|- | |- | ||
| [[De Giorgi's conjecture]] || Partial differential equations || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-21 | | [[De Giorgi's conjecture]] || Partial differential equations || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-21 | ||
|- | |- | ||
| [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | | [[Absolutely continuous spectrum of the Anderson model in dimension at least three]] || Mathematical physics || 4 || 0 || 1 || 1 || 0 || 2 || 2026-10-16 | ||
| Line 389: | Line 391: | ||
|- | |- | ||
| [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | | [[Serre's positivity conjecture for intersection multiplicities]] || Algebra || 3 || 0 || 1 || 1 || 0 || 1 || 2026-10-16 | ||
Revision as of 08:44, 25 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
- 251 result pages; 250 of them list at least one public follow-up.
- 1263 follow-up entries in total:
- Research follow-ups: 446
- Formalizations: 31
- Reviews and verifications: 610
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 159
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.
