Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (255 pages, 1343 entries) |
Automatic refresh from the published result pages (256 pages, 1353 entries) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 2: | Line 2: | ||
== Summary == | == Summary == | ||
* | * 256 result pages; 256 of them list at least one public follow-up. | ||
* | * 1353 follow-up entries in total: | ||
** Research follow-ups: 459 | ** Research follow-ups: 459 | ||
** Formalizations: 31 | ** Formalizations: 31 | ||
** Reviews and verifications: | ** Reviews and verifications: 640 | ||
** Critiques and corrections: 17 | ** Critiques and corrections: 17 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 206 | ||
== Results == | == Results == | ||
| Line 121: | Line 121: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[One-sample matroid prophet inequalities]] || Algorithms || 7 || 2 || 0 || 4 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[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 | ||
| Line 127: | Line 129: | ||
|- | |- | ||
| [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-17 | | [[Cylinder coverings below the half-area bound]] || Discrete geometry || 7 || 4 || 0 || 3 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[Petty's projection-volume conjecture]] || Convex geometry || 7 || 3 || 0 || 3 || 0 || 1 || 2026-10-17 | |||
|- | |- | ||
| [[The affine Bernstein problem]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-17 | | [[The affine Bernstein problem]] || Differential geometry || 7 || 1 || 0 || 4 || 0 || 2 || 2026-10-17 | ||
| Line 169: | Line 173: | ||
|- | |- | ||
| [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | | [[Universal computation in forced Navier–Stokes flows]] || Partial differential equations || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-20 | ||
|- | |- | ||
| [[Sensitivity versus block sensitivity]] || Computational complexity || 6 || 4 || 0 || 0 || 0 || 2 || 2026-10-19 | | [[Sensitivity versus block sensitivity]] || Computational complexity || 6 || 4 || 0 || 0 || 0 || 2 || 2026-10-19 | ||
| Line 179: | Line 181: | ||
|- | |- | ||
| [[A factor-two approximation for shortest common superstring]] || Algorithms || 6 || 2 || 4 || 0 || 0 || 0 || 2026-10-17 | | [[A factor-two approximation for shortest common superstring]] || Algorithms || 6 || 2 || 4 || 0 || 0 || 0 || 2026-10-17 | ||
|- | |||
| [[Connes' bicentralizer problem]] || Operator algebras || 6 || 1 || 0 || 3 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
| Line 196: | Line 200: | ||
| [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The two-point Chowla conjecture]] || Number theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[ | | [[Polynomial removal for ordered binary matrices]] || Combinatorics || 6 || 4 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-26 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-26 | ||
| Line 229: | Line 233: | ||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-16 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 5 || 2 || 0 || 1 || 0 || 2 || 2026-10-16 | ||
|- | |- | ||
| [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Elementary positivity of chromatic quasisymmetric functions]] || Combinatorics || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
| Line 249: | Line 251: | ||
|- | |- | ||
| [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[The Cartan–Hadamard isoperimetric conjecture]] || Differential geometry || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[The Kervaire conjecture]] || Group theory || 5 || 0 || 0 || 4 || 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 279: | Line 283: | ||
|- | |- | ||
| [[The complete Crouzeix conjecture]] || Functional analysis || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-13 | | [[The complete Crouzeix conjecture]] || Functional analysis || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-13 | ||
|- | |- | ||
| [[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 | ||
| Line 303: | Line 305: | ||
|- | |- | ||
| [[Generalized star height at most three]] || Computational complexity || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-22 | | [[Generalized star height at most three]] || Computational complexity || 4 || 2 || 0 || 2 || 0 || 0 || 2026-10-22 | ||
|- | |||
| [[Rigidity of the Turing degrees]] || Mathematical logic || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-22 | |||
|- | |- | ||
| [[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 | ||
| Line 309: | Line 313: | ||
|- | |- | ||
| [[The cycle–clique Ramsey conjecture]] || Combinatorics || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-20 | | [[The cycle–clique Ramsey conjecture]] || Combinatorics || 4 || 0 || 0 || 2 || 0 || 2 || 2026-10-20 | ||
|- | |||
| [[Modularity of elliptic curves over imaginary quadratic fields]] || Number theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-19 | |||
|- | |- | ||
| [[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 317: | Line 323: | ||
|- | |- | ||
| [[Isomorphism of the free group factors]] || Operator algebras || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[Isomorphism of the free group factors]] || Operator algebras || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |||
| [[Metric Markov cotype of ℓ1]] || Functional analysis || 4 || 1 || 0 || 1 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[Positively curved Einstein four-manifolds]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Positively curved Einstein four-manifolds]] || Differential geometry || 4 || 0 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 331: | Line 339: | ||
|- | |- | ||
| [[The Deligne–Drinfeld conjecture]] || Algebra || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | | [[The Deligne–Drinfeld conjecture]] || Algebra || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-16 | ||
|- | |- | ||
| [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | | [[The area law for gapped ground states in two dimensions]] || Mathematical physics || 4 || 1 || 2 || 1 || 0 || 0 || 2026-10-16 | ||
| Line 371: | Line 377: | ||
|- | |- | ||
| [[Goldfeld's conjecture for quadratic twists]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | | [[Goldfeld's conjecture for quadratic twists]] || Number theory || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-22 | ||
|- | |- | ||
| [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-22 | | [[The computational complexity of Weisfeiler–Leman refinement]] || Computational complexity || 3 || 1 || 0 || 2 || 0 || 0 || 2026-10-22 | ||
| Line 401: | Line 405: | ||
|- | |- | ||
| [[Long-time derivation of the Boltzmann equation]] || Mathematical physics || 3 || 2 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[Long-time derivation of the Boltzmann equation]] || Mathematical physics || 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 | ||
| Line 495: | Line 495: | ||
|- | |- | ||
| [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The random k-SAT satisfiability threshold]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The singular set of stationary integral varifolds]] || Differential geometry || 2 || 0 || 0 || 1 || 0 || 1 || 2026-10-16 | |||
|- | |- | ||
| [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | | [[Long gaps between primes]] || Number theory || 2 || 1 || 1 || 0 || 0 || 0 || 2026-10-08 | ||
Latest revision as of 00:44, 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.
- 1353 follow-up entries in total:
- Research follow-ups: 459
- Formalizations: 31
- Reviews and verifications: 640
- Critiques and corrections: 17
- Catalogue entries, citations and exposition: 206
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.
