common-pile-span-filling

Chat-template-ready English span filling examples derived from selected Common Pile components. This upload contains only judge-accepted rows from a larger generated Common Pile export.

Contents

• Format: gzip-compressed JSON Lines under data/*.jsonl.gz
• Schema: {"messages": [{"role": "user", "content": "..."}, {"role": "assistant", "content": "..."}]}
• Files: 7
• Rows: 253,715
• Task: English span filling

Sources

Accepted rows by source family:

Source family	Accepted rows
common-pile/arxiv_abstracts_filtered	79,655
common-pile/arxiv_papers_filtered	174,060

Effective source files:

Source file	Accepted rows
common-pile/arxiv_abstracts_filtered/arxiv-abstracts-dolma-0000.parquet	39,765
common-pile/arxiv_abstracts_filtered/arxiv-abstracts-dolma-0001.parquet	39,890
common-pile/arxiv_papers_filtered/arxiv-papers-0000.parquet	35,780
common-pile/arxiv_papers_filtered/arxiv-papers-0001.parquet	35,038
common-pile/arxiv_papers_filtered/arxiv-papers-0002.parquet	34,776
common-pile/arxiv_papers_filtered/arxiv-papers-0003.parquet	34,577
common-pile/arxiv_papers_filtered/arxiv-papers-0004.parquet	33,889

Example

{
  "messages": [
    {
      "role": "user",
      "content": "Restore the text by filling in the missing parts. We describe a new algorithm, the $(k,\\ell)$-pebble game with colors, and <mask_1> of $(k,\\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances of sparse graphs appear in rigidity theory and have received increased attention in recent years. In particular, our colored pebbles generalize and strengthen the previous results of Lee and Streinu and <mask_4> <mask_3> Tutte-Nash-Williams characterization of arboricity. <mask_2> that certifies sparsity based on the $(k,\\ell)$-pebble game with colors. Our work also exposes connections between pebble game algorithms and previous sparse graph algorithms by Gabow, Gabow and Westermann and Hendrickson."
    },
    {
      "role": "assistant",
      "content": "We describe a new algorithm, the $(k,\\ell)$-pebble game with colors, and use it obtain a characterization of the family of $(k,\\ell)$-sparse graphs and algorithmic solutions to a family of problems concerning tree decompositions of graphs. Special instances of sparse graphs appear in rigidity theory and have received increased attention in recent years. In particular, our colored pebbles generalize and strengthen the previous results of Lee and Streinu and give a new proof of the Tutte-Nash-Williams characterization of arboricity. We also present a new decomposition that certifies sparsity based on the $(k,\\ell)$-pebble game with colors. Our work also exposes connections between pebble game algorithms and previous sparse graph algorithms by Gabow, Gabow and Westermann and Hendrickson."
    }
  ]
}

Filtering

Rows were judged with google/gemma-4-31B-it.

Outcome	Rows
Audited	279,201
Accepted/uploaded	253,715
Rejected	25,486

Main rejection reasons: url-or-reference-dump, incoherent-or-ocr, response-mismatch, low-value-trivial. Machine-readable counts are in audit_summary.json.

The larger generated export had 57,130,149 rows; this upload keeps only rows with an explicit accepted audit decision.

Recreate

recreate_dataset.py can regenerate a similar dataset from local Parquet files:

python recreate_dataset.py \
  --input-root /path/to/source-parquet-root \
  --output-root data

The script also includes audit and filter subcommands for rerunning the judge/filter workflow with an OpenAI-compatible endpoint.