Dataset Viewer
Auto-converted to Parquet Duplicate
dataset
stringclasses
1 value
id
stringlengths
13
16
metadata
dict
prompt
stringlengths
157
750
source_id
stringlengths
18
21
split
stringclasses
1 value
target_answers
listlengths
1
1
task_type
stringclasses
1 value
verifier
stringclasses
1 value
aime
aime/y1983_13
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1983 #13 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1983_13", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. 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...
aime_2026/y1983_13
heldout
[ "448" ]
math
integer_answer
aime
aime/y1988_07
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1988 #7 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1988_07", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. In triangle $ABC$ , $\tan \angle CAB = 22/7$ , and the altitude from $A$ divides $BC$ into segments of length $3$ and $17$ . What is the area of triangle $ABC$ ?
aime_2026/y1988_07
heldout
[ "110" ]
math
integer_answer
aime
aime/y1988_14
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1988 #14 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1988_14", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $C$ be the graph of $xy = 1$ , and denote by $C^*$ the reflection of $C$ in the line $y = 2x$ . Let the equation of $C^*$ be written in the form \[12x^2 + bxy + cy^2 + d = 0.\] Find the product $b...
aime_2026/y1988_14
heldout
[ "84" ]
math
integer_answer
aime
aime/y1989_01
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1989 #1 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1989_01", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Compute $\sqrt{(31)(30)(29)(28)+1}$ .
aime_2026/y1989_01
heldout
[ "869" ]
math
integer_answer
aime
aime/y1989_11
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1989 #11 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1989_11", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. A sample of 121 integers is given, each between 1 and 1000 inclusive, with repetitions allowed. The sample has a unique mode (most frequent value). Let $D^{}_{}$ be the difference between the mode and...
aime_2026/y1989_11
heldout
[ "947" ]
math
integer_answer
aime
aime/y1990_07
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1990 #7 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1990_07", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. A triangle has vertices $P_{}^{}=(-8,5)$ , $Q_{}^{}=(-15,-19)$ , and $R_{}^{}=(1,-7)$ . The equation of the bisector of $\angle P$ can be written in the form $ax+2y+c=0_{}^{}$ . Find $a+c_{}^{}$ .
aime_2026/y1990_07
heldout
[ "89" ]
math
integer_answer
aime
aime/y1993_12
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1993 #12 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1993_12", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. The vertices of $\triangle ABC$ are $A = (0,0)\,$ , $B = (0,420)\,$ , and $C = (560,0)\,$ . The six faces of a die are labeled with two $A\,$ 's, two $B\,$ 's, and two $C\,$ 's. Point $P_1 = (k,m)\,...
aime_2026/y1993_12
heldout
[ "344" ]
math
integer_answer
aime
aime/y1994_09
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1994 #9 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1994_09", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tile...
aime_2026/y1994_09
heldout
[ "394" ]
math
integer_answer
aime
aime/y1994_15
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1994 #15 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1994_15", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Given a point $P^{}_{}$ on a triangular piece of paper $ABC,\,$ consider the creases that are formed in the paper when $A, B,\,$ and $C\,$ are folded onto $P.\,$ Let us call $P_{}^{}$ a fold point of ...
aime_2026/y1994_15
heldout
[ "597" ]
math
integer_answer
aime
aime/y1999_02
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 1999 #2 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y1999_02", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Consider the parallelogram with vertices $(10,45),$ $(10,114),$ $(28,153),$ and $(28,84).$ A line through the origin cuts this figure into two congruent polygons. The slope of the line is $m/n,$ wher...
aime_2026/y1999_02
heldout
[ "118" ]
math
integer_answer
aime
aime/y2000_I_05
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2000 I #5 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2000_I_05", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Each of two boxes contains both black and white marbles, and the total number of marbles in the two boxes is $25.$ One marble is taken out of each box randomly. The probability that both marbles are b...
aime_2026/y2000_I_05
heldout
[ "26" ]
math
integer_answer
aime
aime/y2001_II_14
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2001 II #14 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2001_II_14", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. There are $2n$ complex numbers that satisfy both $z^{28} - z^{8} - 1 = 0$ and $|z| = 1$ . These numbers have the form $z_{m} = \cos\theta_{m} + i\sin\theta_{m}$ , where $0\leq\theta_{1} < \theta_{2} <...
aime_2026/y2001_II_14
heldout
[ "840" ]
math
integer_answer
aime
aime/y2002_I_12
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2002 I #12 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2002_I_12", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $F(z)=\frac{z+i}{z-i}$ for all complex numbers $z\not= i$ , and let $z_n=F(z_{n-1})$ for all positive integers $n$ . Given that $z_0=\frac 1{137}+i$ and $z_{2002}=a+bi$ , where $a$ and $b$ are rea...
aime_2026/y2002_I_12
heldout
[ "275" ]
math
integer_answer
aime
aime/y2005_I_01
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2005 I #1 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2005_I_01", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Six congruent circles form a ring with each circle externally tangent to two circles adjacent to it. All circles are internally tangent to a circle $C$ with radius 30. Let $K$ be the area of the regio...
aime_2026/y2005_I_01
heldout
[ "942" ]
math
integer_answer
aime
aime/y2005_I_08
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2005 I #8 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2005_I_08", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. The equation $2^{333x-2} + 2^{111x+2} = 2^{222x+1} + 1$ has three real roots. Given that their sum is $\frac mn$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$
aime_2026/y2005_I_08
heldout
[ "113" ]
math
integer_answer
aime
aime/y2007_I_05
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2007 I #5 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2007_I_05", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. The formula for converting a Fahrenheit temperature $F$ to the corresponding Celsius temperature $C$ is $C = \frac{5}{9}(F-32).$ An integer Fahrenheit temperature is converted to Celsius, rounded to t...
aime_2026/y2007_I_05
heldout
[ "539" ]
math
integer_answer
aime
aime/y2008_II_08
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2008 II #8 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2008_II_08", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $a = \pi/2008$ . Find the smallest positive integer $n$ such that \[2[\cos(a)\sin(a) + \cos(4a)\sin(2a) + \cos(9a)\sin(3a) + \cdots + \cos(n^2a)\sin(na)]\] is an integer.
aime_2026/y2008_II_08
heldout
[ "251" ]
math
integer_answer
aime
aime/y2008_I_07
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2008 I #7 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2008_I_07", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $S_i$ be the set of all integers $n$ such that $100i\leq n < 100(i + 1)$ . For example, $S_4$ is the set ${400,401,402,\ldots,499}$ . How many of the sets $S_0, S_1, S_2, \ldots, S_{999}$ do not...
aime_2026/y2008_I_07
heldout
[ "708" ]
math
integer_answer
aime
aime/y2012_II_06
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2012 II #6 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2012_II_06", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $z=a+bi$ be the complex number with $\vert z \vert = 5$ and $b > 0$ such that the distance between $(1+2i)z^3$ and $z^5$ is maximized, and let $z^4 = c+di$ . Find $c+d$ .
aime_2026/y2012_II_06
heldout
[ "125" ]
math
integer_answer
aime
aime/y2015_I_11
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2015 I #11 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2015_I_11", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Triangle $ABC$ has positive integer side lengths with $AB=AC$ . Let $I$ be the intersection of the bisectors of $\angle B$ and $\angle C$ . Suppose $BI=8$ . Find the smallest possible perimeter of $\t...
aime_2026/y2015_I_11
heldout
[ "108" ]
math
integer_answer
aime
aime/y2016_II_01
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2016 II #1 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2016_II_01", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Initially Alex, Betty, and Charlie had a total of $444$ peanuts. Charlie had the most peanuts, and Alex had the least. The three numbers of peanuts that each person had formed a geometric progression....
aime_2026/y2016_II_01
heldout
[ "108" ]
math
integer_answer
aime
aime/y2016_II_11
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2016 II #11 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2016_II_11", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. For positive integers $N$ and $k$ , define $N$ to be $k$ -nice if there exists a positive integer $a$ such that $a^{k}$ has exactly $N$ positive divisors. Find the number of positive integers less tha...
aime_2026/y2016_II_11
heldout
[ "749" ]
math
integer_answer
aime
aime/y2018_I_15
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2018 I #15 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2018_I_15", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. David found four sticks of different lengths that can be used to form three non-congruent convex cyclic quadrilaterals, $A,\text{ }B,\text{ }C$ , which can each be inscribed in a circle with radius $1...
aime_2026/y2018_I_15
heldout
[ "59" ]
math
integer_answer
aime
aime/y2019_II_09
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2019 II #9 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2019_II_09", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Call a positive integer $n$ $k$ - pretty if $n$ has exactly $k$ positive divisors and $n$ is divisible by $k$ . For example, $18$ is $6$ -pretty. Let $S$ be the sum of the positive integers less than ...
aime_2026/y2019_II_09
heldout
[ "472" ]
math
integer_answer
aime
aime/y2019_I_13
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2019 I #13 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2019_I_13", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Triangle $ABC$ has side lengths $AB=4$ , $BC=5$ , and $CA=6$ . Points $D$ and $E$ are on ray $AB$ with $AB<AD<AE$ . The point $F \neq C$ is a point of intersection of the circumcircles of $\triangle A...
aime_2026/y2019_I_13
heldout
[ "32" ]
math
integer_answer
aime
aime/y2020_II_08
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2020 II #8 (di-zhang-fdu/AIME_1983_2024)", "origin_task_id": "aime_2026/y2020_II_08", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Define a sequence recursively by $f_1(x)=|x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n>1$ . Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500,000$ .
aime_2026/y2020_II_08
heldout
[ "101" ]
math
integer_answer
aime
aime/y2022_II_11
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2022 II #11 (AI-MO/aimo-validation-aime)", "origin_task_id": "aime_2026/y2022_II_11", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $ABCD$ be a convex quadrilateral with $AB=2, AD=7,$ and $CD=3$ such that the bisectors of acute angles $\angle{DAB}$ and $\angle{ADC}$ intersect at the midpoint of $\overline{BC}.$ Find the square...
aime_2026/y2022_II_11
heldout
[ "180" ]
math
integer_answer
aime
aime/y2022_II_12
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2022 II #12 (AI-MO/aimo-validation-aime)", "origin_task_id": "aime_2026/y2022_II_12", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $a, b, x,$ and $y$ be real numbers with $a>4$ and $b>1$ such that\[\frac{x^2}{a^2}+\frac{y^2}{a^2-16}=\frac{(x-20)^2}{b^2-1}+\frac{(y-11)^2}{b^2}=1.\]Find the least possible value of $a+b.$
aime_2026/y2022_II_12
heldout
[ "23" ]
math
integer_answer
aime
aime/y2022_I_04
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2022 I #4 (AI-MO/aimo-validation-aime)", "origin_task_id": "aime_2026/y2022_I_04", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Let $w = \dfrac{\sqrt{3} + i}{2}$ and $z = \dfrac{-1 + i\sqrt{3}}{2},$ where $i = \sqrt{-1}.$ Find the number of ordered pairs $(r,s)$ of positive integers not exceeding $100$ that satisfy the equatio...
aime_2026/y2022_I_04
heldout
[ "834" ]
math
integer_answer
aime
aime/y2023_I_01
{ "dataset": "aime", "origin_kind": "aime_2026", "origin_source": "AIME 2023 I #1 (AI-MO/aimo-validation-aime)", "origin_task_id": "aime_2026/y2023_I_01", "task_type": "math", "verifier": "integer_answer" }
Solve the following competition math problem. The answer is an integer from 0 to 999. Put the final answer in \boxed{}. Five men and nine women stand equally spaced around a circle in random order. The probability that every man stands diametrically opposite a woman is $\frac{m}{n},$ where $m$ and $n$ are relatively pr...
aime_2026/y2023_I_01
heldout
[ "191" ]
math
integer_answer

R²Orch Dataset

Training pool, held-out set and test sets of R²Orch: Recursive Self-Improvement for Agent Orchestration via Self-Play within a Skill-Internalization Loop.

Paper: arXiv:2610.22740 · Hugging Face paper page · Code: github.com/beita6969/R2Orch

Six in-distribution (IID) benchmarks supply the training tasks, a held-out set for the training curves and the IID test sets. Six out-of-distribution (OOD) benchmarks are used for testing only; each is posed as one IID task type. Every test set has 128 tasks (AIME 2026: all 30 problems). The training pool, the held-out set and the test sets share no task (see Disjointness).

Benchmark Role Training Held-out Test Test source Metric
HotpotQA IID 1,248 32 128 distractor validation Ans EM
NQ-Open IID 1,248 32 128 validation Ans EM
MedQA (USMLE, 4 options) IID 1,248 32 128 test Acc.
AIME IID 947 (AIME 1983–2025) 30 30 AIME 2026, all problems Acc.
MBPP+ IID 215 32 128 128 of the 378 problems Pass@1
ALFWorld IID 1,248 games from train 32 128 valid_unseen SR
TriviaQA OOD – – 128 rc.nocontext validation Ans EM
MuSiQue OOD – – 128 MuSiQue-Ans v1.0 dev Ans EM
GPQA OOD – – 128 (IDs only) Diamond Acc.
MATH-Hard OOD – – 128 MATH test, level 5 Acc.
SWE-Bench Verified OOD – – 128 128 of the 500 instances Resolved
WebShop OOD – – 128 official human-goal test range (0–499) SR

Files

  • data/train_pool.jsonl — the full training pool (6,154 rows) exactly as read by the training code. The same rows, split by benchmark, are in data/train/<dataset>.jsonl (configs train_*).
  • data/heldout/<dataset>.jsonl — the held-out set of the training curves (configs heldout_*).
  • data/test/iid/<dataset>.jsonl — IID test sets (configs iid_*).
  • data/test/ood/<benchmark>.jsonl — OOD test sets (configs ood_*).
  • data/test/ood/gpqa_diamond.ids.json — GPQA Record IDs and option-order seeds (see below).
  • data/test/ood/SOURCES.json — pinned raw sources (URL revision and sha256) of every OOD set.
  • scripts/build_ood.py — regenerates every OOD file from the pinned public sources.

Rows

IID rows (train, heldout, iid): id, source_id, dataset, split, task_type, verifier, prompt, target_answers (MBPP+: reference with the tests; ALFWorld: the goal text, the game file is in metadata.game_path relative to alfworld/json_2.1.1) and metadata. Training rows also carry the ADS curriculum fields computed with the base model: ads_sample_id, embedding (128 PCA features), cluster_id (16 k-means clusters per benchmark), difficulty_score (mean target-token NLL, normalized), rank_in_cluster, cluster_size.

OOD rows: kind (the benchmark), posed_as (the IID dataset it is posed as), task_id, source_id, split, origin, prompt and answer / answers.

Training pool

  • The candidates of a benchmark are ranked by a fixed sha256 of the task id and the first 1,280 are kept. AIME (977 problems with the held-out) and MBPP+ (247 with the held-out) have fewer usable problems and keep all of them, each once.
  • Removed before ranking: every item whose question text equals a test item of the same task type (IID or OOD); the MBPP+ problems whose task statement matches an IID test problem up to numbers (MBPP 71 and 762); the three AIME problems that reappear in the MATH-Hard test set (2003 II #9, 2005 I #2, 2013 I #14); answers that are empty or contain a line break.
  • AIME problems come from di-zhang-fdu/AIME_1983_2024, AI-MO/aimo-validation-aime (2022–2024) and MathArena/aime_2025. Public collections lack about 55 of the 1,035 problems of 1983–2025, mostly ones that depend on a figure.
  • The held-out set takes 32 tasks per benchmark (AIME: 30 problems of earlier years) from these tasks, the ones with the smallest sha256 of heldout:<dataset>:<source_id>; the training pool keeps the rest.

Test sets

IID test sets: HotpotQA distractor validation, NQ-Open validation, MedQA test, AIME 2026 (all 30 problems, MathArena/aime_2026), 128 of the 378 MBPP+ problems and ALFWorld valid_unseen games, each by a fixed sha256 ranking. OOD test sets keep the first 128 candidates by ascending sha256 of test:<benchmark>:<source id>.

  • GPQA questions are not redistributed. gpqa_diamond.ids.json lists the 128 Record IDs and the seeds of their option order. Accept the terms of Idavidrein/gpqa, download gpqa_diamond.csv, and run python scripts/build_ood.py gpqa --csv gpqa_diamond.csv --ids data/test/ood/gpqa_diamond.ids.json --out gpqa_diamond.jsonl.
  • SWE-Bench Verified rows identify the instance (source_id = instance_id, repo, base_commit); score them with the official harness.
  • WebShop rows identify official human goals (goal_index after the official random.seed(233) shuffle of the 12,087 human goals, plus asin and the instruction); score them in the WebShop environment.
  • Ans EM uses SQuAD-style normalization and the maximum over the reference aliases (answers). MATH-Hard answers are LaTeX expressions and need an equivalence checker.

Disjointness

Every held-out and test task was compared with every training task of any task type, and every test task with every held-out task, on the normalized question text (exact match, and near-duplicates by 5-word-shingle containment of at least 0.9) and, for ALFWorld, on the game file. No exact, near-duplicate or game overlap was found. Three MBPP+ test problems with a similar template (for example the volume of a sphere and of a cone) were reviewed and are different problems.

Licenses

Each subset keeps the license and terms of its source dataset; see the pinned sources in data/test/ood/SOURCES.json and scripts/build_ood.py. GPQA text is not included.

Downloads last month
108

Paper for beita6969/R2Orch-Dataset