Dataset Preview
Duplicate
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed
Error code:   DatasetGenerationError
Exception:    CastError
Message:      Couldn't cast
pass@1: double
pass@1_ci95: list<item: double>
  child 0, item: double
pass@1_sd_boot: double
pass@1_by_rollout_index: list<item: double>
  child 0, item: double
pass@1_sd_rollouts: double
pass@8: double
pass@8_ci95: list<item: double>
  child 0, item: double
pass@8_sd_boot: double
pass@16: double
pass@16_ci95: list<item: double>
  child 0, item: double
pass@16_sd_boot: double
cap_rate: double
n_problems: int64
n_rollouts: int64
rollouts_per_problem: int64
max_tokens_used: list<item: int64>
  child 0, item: int64
prompt_style: list<item: null>
  child 0, item: null
median_output_tokens: int64
mean_output_tokens: double
expected_problems: int64
complete: bool
files: list<item: string>
  child 0, item: string
per_problem: struct<aime2024_0: struct<rollout_index: list<item: int64>, correct: list<item: int64>, tokens: list (... 8176 chars omitted)
  child 0, aime2024_0: struct<rollout_index: list<item: int64>, correct: list<item: int64>, tokens: list<item: int64>, answ (... 161 chars omitted)
      child 0, rollout_index: list<item: int64>
          child 0, item: int64
      child 1, correct: list<item: int64>
          child 0, item: int64
      child 2, tokens: list<item: int64>
          child 0, item: int64
      child 3, answer: list<item: string>
          child 0, item: string
      child 4, hit_cap: list<item: int64>
          child 0, item: int64
      child 5, answer_end_frac: list<item: double>
          child 0, item: double
      child 6, answer_marker: list<item: s
...
 child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
  child 27, 28: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
      child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
  child 28, 29: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
      child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
  child 29, 30: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
      child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
  child 30, 31: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
      child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
  child 31, 32: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
      child 0, k: int64
      child 1, expected_tokens: double
      child 2, pass_at_k: double
      child 3, majority_at_k: double
aggregate_by_k_doc: string
completion: string
steer: string
problem_key: string
rollout_index: int64
correct: bool
output_tokens: int64
committed: bool
finish_reason: string
label: string
hit_token_cap: bool
to
{'problem_key': Value('string'), 'rollout_index': Value('int64'), 'arm': Value('string'), 'steer': Value('string'), 'label': Value('string'), 'committed': Value('bool'), 'correct': Value('bool'), 'hit_token_cap': Value('bool'), 'finish_reason': Value('string'), 'output_tokens': Value('int64'), 'max_tokens_used': Value('int64'), 'completion': Value('string')}
because column names don't match
Traceback:    Traceback (most recent call last):
                File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1827, in _prepare_split_single
                  for key, table in generator:
                                    ^^^^^^^^^
                File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 613, in wrapped
                  for item in generator(*args, **kwargs):
                              ~~~~~~~~~^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 343, in _generate_tables
                  self._cast_table(pa_table, json_field_paths=json_field_paths),
                  ~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 132, in _cast_table
                  pa_table = table_cast(pa_table, self.info.features.arrow_schema)
                File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2378, in table_cast
                  return cast_table_to_schema(table, schema)
                File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2306, in cast_table_to_schema
                  raise CastError(
                  ...<3 lines>...
                  )
              datasets.table.CastError: Couldn't cast
              pass@1: double
              pass@1_ci95: list<item: double>
                child 0, item: double
              pass@1_sd_boot: double
              pass@1_by_rollout_index: list<item: double>
                child 0, item: double
              pass@1_sd_rollouts: double
              pass@8: double
              pass@8_ci95: list<item: double>
                child 0, item: double
              pass@8_sd_boot: double
              pass@16: double
              pass@16_ci95: list<item: double>
                child 0, item: double
              pass@16_sd_boot: double
              cap_rate: double
              n_problems: int64
              n_rollouts: int64
              rollouts_per_problem: int64
              max_tokens_used: list<item: int64>
                child 0, item: int64
              prompt_style: list<item: null>
                child 0, item: null
              median_output_tokens: int64
              mean_output_tokens: double
              expected_problems: int64
              complete: bool
              files: list<item: string>
                child 0, item: string
              per_problem: struct<aime2024_0: struct<rollout_index: list<item: int64>, correct: list<item: int64>, tokens: list (... 8176 chars omitted)
                child 0, aime2024_0: struct<rollout_index: list<item: int64>, correct: list<item: int64>, tokens: list<item: int64>, answ (... 161 chars omitted)
                    child 0, rollout_index: list<item: int64>
                        child 0, item: int64
                    child 1, correct: list<item: int64>
                        child 0, item: int64
                    child 2, tokens: list<item: int64>
                        child 0, item: int64
                    child 3, answer: list<item: string>
                        child 0, item: string
                    child 4, hit_cap: list<item: int64>
                        child 0, item: int64
                    child 5, answer_end_frac: list<item: double>
                        child 0, item: double
                    child 6, answer_marker: list<item: s
              ...
               child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
                child 27, 28: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
                    child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
                child 28, 29: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
                    child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
                child 29, 30: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
                    child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
                child 30, 31: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
                    child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
                child 31, 32: struct<k: int64, expected_tokens: double, pass_at_k: double, majority_at_k: double>
                    child 0, k: int64
                    child 1, expected_tokens: double
                    child 2, pass_at_k: double
                    child 3, majority_at_k: double
              aggregate_by_k_doc: string
              completion: string
              steer: string
              problem_key: string
              rollout_index: int64
              correct: bool
              output_tokens: int64
              committed: bool
              finish_reason: string
              label: string
              hit_token_cap: bool
              to
              {'problem_key': Value('string'), 'rollout_index': Value('int64'), 'arm': Value('string'), 'steer': Value('string'), 'label': Value('string'), 'committed': Value('bool'), 'correct': Value('bool'), 'hit_token_cap': Value('bool'), 'finish_reason': Value('string'), 'output_tokens': Value('int64'), 'max_tokens_used': Value('int64'), 'completion': Value('string')}
              because column names don't match
              
              The above exception was the direct cause of the following exception:
              
              Traceback (most recent call last):
                File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1369, in compute_config_parquet_and_info_response
                  parquet_operations, partial, estimated_dataset_info = stream_convert_to_parquet(
                                                                        ~~~~~~~~~~~~~~~~~~~~~~~~~^
                      builder, max_dataset_size_bytes=max_dataset_size_bytes
                      ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                  )
                  ^
                File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 948, in stream_convert_to_parquet
                  builder._prepare_split(split_generator=splits_generators[split], file_format="parquet")
                  ~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1694, in _prepare_split
                  for job_id, done, content in self._prepare_split_single(
                                               ~~~~~~~~~~~~~~~~~~~~~~~~~~^
                      gen_kwargs=gen_kwargs, job_id=job_id, **_prepare_split_args
                      ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                  ):
                  ^
                File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1880, in _prepare_split_single
                  raise DatasetGenerationError("An error occurred while generating the dataset") from e
              datasets.exceptions.DatasetGenerationError: An error occurred while generating the dataset

Need help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.

problem_key
string
rollout_index
int64
arm
string
steer
string
label
string
committed
bool
correct
bool
hit_token_cap
bool
finish_reason
string
output_tokens
int64
max_tokens_used
int64
completion
string
aime2024_0
0
none
base
run
true
true
false
stop
1,171
31,744
Let's denote the time Aya spends walking at her original speed \( s \) as \( T_1 \) and the time she spends walking at her increased speed \( s+2 \) as \( T_2 \). We know that the total time spent walking and stopping at the coffee shop for both scenarios is 4 hours and 2 hours 24 minutes, respectively. First, we con...
aime2024_0
1
none
base
run
false
false
false
stop
1,193
31,744
To solve this problem, we need to determine the time it takes for Aya to walk 9 kilometers at a speed of \(s + \frac{1}{2}\) kilometers per hour, including the time spent in the coffee shop. Let's break down the problem step by step. 1. **Determine the walking time at the first speed:** - Let \(t\) be the time spe...
aime2024_0
2
none
base
run
true
false
false
stop
901
31,744
To solve this problem, we need to determine the walking speed \( s \) and the time \( t \) spent in the coffee shop. Let's break it down step by step. ### Step 1: Set up the equations We are given two scenarios: 1. **First scenario**: - Walking speed: \( s \) km/h - Time spent walking: 4 hours - Time ...
aime2024_0
3
none
base
run
true
false
false
stop
1,485
31,744
To solve the problem, let's first define the variables and equations based on the given information. Let \( t \) be the time spent in the coffee shop in minutes. The time spent walking at a constant speed \( s \) kilometers per hour is 4 hours minus \( t \) minutes, which is \( 4 - \frac{t}{60} \) hours. Since the wal...
aime2024_0
4
none
base
run
true
true
false
stop
1,129
31,744
To solve this problem, we need to determine the time Aya spends walking and the time she spends in the coffee shop for each scenario. We will then use this information to find the total time for the scenario where she walks at \( s + \frac{1}{2} \) kilometers per hour. First, let's denote the time Aya spends walking ...
aime2024_0
5
none
base
run
true
true
false
stop
1,022
31,744
To solve this problem, we need to determine the value of \( t \) and then use it to find the time it takes Aya to walk 9 kilometers at a speed of \( s + \frac{1}{2} \) kilometers per hour. First, let's express the time taken for the walk in terms of \( s \) and \( t \). When Aya walks at a speed of \( s \) kilometers...
aime2024_0
6
none
base
run
true
false
false
stop
1,157
31,744
To solve this problem, we need to determine the time Aya spends walking and then add the time she spends in the coffee shop. We start by setting up equations based on the information given. 1. **Determine the time spent walking at different speeds:** - When Aya walks at a speed of \( s \) km/h, the walk takes 4 ho...
aime2024_0
7
none
base
run
true
false
false
stop
1,341
31,744
Let's denote the distance of the walk as $D$, the time spent walking as $T_w$, and the time spent in the coffee shop as $T_c = t$ minutes. We know that the total time for the walk, including the coffee shop, is given by: \[T_{\text{total}} = T_w + T_c\] When Aya walks at $s$ km/h, the walk takes 4 hours including $t...
aime2024_0
8
none
base
run
true
false
false
stop
301
31,744
We are given that Aya's walk takes her 4 hours when she walks at a constant speed of $s$ kilometers per hour. Since she walks 9 kilometers, we have $s=\frac{9}{4}$ kilometers per hour. We are also given that the walk takes her 2 hours and 24 minutes when she walks at a speed of $s+2$ kilometers per hour. Since 24 minu...
aime2024_0
9
none
base
run
false
false
false
stop
19,901
31,744
Let's break down the problem step by step. ### Step 1: Understand the given information 1. **First Scenario:** - Speed: \( s \) km/h - Time spent walking: 4 hours - Time spent in the coffee shop: \( t \) minutes - Total time: 4 hours + \( t \) minutes 2. **Second Scenario:** - Speed: \( s + 2 \) km/h ...
aime2024_0
10
none
base
run
true
true
false
stop
1,358
31,744
Let's break down the problem step by step. ### Step 1: Understand the given information - **First scenario**: - Speed: \( s \) km/h - Time: 4 hours (including \( t \) minutes in the coffee shop) - Distance walked: 9 km - **Second scenario**: - Speed: \( s + 2 \) km/h - Time: 2 hours and 24 minu...
aime2024_0
11
none
base
run
true
true
false
stop
1,043
31,744
To solve this problem, we need to determine the time it takes for Aya to walk 9 kilometers at a speed of \( s + \frac{1}{2} \) kilometers per hour, including the time spent in the coffee shop. First, let's find the value of \( s \) and \( t \) from the given information. ### Step 1: Determine \( s \) and \( t \) 1....
aime2024_0
12
none
base
run
true
false
false
stop
1,307
31,744
To solve this problem, we need to determine the time it takes Aya to walk 9 kilometers at a speed of \( s + \frac{1}{2} \) kilometers per hour, including the time spent in the coffee shop. We start by setting up equations based on the information given. First, let's denote the time spent in the coffee shop as \( t \)...
aime2024_0
13
none
base
run
true
true
false
stop
1,187
31,744
To solve this problem, we need to determine the value of \( t \) (the time spent in the coffee shop) and then use it to find out how long the walk takes when Aya walks at a speed of \( s + \frac{1}{2} \) kilometers per hour. First, let's set up the equations based on the information given: 1. When Aya walks at a spe...
aime2024_0
14
none
base
run
true
true
false
stop
1,123
31,744
Let's denote the total time Aya spends walking and in the coffee shop as \( T \) minutes. We know that when she walks at a speed of \( s \) km/h, the walk takes her 4 hours, including \( t \) minutes in the coffee shop. Similarly, when she walks at a speed of \( s+2 \) km/h, the walk takes her 2 hours and 24 minutes, ...
aime2024_0
15
none
base
run
true
false
false
stop
388
31,744
We have two equations: $$\frac{9}{s} + \frac{t}{60} = 4 \quad \text{and} \quad \frac{9}{s+2} + \frac{t}{60} = 2.24$$ Subtracting the second equation from the first equation, we get: $$\frac{9}{s} - \frac{9}{s+2} = 1.76$$ Multiplying both sides by $s(s+2)$, we get: $$9(s+2) - 9s = 1.76s(s+2)$$ Simplifying, we get: $$18...
aime2024_1
0
none
base
run
true
false
false
stop
754
31,744
To solve the problem, we will use properties of cyclic quadrilaterals, power of a point, and the intersecting chords theorem. Let's start by noting that $D$ is the intersection of the tangents to the circumcircle $\omega$ at points $B$ and $C$. This means that $D$ is the excenter of the triangle $ABC$ opposite to $A$,...
aime2024_1
1
none
base
run
false
false
true
length
31,744
31,744
To solve this problem, we will use properties of cyclic quadrilaterals, the Power of a Point theorem, and the Angle Bisector Theorem. Let's proceed step by step. 1. **Identify Key Points and Properties:** - \(D\) is the intersection of the tangents to \(\omega\) at \(B\) and \(C\), so \(DB = DC\) and \(\angle BDC ...
aime2024_1
2
none
base
run
true
false
false
stop
712
31,744
We begin by using the Angle Bisector Theorem to find that $\frac{AB}{AP} = \frac{BP}{PC}$, which implies that $\frac{5}{AP} = \frac{9}{10 - AP}$. Solving for $AP$, we find that $AP = \frac{45}{14}$, so $m + n = 45 + 14 = \boxed{59}$. The solution provided in the problem statement contains an error in the application o...
aime2024_1
3
none
base
run
true
false
false
stop
1,069
31,744
To solve for \( AP \) in the given problem, we will use properties of cyclic quadrilaterals and the power of a point theorem. Here is the step-by-step reasoning: 1. **Identify Key Points and Properties:** - \( D \) is the intersection of the tangents to the circle \( \omega \) at points \( B \) and \( C \). - \...
aime2024_1
4
none
base
run
true
false
false
stop
639
31,744
To solve the problem, we will use the properties of the tangents to a circle and the power of a point theorem. 1. **Identify the given values and properties:** - \(AB = 5\) - \(BC = 9\) - \(AC = 10\) - \(D\) is the intersection of the tangents to \(\omega\) at \(B\) and \(C\). - \(P\) is the intersecti...
aime2024_1
5
none
base
run
true
false
false
stop
683
31,744
We will use the following diagram: [asy] unitsize(0.8 cm); pair A, B, C, D, P; A = (0,0); B = (5,0); C = (1,4); P = (1.5,3.6); D = extension(B, B + rotate(90)*(B - C), C, C + rotate(90)*(C - B)); draw(A--B--C--cycle); draw(circle((1.4,2),2.3)); draw(A--D); draw(B--D); draw(C--D); label("$A$", A, SW); label("$B$", ...
aime2024_1
6
none
base
run
true
false
false
stop
84
31,744
Let $I$ be the intersection of $AD$ and $BC$. Since $ABCD$ is harmonic, we have $AI \cdot AD = AP \cdot AB = 5AP$. Also, $AP \cdot AB = AI \cdot AD = 20$. Therefore, $AP = \frac{4}{1}$. Thus, $m + n = \boxed{5}$.
aime2024_1
7
none
base
run
true
false
false
stop
1,159
31,744
To solve the problem, we will use properties of cyclic quadrilaterals and power of a point theorem. Here's the step-by-step reasoning: 1. **Identify Key Points and Relationships:** - \(ABC\) is a triangle inscribed in circle \(\omega\). - Tangents to \(\omega\) at \(B\) and \(C\) intersect at \(D\). - Line \...
aime2024_1
8
none
base
run
true
false
false
stop
522
31,744
Let $E$ and $F$ be the midpoints of $AB$ and $AC$, respectively. Then $DE$ and $DF$ are perpendicular bisectors of $AB$ and $AC$, respectively. Therefore, $DE$ and $DF$ intersect at the circumcenter $O$ of triangle $ABC$. Since $D$ is the intersection of the tangents to $\omega$ at $B$ and $C$, we have $\angle BDC = \...
aime2024_1
9
none
base
run
true
false
false
stop
599
31,744
Step 1: Find the area of triangle $ABC$ using Heron's formula. We first find the semiperimeter $s$ of triangle $ABC$: $$s = \frac{AB + BC + AC}{2} = \frac{5 + 9 + 10}{2} = 12$$ Now we can use Heron's formula to find the area of triangle $ABC$: $$[ABC] = \sqrt{s(s-AB)(s-BC)(s-AC)} = \sqrt{12(12-5)(12-9)(12-10)} = 24$$ ...
aime2024_1
10
none
base
run
true
false
false
stop
926
31,744
To solve this problem, we will use the properties of cyclic quadrilaterals and the power of a point theorem. 1. **Identify the given values and setup the problem:** - We are given a triangle \(ABC\) with sides \(AB = 5\), \(BC = 9\), and \(AC = 10\). - The tangents to the circumcircle \(\omega\) at points \(B\)...
aime2024_1
11
none
base
run
true
false
false
stop
436
31,744
Step 1: Use Power of a Point theorem to find $AP$. Since $AD$ is tangent to $\omega$ at $D$, we have $AD^2 = AP \cdot AC$. By Power of a Point theorem, we have $AD^2 = AB \cdot AC = 5 \cdot 10 = 50$. Therefore, $AP \cdot AC = 50$. Step 2: Use the Law of Cosines to find $\cos A$. Using the Law of Cosines, we have $\c...
aime2024_1
12
none
base
run
true
false
false
stop
182
31,744
Let $E$ be the midpoint of $\overline{BC}$. By the Power of a Point Theorem, we have that \begin{align*} AD \cdot AP &= AB \cdot AC \\ AD \cdot AP &= 5 \cdot 10 \\ AD \cdot AP &= 50. \end{align*}By the Power of a Point Theorem, we have that \begin{align*} AD \cdot AP &= AE^2 \\ AD \cdot AP &= (BE + EC)^2 \\ AD \cdot A...
aime2024_1
13
none
base
run
true
false
false
stop
1,101
31,744
By Power of a Point, we have \[ AD \cdot AP = AB \cdot AC = 5 \cdot 10 = 50. \]To find $AP$, we need to find $AD$. By the Power of a Point theorem, we have \[ AD^2 = AB \cdot AC = 5 \cdot 10 = 50. \]Therefore, $AD = \sqrt{50} = 5\sqrt{2}$. Since $AP = AD - PD$, we have \[ AP = AD - PD = 5\sqrt{2} - \frac{AB \cdot AC}{...
End of preview.

rollouts-qwen4b — evaluation rollouts

Model: Qwen/Qwen3-4B-Base. Tokenizer used for answer positions: Qwen/Qwen3-4B-Base. Protocol: 32 rollouts per problem (two seeded batches of 16), temperature 0.6, top-p 0.95, budget 31,744 generated tokens, seed 20260819. Prompts and grader: the paper's repository (sophicle/reason). Rollout jsonl files are kept as written (one graded rollout per line, with the completion), under the run directories as on disk (run/, run_regraded/, *_execgraded/); cell summaries are at <prompt>/<benchmark>/summary/<arm>.json.

Downloads last month
98