Datasets:

ymoslem
/

AIME-24-25-26-router

qid string	question string	prompt string	ground_truth_answer string	full_output string	answer int64	accuracy int64	num_words int64	num_tokens int64	score float64	decision_label int64	decision_str string
cac41816043a	Twenty five of King Arthur's knights are seated at their customary round table. Three of them are chosen - all choices being equally likely - and are sent off to slay a troublesome dragon. Let $P$ be the probability that at least two of the three had been sitting next to each other. If $P$ is written as a fraction in l...	Twenty five of King Arthur's knights are seated at their customary round table. Three of them are chosen - all choices being equally likely - and are sent off to slay a troublesome dragon. Let $P$ be the probability that at least two of the three had been sitting next to each other. If $P$ is written as a fraction in l...	57	<think> Okay, so I have this problem about King Arthur's knights. There are 25 knights sitting around a round table. We need to find the probability that if we choose three knights at random, at least two of them were sitting next to each other. Then, once we have that probability as a reduced fraction, we have to add ...	57	1	4,331	6,897	1	1	accept
ec31d1b9eeef	For $\{1, 2, 3, \ldots, n\}$ and each of its nonempty subsets a unique alternating sum is defined as follows. Arrange the numbers in the subset in decreasing order and then, beginning with the largest, alternately add and subtract succesive numbers. For example, the alternating sum for $\{1, 2, 3, 6,9\}$ is $9-6+3-2+1=...	For $\{1, 2, 3, \ldots, n\}$ and each of its nonempty subsets a unique alternating sum is defined as follows. Arrange the numbers in the subset in decreasing order and then, beginning with the largest, alternately add and subtract succesive numbers. For example, the alternating sum for $\{1, 2, 3, 6,9\}$ is $9-6+3-2+1=...	448	<think> Okay, so I need to find the sum of all alternating sums for the set {1, 2, 3, ..., 7}. Hmm, let me start by understanding the problem again. For each nonempty subset of this set, we arrange the numbers in decreasing order and then compute the alternating sum by subtracting and adding alternately starting with t...	448	1	2,814	4,772	1	1	accept
4abe5c43a215	Mary told John her score on the American High School Mathematics Examination (AHSME), which was over $80$ . From this, John was able to determine the number of problems Mary solved correctly. If Mary's score had been any lower, but still over $80$ , John could not have determined this. What was Mary's score? (Recall th...	Mary told John her score on the American High School Mathematics Examination (AHSME), which was over $80$ . From this, John was able to determine the number of problems Mary solved correctly. If Mary's score had been any lower, but still over $80$ , John could not have determined this. What was Mary's score? (Recall th...	119	<think> Okay, let's see. Mary told John her AHSME score, which was over 80. From that score, John could determine the number of problems he solved correctly. But if the score had been any lower. but still over 80, John wouldn't have been able to figure it out. We need to find Mary's actual score. First, let me recall ...	119	1	5,186	10,994	1	1	accept
e80004535e1d	A gardener plants three maple trees, four oaks, and five birch trees in a row. He plants them in random order, each arrangement being equally likely. Let $\frac m n$ in lowest terms be the probability that no two birch trees are next to one another. Find $m+n$ . Think briefly about the approach, then provide your fin...	A gardener plants three maple trees, four oaks, and five birch trees in a row. He plants them in random order, each arrangement being equally likely. Let $\frac m n$ in lowest terms be the probability that no two birch trees are next to one another. Find $m+n$ . Think briefly about the approach, then provide your fin...	106	<think> Okay, so the problem is about a gardener planting trees in a row, and we need to find the probability that no two birch trees are next to each other. The trees are three maples, four oaks, and five birches, making a total of 3 + 4 + 5 = 12 trees. They’re arranged randomly, and each arrangement is equally likely...	106	1	4,291	8,647	1	1	accept
9baa9145fad7	Let $A$ , $B$ , $C$ and $D$ be the vertices of a regular tetrahedron, each of whose edges measures $1$ meter. A bug, starting from vertex $A$ , observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to...	Let $A$ , $B$ , $C$ and $D$ be the vertices of a regular tetrahedron, each of whose edges measures $1$ meter. A bug, starting from vertex $A$ , observes the following rule: at each vertex it chooses one of the three edges meeting at that vertex, each edge being equally likely to be chosen, and crawls along that edge to...	182	<think> Okay, so I have this problem about a bug crawling on a regular tetrahedron. Let me try to understand what's being asked here. The tetrahedron has vertices A, B, C, D, and each edge is 1 meter long. The bug starts at vertex A, and at each vertex, it randomly chooses one of the three edges with equal probability ...	182	1	6,481	12,569	1	1	accept
52d4c0337b5a	In a tournament each player played exactly one game against each of the other players. In each game the winner was awarded 1 point, the loser got 0 points, and each of the two players earned $\frac{1}{2}$ point if the game was a tie. After the completion of the tournament, it was found that exactly half of the points e...	In a tournament each player played exactly one game against each of the other players. In each game the winner was awarded 1 point, the loser got 0 points, and each of the two players earned $\frac{1}{2}$ point if the game was a tie. After the completion of the tournament, it was found that exactly half of the points e...	25	<think> Okay, let me try to work through this problem step by step. Hmm, so we have a tournament where each player plays exactly one game against each other player. The scoring is straightforward: 1 point for a win, 0 for a loss, and ½ each if it's a tie. The key point here is that exactly half of the points each playe...	25	1	5,316	8,389	1	1	accept
97e7344bb9b9	The pages of a book are numbered $1_{}^{}$ through $n_{}^{}$ . When the page numbers of the book were added, one of the page numbers was mistakenly added twice, resulting in an incorrect sum of $1986_{}^{}$ . What was the number of the page that was added twice? Think briefly about the approach, then provide your fina...	The pages of a book are numbered $1_{}^{}$ through $n_{}^{}$ . When the page numbers of the book were added, one of the page numbers was mistakenly added twice, resulting in an incorrect sum of $1986_{}^{}$ . What was the number of the page that was added twice? Think briefly about the approach, then provide your fina...	33	<think> Okay, let's see. The problem is about a book with pages numbered from 1 to n. When someone added up all the page numbers, they accidentally added one of the pages twice, and the total they got was 1986. We need to find out which page was added twice. Hmm, first, I remember that the sum of the first n natural n...	33	1	2,915	5,318	1	1	accept
d7c993b75cd2	"In a parlor game, the magician asks one of the participants to think of a three digit number $(abc)(...TRUNCATED)	"In a parlor game, the magician asks one of the participants to think of a three digit number $(abc)(...TRUNCATED)	358	"<think>\nOkay, let's see. I need to figure out the original three-digit number abc (where a, b, c a(...TRUNCATED)	358	1	3,902	6,877	1	1	accept
3e59a64752f8	"In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately fol(...TRUNCATED)	"In a sequence of coin tosses, one can keep a record of instances in which a tail is immediately fol(...TRUNCATED)	560	"<think>\nOkay, so I need to figure out how many different sequences of 15 coin tosses will have exa(...TRUNCATED)	560	1	15,411	21,188	1	1	accept
c5d028cd4ffb	"Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, (...TRUNCATED)	"Al walks down to the bottom of an escalator that is moving up and he counts 150 steps. His friend, (...TRUNCATED)	120	"<think>\nOkay, let's see. I need to figure out how many steps are visible on the escalator at a giv(...TRUNCATED)	120	1	2,633	4,296	1	1	accept

End of preview. Expand in Data Studio

AIME 2024-2026 router: quality-estimation data

Accept/route labels for a two-tier LLM cascade on AIME. Each row is one VibeThinker-1.5B answer to one AIME problem, labelled by whether that answer was correct.

Built for CRE-Router, where a quality estimator reads an efficient model's output and decides whether to escalate the query to a stronger model.

Splits

Split	Rows	Problems	Runs	Accept	Route	Accuracy
`train_vibethinker`	4,605	921 (AIME 1983-2023)	5	3,968	637	0.862
`test_vibethinker`	450	90 (AIME 2024-2026)	5	333	117	0.740

No problem appears in both splits. The test split holds 30 problems per year, so accuracy can be read per year: 0.807 for 2024, 0.733 for 2025, 0.680 for 2026.

Label

decision_label is 1 (accept) when VibeThinker-1.5B answered correctly and 0 (route) when it did not. This is pure quality estimation. It does not ask whether a stronger model would have answered the query correctly instead.

Correctness is recomputed from full_output when the dataset is built rather than copied from the generation log, so a change in the answer parser appears as a reported difference instead of a silently different label.

Columns

Column	Meaning
`qid`	Problem id. `<year>-<n>` in the test split, a content hash in train
`run`	Which of the 5 sampled runs this answer came from, 0 to 4
`cluster`	Semantic cluster, 0 to 2, used by the router's first stage
`year`	Competition year, test split only
`question`	Problem statement
`prompt`	Text actually sent to the model
`ground_truth_answer`	Official answer
`full_output`	The model's complete response
`answer`	Answer parsed from `full_output`
`accuracy`, `score`	1 when the parsed answer matches, else 0
`num_words`, `num_tokens`	Length of the response
`decision_label`, `decision_str`	The label, as an integer and as text

Generations

VibeThinker-1.5B, sampled 5 times per problem, served on a single A100 80GB under vLLM 0.19.0 at a maximum concurrency of 32. A problem therefore appears 5 times, with different outputs and sometimes different labels.

Relation to `ymoslem/AIME-router`

The earlier dataset was built from generations served on two A100s, kept one run per problem, and tested on the 30 problems of AIME 2024 alone. This one is rebuilt on the single-card basis the rest of the routing work now reports, keeps all five runs, and tests on three years. Results from the two are not comparable.

Sources and licence

Part	Source	Licence
Train problems	`gneubig/aime-1983-2024`	CC0-1.0
Test 2024	`simplescaling/aime24_nofigures`	Apache-2.0
Test 2025	`simplescaling/aime25_nofigures`	none declared
Test 2026	`MathArena/aime_2026`	CC BY-NC-SA 4.0

Released under CC BY-NC-SA 4.0, the most restrictive of the four. Test problems arrive via ymoslem/AIME-24-25-26-clustered and follow its figure rule: every problem is self-contained.