Datasets:
id string | paper string | preset string | seed string | dataset string | model string | effort string | max_tokens int64 | reply string | reasoning string | analysis_chars int64 | n_tokens int64 | prompt_tokens int64 | finish_reason string | truncated bool | has_answer_tag bool | provider string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0705.4246::09 | 0705.4246 | easy | 349484331 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 |
<answer>{"x":"AAAAAAAAAAAAAAAaBBBBBBb","y":"AAAAAAAAAAAAaBBBBBb"}</answer> | We need to find words x and y satisfying two constraints: lengths and counts of each letter type given.
Counts: x length 23 with counts [a,A,b,B] = [1, 15, 1, 6]; meaning exactly 1 'a', 15 'A' (inverse of a), 1 'b', 6 'B' (inverse of b). That sums to 1+15+1+6 = 23. y length 19 with counts [a,A,b,B] = [1,12,1,5] i.e., ... | 114,955 | 37,976 | 523 | stop | false | true | Crusoe |
0712.1400::06 | 0712.1400 | easy | 2136280014 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33](...TRUNCATED) | "We need to solve linear system over GF(q) where q = 2147483647 (note: this is a prime? Actually 2^3(...TRUNCATED) | 118,418 | 39,643 | 12,132 | stop | false | true | Crusoe |
0705.4246::05 | 0705.4246 | easy | 760737996 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 |
<answer>{"x":"aaaAAAAbbbbB","y":"aaaaaaaaAAAbBBBBBBB"}</answer> | "We need to find x and y satisfying constraints and substituting into w yields word whose reduced fo(...TRUNCATED) | 163,047 | 44,324 | 465 | stop | false | true | Crusoe |
0705.4246::04 | 0705.4246 | easy | 1775818435 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 |
<answer>{"x":"bbbbbaaaaAB","y":"aAAAAAAAAAAAAbBBBBBBBBBBBBB"}</answer> | "We need to parse problem: We have free group on letters a,b with inverses A,B. We need to find word(...TRUNCATED) | 189,353 | 51,048 | 441 | stop | false | true | Crusoe |
0705.4246::00 | 0705.4246 | easy | 1061254800 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>{\"x\":\"aAAAAAAAAAAAAAbBBBBBBBBBBA\",\"y\":\"aAAAAAAAAAAAAAAAAAAAbBBBBBBBBBBBBBBa\"}</an(...TRUNCATED) | "We need to find words x,y meeting constraints: x length 26 with counts a=2, A=13, b=1, B=10 ; simil(...TRUNCATED) | 189,257 | 53,539 | 523 | stop | false | true | Crusoe |
0709.1499::01 | 0709.1499 | easy | 1757572287 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>\n[\n [ [], [ [\"2/1\",[158]], [\"4/1\",[120]], [\"-6/1\",[109]], [\"18/1\",[104]], [\"-(...TRUNCATED) | "We have a problem: find a 3x3 matrix X(x) of polynomials (with integer coefficients) that satisfies(...TRUNCATED) | 200,002 | 63,714 | 502 | stop | false | true | Crusoe |
0705.4246::02 | 0705.4246 | easy | 2053126898 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>{\"x\":\"AAAAAAAAAaabBBBBBB\",\"y\":\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaAAbbbbbbbbbbbbbbbbb(...TRUNCATED) | "We need to find words x and y that satisfy constraints and when substituted into w yields target re(...TRUNCATED) | 299,830 | 77,822 | 458 | stop | false | true | Crusoe |
0709.1499::09 | 0709.1499 | easy | 2074320434 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>\n[\n [\n [ [\"1/1\",[0]], [\"1/1\",[1]], [\"1/1\",[2]], [\"1/1\",[3]], [\"1/1\",[4]](...TRUNCATED) | "We need to find X such that transpose(X) B + B X = 0. So it's like a skew-symmetry condition: X sat(...TRUNCATED) | 265,943 | 79,222 | 515 | stop | false | true | Crusoe |
0709.1499::03 | 0709.1499 | easy | 740832859 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>{ \"0\": [ [ [\"250/1\",[158]], [\"-25/1\",[120]], [\"20/1\",[110]], [\"100/1\",[98]], [\(...TRUNCATED) | "We need to produce a solution to a linear equation: transpose(X) * B + B * X = 0 (the zero matrix).(...TRUNCATED) | 275,982 | 85,157 | 526 | stop | false | true | Crusoe |
0709.1499::05 | 0709.1499 | easy | 471917329 | amphora/math-intuition-20260908-402-easy-10 | nvidia/nemotron-3-nano-30b-a3b | high | 100,000 | "\n<answer>\n{\n \"row0\": [\n [\n [\"1/1\",[0]],\n [\"1/1\",[1]],\n [\"1/1\",[2](...TRUNCATED) | "We need to find a 3x3 matrix X(x) over Z[x] satisfying transpose(X) * B + B * X = 0 (i.e., the anti(...TRUNCATED) | 282,472 | 89,374 | 515 | stop | false | true | Crusoe |
math-intuition reasoning traces
Full chain-of-thought traces from 7 reasoning models on the same 4,020 problems, graded by each problem family's own verifier.
Questions come from
amphora/math-intuition-20260908-402-easy-10
— 402 arXiv-derived problem families x 10 seeds, easy preset. Every row here refers to an id
in that dataset, so prompts and the instance cache can be joined from it.
Generation settings
Identical for every model, so the traces are directly comparable:
| max output | 100,000 tokens |
| reasoning effort | high / thinking enabled |
| temperature | 1.0 |
| system prompt | Solve the provided question. Do not use code execution to solve. |
| user message | the dataset's question column, verbatim |
The questions carry their own answer contract (<answer>{...}</answer> with a worked example),
so no formatting instructions were added.
Files
One gzipped JSONL per model, 4,020 rows each, 100% carrying a reasoning trace.
| model | accuracy | truncated | correct-when-answered | mean output tok | mean trace chars |
|---|---|---|---|---|---|
| Nemotron-3-ultra-550B-A55B | 32.14% | 26.4% | 44.23% | 65,879 | 138,601 |
| Qwen3.5-27B-GPTQ-Int4 | 19.68% | 13.5% | 23.07% | 64,517 | 128,882 |
| Nemotron-3-super-120B-A12B | 16.59% | 42.6% | 31.34% | 73,317 | 160,346 |
| Qwen3.5-35B-A3B-GPTQ-Int4 | 15.37% | 19.1% | 19.21% | 71,487 | 146,204 |
| Nemotron-3-nano-30B-A3B | 11.27% | 53.4% | 25.03% | 79,566 | 220,555 |
| Qwen3.5-122B-A10B-GPTQ-Int4 | 8.71% | 76.8% | 40.56% | 91,237 | 179,376 |
| Qwen3.5-397B-A17B-GPTQ-Int4 | 8.26% | 39.3% | 20.04% | 74,018 | 131,799 |
Schema
id row id in the source dataset (e.g. "0705.4246::03")
paper arXiv id of the problem family
preset, seed generator settings for that instance
model model served
effort reasoning effort used
max_tokens output budget for that row
reasoning THE TRACE - full chain of thought
reply the final answer only (after </think> or the harmony final channel)
analysis_chars len(reasoning)
n_tokens completion tokens billed (reasoning + reply)
finish_reason "stop" or "length"
truncated finish_reason == "length"
has_answer_tag whether reply contains <answer>
reply and reasoning are kept separate on purpose. The graders take the last
<answer> match, so scoring text that still contains the chain of thought can pick up a
discarded draft answer instead of the real one.
Reading the numbers
Accuracy is capped, not saturated. Every model was cut off at 100,000 output tokens, and
truncation rates run from 13.5% to 76.8%. A truncated row has no answer and scores zero, so the
headline column understates every model — most severely Qwen3.5-122B-A10B, whose
correct-when-answered rate (40.56%) is the second best in the set while its headline is last.
Compare truncated and correct-when-answered before ranking anything.
Quantization differs between families. The Qwen3.5 models are GPTQ-Int4, Nemotron-super is BF16, and the two other Nemotrons were served through an API provider. Cross-family comparisons carry that confound.
Not included yet
gpt-oss-20b and gpt-oss-120b were run on the same problems but predate trace capture, so
only 2,990 / 4,020 and 2,301 / 4,020 of their rows carry reasoning. Backfills are in progress.
- Downloads last month
- 98