venue stringclasses 1
value | paper_id stringlengths 5 17 | title stringlengths 28 115 | authors stringlengths 11 126 | year int64 2.02k 2.02k | arxiv_id stringlengths 10 10 ⌀ | arxiv_v1_date stringdate 2023-07-27 00:00:00 2025-01-20 00:00:00 ⌀ | arxiv_match stringclasses 2
values | edge_repaired bool 1
class | num_nodes int64 34 85 | num_edges int64 103 306 | dag stringlengths 85.4k 347k |
|---|---|---|---|---|---|---|---|---|---|---|---|
FOCS_2024 | 0001CMOSW24 | The Tractability Border of Reachability in Simple Vector Addition Systems with States | "Dmitry Chistikov 0001; Wojciech Czerwinski; Filip Mazowiecki; Lukasz Orlikowski; Henry Sinclair-Ban(...TRUNCATED) | 2,024 | 2412.16612 | 2024-12-21 | matched | true | 56 | 154 | "{\"paper_title\": \"The Tractability Border of Reachability in Simple Vector Addition Systems with (...TRUNCATED) |
FOCS_2024 | 0001CPSS24 | Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds | Nikhil Bansal 0001; Vincent Cohen-Addad; Milind Prabhu; David Saulpic; Chris Schwiegelshohn | 2,024 | 2405.01339 | 2024-05-02 | matched | true | 70 | 252 | "{\"paper_title\": \"Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Boun(...TRUNCATED) |
FOCS_2024 | 0001G24 | Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS | Mohsen Ghaffari 0001; Christoph Grunau | 2,024 | 2410.19516 | 2024-10-25 | matched | true | 49 | 134 | "{\"paper_title\": \"Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved M(...TRUNCATED) |
FOCS_2024 | 0001K024 | On Approximating Cutwidth and Pathwidth | Nikhil Bansal 0001; Dor Katzelnick; Roy Schwartz 0002 | 2,024 | 2311.15639 | 2023-11-27 | matched | true | 59 | 175 | "{\"paper_title\": \"On Approximating Cutwidth and Pathwidth\", \"paper_url\": null, \"nodes\": [{\"(...TRUNCATED) |
FOCS_2024 | 0001RRS24 | Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting | Ruiquan Gao 0001; Mohammad Roghani; Aviad Rubinstein; Amin Saberi | 2,024 | 2409.15713 | 2024-09-24 | matched | true | 75 | 219 | "{\"paper_title\": \"Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting\", \(...TRUNCATED) |
FOCS_2024 | 0001ST24 | Fast Decision Tree Learning Solves Hard Coding-Theoretic Problems | Caleb Koch 0001; Carmen Strassle; Li-Yang Tan | 2,024 | 2409.13096 | 2024-09-19 | matched | true | 49 | 125 | "{\"paper_title\": \"Fast decision tree learning solves hard coding-theoretic problems\", \"paper_ur(...TRUNCATED) |
FOCS_2024 | 0001STTZ24 | Towards Instance-Optimal Euclidean Spanners | Hung Le 0001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 0008 | 2,024 | 2409.08227 | 2024-09-12 | matched | true | 46 | 139 | "{\"paper_title\": \"Towards Instance-Optimal Euclidean Spanners\", \"paper_url\": null, \"nodes\": (...TRUNCATED) |
FOCS_2024 | 0001X24 | Spectral Guarantees for Adversarial Streaming PCA | Eric Price 0001; Zhiyang Xun | 2,024 | 2408.10332 | 2024-08-19 | matched | true | 50 | 141 | "{\"paper_title\": \"Spectral Guarantees for Adversarial Streaming PCA\", \"paper_url\": null, \"nod(...TRUNCATED) |
FOCS_2024 | 0002LRX24 | On Pigeonhole Principles and Ramsey in TFNP | Siddhartha Jain 0002; Jiawei Li 0014; Robert Robere; Zhiyang Xun | 2,024 | 2401.12604 | 2024-01-23 | matched | true | 84 | 255 | "{\"paper_title\": \"On Pigeonhole Principles and Ramsey in TFNP\", \"paper_url\": null, \"nodes\": (...TRUNCATED) |
FOCS_2024 | 0003W24 | Constant-Depth Arithmetic Circuits for Linear Algebra Problems | Robert Andrews 0003; Avi Wigderson | 2,024 | 2404.10839 | 2024-04-16 | matched | true | 77 | 206 | "{\"paper_title\": \"Constant-Depth Arithmetic Circuits for Linear Algebra Problems\", \"paper_url\"(...TRUNCATED) |
tcs-dags-clean
FOCS 2024 paper dependency DAGs with every depends_on edge audited, and the standalone proof
questions that target them, as used by the tcs knowledge-injection experiments. Private working
copy; not the canonical AI-Math-TCS release. Built by scripts/hf_export.py in the tcs repo.
from datasets import load_dataset
dags = load_dataset("3N3G/tcs-dags-clean", "dags", split="FOCS_2024")
questions = load_dataset("3N3G/tcs-dags-clean", "questions", split="FOCS_2024")
| venue | papers | questions | questions kept |
|---|---|---|---|
| FOCS 2024 | 91 | 2599 | 2053 |
Sources
- DAGs:
AI-Math-TCS/tcs_dagsFOCS_2024 splitgpt_5_4at revision24965d89a53f88d7caa9ee5fd7abf8481f11f452, with the edge audit below applied. - Questions:
AI-Math-TCS/tcs_standalone_hardFOCS_2024gpt_5_4at revision15bea05f1ae30580bf98aa8e6c5b9871a18f0ed6, all rows. - arXiv ids and v1 dates: resolved by title match (exp1.9);
arxiv_matchismatchedorunresolved.
STOC 2026 is deliberately absent: its upstream graphs are not yet audited this way.
Config dags
One row per paper: venue, paper_id, title, authors, year, arxiv_id,
arxiv_v1_date, arxiv_match, edge_repaired, num_nodes, num_edges, dag (JSON:
nodes, edges, deleted_depends_on_edges, dropped_depends_on_edges). Edge convention:
from requires to.
The edge audit. Upstream's FOCS 2024 graphs are not acyclic: 90 of 91 papers have directed
cycles on depends_on alone, 37.6% of nodes inside nontrivial strongly connected components,
and 9.3% of the edges outside cycles run from a definition or cited fact to a result proved in
the paper. Every one of the 9,828 depends_on edges was judged keep / flip / delete by
gemini-3.1-pro-preview (thinking high) from node statements, summaries and the edge's own
description, under the prompt proposed as Stage 2.75 of the upstream pipeline
(data/edge_repair/audit_prompt.txt in the tcs repo); residual cycles got one targeted second
pass. Result: 6,840 kept, 1,303 flipped, 1,685 deleted; every paper acyclic on depends_on.
Every surviving depends_on edge carries provenance (kept | flipped) and the auditor's
audit_reason; deletions sit under deleted_depends_on_edges with reasons. Other relations
(elaborates, proves, ...) are upstream's verbatim with provenance: original and were not
audited.
Validation against an independent cycle-only audit of the 3,909 intra-cycle edges: 95.6% identical verdicts, 96.6% agreement on whether the recorded direction stands, all four hand-adjudicated edges reproduced. Known residue: 11 kept edges still run from a definition or cited fact to a derived result. Per-edge correctness beyond that is verified only by sampling; the reasons are in the data for review.
Config questions
One row per generated question, filtered rows included: question_id
(venue/paper_id/node_id/row_idx), venue, paper_id, node_id (zero-padded), difficulty,
topic_tags, problem, answer, rubric, proof_source, generated_reference (always null
here), kept, filter_reason. kept applies the experiments' loader rules:
proof_source_not_dag (reference answer is model-written, not the paper's proof),
leaked_generator_text (generation-guideline prose shipped inside the problem),
node_missing (target node absent from the DAG), no_extracted_proof (target has no proof or
sketch in the DAG).
Known defects
- Standalone problems restate their prerequisites as givens, so they cannot serve as a bare theorem statement.
- Larger nodes'
proof_contentoften holds a whole section, embedding smaller nodes' proofs verbatim (118 cases); any context built from other nodes' proofs must screen for this. - Node summaries frequently describe the proof plan.
- Close reading of sampled questions found a provably false statement and an undefined term.
- Some
proof_source=dagrows target cited results whose "proof" is citation text.
- Downloads last month
- 36