
Follow the proof.
Step-by-step maps of OpenAI's math papers, in plain English.
Featured digests
Fully mapped papers. Each one took a careful model pass; the rest of the catalog is read-only until it gets its turn.All digested (5)
Theoretical computer scienceLean
The Exponential Time Hypothesis is False
Family 378 · 67 ppFor fixed , counts -CNF solutions deterministically in time, refuting ETH
89 nodes5 novel68 sections
How a paper reads here
The source PDFs are dense and unsigned. The explorer gives each one three handles.
- The mapEvery theorem, lemma and in-proof claim becomes a node; "uses" edges are drawn as a layered DAG with the main result on top. Click a node and its whole support lights up.
- The nodeEach step has a name, the paper's statement, a plain-English version, why it is here, and a classification: novel, routine, or a known result with its citation.
- Ask the paperA chat that only knows the map. Every claim in an answer cites a node, and clicking the citation opens that step. It will not assert anything that is not in the map.
Browse by discipline
373 result families. The count is families; the second number is how many are digested so far.