A map of the argument.
Explore how results connect, locate notation, and follow every explanation back to the paper.
Try a paper
The critical dimension for one-phase Bernoulli minimizers
50 pages · 178 nodes · 127 connections · 49 notation entries
1 check to inspect · includes agent-authored notes on selected resultsThe p-adic section conjecture
24 pages · 88 nodes · 73 connections · 30 notation entries
1 check to inspect · includes agent-authored notes on selected resultsThe Factor-Two Hardness Threshold for Vertex Cover
25 pages · 94 nodes · 76 connections · 33 notation entries
26 checks to inspect · includes agent-authored notes on selected resultsA counterexample to the Monge ansatz for the three-marginal Coulomb cost
14 pages · 40 nodes · 43 connections · 20 notation entries
1 check to inspect · includes agent-authored notes on selected resultsA Direct Proof of Optimal Max-Cut Hardness
38 pages · 118 nodes · 136 connections · 56 notation entries
28 checks to inspect · includes agent-authored notes on selected resultsOpen your own map
Generate a map with the skill, then select its JSON and original PDF. Both stay on this device.
What the map means
A graph is more useful than a strict tree here: several theorems may share a lemma, and a result may have several prerequisites. Explore one result at a time, including its references, examples, and equations.
The extractor records explicit cross-references and proposes proof boundaries. Agent-authored notes add selected definitions and explanations. Every connection includes evidence; unresolved references stay unresolved. “Definition not located” is a request to inspect the source, not a claim that the notation is wrong.
This project is independent of arXiv, alphaXiv, Stanford, and OpenAI. The sample PDFs retain their original license.