Results by number of public follow-ups: Difference between revisions
From OpenAI Aftermath
Automatic refresh from the published result pages (221 pages, 954 entries) |
Automatic refresh from the published result pages (226 pages, 985 entries) |
||
| Line 2: | Line 2: | ||
== Summary == | == Summary == | ||
* | * 226 result pages; 224 of them list at least one public follow-up. | ||
* | * 985 follow-up entries in total: | ||
** Research follow-ups: | ** Research follow-ups: 342 | ||
** Formalizations: | ** Formalizations: 29 | ||
** Reviews and verifications: | ** Reviews and verifications: 495 | ||
** Critiques and corrections: 14 | ** Critiques and corrections: 14 | ||
** Catalogue entries, citations and exposition: | ** Catalogue entries, citations and exposition: 105 | ||
== Results == | == Results == | ||
| Line 14: | Line 14: | ||
! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ! Result !! Area !! Follow-ups !! Research !! Formalizations !! Reviews and verifications !! Critiques and corrections !! Catalogue, citations and exposition !! Latest entry | ||
|- | |- | ||
| [[The quasi-Riemann hypothesis]] || Number theory || | | [[The quasi-Riemann hypothesis]] || Number theory || 37 || 27 || 2 || 7 || 0 || 1 || 2026-10-19 | ||
|- | |- | ||
| [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | | [[Matrix multiplication with exponent at most 9/4]] || Algebraic complexity || 14 || 10 || 0 || 2 || 0 || 2 || 2026-10-21 | ||
|- | |- | ||
| [[The Euclidean plane is not five-colorable]] || Discrete geometry || | | [[The Euclidean plane is not five-colorable]] || Discrete geometry || 11 || 7 || 0 || 0 || 1 || 3 || 2026-10-16 | ||
|- | |- | ||
| [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | | [[The Unique Games Conjecture]] || Computational complexity || 9 || 5 || 1 || 2 || 0 || 1 || 2026-10-21 | ||
| Line 27: | Line 27: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The Erdős–Hall question on totient values]] || Number theory || 9 || 2 || 0 || 4 || 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 | ||
| Line 43: | Line 45: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[Uniform exclusion of Landau–Siegel zeros]] || Number theory || 8 || 3 || 0 || 4 || 0 || 1 || 2026-10-17 | |||
|- | |- | ||
| [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | | [[Integer multiplication below n log n]] || Algorithms || 8 || 6 || 0 || 1 || 0 || 1 || 2026-10-16 | ||
| Line 65: | Line 69: | ||
|- | |- | ||
| [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | | [[Universal optimality of the triangular lattice]] || Discrete geometry || 7 || 2 || 0 || 3 || 0 || 2 || 2026-10-18 | ||
|- | |- | ||
| [[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 | ||
| Line 93: | Line 95: | ||
|- | |- | ||
| [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | | [[Foulkes' conjecture]] || Algebra || 6 || 0 || 0 || 6 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[Heilbronn's triangle problem]] || Discrete geometry || 6 || 1 || 0 || 4 || 0 || 1 || 2026-10-16 | |||
|- | |||
| [[Lech's multiplicity conjecture]] || Algebra || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | |||
|- | |- | ||
| [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[Nagata's conjecture on plane curves]] || Algebraic geometry || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 103: | Line 109: | ||
|- | |- | ||
| [[The Bass trace conjecture]] || Group theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Bass trace conjecture]] || Group theory || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
|- | |||
| [[The Mahler conjectures]] || Convex geometry || 6 || 2 || 0 || 2 || 0 || 2 || 2026-10-16 | |||
|- | |- | ||
| [[The Toms–Winter conjecture]] || Operator algebras || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | | [[The Toms–Winter conjecture]] || Operator algebras || 6 || 2 || 0 || 4 || 0 || 0 || 2026-10-16 | ||
| Line 117: | Line 125: | ||
|- | |- | ||
| [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | | [[Depth-three circuit lower bounds beyond the square-root exponent]] || Computational complexity || 5 || 2 || 0 || 3 || 0 || 0 || 2026-10-21 | ||
|- | |||
| [[Equality of microstates and nonmicrostates free entropy]] || Operator algebras || 5 || 1 || 0 || 4 || 0 || 0 || 2026-10-21 | |||
|- | |- | ||
| [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | | [[Kaplansky's quasitrace conjecture]] || Operator algebras || 5 || 1 || 0 || 3 || 0 || 1 || 2026-10-21 | ||
| Line 141: | Line 151: | ||
|- | |- | ||
| [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | | [[Entanglement without secret key and the PPT-squared conjecture]] || Quantum information || 5 || 0 || 0 || 5 || 0 || 0 || 2026-10-16 | ||
|- | |- | ||
| [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | | [[Mean-payoff games in quasipolynomial time]] || Algorithms || 5 || 0 || 0 || 4 || 0 || 1 || 2026-10-16 | ||
| Line 167: | Line 173: | ||
|- | |- | ||
| [[The Laughlin spectral gap]] || Mathematical physics || 5 || 4 || 0 || 1 || 0 || 0 || 2026-10-16 | | [[The Laughlin spectral gap]] || Mathematical physics || 5 || 4 || 0 || 1 || 0 || 0 || 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 249: | Line 253: | ||
|- | |- | ||
| [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | | [[Thompson's group F is nonamenable]] || Group theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-13 | ||
|- | |||
| [[The Gaussian moat problem]] || Number theory || 4 || 2 || 0 || 1 || 0 || 1 || 2026-10-12 | |||
|- | |- | ||
| [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | | [[Endpoint Sobolev regularity of the centered maximal function]] || Harmonic analysis || 4 || 1 || 0 || 2 || 0 || 1 || 2026-10-11 | ||
| Line 257: | Line 263: | ||
|- | |- | ||
| [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[Moore's parity conjecture for constant-depth quantum circuits]] || Computational complexity || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[Single-fold Diophantine representations]] || Mathematical logic || 4 || 1 || 0 || 3 || 0 || 0 || 2026-10-10 | |||
|- | |- | ||
| [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | | [[The David–Semmes problem in higher codimension]] || Harmonic analysis || 4 || 0 || 0 || 3 || 0 || 1 || 2026-10-10 | ||
| Line 267: | Line 275: | ||
|- | |- | ||
| [[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 | ||
|- | |||
| [[The generalized Mukai conjecture]] || Algebraic geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-21 | |||
|- | |- | ||
| [[The low-temperature Sherrington–Kirkpatrick fluctuation law]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-20 | | [[The low-temperature Sherrington–Kirkpatrick fluctuation law]] || Probability || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-20 | ||
| Line 321: | Line 331: | ||
|- | |- | ||
| [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | | [[The Euclidean Steinitz–Bergström conjecture]] || Discrete geometry || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-12 | ||
|- | |||
| [[The periodic tiling conjecture in dimension three]] || Discrete geometry || 3 || 1 || 0 || 0 || 0 || 2 || 2026-10-12 | |||
|- | |- | ||
| [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | | [[Classical capacity of generalized amplitude damping]] || Quantum information || 3 || 1 || 0 || 1 || 0 || 1 || 2026-10-11 | ||
| Line 327: | Line 339: | ||
|- | |- | ||
| [[The Erdős similarity conjecture]] || Real analysis || 3 || 3 || 0 || 0 || 0 || 0 || 2026-10-10 | | [[The Erdős similarity conjecture]] || Real analysis || 3 || 3 || 0 || 0 || 0 || 0 || 2026-10-10 | ||
|- | |- | ||
| [[The Kervaire conjecture]] || Group theory || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The Kervaire conjecture]] || Group theory || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
| Line 335: | Line 345: | ||
|- | |- | ||
| [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | | [[The second Kahn–Kalai conjecture]] || Probability || 3 || 0 || 0 || 3 || 0 || 0 || 2026-10-10 | ||
|- | |||
| [[Urysohn width and macroscopic dimension under positive scalar curvature]] || Differential geometry || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-21 | |||
|- | |- | ||
| [[The trilinear Hilbert transform]] || Harmonic analysis || 2 || 0 || 0 || 2 || 0 || 0 || 2026-10-20 | | [[The trilinear Hilbert transform]] || Harmonic analysis || 2 || 0 || 0 || 2 || 0 || 0 || 2026-10-20 | ||
| Line 409: | Line 421: | ||
|- | |- | ||
| [[The hypercube Ramsey number has linear order]] || Combinatorics || 2 || 0 || 1 || 0 || 0 || 1 || 2026-10-11 | | [[The hypercube Ramsey number has linear order]] || Combinatorics || 2 || 0 || 1 || 0 || 0 || 1 || 2026-10-11 | ||
|- | |- | ||
| [[An exact Hausdorff gauge for SLE]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | | [[An exact Hausdorff gauge for SLE]] || Probability || 2 || 1 || 0 || 1 || 0 || 0 || 2026-10-10 | ||
Revision as of 00:17, 21 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 21 October 2026. The table can be re-sorted by any column.
Summary
- 226 result pages; 224 of them list at least one public follow-up.
- 985 follow-up entries in total:
- Research follow-ups: 342
- Formalizations: 29
- Reviews and verifications: 495
- Critiques and corrections: 14
- Catalogue entries, citations and exposition: 105
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 (9 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.
