READABLE PAPER MAP · EXPERIMENTAL

The Factor-Two Hardness Threshold for Vertex Cover

Follow the argument. Find the definition. Check the source.

Map JSON
Reading aid, not a proof certificate. Solid connections record explicit references; dashed connections are inferred. A reference may provide context rather than a necessary proof step. External sources have not been retrieved.
Report a map issue
100%
Theorem 2.1 → Theorem 1.1: cited-in-proofProposition 3.3 → Theorem 1.1: cited-in-proofProposition 3.5 → Theorem 1.1: cited-in-proofCorollary 7.2 → Theorem 1.1: cited-in-proofVertex cover and τ(G) → Theorem 1.1: defines
6 / 94 nodes · 8 connections

Connections around the selected result. Drag the background to pan; zoom in for labels. Click a node to read its statement; click a connection to read the supporting passage. Solid lines: explicit references. Dashed: inferred.

All matching nodes (39)
Browse connections around this result (8)
Extraction and provenance

Numbered headings, explicit cross-references, nearby proof boundaries, and candidate notation contexts. PDF text can be incomplete.

Agent-authored source-linked notes on selected results. Remaining extraction is automatic.

PDF SHA-256: 4c8faec31a1af3d0c640485e464ecedd99fb984f4a2c3b457f032685013804ab

readable-paper 0.1.4 · 25 pages · 529 text blocks

Get the open-source skill
A COMMUNITY OF READERS

Make room for
understanding.

Read openly. Join with your academic email to share questions, insights, and a little clarity.

Your email stays private. Verification confirms mailbox access, not mathematical expertise.