Dataset Preview
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
schema_version: int64
problem_id: string
final_source: string
selected_proof_id: string
final_proof: string
mean_verifier_score: double
valid_verification_count: int64
self_score: double
rounds_completed: int64
proofs_in_pool: int64
calls_completed: int64
physical_requests_completed: int64
valid_verifications_completed: int64
invalid_verifications_completed: int64
latency_s: double
cached_prompt_tokens: int64
segments: list<item: struct<kind: string, request_id: string, finish_reason: string, prompt_tokens: int64, cac (... 157 chars omitted)
child 0, item: struct<kind: string, request_id: string, finish_reason: string, prompt_tokens: int64, cached_prompt_ (... 145 chars omitted)
child 0, kind: string
child 1, request_id: string
child 2, finish_reason: string
child 3, prompt_tokens: int64
child 4, cached_prompt_tokens: int64
child 5, completion_tokens: int64
child 6, reasoning_tokens: null
child 7, requested_max_completion_tokens: int64
child 8, latency_s: double
child 9, stream_aborted: bool
reasoning_content: string
reasoning_tokens: null
prompt_tokens: int64
stage: string
xml_valid: bool
prompt_sha256: string
stop_reason: string
sample_id: string
logical_max_completion_tokens: int64
seed: int64
xml_error: null
requested_max_completion_tokens: int64
stream_aborted: bool
salvaged: bool
finish_reason: string
physical_prompt_tokens: int64
content: string
error: null
completion_tokens: int64
physical_request_count: int64
verification_disposition: string
to
{'sample_id': Value('string'), 'stage': Value('string'), 'seed': Value('int64'), 'prompt_sha256': Value('string'), 'content': Value('string'), 'reasoning_content': Value('string'), 'finish_reason': Value('string'), 'prompt_tokens': Value('int64'), 'cached_prompt_tokens': Value('int64'), 'completion_tokens': Value('int64'), 'reasoning_tokens': Value('null'), 'requested_max_completion_tokens': Value('int64'), 'logical_max_completion_tokens': Value('int64'), 'physical_request_count': Value('int64'), 'physical_prompt_tokens': Value('int64'), 'segments': List({'kind': Value('string'), 'request_id': Value('string'), 'finish_reason': Value('string'), 'prompt_tokens': Value('int64'), 'cached_prompt_tokens': Value('int64'), 'completion_tokens': Value('int64'), 'reasoning_tokens': Value('null'), 'requested_max_completion_tokens': Value('int64'), 'latency_s': Value('float64'), 'stream_aborted': Value('bool')}), 'latency_s': Value('float64'), 'stop_reason': Value('string'), 'stream_aborted': Value('bool'), 'salvaged': Value('bool'), 'xml_valid': Value('bool'), 'xml_error': Value('null'), 'error': Value('null'), 'verification_disposition': 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 1816, 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 2369, in table_cast
return cast_table_to_schema(table, schema)
File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2297, in cast_table_to_schema
raise CastError(
...<3 lines>...
)
datasets.table.CastError: Couldn't cast
schema_version: int64
problem_id: string
final_source: string
selected_proof_id: string
final_proof: string
mean_verifier_score: double
valid_verification_count: int64
self_score: double
rounds_completed: int64
proofs_in_pool: int64
calls_completed: int64
physical_requests_completed: int64
valid_verifications_completed: int64
invalid_verifications_completed: int64
latency_s: double
cached_prompt_tokens: int64
segments: list<item: struct<kind: string, request_id: string, finish_reason: string, prompt_tokens: int64, cac (... 157 chars omitted)
child 0, item: struct<kind: string, request_id: string, finish_reason: string, prompt_tokens: int64, cached_prompt_ (... 145 chars omitted)
child 0, kind: string
child 1, request_id: string
child 2, finish_reason: string
child 3, prompt_tokens: int64
child 4, cached_prompt_tokens: int64
child 5, completion_tokens: int64
child 6, reasoning_tokens: null
child 7, requested_max_completion_tokens: int64
child 8, latency_s: double
child 9, stream_aborted: bool
reasoning_content: string
reasoning_tokens: null
prompt_tokens: int64
stage: string
xml_valid: bool
prompt_sha256: string
stop_reason: string
sample_id: string
logical_max_completion_tokens: int64
seed: int64
xml_error: null
requested_max_completion_tokens: int64
stream_aborted: bool
salvaged: bool
finish_reason: string
physical_prompt_tokens: int64
content: string
error: null
completion_tokens: int64
physical_request_count: int64
verification_disposition: string
to
{'sample_id': Value('string'), 'stage': Value('string'), 'seed': Value('int64'), 'prompt_sha256': Value('string'), 'content': Value('string'), 'reasoning_content': Value('string'), 'finish_reason': Value('string'), 'prompt_tokens': Value('int64'), 'cached_prompt_tokens': Value('int64'), 'completion_tokens': Value('int64'), 'reasoning_tokens': Value('null'), 'requested_max_completion_tokens': Value('int64'), 'logical_max_completion_tokens': Value('int64'), 'physical_request_count': Value('int64'), 'physical_prompt_tokens': Value('int64'), 'segments': List({'kind': Value('string'), 'request_id': Value('string'), 'finish_reason': Value('string'), 'prompt_tokens': Value('int64'), 'cached_prompt_tokens': Value('int64'), 'completion_tokens': Value('int64'), 'reasoning_tokens': Value('null'), 'requested_max_completion_tokens': Value('int64'), 'latency_s': Value('float64'), 'stream_aborted': Value('bool')}), 'latency_s': Value('float64'), 'stop_reason': Value('string'), 'stream_aborted': Value('bool'), 'salvaged': Value('bool'), 'xml_valid': Value('bool'), 'xml_error': Value('null'), 'error': Value('null'), 'verification_disposition': 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 1683, 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 1869, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
sample_id string | stage string | seed int64 | prompt_sha256 string | content string | reasoning_content string | finish_reason string | prompt_tokens int64 | cached_prompt_tokens int64 | completion_tokens int64 | reasoning_tokens null | requested_max_completion_tokens int64 | logical_max_completion_tokens int64 | physical_request_count int64 | physical_prompt_tokens int64 | segments list | latency_s float64 | stop_reason string | stream_aborted bool | salvaged bool | xml_valid bool | xml_error null | error null | verification_disposition string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
round-01/generate/r01-p0008 | round-01/generate | 754,889,539 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | <solution>
We prove both parts.
Let the initial numbers be \(a_1,\dots,a_{2026}>1\). For any integer \(x>1\) write its prime factorization \(x=\prod_p p^{\alpha_p(x)}\); for \(x=1\) set \(\alpha_p(1)=0\).
---
### Part (a)
Define the **total exponent sum**
\[
T=\sum_{i=1}^{2026}\sum_p \alpha_p(a_i).
\]
\(T\) is a no... | We need to solve the problem. Let's restate:
We have 2026 integers greater than 1 written on a blackboard, not necessarily distinct. In a move, choose two integers m>1 and n>1 from different places on the blackboard, and replace them with gcd(m,n) and lcm(m,n)/gcd(m,n). He continues while possible (i.e., while there a... | stop | 448 | null | 11,889 | null | 128,000 | 128,000 | 1 | 448 | [
{
"kind": "chat_stream",
"request_id": "round-01/generate/r01-p0008",
"finish_reason": "stop",
"prompt_tokens": 448,
"cached_prompt_tokens": null,
"completion_tokens": 11889,
"reasoning_tokens": null,
"requested_max_completion_tokens": 128000,
"latency_s": 84.951,
"stream_abo... | 84.951 | stop | false | false | true | null | null | null |
round-01/generate/r01-p0009 | round-01/generate | 896,284,131 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | <solution>
We prove both parts.
Let the initial numbers be \(a_1,\dots,a_{2026}>1\). For any integer \(x>1\) write its prime factorization \(x=\prod_p p^{\alpha_p(x)}\); for \(x=1\) set \(\alpha_p(1)=0\).
---
### Part (a)
Define the **total exponent sum**
\[
T=\sum_{i=1}^{2026}\sum_p \alpha_p(a_i).
\]
\(T\) is a no... | We need to solve the problem. Let's restate:
We have 2026 integers greater than 1 written on a blackboard, not necessarily distinct. In a move, choose two integers m>1 and n>1 from different places on the blackboard, and replace them with gcd(m,n) and lcm(m,n)/gcd(m,n). He continues while possible (i.e., while there a... | stop | 448 | null | 11,889 | null | 128,000 | 128,000 | 1 | 448 | [
{
"kind": "chat_stream",
"request_id": "round-01/generate/r01-p0009",
"finish_reason": "stop",
"prompt_tokens": 448,
"cached_prompt_tokens": null,
"completion_tokens": 11889,
"reasoning_tokens": null,
"requested_max_completion_tokens": 128000,
"latency_s": 85.572,
"stream_abo... | 85.572 | stop | false | false | true | null | null | null |
round-01/generate/r01-p0010 | round-01/generate | 161,558,040 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | <solution>
We prove both parts.
Let the initial numbers be \(a_1,\dots,a_{2026}>1\). For any integer \(x>1\) write its prime factorization \(x=\prod_p p^{\alpha_p(x)}\); for \(x=1\) set \(\alpha_p(1)=0\).
---
### Part (a)
Define the **total exponent sum**
\[
T=\sum_{i=1}^{2026}\sum_p \alpha_p(a_i).
\]
\(T\) is a no... | We need to solve the problem. Let's restate:
We have 2026 integers greater than 1 written on a blackboard, not necessarily distinct. In a move, choose two integers m>1 and n>1 from different places on the blackboard, and replace them with gcd(m,n) and lcm(m,n)/gcd(m,n). He continues while possible (i.e., while there a... | stop | 448 | null | 11,894 | null | 128,000 | 128,000 | 1 | 448 | [
{
"kind": "chat_stream",
"request_id": "round-01/generate/r01-p0010",
"finish_reason": "stop",
"prompt_tokens": 448,
"cached_prompt_tokens": null,
"completion_tokens": 11894,
"reasoning_tokens": null,
"requested_max_completion_tokens": 128000,
"latency_s": 85.9,
"stream_abort... | 85.9 | stop | false | false | true | null | null | null |
round-01/generate/r01-p0003 | round-01/generate | 1,091,333,567 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | "<solution>\nWe prove both statements.\n\nLet the initial multiset consist of \\(2026\\) integers, e(...TRUNCATED) | "We need to solve the problem. The problem: There are 2026 integers greater than 1 written on a blac(...TRUNCATED) | stop | 448 | 1 | 15,377 | null | 128,000 | 128,000 | 1 | 448 | [{"kind":"chat_stream","request_id":"round-01/generate/r01-p0003","finish_reason":"stop","prompt_tok(...TRUNCATED) | 113.009 | stop | false | false | true | null | null | null |
round-01/verify/r01-p0010/v015 | round-01/verify/r01-p0010 | 639,779,213 | d9d66c114c2ac35bb05ee40ecac74f2a4a61b347dba53dae940606470156bdca | "<evaluation>\nThe solution correctly proves part (b) and the main idea of part (a) is sound: the to(...TRUNCATED) | "We are asked to evaluate the candidate solution. The problem: 2026 integers >1 on blackboard, moves(...TRUNCATED) | stop | 1,608 | 1,464 | 3,788 | null | 128,000 | 128,000 | 1 | 1,608 | [{"kind":"chat_stream","request_id":"round-01/verify/r01-p0010/v015","finish_reason":"stop","prompt_(...TRUNCATED) | 38.882 | stop | false | false | true | null | null | accepted |
round-01/verify/r01-p0009/v010 | round-01/verify/r01-p0009 | 591,901,226 | 88e1e2ec8f1ee760002a2603ce4fc4ff1880596e15bc18d27df8b7acb4603c7e | "<evaluation>\nThe solution correctly proves both parts of the problem. The total exponent sum argum(...TRUNCATED) | "We need to evaluate the candidate solution. The problem: There are 2026 integers >1 written on a bl(...TRUNCATED) | stop | 1,603 | 1,602 | 4,138 | null | 128,000 | 128,000 | 1 | 1,603 | [{"kind":"chat_stream","request_id":"round-01/verify/r01-p0009/v010","finish_reason":"stop","prompt_(...TRUNCATED) | 41.496 | stop | false | false | true | null | null | accepted |
round-01/verify/r01-p0009/v013 | round-01/verify/r01-p0009 | 478,153,878 | 88e1e2ec8f1ee760002a2603ce4fc4ff1880596e15bc18d27df8b7acb4603c7e | "<evaluation>\nThe solution is correct and rigorous. Part (a) uses a total exponent sum that strictl(...TRUNCATED) | "We need to evaluate the candidate solution. The problem: There are 2026 integers greater than 1 wri(...TRUNCATED) | stop | 1,603 | 1,602 | 4,422 | null | 128,000 | 128,000 | 1 | 1,603 | [{"kind":"chat_stream","request_id":"round-01/verify/r01-p0009/v013","finish_reason":"stop","prompt_(...TRUNCATED) | 44.515 | stop | false | false | true | null | null | accepted |
round-01/generate/r01-p0019 | round-01/generate | 1,353,284,577 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | "<solution>\nLet the numbers on the blackboard at any stage be \\(a_1,\\dots,a_{2026}\\). \nDefine (...TRUNCATED) | "We need to solve a problem about a process on integers >1. We have 2026 integers >1, not necessaril(...TRUNCATED) | stop | 448 | 1 | 16,096 | null | 128,000 | 128,000 | 1 | 448 | [{"kind":"chat_stream","request_id":"round-01/generate/r01-p0019","finish_reason":"stop","prompt_tok(...TRUNCATED) | 132.108 | stop | false | false | true | null | null | null |
round-01/generate/r01-p0016 | round-01/generate | 1,909,985,847 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | "<solution>\nLet $n>1$ be an integer. Write its prime factorization $n = \\prod_{p} p^{e_p(n)}$ wher(...TRUNCATED) | "We need to solve a problem about a process on integers >1. We have 2026 integers >1, not necessaril(...TRUNCATED) | stop | 448 | null | 17,713 | null | 128,000 | 128,000 | 1 | 448 | [{"kind":"chat_stream","request_id":"round-01/generate/r01-p0016","finish_reason":"stop","prompt_tok(...TRUNCATED) | 133.397 | stop | false | false | true | null | null | null |
round-01/generate/r01-p0026 | round-01/generate | 1,069,259,720 | 2a53a16dff6a76ec08200b50c416aa2b3f9174a02dabb9ed5beb2a80a6d34373 | "<solution>\nWe are given \\(2026\\) integers greater than \\(1\\) on a blackboard. \nLet the numbe(...TRUNCATED) | "We need to solve a problem about a process on a blackboard with 2026 integers >1. In each move, cho(...TRUNCATED) | stop | 448 | 447 | 16,831 | null | 128,000 | 128,000 | 1 | 448 | [{"kind":"chat_stream","request_id":"round-01/generate/r01-p0026","finish_reason":"stop","prompt_tok(...TRUNCATED) | 135.271 | stop | false | false | true | null | null | null |
End of preview.
No dataset card yet
- Downloads last month
- 24,970