This repository contains s1-test-time-scaling-synth, a reinforcement learning dataset in Japanese and English.
This dataset is built upon the supervised fine-tuning dataset simplescaling/data_ablation_full59K (hereafter, the "original dataset"), originally developed in "s1: Simple test-time scaling" [Muennighoff+, EMNLP25].
The original dataset is a compilation of existing datasets covering mathematics, science, and code generation tasks, and was reported to be effective in distilling reasoning traces generated using frontier reasoning models (Gemini). Motivated by their report, we curated the original dataset so that it can be used for reinforcement learning with verifiable rewards (RLVR), where problem statements can be given in both Japanese and English to investigate the language specificity of RLVR training. Specifically, we performed the following annotations and modifications:
We applied best-of-N translation using gpt-oss-120b. Specifically, we generated eight translation candidates in a zero-shot setting, followed by rejection sampling based on a self-assessed translation quality using GEMBA-MQM [Kocmi and Federmann, EAMT23].
We primarily extracted short ground-truth answers from metadata field in the original dataset. We then annotated answeability for each problem by considering the problem type, the availability of ground-truth answer, translation quality, etc. We also conducted a light quatitative validation of answerability for reference.
Since the original dataset is sourced from a wide variety of datasets ([Muennighoff+, EMNLP25] Appendix D.2), users should carefully confirm the licenses, commercial use, and potential benchmark leakage when using this dataset for developing LLMs. To assist users' investigation, we have attached the source information of the original dataset we investigated at the end of this document.
You can load the dataset using the datasets package.
from datasets import load_dataset
dataset = load_dataset("tokyotech-llm/s1-test-time-scaling-synth-public", "v202512", split="train")
For reinforcement learning, use question (English) or translated_question (Japanese) as the problem statement. To verify the solution, use answer as the ground truth.
Some problems may be unanswerable (e.g., missing ground truth or containing critical translation errors). You can exclude these potentially unanswerable problem statements by filtering the records using answerable==True.
subset = dataset.filter(lambda x: x["answerable"])
print(len(dataset), len(subset))
The number of records is 58,986, which is identical to the original dataset. As we extended the original dataset by adding new fields for annotations and modifications, the dataset fields are split into (i) fields inherited from the original dataset and (ii) fields added in our work.
The following fields are provided as-is from the original dataset.
qfq/openaimath/Intermediate Algebra).json.loads(metadata).translated_question.metadata.answer, solution, etc. Refer to the appendix for details.translated_question and question.Different licenses apply to different parts of the dataset.
We gratefully acknowledge Niklas Muennighoff, Zitong Yang, Weijia Shi, Xiang Lisa Li, Li Fei-Fei, Hannaneh Hajishirzi, Luke Zettlemoyer, Percy Liang, Emmanuel Candes, and Tatsunori Hashimoto, the author of the original s1 paper [Muennighoff+, EMNLP25].
This work is based on results obtained from AIST policy-based budget project "R&D on Generative AI Foundation Models for the Physical Domain".
This work is based on results obtained from a project, JPNP18002, commissioned by the New Energy and Industrial Technology Development Organization (NEDO).
We used ABCI 3.0 provided by AIST and AIST Solutions with support from "ABCI 3.0 Development Acceleration Use".
This study was carried out using the TSUBAME4.0 supercomputer at Institute of Science Tokyo.
This work is based on OpenAI's gpt-oss. We acknowledge and thank OpenAI for their contributions and the release of these models.
We used gpt-oss-120b to perform best-of-N translation (generation of candidate translations and translation quality assessment).
Specifically, we used the generation parameters reasoning_effort=medium and temperature=1.0. We optimized the translation instruction (prompt) using the GEPA algorithm (Agrawal+, ICLR26) within the DSPy framework.
We primarily obtained short ground-truth answers from metadata fields such as metadata.answer, metadata.label, and metadata.final_answer.
For source datasets that do not provide ground-truth answers in metadata, we heuristically extracted short answers from solution and/or attempt.
The answerable label was assigned according to the following criteria.
We mark proof-based problems as unanswerable (False), since they are generally difficult to evaluate using short answers.
False for math proof problemsFalse if the translation quality score (GEMBA-MQM) is ≤ -10False if short ground-truth answer extraction/annotation failsFalse if the short ground-truth answer is \\blacksquareTrue otherwiseAs a result, 43,351 samples were annotated with answerable=True.
To quatitatively validate answerability—whether the annotated ground-truth answer can be derived from the (translated) problem statement—we evaluated the accuracy of a frontier LLM using problem statements and ground-truth answers.
Specifically, we randomly sampled 100 problems from each of three source datasets, and measured GPT-5 (gpt-5-2025-08-07) accuracy when prompted with the Japanese (translated_question) and English (question) versions of the problem statements. The results are as follows (accuracy in %):
| source dataset | Ja | En |
|---|---|---|
| baber/agieval/logiqa | 77 | 78 |
| KbsdJames/Omni-MATH | 81 | 88 |
| AI-MO/NuminaMath-CoT/aops_forum | 80 | 85 |
Across all three source datasets, we confirmed that the accuracy is around or above 80%, and that the difference between Japanese and English prompts is small.
The problems included in the original dataset are sourced from 16 existing datasets.
To help users identify the source dataset for each problem, we extended Table 6 in [Muennighoff+, EMNLP25] and investigated:
huggingface_id field value.We have made reasonable efforts to investigate the source datasets. However, we do not guarantee the accuracy, completeness, or legal correctness of these determinations. This statement does not constitute legal advice and should not be relied upon as such. If there is any discrepancy between this document and the paper, the paper's description takes precedence.
| Source | Description | # Samples (Paper) | # Samples (dataset) | HF Dataset ID (huggingface_id) | License | Proprietary LLMs Usage |
|---|---|---|---|---|---|---|
| NuminaMATH (LI et al., 2024) | Math problems from online websites | 30,660 | 30,658 | AI-MO/NuminaMath-CoT | Apache License 2.0 | GPT-4, reasoning traces |
| MATH (Hendrycks et al., 2021) | Math problems from competitions | 11,999 | 11,958 | qfq/openaimath | MIT | No |
| OlympicArena (Huang et al., 2024a) | Astronomy, Biology, Chemistry, Computer Science, Geography, Math, and Physics olympiad questions | 4,250 | 4,250 | GAIR/OlympicArena | CC BY-NC-SA 4.0 | GPT-4, difficulty and correctness check |
| OmniMath (Gao et al., 2024a) | Math problems from competitions | 4,238 | 4,238 | KbsdJames/Omni-MATH | Apache License 2.0 | GPT-4o, difficulty annotation |
| AGIEval (Zhong et al., 2023; Ling et al., 2017; Hendrycks et al., 2021; Liu et al., 2020; Zhong et al., 2019; Wang et al., 2021) | English, Law, Logic and Math problems from the SAT, LSAT and other exams | 2,385 | 2,385 | baber/agieval | Mixed (MIT for code; original exams may be copyrighted) | No |
| xword | Crossword puzzles | 999 | 999 | 0xharib/xword1 | Proprietary (including New York Times, etc.) | No |
| OlympiadBench (He et al., 2024b) | Math and Physics olympiad questions | 896 | 896 | Hothan/OlympiadBench | Unknown | No |
| AIME (1983-2021) | American Invitational Mathematics Examination | 890 | 890 | qq8933/AIME_1983_2024 | Proprietary (Mathematical Association of America, AoPS) | No |
| TheoremQA (Chen et al., 2023) | Computer Science, Finance, Math, and Physics university-level questions relating to theorems | 747 | 747 | TIGER-Lab/TheoremQA | MIT | No |
| USACO (Shi et al., 2024) | Code problems from the USA Computing Olympiad | 519 | 519 | codegenning/usacobench_formatted | Proprietary (USA Computing Olympiad) | GPT family, reference implementation |
| JEEBench (Arora et al., 2023) | Chemistry, Math, and Physics problems used in the university entrance examination of the Indian Institute of Technology | 515 | 515 | daman1209arora/jeebench | MIT | GPT-3.5/4, solution (not ground-truth answer) |
| GPQA (Rein et al., 2023) | PhD-Level Science Questions | 348 | 348 | Idavidrein/gpqa | MIT | No |
| SciEval (Sun et al., 2024) | Biology, Chemistry, and Physics problems from various sources | 227 | 227 | OpenDFM/SciEval | CC BY 4.0 | No |
| s1-prob | Stanford statistics qualifying exams | 182 | 182 | qfq/stats_qual | Apache License 2.0 | No |
| s1-teasers | Math brain-teasers crawled from the Internet | 23 | 23 | qfq/quant | Apache License 2.0 | No |
| LiveCodeBench (Jain et al., 2024) | Code problems from coding websites (LeetCode, AtCoder, and CodeForces) | 151 | 151 | LiveCodeBench/release_v[1,2,3] | Proprietary (LeetCode, AtCoder, CodeForces, etc.) | No |
End of document
1 commits
This repository contains s1-test-time-scaling-synth, a reinforcement learning dataset in Japanese and English.
This dataset is built upon the supervised fine-tuning dataset simplescaling/data_ablation_full59K (hereafter, the "original dataset"), originally developed in "s1: Simple test-time scaling" [Muennighoff+, EMNLP25].
The original dataset is a compilation of existing datasets covering mathematics, science, and code generation tasks, and was reported to be effective in distilling reasoning traces generated using frontier reasoning models (Gemini). Motivated by their report, we curated the original dataset so that it can be used for reinforcement learning with verifiable rewards (RLVR), where problem statements can be given in both Japanese and English to investigate the language specificity of RLVR training. Specifically, we performed the following annotations and modifications:
We applied best-of-N translation using gpt-oss-120b. Specifically, we generated eight translation candidates in a zero-shot setting, followed by rejection sampling based on a self-assessed translation quality using GEMBA-MQM [Kocmi and Federmann, EAMT23].
We primarily extracted short ground-truth answers from metadata field in the original dataset. We then annotated answeability for each problem by considering the problem type, the availability of ground-truth answer, translation quality, etc. We also conducted a light quatitative validation of answerability for reference.
Since the original dataset is sourced from a wide variety of datasets ([Muennighoff+, EMNLP25] Appendix D.2), users should carefully confirm the licenses, commercial use, and potential benchmark leakage when using this dataset for developing LLMs. To assist users' investigation, we have attached the source information of the original dataset we investigated at the end of this document.
You can load the dataset using the datasets package.
from datasets import load_dataset
dataset = load_dataset("tokyotech-llm/s1-test-time-scaling-synth-public", "v202512", split="train")
For reinforcement learning, use question (English) or translated_question (Japanese) as the problem statement. To verify the solution, use answer as the ground truth.
Some problems may be unanswerable (e.g., missing ground truth or containing critical translation errors). You can exclude these potentially unanswerable problem statements by filtering the records using answerable==True.
subset = dataset.filter(lambda x: x["answerable"])
print(len(dataset), len(subset))
The number of records is 58,986, which is identical to the original dataset. As we extended the original dataset by adding new fields for annotations and modifications, the dataset fields are split into (i) fields inherited from the original dataset and (ii) fields added in our work.
The following fields are provided as-is from the original dataset.
qfq/openaimath/Intermediate Algebra).json.loads(metadata).translated_question.metadata.answer, solution, etc. Refer to the appendix for details.translated_question and question.Different licenses apply to different parts of the dataset.
We gratefully acknowledge Niklas Muennighoff, Zitong Yang, Weijia Shi, Xiang Lisa Li, Li Fei-Fei, Hannaneh Hajishirzi, Luke Zettlemoyer, Percy Liang, Emmanuel Candes, and Tatsunori Hashimoto, the author of the original s1 paper [Muennighoff+, EMNLP25].
This work is based on results obtained from AIST policy-based budget project "R&D on Generative AI Foundation Models for the Physical Domain".
This work is based on results obtained from a project, JPNP18002, commissioned by the New Energy and Industrial Technology Development Organization (NEDO).
We used ABCI 3.0 provided by AIST and AIST Solutions with support from "ABCI 3.0 Development Acceleration Use".
This study was carried out using the TSUBAME4.0 supercomputer at Institute of Science Tokyo.
This work is based on OpenAI's gpt-oss. We acknowledge and thank OpenAI for their contributions and the release of these models.
We used gpt-oss-120b to perform best-of-N translation (generation of candidate translations and translation quality assessment).
Specifically, we used the generation parameters reasoning_effort=medium and temperature=1.0. We optimized the translation instruction (prompt) using the GEPA algorithm (Agrawal+, ICLR26) within the DSPy framework.
We primarily obtained short ground-truth answers from metadata fields such as metadata.answer, metadata.label, and metadata.final_answer.
For source datasets that do not provide ground-truth answers in metadata, we heuristically extracted short answers from solution and/or attempt.
The answerable label was assigned according to the following criteria.
We mark proof-based problems as unanswerable (False), since they are generally difficult to evaluate using short answers.
False for math proof problemsFalse if the translation quality score (GEMBA-MQM) is ≤ -10False if short ground-truth answer extraction/annotation failsFalse if the short ground-truth answer is \\blacksquareTrue otherwiseAs a result, 43,351 samples were annotated with answerable=True.
To quatitatively validate answerability—whether the annotated ground-truth answer can be derived from the (translated) problem statement—we evaluated the accuracy of a frontier LLM using problem statements and ground-truth answers.
Specifically, we randomly sampled 100 problems from each of three source datasets, and measured GPT-5 (gpt-5-2025-08-07) accuracy when prompted with the Japanese (translated_question) and English (question) versions of the problem statements. The results are as follows (accuracy in %):
| source dataset | Ja | En |
|---|---|---|
| baber/agieval/logiqa | 77 | 78 |
| KbsdJames/Omni-MATH | 81 | 88 |
| AI-MO/NuminaMath-CoT/aops_forum | 80 | 85 |
Across all three source datasets, we confirmed that the accuracy is around or above 80%, and that the difference between Japanese and English prompts is small.
The problems included in the original dataset are sourced from 16 existing datasets.
To help users identify the source dataset for each problem, we extended Table 6 in [Muennighoff+, EMNLP25] and investigated:
huggingface_id field value.We have made reasonable efforts to investigate the source datasets. However, we do not guarantee the accuracy, completeness, or legal correctness of these determinations. This statement does not constitute legal advice and should not be relied upon as such. If there is any discrepancy between this document and the paper, the paper's description takes precedence.
| Source | Description | # Samples (Paper) | # Samples (dataset) | HF Dataset ID (huggingface_id) | License | Proprietary LLMs Usage |
|---|---|---|---|---|---|---|
| NuminaMATH (LI et al., 2024) | Math problems from online websites | 30,660 | 30,658 | AI-MO/NuminaMath-CoT | Apache License 2.0 | GPT-4, reasoning traces |
| MATH (Hendrycks et al., 2021) | Math problems from competitions | 11,999 | 11,958 | qfq/openaimath | MIT | No |
| OlympicArena (Huang et al., 2024a) | Astronomy, Biology, Chemistry, Computer Science, Geography, Math, and Physics olympiad questions | 4,250 | 4,250 | GAIR/OlympicArena | CC BY-NC-SA 4.0 | GPT-4, difficulty and correctness check |
| OmniMath (Gao et al., 2024a) | Math problems from competitions | 4,238 | 4,238 | KbsdJames/Omni-MATH | Apache License 2.0 | GPT-4o, difficulty annotation |
| AGIEval (Zhong et al., 2023; Ling et al., 2017; Hendrycks et al., 2021; Liu et al., 2020; Zhong et al., 2019; Wang et al., 2021) | English, Law, Logic and Math problems from the SAT, LSAT and other exams | 2,385 | 2,385 | baber/agieval | Mixed (MIT for code; original exams may be copyrighted) | No |
| xword | Crossword puzzles | 999 | 999 | 0xharib/xword1 | Proprietary (including New York Times, etc.) | No |
| OlympiadBench (He et al., 2024b) | Math and Physics olympiad questions | 896 | 896 | Hothan/OlympiadBench | Unknown | No |
| AIME (1983-2021) | American Invitational Mathematics Examination | 890 | 890 | qq8933/AIME_1983_2024 | Proprietary (Mathematical Association of America, AoPS) | No |
| TheoremQA (Chen et al., 2023) | Computer Science, Finance, Math, and Physics university-level questions relating to theorems | 747 | 747 | TIGER-Lab/TheoremQA | MIT | No |
| USACO (Shi et al., 2024) | Code problems from the USA Computing Olympiad | 519 | 519 | codegenning/usacobench_formatted | Proprietary (USA Computing Olympiad) | GPT family, reference implementation |
| JEEBench (Arora et al., 2023) | Chemistry, Math, and Physics problems used in the university entrance examination of the Indian Institute of Technology | 515 | 515 | daman1209arora/jeebench | MIT | GPT-3.5/4, solution (not ground-truth answer) |
| GPQA (Rein et al., 2023) | PhD-Level Science Questions | 348 | 348 | Idavidrein/gpqa | MIT | No |
| SciEval (Sun et al., 2024) | Biology, Chemistry, and Physics problems from various sources | 227 | 227 | OpenDFM/SciEval | CC BY 4.0 | No |
| s1-prob | Stanford statistics qualifying exams | 182 | 182 | qfq/stats_qual | Apache License 2.0 | No |
| s1-teasers | Math brain-teasers crawled from the Internet | 23 | 23 | qfq/quant | Apache License 2.0 | No |
| LiveCodeBench (Jain et al., 2024) | Code problems from coding websites (LeetCode, AtCoder, and CodeForces) | 151 | 151 | LiveCodeBench/release_v[1,2,3] | Proprietary (LeetCode, AtCoder, CodeForces, etc.) | No |
End of document
1 commits