global_idx int64 0 999 | question stringlengths 40 2.42k | generated_response stringlengths 784 139k | solution stringlengths 1 6.9k | top_token_ids listlengths 211 32.7k | top_logprobs listlengths 211 32.7k | is_correct bool 2
classes | evaluation_method stringclasses 2
values | evaluation_reason stringlengths 12 188 |
|---|---|---|---|---|---|---|---|---|
0 | "Given a rational number, write it as a fraction in lowest terms and calculate the product of the re(...TRUNCATED) | "Alright, so I have this problem here: I need to find how many rational numbers between 0 and 1 have(...TRUNCATED) | 128 | [[32313,71486,5338,40,1249,80022,11578,10061,3925,24765,785,15364,4416,11908,11395,22043,1654,7039,1(...TRUNCATED) | [[-0.326171875,-1.326171875,-5.07421875,-5.69921875,-6.07421875,-7.69921875,-9.453125,-10.390625,-10(...TRUNCATED) | true | math_verify_numeric_visible_response | reference=[128, '128']; response=[128, '128'] |
1 | "Let $ \\mathcal{H}$ be an infinite-dimensional Hilbert space, let $ d>0$ , and suppose that $ S(...TRUNCATED) | "Alright, so I've got this problem about Hilbert spaces and orthonormal systems. Let me try to unpac(...TRUNCATED) | "1. **Consider a countable subset \\( S_0 \\subseteq S \\)**:\n Let \\( S_0 = \\{x_1, x_2, \\ldots(...TRUNCATED) | [[32313,71486,80022,40,11578,11395,15216,1249,3925,23336,24765,5338,11908,18665,22043,9707,10061,354(...TRUNCATED) | [[-0.5234375,-0.8984375,-8.6484375,-9.0234375,-9.8984375,-10.8984375,-11.2109375,-11.2734375,-11.710(...TRUNCATED) | false | manual_visible_response_review | "Does not construct the required center y; it assumes a nontrivial orthogonal complement for the spa(...TRUNCATED) |
2 | "Find the remainder when $9 \\times 99 \\times 999 \\times \\cdots \\times \\underbrace{99\\cdots9}_(...TRUNCATED) | "Okay, so I've got this problem here where I need to find the remainder when the product of a bunch (...TRUNCATED) | 109 | [[32313,71486,40,1249,5338,785,10061,80022,1654,7039,11578,4416,11395,22043,3925,9454,641,24765,4625(...TRUNCATED) | [[-0.461181640625,-1.8359375,-2.5859375,-2.7109375,-2.7109375,-7.5859375,-7.8359375,-8.4609375,-8.83(...TRUNCATED) | true | math_verify_numeric_visible_response | reference=[109, '109']; response=[109, '109'] |
3 | Compute the mean molecular speed v in the heavy gas radon (Rn) in m/s | "Okay, so I need to compute the mean molecular speed of radon gas. Hmm, I remember that there's a fo(...TRUNCATED) | 167.0 | [[32313,71486,5338,40,1249,80022,785,11578,11395,3925,15364,11908,35439,24765,10061,7039,9454,2461,6(...TRUNCATED) | [[-0.1710205078125,-1.9208984375,-5.296875,-5.921875,-6.046875,-8.296875,-8.921875,-9.421875,-10.171(...TRUNCATED) | false | math_verify_numeric_visible_response | reference=[167.000000000000, '167.0']; response=[161.400000000000, '161.4 \\,'] |
4 | "Two capacitors with capacitance values $C_{1}=2000 \\pm 10 \\mathrm{pF}$ and $C_{2}=3000 \\pm 15 \\(...TRUNCATED) | "Okay, so I have this problem about capacitors connected in series, and I need to find the percentag(...TRUNCATED) | 1.3 | [[32313,71486,5338,40,1249,80022,11578,785,3925,10061,11395,7039,9454,11908,22043,35439,4416,24765,1(...TRUNCATED) | [[-0.24365234375,-1.7431640625,-3.869140625,-4.4921875,-4.7421875,-8.9921875,-9.3671875,-10.1171875,(...TRUNCATED) | false | math_verify_numeric_visible_response | reference=[1.30000000000000, '1.3']; response=[1.16*(1/100), '1.16\\%'] |
5 | "One base of a trapezoid is $100$ units longer than the other base. The segment that joins the midpo(...TRUNCATED) | "Okay, so I have this problem about a trapezoid. Let me try to parse it step by step.\n\nFirst, the (...TRUNCATED) | 181 | [[32313,71486,40,5338,80022,1249,11578,10061,3925,11395,785,11908,15216,22043,24765,9707,18665,23336(...TRUNCATED) | [[-0.31689453125,-1.31640625,-6.44140625,-6.81640625,-8.0703125,-8.1953125,-9.9453125,-10.4453125,-1(...TRUNCATED) | true | math_verify_numeric_visible_response | reference=[181, '181']; response=[181, '181'] |
6 | "Let's say a language $L \\subseteq \\{0,1\\}^*$ is in $\\textbf{P}_{angel}$ if there exists a p(...TRUNCATED) | "Alright, so I've been given this problem about P_angel and related complexity classes. It's a bit i(...TRUNCATED) | "1. **Defining the Sparse Set \\( S \\) and the Turing Machine \\( M \\)**\n\n We need to construc(...TRUNCATED) | [[71486,32313,40,11578,80022,15216,11395,1249,10061,5338,7039,3925,22043,11908,785,4416,9454,15364,2(...TRUNCATED) | [[-0.63330078125,-0.75830078125,-8.8828125,-9.3828125,-9.5078125,-10.1953125,-10.4453125,-10.5078125(...TRUNCATED) | false | manual_visible_response_review | "The multi-part complexity argument is incomplete and its sparse-oracle construction does not establ(...TRUNCATED) |
7 | "In a mathematics test number of participants is $N < 40$ . The passmark is fixed at $65$ . The te(...TRUNCATED) | "Okay, so I have this math problem here, and I need to solve part (a) first. Let me read it again an(...TRUNCATED) | "(a) Let the number of promoted participants be \\( P \\) and the number of repeaters be \\( R \\). (...TRUNCATED) | [[32313,71486,5338,1249,40,10061,22043,80022,11578,1654,785,3925,11395,8304,4416,15216,9454,7039,970(...TRUNCATED) | [[-0.52880859375,-0.90380859375,-5.77734375,-6.40234375,-7.65234375,-9.28125,-9.40625,-9.71875,-9.78(...TRUNCATED) | false | manual_visible_response_review | "Does not answer part (b) and does not agree with the supplied reference; the dataset reference itse(...TRUNCATED) |
8 | "Kathy has $5$ red cards and $5$ green cards. She shuffles the $10$ cards and lays out $5$ of the ca(...TRUNCATED) | "Okay, so I have this problem where Kathy has 5 red cards and 5 green cards. She shuffles them and l(...TRUNCATED) | 157 | [[32313,71486,5338,1249,40,42,80022,1654,785,10061,11578,3925,22043,11395,11908,9454,4416,7039,24765(...TRUNCATED) | [[-0.463623046875,-1.0888671875,-4.21484375,-4.71484375,-4.83984375,-6.21484375,-8.7109375,-9.335937(...TRUNCATED) | true | math_verify_numeric_visible_response | reference=[157, '157']; response=[157, '157'] |
9 | "Square $AIME$ has sides of length $10$ units. Isosceles triangle $GEM$ has base $EM$ , and the are(...TRUNCATED) | "Okay, so I have this geometry problem here, and I need to figure out the length of the altitude to (...TRUNCATED) | 25 | [[32313,71486,40,5338,1249,80022,10061,785,11578,1654,3925,22043,11395,7039,9707,4416,9454,11908,186(...TRUNCATED) | [[-0.361572265625,-1.361328125,-3.861328125,-4.11328125,-4.73828125,-7.86328125,-8.921875,-9.359375,(...TRUNCATED) | true | math_verify_numeric_visible_response | reference=[25, '25']; response=[25, '25'] |
End of preview. Expand in Data Studio
s1K DeepSeek R1 Distill Qwen 32B — evaluated
This dataset preserves the 1,000 rows and original columns from
VoCuc/s1K-1.1-DeepSeek-R1-Distill-Qwen-32B
and adds correctness annotations for generated_response against solution.
Added columns
is_correct: whether the generated answer is judged correct.evaluation_method:math_verify_numeric_visible_responsefor a reference that is exactly one numeric literal, otherwisemanual_visible_response_review.evaluation_reason: extracted math-verify values or a concise manual-review reason.
Evaluation
- Total: 1,000
- Correct: 559 (55.9%)
- Incorrect: 441 (44.1%)
- Numeric-literal
solutionverified with math-verify: 336 - All other
solutionvalues manually reviewed: 664
Only text after the first </think> marker (or the whole response if there is
no marker) is evaluated. Math verification is intentionally restricted to a
reference solution matching a single numeric literal, e.g. 123 or 12.5.
Every other sample was read against its question and reference solution. The
annotations are auditable through evaluation_method and evaluation_reason.
- Downloads last month
- 82