Datasets:
model stringclasses 4
values | dataset stringclasses 1
value | token_budget int64 2.05k 32.8k | problem_id stringclasses 60
values | question large_stringclasses 60
values | gt_answer large_stringclasses 55
values | level stringclasses 0
values | difficulty float64 | variant stringclasses 1
value | subject stringclasses 1
value | predicted_answer large_stringlengths 2 196 | correct_strict bool 2
classes | correct_answer_forced bool 2
classes | answer_forced bool 2
classes | finish_reason stringclasses 2
values | decoding stringclasses 1
value | trace large_stringlengths 4.05k 126k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
qwen3-1.7b | aime | 2,048 | aime24_60 | Every morning Aya goes for a $9$-kilometer-long walk and stops at a coffee shop afterwards. When she walks at a constant speed of $s$ kilometers per hour, the walk takes her 4 hours, including $t$ minutes spent in the coffee shop. When she walks $s+2$ kilometers per hour, the walk takes her 2 hours and 24 minutes, incl... | [204] | null | null | main | aime | [9/(s + 1/2)] | false | false | true | end_think | sampled | <think>
Okay, let's try to figure out this problem. So, Aya walks 9 kilometers every morning, and she goes to a coffee shop after. The time it takes her to walk plus the time spent at the coffee shop is given in two different scenarios. When she walks at speed s km/h, the total time is 4 hours, including t minutes at t... |
qwen3-1.7b | aime | 2,048 | aime24_61 | Let $ABC$ be a triangle inscribed in circle $\omega$. Let the tangents to $\omega$ at $B$ and $C$ intersect at point $D$, and let $\overline{AD}$ intersect $\omega$ at $P$. If $AB=5$, $BC=9$, and $AC=10$, $AP$ can be written as the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime integers. Find $m + n$. | [113] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the length of AP in triangle ABC inscribed in a circle ω. The tangents at B and C meet at D, and AD intersects ω again at P. The given sides are AB=5, BC=9, AC=10. The answer should be in the form m/n where m and n are coprime, and then find m + n.
First, let me visualize the problem. T... |
qwen3-1.7b | aime | 2,048 | aime24_62 | Each vertex of a regular octagon is independently colored either red or blue with equal probability. The probability that the octagon can then be rotated so that all of the blue vertices end up at positions where there were originally red vertices is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integ... | [371] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the probability that a randomly colored regular octagon can be rotated so that all blue vertices end up in positions where there were originally red vertices. The answer should be in the form m/n where m and n are coprime, and then find m + n. Alright, let me think about how to approach ... |
qwen3-1.7b | aime | 2,048 | aime24_63 | Define $f(x)=|| x|-\tfrac{1}{2}|$ and $g(x)=|| x|-\tfrac{1}{4}|$. Find the number of intersections of the graphs of \[y=4 g(f(\sin (2 \pi x))) \quad\text{ and }\quad x=4 g(f(\cos (3 \pi y))).\] | [385] | null | null | main | aime | [Eq(y, 4*f*g*sin(2*pi*x))] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the number of intersections between the graphs of two functions: y = 4g(f(sin(2πx))) and x = 4g(f(cos(3πy))). The functions f and g are defined as f(x) = |x| - 1/2 and g(x) = |x| - 1/4.
First, I need to understand what these functions look like. Let me start by analyzing f(x) and g(x).... |
qwen3-1.7b | aime | 2,048 | aime24_64 | Let $p$ be the least prime number for which there exists a positive integer $n$ such that $n^{4}+1$ is divisible by $p^{2}$. Find the least positive integer $m$ such that $m^{4}+1$ is divisible by $p^{2}$. | [110] | null | null | main | aime | [12] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the smallest prime number p where n⁴ + 1 is divisible by p². Then, once I find that p, I have to find the smallest positive integer m such that m⁴ + 1 is divisible by p². Hmm, let's start by understanding the problem step by step.
First, let me recall that for a prime p, if p divides n⁴... |
qwen3-1.7b | aime | 2,048 | aime24_65 | Let $ABCD$ be a tetrahedron such that $AB=CD= \sqrt{41}$, $AC=BD= \sqrt{80}$, and $BC=AD= \sqrt{89}$. There exists a point $I$ inside the tetrahedron such that the distances from $I$ to each of the faces of the tetrahedron are all equal. This distance can be written in the form $\frac{m \sqrt n}{p}$, where $m$, $n$, an... | [104] | null | null | main | aime | [{0, 1}] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the distance from a point I inside a tetrahedron ABCD to each of its faces, given the lengths of the edges. The tetrahedron has edges AB = CD = √41, AC = BD = √80, and BC = AD = √89. The point I is such that its distances to all four faces are equal. The answer should be in the form m√n ... |
qwen3-1.7b | aime | 2,048 | aime24_66 | Let $\mathcal{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$. Let $r$ be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of $\mathcal{B}$. The value of $r^2$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive in... | [721] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the radius squared of the smallest sphere that can contain each rectangular box in the set B, where B consists of all rectangular boxes with surface area 54 and volume 23. Then express that radius squared as a reduced fraction p/q and find p+q. Alright, let me start breaking this down.
... |
qwen3-1.7b | aime | 2,048 | aime24_67 | There exist real numbers $x$ and $y$, both greater than 1, such that $\log_x\left(y^x\right)=\log_y\left(x^{4y}\right)=10$. Find $xy$. | [25] | null | null | main | aime | [25] | false | true | true | end_think | sampled | <think>
Okay, so I need to solve this problem where there are real numbers x and y, both greater than 1, such that log base x of (y^x) equals log base y of (x^{4y}) equals 10. And I need to find the product xy. Hmm, let me try to break this down step by step.
First, let me recall some logarithm properties. The logarit... |
qwen3-1.7b | aime | 2,048 | aime24_68 | Alice and Bob play the following game. A stack of $n$ tokens lies before them. The players take turns with Alice going first. On each turn, the player removes either $1$ token or $4$ tokens from the stack. Whoever removes the last token wins. Find the number of positive integers $n$ less than or equal to $2024$ for whi... | [809] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so Alice and Bob are playing this game with tokens. The rules are that they take turns removing either 1 or 4 tokens from a stack of n tokens. The person who takes the last token wins. We need to find how many positive integers n ≤ 2024 have a strategy where Bob can always win no matter what Alice does.
... |
qwen3-1.7b | aime | 2,048 | aime24_69 | Jen enters a lottery by picking $4$ distinct numbers from $S=\{1,2,3,\cdots,9,10\}.$ $4$ numbers are randomly chosen from $S.$ She wins a prize if at least two of her numbers were $2$ of the randomly chosen numbers, and wins the grand prize if all four of her numbers were the randomly chosen numbers. The probability of... | [116] | null | null | main | aime | [E*a*dp*g*i*n*p*r*r*z] | false | false | true | end_think | sampled | <think>
Okay, so Jen is entering a lottery, and she picks 4 distinct numbers from the set S = {1,2,3,...,9,10}. Then, 4 numbers are randomly chosen from S. She wins a prize if at least two of her numbers are in the randomly chosen set, and she wins the grand prize if all four of her numbers are in the randomly chosen s... |
qwen3-1.7b | aime | 2,048 | aime24_70 | Rectangles $ABCD$ and $EFGH$ are drawn such that $D,E,C,F$ are collinear. Also, $A,D,H,G$ all lie on a circle. If $BC=16$,$AB=107$,$FG=17$, and $EF=184$, what is the length of $CE$? | [104] | null | null | main | aime | [{77, c*e, -107 + 184}] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the length of CE in this problem with rectangles ABCD and EFGH. Let me try to visualize the problem first.
We have two rectangles, ABCD and EFGH. The points D, E, C, F are collinear. That means they lie on a straight line. Also, points A, D, H, G all lie on a circle. The given lengths ... |
qwen3-1.7b | aime | 2,048 | aime24_71 | Consider the paths of length $16$ that follow the lines from the lower left corner to the upper right corner on an $8\times 8$ grid. Find the number of such paths that change direction exactly four times, as in the examples shown below. | [294] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the number of paths of length 16 on an 8x8 grid that go from the lower left corner to the upper right corner, changing direction exactly four times. Let me try to figure this out step by step.
First, let me recall that on an 8x8 grid, moving from the lower left corner (0,0) to the upper... |
qwen3-1.7b | aime | 2,048 | aime24_72 | Find the largest possible real part of \[(75+117i)z+\frac{96+144i}{z}\]where $z$ is a complex number with $|z|=4$. | [540] | null | null | main | aime | [540] | false | true | true | end_think | sampled | <think>
Okay, so I need to find the largest possible real part of the expression $(75 + 117i)z + \frac{96 + 144i}{z}$ where $z$ is a complex number with magnitude 4. Hmm, let me think about how to approach this.
First, since $|z| = 4$, that means $z$ lies on a circle in the complex plane with radius 4 centered at the ... |
qwen3-1.7b | aime | 2,048 | aime24_73 | Eight circles of radius $34$ are sequentially tangent, and two of the circles are tangent to $AB$ and $BC$ of triangle $ABC$, respectively. $2024$ circles of radius $1$ can be arranged in the same manner. The inradius of triangle $ABC$ can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive i... | [197] | null | null | main | aime | [a*b*c] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the inradius of triangle ABC, given some information about circles arranged around it. Let me try to visualize the problem first.
There are eight circles of radius 34 that are sequentially tangent. Two of these circles are tangent to AB and BC of triangle ABC, respectively. Then, there ... |
qwen3-1.7b | aime | 2,048 | aime24_74 | Let $A$, $B$, $C$, and $D$ be point on the hyperbola $\frac{x^2}{20}- \frac{y^2}{24} = 1$ such that $ABCD$ is a rhombus whose diagonals intersect at the origin. Find the greatest real number that is less than $BD^2$ for all such rhombi. | [480] | null | null | main | aime | [theta] | false | false | true | end_think | sampled | <think>
Okay, let's try to tackle this problem step by step. So, we have a hyperbola given by the equation $\frac{x^2}{20} - \frac{y^2}{24} = 1$, and there are four points A, B, C, D on this hyperbola forming a rhombus. The diagonals of the rhombus intersect at the origin, which is the center of the hyperbola. We need ... |
qwen3-1.7b | aime | 2,048 | aime24_75 | Among the 900 residents of Aimeville, there are 195 who own a diamond ring, 367 who own a set of golf clubs, and 562 who own a garden spade. In addition, each of the 900 residents owns a bag of candy hearts. There are 437 residents who own exactly two of these things, and 234 residents who own exactly three of these th... | [73] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, let's try to figure out how many residents own all four things. So, we have 900 residents in total. Each owns a bag of candy hearts, which is given as 900. Then there are three other items: a diamond ring, a set of golf clubs, and a garden spade. The numbers for these are 195, 367, and 562 respectively. A... |
qwen3-1.7b | aime | 2,048 | aime24_76 | Let $\triangle ABC$ have circumcenter $O$ and incenter $I$ with $\overline{IA}\perp\overline{OI}$, circumradius $13$, and inradius $6$. Find $AB\cdot AC$. | [468] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find AB·AC in triangle ABC where the circumradius is 13, the inradius is 6, and IA is perpendicular to OI. Hmm, let's start by recalling some properties of triangles, circumcenters, incenters, and maybe some formulas related to them.
First, the circumradius R is given as 13, and the inradius... |
qwen3-1.7b | aime | 2,048 | aime24_77 | Find the number of triples of nonnegative integers \((a,b,c)\) satisfying \(a + b + c = 300\) and
\begin{equation*}
a^2b + a^2c + b^2a + b^2c + c^2a + c^2b = 6,000,000.
\end{equation*} | [601] | null | null | main | aime | [1] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the number of triples of nonnegative integers (a, b, c) such that a + b + c = 300 and the sum a²b + a²c + b²a + b²c + c²a + c²b equals 6,000,000. Hmm, that seems pretty complex. Let me try to break it down.
First, the problem gives me two equations:
1. a + b + c = 300
2. a²b + a²c + b²... |
qwen3-1.7b | aime | 2,048 | aime24_78 | Let \(O=(0,0)\), \(A=\left(\tfrac{1}{2},0\right)\), and \(B=\left(0,\tfrac{\sqrt{3}}{2}\right)\) be points in the coordinate plane. Let \(\mathcal{F}\) be the family of segments \(\overline{PQ}\) of unit length lying in the first quadrant with \(P\) on the \(x\)-axis and \(Q\) on the \(y\)-axis. There is a unique point... | [23] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to solve this problem where there are points O, A, and B in the coordinate plane. The problem is about finding the square of the distance from O to a specific point C on AB, which is not on any segment from the family F other than AB itself. Let me try to break this down step by step.
First, le... |
qwen3-1.7b | aime | 2,048 | aime24_79 | Let $\omega\neq 1$ be a 13th root of unity. Find the remainder when
\[\prod_{k=0}^{12}(2-2\omega^k+\omega^{2k})\]
is divided by 1000. | [321] | null | null | main | aime | [\Phi_{13}(alpha)] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the remainder when the product $\prod_{k=0}^{12}(2 - 2\omega^k + \omega^{2k})$ is divided by 1000, where $\omega$ is a 13th root of unity not equal to 1. Hmm, let me start by recalling some properties of roots of unity.
First, since $\omega$ is a 13th root of unity, we know that $\omega... |
qwen3-1.7b | aime | 2,048 | aime24_80 | Let \(b\ge 2\) be an integer. Call a positive integer \(n\) \(b\text-\textit{eautiful}\) if it has exactly two digits when expressed in base \(b\) and these two digits sum to \(\sqrt n\). For example, \(81\) is \(13\text-\textit{eautiful}\) because \(81 = \underline{6} \ \underline{3}_{13} \) and \(6 + 3 = \sqrt{81}... | [211] | null | null | main | aime | [b >= 2] | false | false | true | end_think | sampled | <think>
Okay, let's try to tackle this problem step by step. The question is about finding the smallest integer $ b \geq 2 $ such that there are more than ten $ b $-beautiful integers.
First, let me make sure I understand what a $ b $-beautiful integer is. The problem says that a positive integer $ n $ is $ b $-beaut... |
qwen3-1.7b | aime | 2,048 | aime24_81 | Find the number of rectangles that can be formed inside a fixed regular dodecagon ($12$-gon) where each side of the rectangle lies on either a side or a diagonal of the dodecagon. The diagram below shows three of those rectangles.
[asy] unitsize(0.6 inch); for(int i=0; i<360; i+=30) { dot(dir(i), 4+black); draw(dir(i)-... | [315] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the number of rectangles that can be formed inside a regular dodecagon where each side of the rectangle lies on either a side or a diagonal of the dodecagon. The problem mentions that there are three such rectangles shown in the diagram, but I need to figure out the total number.
First,... |
qwen3-1.7b | aime | 2,048 | aime24_82 | A list of positive integers has the following properties:
$\bullet$ The sum of the items in the list is $30$.
$\bullet$ The unique mode of the list is $9$.
$\bullet$ The median of the list is a positive integer that does not appear in the list itself.
Find the sum of the squares of all the items in the list. | [236] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, let's try to tackle this problem step by step. So, we have a list of positive integers with some specific properties. Let me list them out again to make sure I don't miss anything:
1. The sum of the items in the list is 30.
2. The unique mode of the list is 9.
3. The median of the list is a positive inte... |
qwen3-1.7b | aime | 2,048 | aime24_83 | Find the number of ways to place a digit in each cell of a 2x3 grid so that the sum of the two numbers formed by reading left to right is $999$, and the sum of the three numbers formed by reading top to bottom is $99$. The grid below is an example of such an arrangement because $8+991=999$ and $9+9+81=99$.
\[\begin{arr... | [45] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to figure out how many ways there are to fill a 2x3 grid with digits such that the sum of the two numbers formed by reading left to right is 999, and the sum of the three numbers formed by reading top to bottom is 99. Let me start by understanding the problem step by step.
First, let me visuali... |
qwen3-1.7b | aime | 2,048 | aime24_84 | Let $x,y$ and $z$ be positive real numbers that satisfy the following system of equations:
\[\log_2\left({x \over yz}\right) = {1 \over 2}\]\[\log_2\left({y \over xz}\right) = {1 \over 3}\]\[\log_2\left({z \over xy}\right) = {1 \over 4}\]
Then the value of $\left|\log_2(x^4y^3z^2)\right|$ is $\tfrac{m}{n}$ where $m$ an... | [33] | null | null | main | aime | [25/8.0] | false | false | true | end_think | sampled | <think>
Okay, let's try to solve this problem. So, we have three equations with three variables: x, y, z. All are positive real numbers. The equations are logarithms with base 2, and we need to find the absolute value of log base 2 of x^4 y^3 z^2, then express it as a fraction m/n and find m + n.
First, let me recall ... |
qwen3-1.7b | aime | 2,048 | aime24_85 | Let ABCDEF be a convex equilateral hexagon in which all pairs of opposite sides are parallel. The triangle whose sides are extensions of segments AB, CD, and EF has side lengths 200, 240, and 300. Find the side length of the hexagon. | [80] | null | null | main | aime | [] | false | false | true | end_think | sampled | <think>
Okay, so I need to find the side length of a convex equilateral hexagon ABCDEF where all pairs of opposite sides are parallel. The triangle formed by extending AB, CD, and EF has sides 200, 240, and 300. Hmm, let me try to visualize this.
First, since it's an equilateral hexagon, all sides are equal. Let me de... |
Effectiveness of Hidden-State Probes for Localizing Reasoning Failures
NeurIPS 2026 Workshop: Interpretability as a Science
This dataset accompanies the paper Effectiveness of Hidden-State Probes for Localizing Reasoning Failures (Interpretability as a Science: NeurIPS 2026 Workshop). It contains reasoning traces from Qwen3-4B and Qwen3-8B on DeepMath-103K and Hendrycks MATH problems, Monte Carlo continuations from each step of the incorrect traces, the failure labels assigned from those continuations, probe scores and checkpoints, per-step hidden-state features, and the inputs of every table command in the code repository. The traces are generated on DeepMath-103K examples at difficulty ≥ 7 and on levels 4 and 5 of the Hendrycks MATH training split. It also contains evaluation runs of Qwen3-1.7B, 4B, 8B and 14B on nine math benchmarks at token budgets from 2,048 to 32,768, with one sampled generation per problem.
The files keep the layout that the code reads. Download the table inputs with
hf download ssubhnil/Reasoning-Failures --repo-type dataset --local-dir hf_data \
--include "runs/*" --include "data/*" \
--exclude "runs/hf_pull/mc_rollouts_locus_k16/*/campaign/branches.jsonl.zst" \
--exclude "runs/hf_pull/mc_rollouts_locus_k16/*/corpus/*" \
--exclude "*/conf_probe.pt" --exclude "*/value_probe.pt" \
--exclude "runs/hf_pull/probe_corpus_16k/*" --exclude "runs/value_probe/ask_a_818/_packed/*"
and omit the --include and --exclude options to download everything.
Failure types
Failure types on three Qwen3-4B traces from the gold collection. Each panel shows the rollout rate $\hat p_t$ at the evaluated steps and the envelope $V^*_t$. For a pit, the envelope crosses $\theta = 0.1$ partway through the trace, at the pit step. For a near miss, the envelope never crosses the threshold. For a capability gap, the envelope is below the threshold from step 0.
Failure types in the broad collection (28,699 incorrect Qwen3-4B traces and 24,871 Qwen3-8B traces): their shares, the relative depth of the pit step, and the best reachable value before the pit step.
Confidence-probe predictions at the final step of each trace on the broad collection (read positions are described under Hidden-state features), with training and validation split by problem. (A) Miss rate by failure type. (B) Pit and near miss, binned by the best reachable value at step 0. (C) Pit-versus-near-miss AUROC of the confidence probe and the combined probe.
Models
| Model | Repository | Licence |
|---|---|---|
| Qwen3-4B | Qwen/Qwen3-4B | Apache-2.0 |
| Qwen3-8B | Qwen/Qwen3-8B | Apache-2.0 |
| Qwen3-4B transcoders | mwhanna/qwen3-4b-transcoders | MIT |
| Qwen3-8B transcoders | mwhanna/qwen3-8b-transcoders | MIT |
The evaluation runs also use Qwen/Qwen3-1.7B and Qwen/Qwen3-14B (Apache-2.0). Model weights and transcoder weights are not included here.
Contents
| Path | Contents | Size |
|---|---|---|
probe_corpus_16k/qwen3-{4b,8b}/ |
All generated traces: 144,000 per model (35,854 problems, about four traces each), with the rendered prompt, the trace, step segmentation and the stored correctness label | 7.5 GB (4B), 7.8 GB (8B) |
runs/hf_pull/probe_corpus_16k/qwen3-{4b,8b}/_p1_packed/ |
The same 144,000 traces per model with their hidden-state features (see Hidden-state features); the trace text duplicates probe_corpus_16k/ |
34.0 GB (4B), 52.7 GB (8B) |
runs/value_probe/ask_a_818/_packed/ |
Hidden-state and next-token features of the 818 gold-collection pit traces | 0.2 GB |
runs/hf_pull/mc_rollouts_locus_k16/qwen3-{4b,8b}/corpus/ |
The incorrect traces that the continuations start from (28,699 at 4B, 24,871 at 8B), with the gold answer | 2.0 GB (4B), 1.8 GB (8B) |
runs/hf_pull/mc_rollouts_locus_k16/qwen3-{4b,8b}/campaign/branches.jsonl.zst |
Continuations: 3,600,080 at 4B and 3,270,056 at 8B, one per line, with the step they start from and whether they reach the correct answer | 4.1 GB per model |
runs/hf_pull/mc_rollouts_locus_k16/qwen3-{4b,8b}/campaign/mc_ground_truth.pt |
Rollout rates: for each trace and evaluated step, the fraction of continuations that reach the correct answer and their number (382,449 steps at 4B, 350,346 at 8B) | 11 MB (4B), 10 MB (8B) |
runs/hf_pull/mc_rollouts_locus_k16/qwen3-{4b,8b}/campaign/gold_pits.json |
Failure types of every incorrect trace in the broad collection, with the pit step and the rollout rates along the trace | 8 MB (4B), 7 MB (8B) |
runs/hf_pull/mc_rollouts_locus_k16/qwen3-{4b,8b}/campaign/gold_pits_by_md5.pt |
Pit steps keyed by the MD5 of the trace text | 0.5 MB (4B), 0.4 MB (8B) |
runs/mc_gold/ |
The gold collection (campaign_final/, Qwen3-4B): 5,380 traces, 818 of them with a pit step, failure types and rollout rates only; and copies of the broad-collection labels (locus_{4b,8b}_k16/) |
19 MB |
runs/resp/ |
Pointer-probe labels, predictions and scores; gold-collection pit steps keyed by MD5 (campaign_final/) |
28 MB |
runs/conf_probe/, runs/conf_probe_psplit/, runs/mc_conf_probe/ (excluding checkpoints) |
Confidence-probe scores per trace, split and seed, their controls, the per-seed calibration scores and the reasoning-dynamics text features (conf_probe/dynamics/) |
0.4 GB |
runs/conf_probe{,_psplit}/qwen3-{4b,8b}/, runs/mc_conf_probe/qwen3-{4b,8b}/, runs/value_probe/qwen3-*/ |
Probe checkpoints (PyTorch state dicts) and their metrics | 4.6 GB |
runs/value_probe/ (excluding checkpoints) |
Value-probe readouts and the label-swap per-trace scores | 0.1 MB |
runs/layer_selection/qwen3-{4b,8b}/ |
Read-site selection curves: correctness AUROC by layer and by number of layers | 37 KB |
runs/failure_type_classifier/ |
Transcoder failure-type classifier: stored per-partition scores and the inputs of the classifier fit | 72 MB |
runs/paper/labels/, runs/paper/correction_flags/ |
Label correction flags, keyed by trace | 13 MB |
data/paper_tables/, data/problem_lookup.parquet |
Stored tables read by the figure commands and the supporting table; problem topic and difficulty | 1 MB |
evaluation/<benchmark>/ |
Evaluation runs, one sampled generation per model, benchmark, token budget and problem | 10.1 GB |
Path components such as hf_pull, mc_rollouts_locus_k16, locus_{4b,8b}_k16 and bipp_locus_4b are directory names from the original runs. So are _p1_packed (trace shards with hidden-state features), ask_a_818 (the gold collection's 818 pit traces), campaign_final and campaign (the label directories of the gold and the broad collection) and psplit (problem split); -hidlogit marks the probe variant whose inputs add the five next-token statistics. The code reads these paths, so they are kept.
Loading
The .pt files are pickles; load them only from this repository.
import json, torch
labels = json.load(open("runs/hf_pull/mc_rollouts_locus_k16/qwen3-4b/campaign/gold_pits.json"))
trace_id, row = next(iter(labels.items()))
row["regime"], row["gold_pit"], row["curve"]
steps = torch.load("runs/hf_pull/mc_rollouts_locus_k16/qwen3-4b/campaign/mc_ground_truth.pt", weights_only=False)
steps[trace_id][0] # {'p_correct_mc': ..., 'n_rollouts': ...}
import pandas as pd, pyarrow as pa
with pa.input_stream("runs/hf_pull/mc_rollouts_locus_k16/qwen3-4b/campaign/branches.jsonl.zst", compression="zstd") as f:
continuations = pd.read_json(f, lines=True, nrows=1000) # trace_id, step, idx, correct, text
from datasets import load_dataset
math500 = load_dataset("ssubhnil/Reasoning-Failures", "eval_math500", split="train")
Steps
Each trace is split at blank lines and adjacent blocks are merged until every step has at least 400 tokens (merged_step_char_spans in sst/shared/extractors.py of the code repository, Qwen3 tokenizer); every step index in this dataset uses this segmentation.
Hidden-state features
The feature shards hold one vector per step for every trace: the model's hidden state at layers 23 and 24, read at the stored end position of each step, concatenated, in bfloat16 (5,120 numbers per step at Qwen3-4B, 8,192 at Qwen3-8B). The gold-collection shards add five statistics of the next-token distribution at the same position (entropy, varentropy, top probability, the margin to the second token and the top-5 mass). The shards contain the same traces as probe_corpus_16k/, so download one or the other unless you need both. To use them, either download them, for example
hf download ssubhnil/Reasoning-Failures --repo-type dataset --local-dir hf_data \
--include "runs/hf_pull/probe_corpus_16k/qwen3-4b/_p1_packed/*"
(34.0 GB for Qwen3-4B, 52.7 GB for Qwen3-8B), or regenerate them with scripts/precompute_p1_features.py in the code repository.
Read positions. The features were not read exactly at the last token of each step. The stored step positions (step_spans) were computed from each step tokenized on its own, and the features were extracted in left-padded batches without shifting those positions. Each read therefore sits earlier in the trace than the step's last token, by the same number of tokens for every step of a trace: a median of 157 tokens at Qwen3-4B and 148 at Qwen3-8B, at most 512, and zero for about 22% of traces (pad widths reconstructed from the batching rule). For the final step, the read falls inside the intended step in 51.0% (4B) and 51.6% (8B) of traces and in an earlier step in 48.9% and 48.3% (the remaining 0.1% fall between steps). Tokenizing steps separately adds a smaller drift (a median of 3 tokens on a 40-trace Qwen3-4B sample). The probes in the paper were trained and evaluated on these features, and scripts/precompute_p1_features.py reads at the same positions. No result was re-scored with corrected positions. To read exact last-token states, locate steps with merged_step_char_spans and map their character spans to the token offsets of the joint prompt-and-trace tokenization.
Labels
Each incorrect trace is labelled from the rollout rate $\hat p_t$, the fraction of continuations sampled from step $t$ that reach the correct answer. The best reachable value $V^*_t$ (the envelope) is the largest value at step $t$ or any later step of the trace.
| Name in the paper | Value in the files | Definition |
|---|---|---|
| capability gap | regime = "capability" |
the envelope is at or below $\theta = 0.1$ already at step 0 |
| pit | regime = "pit" |
the envelope first falls to $\theta$ or below at an interior step, the pit step |
| near miss | regime = "reaches" |
the envelope never falls to $\theta$ or below |
| pit step | gold_pit |
the first step at which the envelope is at or below $\theta$; empty for capability gaps and near misses |
| rollout rate | p_correct_mc |
$\hat p_t$; n_rollouts is the number of continuations $K$ |
| correctness label | is_correct |
the stored verdict of the answer checker on the final answer |
Evaluation runs
The evaluation/ files hold one generation per model, benchmark, token budget and problem. The generations were sampled: the sampling temperature was not recorded (the generation code's default was 0.7), and no seed was fixed, so a rerun does not reproduce the traces. The decoding column marks the two math_test files, for Qwen3-1.7B and Qwen3-4B, whose traces agree across token budgets as greedy decoding would (greedy_inferred); every other file reads sampled. Revisions up to 9c2e9ea8 carried temperature and seed columns filled with the constants 0.0 and 42, which did not record the decoding settings. Strict accuracy is the mean of correct_strict: the answer is correct and was produced without forced extraction. Answer-forced accuracy is the mean of correct_answer_forced, which also counts answers extracted after a final answer was forced (answer_forced). The evaluation runs are released with the dataset; the paper does not report them. These runs were previously released as the dataset ssubhnil/Qwen3-Math-Eval, which this repository replaces.
| Benchmark | Config | Distinct problems | Models | Token budgets |
|---|---|---|---|---|
| MATH-500 | eval_math500 |
500 | 1.7B, 4B, 8B, 14B | 2k to 16k |
| MATH test | eval_math_test |
5,000 | 1.7B, 4B, 8B, 14B | 2k to 16k (1.7B and 4B: 2k to 8k) |
| MATH competition subset | eval_competition_math |
251 | 1.7B, 4B | 2k to 16k |
| MATH train L1-3 | eval_math_train_l1_3_indist |
2,283 | 1.7B, 4B, 8B, 14B | 2k to 16k |
| MATH-Perturb | eval_math_perturb |
836 | 1.7B, 4B, 8B, 14B | 2k to 16k |
| GSM-Plus | eval_gsm_plus |
2,400 | 1.7B, 4B, 8B, 14B | 2k to 16k |
| AIME 2024-25 | eval_aime |
60 | 1.7B, 4B, 8B, 14B | 2k to 32k |
| Putnam-AXIOM | eval_putnam_axiom |
597 | 1.7B, 4B, 8B, 14B | 2k to 32k |
| DeepMath-103K | eval_deepmath |
101,882 | 4B, 8B, 14B | 4k to 32k |
Distinct problems are counted by question text. MATH-Perturb has 837 rows per run (one question appears twice), Putnam-AXIOM 600, and DeepMath-103K covers all difficulty levels. GSM-Plus is its 2,400-problem testmini split.
Strict accuracy against token budget for every benchmark and model. Bars are 95% intervals from a bootstrap over problems; n is the number of distinct problems.
Strict (solid) and answer-forced (dashed) accuracy for Qwen3-4B and Qwen3-8B.
DeepMath-103K strict accuracy by difficulty at the 16k token budget, on rows whose gold answer is not yes/no, true/false, a single letter or empty (these forms are affected by the answer-checker correction; see Limitations). The lower strip gives the number of problems per difficulty; difficulties at most 2.5 and at least 9.5 are pooled. The dashed line marks difficulty 7, the lower bound of the examples used for the traces.
Limitations
- Correctness labels are stored as produced. The correction flags in
runs/paper/mark traces whose label changes under the corrected answer checker (binary answers, letter answers and unparseable answers); the labels themselves are not rewritten. - The evaluation labels were produced by an answer checker that predates a correction for yes/no, true/false and letter answers. The released
correct_strictandcorrect_answer_forcedcolumns are these stored labels; the corrected checker is the one in the code repository, and nothing here was regraded. The stored gold answers show the affected forms: in DeepMath, 218,916 of 1,235,860 rows have a yes/no or true/false gold parsed as a product of symbols (for example[e*s*y]for yes), 42,406 have a single-letter gold and 18,225 have an empty gold ([]). The other benchmarks have few such rows. The share of affected gold forms rises with DeepMath difficulty, from 14% at difficulty 6.5 or below to above 65% at 8.5 and above. - The continuations were sampled with settings (temperature, top-p, seed) that were not recorded with the files and cannot be recovered. Each continuation is capped at 4,096 tokens. In the broad collection, refined steps received 16 continuations and scanned steps 8 (both models); in the gold collection, refined steps received 8 and scanned steps 4.
- The
step_rewardsfield of the traces is a constant placeholder (0.5) and carries no information. Problem ids inprobe_corpus_16kare indices within the dataset named by their directory. data/problem_lookup.parquetgives the DeepMath-103K level-two topic and difficulty for DeepMath problems. For Hendrycks MATH problems the difficulty is the MATH level (4 or 5) where known and is otherwise empty.- The DeepMath-103K solution fields (
r1_solution_*) are not included. - Transcoder activations are not distributed. The code repository contains the extraction script.
- In the evaluation files,
problem_idis not one scheme across models: MATH test uses0,1, … for Qwen3-1.7B and 4B andhmath_algebra_0, … for Qwen3-8B and 14B, and DeepMath ids repeat acrosssource_shard. Match problems onquestion. - The DeepMath runs of Qwen3-4B miss 202 (4,096 tokens), 105 (8,192) and 97 (16,384) of the 101,882 distinct DeepMath questions that the Qwen3-14B runs cover.
Sources and licences
The material produced for this dataset (traces, continuations, labels, probe scores and checkpoints, tables) is released under CC BY 4.0. Benchmark problems keep the licence of their source.
| Source | Used in | Licence declared by the source |
|---|---|---|
| DeepMath-103K | problems of the traces; topic and difficulty; evaluation/deepmath |
MIT |
| Hendrycks MATH | problems of the traces; evaluation/math_test, evaluation/competition_math |
MIT |
| MATH-500 | evaluation/math500 |
no licence declared by the source |
| MATH-Perturb | evaluation/math_perturb |
Apache-2.0 |
| GSM-Plus | evaluation/gsm_plus |
CC BY-SA 4.0; these files are distributed under CC BY-SA 4.0 |
| Putnam-AXIOM | evaluation/putnam_axiom |
Apache-2.0 |
| AIME 2024, AIME 2025 | evaluation/aime |
no licence declared by the source |
| NuminaMath-CoT | evaluation/math_train_l1_3_indist |
Apache-2.0 |
Licences were read from each source's card or repository on 2026-10-04.
Citation
@inproceedings{
subhnil2026effectiveness,
title={Effectiveness of Hidden-State Probes for Localizing Reasoning Failures},
author={Shubham Subhnil and Yannis Belkhiter and Erik Miehling and Adam Dahlgren Lindstr{\"o}m and Elizabeth M. Daly},
booktitle={Interpretability as a Science: NeurIPS 2026 Workshop},
year={2026},
url={https://openreview.net/forum?id=X1D0ZeEeZ4}
}
Please also cite the source benchmarks above.
Acknowledgement
This work was funded in part by the EU Horizon project ELIAS (#101120237). Views and opinions expressed are those of the author(s) only and do not necessarily reflect those of the European Union or The European Research Executive Agency. This work was partially supported by the Knut and Alice Wallenberg Foundation. Experiments were run on the Cognitive Compute Cluster (CCC) at IBM Research.
- Downloads last month
- 160





