Dataset Viewer
Auto-converted to Parquet Duplicate
cot_idx
int64
0
82.6k
sample_idx
int64
0
36.9k
problem
stringlengths
16
4.31k
solution
stringlengths
85
38.1k
⌀
answer
stringlengths
0
3.24k
data_source
stringclasses
45 values
data_fields
dict
input_ids
listlengths
361
24.2k
labels
listlengths
361
24.2k
valid_mask
listlengths
361
24.2k
0
0
If $5x - 3 = 12$, what is the value of $5x + 3$?
null
18
math
{ "unique_id": "test/prealgebra/2002.json", "subject": "Prealgebra", "level": 2, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 2679, 400, 20, 87, 481, 220, 18, 284, 220, 16, 17, 54876, 1128, 374, 279, 897, 315, 400, 20, 87, 488, 220, 18, 3, 1939, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075, 46391, 15164...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
1
1
How many vertical asymptotes does the graph of $y=\frac{2}{x^2+x-6}$ have?
null
2
math
{ "unique_id": "test/algebra/1.json", "subject": "Algebra", "level": 3, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 4340, 1657, 12140, 96254, 6295, 1558, 279, 4771, 315, 400, 88, 34433, 37018, 90, 17, 15170, 87, 61, 17, 37892, 12, 21, 31716, 614, 1939, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075,...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
2
2
Determine the remainder of 71 (mod 3).
null
2
math
{ "unique_id": "test/number_theory/81.json", "subject": "Number Theory", "level": 1, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 35, 24308, 279, 26313, 315, 220, 22, 16, 320, 2593, 220, 18, 3593, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, 697, 1590, 4226, 2878, 1124, 79075, 46391, 151645, 198, 151644, 77091, 198, 151667, 198, 32313, 11, 773, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, 0, 0, 0, 0, ...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1...
3
3
We have two geometric sequences of positive real numbers: $$6,a,b\text{ and }\frac{1}{b},a,54$$Solve for $a$.
null
3\sqrt{2}
math
{ "unique_id": "test/algebra/184.json", "subject": "Algebra", "level": 5, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 1654, 614, 1378, 52484, 23700, 315, 6785, 1931, 5109, 25, 26107, 21, 15012, 8402, 59, 1318, 90, 323, 51300, 37018, 90, 16, 15170, 65, 2137, 64, 11, 20, 19, 14085, 50, 3948, 369, 400, 64, 3, 382, 5501, 2874, 3019, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1...
4
4
The only garments that a particular factory produces are dresses and shirts. It produces three dresses for every five shirts it makes. If the factory produced a total of 72 garments today, how many dresses did it make?
null
27
math
{ "unique_id": "test/prealgebra/1715.json", "subject": "Prealgebra", "level": 3, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 785, 1172, 66456, 429, 264, 3953, 8633, 18644, 525, 220, 36762, 323, 36724, 13, 1084, 18644, 2326, 2698, 43257, 369, 1449, 4236, 36724, 220, 432, 3643, 13, 1416, 279, 8633, 8947, 264, 2790, 315, 220, 22, 17, 66456, 3...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
5
6
$AB = 20$ cm, $m \angle A = 30^\circ$, and $m \angle C = 45^\circ$. Express the number of centimeters in the length of $\overline{BC}$ in simplest radical form. [asy] import olympiad; size(200); import geometry; import graph; defaultpen(linewidth(0.8)); pair A = origin, B = (10*sqrt(3),10), C = (10*sqrt(3) + 10,0); dra...
null
10\sqrt{2}
math
{ "unique_id": "test/prealgebra/1210.json", "subject": "Prealgebra", "level": 5, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 3, 1867, 284, 220, 17, 15, 3, 9961, 11, 400, 76, 1124, 4044, 362, 284, 220, 18, 15, 24884, 43298, 54876, 323, 400, 76, 1124, 4044, 356, 284, 220, 19, 20, 24884, 43298, 12947, 17399, 279, 1372, 315, 2889, 54236, 3...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
6
7
If $2^{x+1}=4^{x-7}$ and $8^{3y}=16^{-y+13}$, what is the value of $x+y$?
null
19
math
{ "unique_id": "test/algebra/2457.json", "subject": "Algebra", "level": 4, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 2679, 400, 17, 47822, 87, 10, 16, 51185, 19, 47822, 87, 12, 22, 31716, 323, 400, 23, 47822, 18, 88, 51185, 16, 21, 87210, 88, 10, 16, 18, 31716, 11, 1128, 374, 279, 897, 315, 400, 87, 43010, 3, 1939, 5501, 2874...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
7
9
Carpet costs $\$21.95$ per square yard and the padding to put under it costs $\$2.55$ per square yard. Felix plans to install padding and carpet in the region shown in the diagram. What is the cost of the carpet and padding needed to exactly cover the room? [asy] unitsize(0.2 inch); //import geometry; draw((0,0)--(9,0...
null
735
math
{ "unique_id": "test/prealgebra/1645.json", "subject": "Prealgebra", "level": 4, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 8852, 6862, 7049, 57960, 3, 17, 16, 13, 24, 20, 3, 817, 9334, 19515, 323, 279, 5300, 311, 2182, 1212, 432, 7049, 57960, 3, 17, 13, 20, 20, 3, 817, 9334, 19515, 13, 55923, 6649, 311, 4582, 5300, 323, 27854, 304, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
8
10
The sum of the squares of three consecutive positive even numbers is $12296$. Find the product of the three numbers divided by $8$.
null
32736
math
{ "unique_id": "test/algebra/392.json", "subject": "Algebra", "level": 4, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 785, 2629, 315, 279, 31340, 315, 2326, 23921, 6785, 1496, 5109, 374, 400, 16, 17, 17, 24, 21, 12947, 7379, 279, 1985, 315, 279, 2326, 5109, 17779, 553, 400, 23, 3, 382, 5501, 2874, 3019, 553, 3019, 11, 323, 2182, ...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1...
9
11
If $f(x)$ is an even function and $g(x)$ is an odd function, find if $f(g(x^3))$ is even, odd, or neither. Enter "odd", "even", or "neither".
null
\text{even}
math
{ "unique_id": "test/intermediate_algebra/1230.json", "subject": "Intermediate Algebra", "level": 1, "seq_id": null, "testcase": null, "ID": null, "Year": null, "Problem Number": null, "Part": null }
[ 151644, 872, 198, 2679, 400, 69, 2075, 15087, 374, 458, 1496, 729, 323, 400, 70, 2075, 15087, 374, 458, 10322, 729, 11, 1477, 421, 400, 69, 3268, 2075, 61, 18, 593, 3, 374, 1496, 11, 10322, 11, 476, 13866, 382, 6269, 330, 14556, 4...
[ -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100, -100...
[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0...
End of preview. Expand in Data Studio

Terminator-Qwen3-8B Training Data

Project page | Paper | Code | Trained weights

The tokenized, labeled data used to train Terminator-Qwen3-8B. Terminator is a small network that predicts when a reasoning model has reached its final answer so the remaining reasoning can be skipped.

Each row is one chain of thought (CoT) from Qwen3-8B on a math, coding or science problem, with per-token labels marking where the CoT first reaches its final answer. This dataset holds training data only. To evaluate on the test benchmarks, generate their CoTs with the code.

Contents

Source Train CoTs Train problems Validation CoTs Validation problems
MATH 27,666 10,745 134 50
OpenCoder 22,875 9,423 109 50
OpenScience 29,933 11,719 123 50
AIME 1983-2024 1,625 751 109 50
Total 82,099 32,638 475 200

Usage

from datasets import load_dataset
from transformers import AutoTokenizer

ds = load_dataset("acnagle/Terminator-Qwen3-8B-Training-Data")
row = ds["train"][0]

tokenizer = AutoTokenizer.from_pretrained("Qwen/Qwen3-8B")
text = tokenizer.decode(row["input_ids"])  # the prompt and the CoT

To train with the code, download the files to the path its scripts expect, then run the training script from the repo root:

hf download acnagle/Terminator-Qwen3-8B-Training-Data train.jsonl val.jsonl \
  --repo-type dataset --local-dir data/outputs/Qwen/Qwen3-8B
bash train_terminator_qwen3-8b.sh

Fields

Field Description
cot_idx CoT ID, unique across both splits
sample_idx Problem ID, specific to this dataset. CoTs of the same problem share it
problem, answer Problem text and reference answer
solution Reference solution. Null for MATH (see Sources and licenses) and AIME (none upstream)
data_source math, opencoder, openscience or aime_<year>
data_fields Source-specific metadata. Keys that don't apply to a source are null
input_ids Qwen3-8B tokens: prompt, <think>, the CoT, </think>. The final response isn't included
labels -100 outside the reasoning, 0 up to and including the last token of the answer span, 1 after it. </think> is always 1
valid_mask 1 where labels isn't -100. The training code doesn't read it

How it was made

Each problem has 3 CoTs, sampled from Qwen3-8B with temperature 0.6, top-p 0.95, top-k 20 and presence penalty 1.5, up to 24,576 tokens. Qwen3-30B-A3B-Thinking-2507 then extracted each final answer and located the first place the CoT reaches it. Only CoTs whose span passed verification were kept: 82,574 of 110,345, covering 32,838 of 36,933 problems.

prepare_training_data.py tokenized those CoTs and built the labels with its default settings, holding out 50 problems per source for validation using seed 1337. The rows are grouped by source, so shuffle them before training.

Rebuilding this data from scratch requires generating CoTs and rerunning the pipeline in the code.

Sources and licenses

CoTs, spans and labels are released under Apache-2.0, matching Qwen3-8B. Problem text and reference data stay under their original terms. The labels below are as listed upstream, and they may not settle the rights to the underlying problems.

Source License listed upstream
MATH, via the PRM800K split None. solution is omitted because AoPS claims those solutions as proprietary
AIME 1983-2024 MIT
OpenCoder (educational_instruct) MIT
OpenScience (OS-Q3-235B-4) CC BY 4.0

Citation

@misc{nagle2026terminatorlearningoptimalexit,
  title   = {TERMINATOR: Learning Optimal Exit Points for Early Stopping in Chain-of-Thought Reasoning},
  author  = {Alliot Nagle and Jakhongir Saydaliev and Dhia Garbaya and Michael Gastpar and Ashok Vardhan Makkuva and Hyeji Kim},
  year    = {2026},
  eprint  = {2603.12529},
  archivePrefix = {arXiv},
  primaryClass  = {cs.LG},
  url     = {https://arxiv.org/abs/2603.12529}
}
Downloads last month
15

Models trained or fine-tuned on acnagle/Terminator-Qwen3-8B-Training-Data

Collection including acnagle/Terminator-Qwen3-8B-Training-Data

Paper for acnagle/Terminator-Qwen3-8B-Training-Data