Dataset Viewer
Auto-converted to Parquet Duplicate
id
stringlengths
24
24
messages
listlengths
2
2
language
stringclasses
37 values
language_name
stringclasses
37 values
source_id
stringclasses
99 values
source_dataset
stringclasses
1 value
source_subset
stringclasses
1 value
source_split
stringclasses
1 value
source_license
stringclasses
1 value
translation_model
stringclasses
1 value
translation_method
stringclasses
1 value
translation_metrics
dict
quality
dict
source_metadata_json
stringclasses
99 values
aadf4912583472a2b168470f
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nФиона отново наблюдава хората. Тя забелязва група от десет ученици и започва да играе игра сама, в която разглежда двойка хора от групата и се опитва да отгатне дали се ...
bg
Bulgarian
nemotron-math-1334
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 56589314716, "load_duration": 279176891, "prompt_eval_count": 686, "prompt_eval_duration": 936782454, "eval_count": 753, "eval_duration": 54966854853, "done_reason": "stop", "host": "http://127.0.0.1:11434", "chunk_count": 1, "initial_chunk_count": 1, "request_count": 1, "ada...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0060180541624875, "preserved_token_ratio": 1, "source_copy_ratio": 0.10668340131785378, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-1334", "license": "cc-by-4.0", "pilot_length_stratum": "lt-2k", "pilot_reasoning_chars": 1570, "pilot_stream_index": 1334, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "v...
981307a056a44d437acdf9ef
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nОпределете дали съществува изпъкнал многостен, който има 4 стени, така че всяка двойка стени да има общ ръб." }, { "role": "assistant", "content": "<think>\n...
bg
Bulgarian
nemotron-math-1290
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 268399171561, "load_duration": 763722931, "prompt_eval_count": 2851, "prompt_eval_duration": 3730088913, "eval_count": 3575, "eval_duration": 261937283353, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 3, "initial_chunk_count": 3, "request_count": 3, ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0184583236591596, "preserved_token_ratio": 1, "source_copy_ratio": 0.06800070834071188, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-1290", "license": "cc-by-4.0", "pilot_length_stratum": "5k-10k", "pilot_reasoning_chars": 8394, "pilot_stream_index": 1290, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "...
82943df951338252da6e4c80
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nИма ли интегралът \\[ I = \\int \\dfrac{3x}{\\sqrt{x^3 + 9}} \\, dx \\] решение, изразено чрез стандартни математически функции?" }, { "role": "assistant", "...
bg
Bulgarian
nemotron-math-115
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 544784591058, "load_duration": 2475502215, "prompt_eval_count": 7226, "prompt_eval_duration": 9465968367, "eval_count": 7262, "eval_duration": 528708252099, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 11, "initial_chunk_count": 11, "request_count": 1...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.020572590738423, "preserved_token_ratio": 1, "source_copy_ratio": 0.34075, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-115", "license": "cc-by-4.0", "pilot_length_stratum": "10k-20k", "pilot_reasoning_chars": 12188, "pilot_stream_index": 115, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "...
ecc0bc4aa3a77d215a3f6757
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nПо колко начина могат да бъдат разпределени 14 учители в 4 различни училища, така че всяко училище да има поне двама учители?" }, { "role": "assistant", "con...
bg
Bulgarian
nemotron-math-68
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 1058951548281, "load_duration": 5162881676, "prompt_eval_count": 13161, "prompt_eval_duration": 17360653899, "eval_count": 14117, "eval_duration": 1028536909317, "done_reason": "stop", "host": "http://127.0.0.1:11434", "chunk_count": 22, "initial_chunk_count": 20, "request_coun...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0926863398773512, "preserved_token_ratio": 1, "source_copy_ratio": 0.009666666666666667, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-68", "license": "cc-by-4.0", "pilot_length_stratum": "gte-20k", "pilot_reasoning_chars": 22102, "pilot_stream_index": 68, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "ve...
c959167b8fb646f2fcc09a6a
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nКаква е точковата форма на уравнението на права линия с наклон \\( \\frac{3}{5} \\), която минава през точката \\((10, -2)\\)?" }, { "role": "assistant", "co...
bg
Bulgarian
nemotron-math-3396
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 50392551154, "load_duration": 236935787, "prompt_eval_count": 632, "prompt_eval_duration": 828043708, "eval_count": 672, "eval_duration": 48940335233, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 1, "initial_chunk_count": 1, "request_count": 1, "ada...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.020327868852459, "preserved_token_ratio": 1, "source_copy_ratio": 0.19281968535699878, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-3396", "license": "cc-by-4.0", "pilot_length_stratum": "lt-2k", "pilot_reasoning_chars": 1222, "pilot_stream_index": 3396, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "v...
0e4e7460b101a1ed3a6e363f
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНамерете $\\csc 225^\\circ.$" }, { "role": "assistant", "content": "<think>\nДобре, нека видим. Трябва да намеря косеканса на 225 градуса. Хм, първо, спомням...
bg
Bulgarian
nemotron-math-2307
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 82887986710, "load_duration": 465562573, "prompt_eval_count": 999, "prompt_eval_duration": 1299428698, "eval_count": 1106, "eval_duration": 80499647649, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 2, "initial_chunk_count": 2, "request_count": 2, "a...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.1017576318223867, "preserved_token_ratio": 1, "source_copy_ratio": 0.14104372355430184, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-2307", "license": "cc-by-4.0", "pilot_length_stratum": "2k-5k", "pilot_reasoning_chars": 2023, "pilot_stream_index": 2307, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "v...
287d23dff5494d40160e8473
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nКолко 9-цифрени числа могат да бъдат образувани, използвайки цифрите $0, 1, 2, \\ldots, 9$, така че цифрата $1$ да се среща точно три пъти, а всички останали цифри да са...
bg
Bulgarian
nemotron-math-1642
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 382284070093, "load_duration": 1854859220, "prompt_eval_count": 4763, "prompt_eval_duration": 6398089228, "eval_count": 5086, "eval_duration": 371146170446, "done_reason": "stop", "host": "http://127.0.0.1:11434", "chunk_count": 8, "initial_chunk_count": 8, "request_count": 8, ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0565719110610752, "preserved_token_ratio": 1, "source_copy_ratio": 0.20711437891575624, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-1642", "license": "cc-by-4.0", "pilot_length_stratum": "5k-10k", "pilot_reasoning_chars": 9355, "pilot_stream_index": 1642, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "...
0acff447d00fb9050534db00
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nКомпютърен вирус започва, като заразява едно устройство. Всяка секунда, заразеният компютър има $\\frac{7}{30}$ шанс да остане заразен и да не прави нищо друго, $\\frac{...
bg
Bulgarian
nemotron-math-655
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 698064507102, "load_duration": 2205984615, "prompt_eval_count": 7770, "prompt_eval_duration": 10194440344, "eval_count": 9295, "eval_duration": 680624838166, "done_reason": "stop", "host": "http://127.0.0.1:11434", "chunk_count": 10, "initial_chunk_count": 10, "request_count": ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.061429109395594, "preserved_token_ratio": 1, "source_copy_ratio": 0.08375, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-655", "license": "cc-by-4.0", "pilot_length_stratum": "10k-20k", "pilot_reasoning_chars": 19396, "pilot_stream_index": 655, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", "...
e86d40c8965e074948b3171b
[{"role":"user","content":"Решете следния математически проблем. У(...TRUNCATED)
bg
Bulgarian
nemotron-math-1345
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{"total_duration":1202295229196,"load_duration":5706289355,"prompt_eval_count":14864,"prompt_eval_du(...TRUNCATED)
{"accepted":true,"reasons":[],"language_confidence":1.0,"length_ratio":1.1233432736911861,"preserved(...TRUNCATED)
"{\"category\": \"math\", \"generator\": \"Qwen-2.5-32B-Instruct, DeepSeek-R1\", \"id\": \"nemotron-(...TRUNCATED)
d91505275f9535e7f92b7c6b
[{"role":"user","content":"Решете следния математически проблем. У(...TRUNCATED)
bg
Bulgarian
nemotron-math-4715
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{"total_duration":70975122354,"load_duration":247514915,"prompt_eval_count":807,"prompt_eval_duratio(...TRUNCATED)
{"accepted":true,"reasons":[],"language_confidence":1.0,"length_ratio":1.0409741012756089,"preserved(...TRUNCATED)
"{\"category\": \"math\", \"generator\": \"Qwen-2.5-32B-Instruct, DeepSeek-R1\", \"id\": \"nemotron-(...TRUNCATED)
End of preview. Expand in Data Studio

OpenEuroLLM Multilingual Mathematical Reasoning Traces — TranslateGemma Pilot

Release status: private v0.1-pilot staging dataset. The rows passed the automated translation gates described below, but this pilot has not yet completed a systematic native-speaker audit or independent downstream-solver verification. It should not yet be treated as a final production training release.

This dataset contains 2,930 accepted translations of mathematical reasoning traces into 37 non-English languages used by OpenEuroLLM. Each row preserves an already-solved source problem, step-by-step <think> trace, and final answer. The translation model was instructed to translate faithfully rather than solve the problem again.

The approach follows the language-specific reasoning workflow described in AMD's RL training playbook: translate existing reasoning trajectories so that problems and solutions remain aligned across languages.

Release summary

Item Value
Release v0.1-pilot
Translation period 2026-07-28 to 2026-08-07
Source problems 100
Target languages 37 non-English languages
Attempted source/language pairs 3,700
Accepted and published 2,930 (79.2%)
Deterministically rejected 17 (0.5%)
Terminal translation errors 753 (20.4%)
Cumulative error records, including retries 933
Likely-untranslated accepted rows 0
Accepted source license 2,930 × CC BY 4.0
Parquet download size 39,067,021 bytes

Rejected rows and error logs are not included in this dataset. The 99.4% gate pass rate among rows that reached the accepted/rejected quality decision (2,930 of 2,947) should not be confused with the overall 79.2% accepted yield across all 3,700 attempted pairs.

Source data and sampling

The source is the SFT/math portion of nvidia/Llama-Nemotron-Post-Training-Dataset, version v1.1 in the retained row metadata. The pilot selected 100 deterministic reservoir samples from the first 20,000 streamed math rows. It uses 20 sources from each source-reasoning-length stratum:

  • fewer than 2,000 characters;
  • 2,000–5,000 characters;
  • 5,000–10,000 characters;
  • 10,000–20,000 characters;
  • 20,000 characters or more.

Every accepted row retains the upstream dataset, subset, split, source ID, source license, and a lossless serialized copy of the upstream metadata. The same 100 source IDs were attempted in each target language, which makes the pilot useful for aligned multilingual comparisons. English passthrough rows are not part of this release.

Translation procedure

  • Model: translategemma:27b (TranslateGemma 27B, Q4_K_M Ollama build)
  • Method: faithful_trace_translation
  • Hardware: two NVIDIA L4 GPUs, one Ollama worker per GPU
  • Decoding: temperature 0.0
  • Context / generation cap: 4,096 tokens / 4,096 tokens
  • Initial chunk limits: 4,500 source characters and 64 protected spans
  • Chunking: semantic splitting with adaptive subdivision on invariant failure
  • Protection: formulas, numbers, code, URLs, assignments, and structural markers were masked during translation and required to return exactly once

Long documents were translated in chunks and reassembled. The accepted release contains 24,889 translated chunks, averaging 8.446 chunks per document. Runtime fields are retained for reproducibility; duration values in translation_metrics are Ollama nanoseconds.

Automated quality gates

An output was accepted only when it had:

  1. non-empty translated prompt, reasoning trace, and final answer;
  2. plausible target-language confidence and expected writing-system evidence;
  3. no disallowed unexpected script relative to the source;
  4. exact protected-placeholder recovery during every translation chunk;
  5. preserved numbers, formulas, code, URLs, assignments, and section structure;
  6. plausible translated/source length ratio; and
  7. no high source-copy similarity indicating an untranslated output.

The 17 deterministic rejections were caused by 15 unexpected-script flags, one protected-token loss, and one target-language-confidence failure. No accepted row crossed the pilot's likely-untranslated threshold. These checks detect structural failures; they do not prove that every intermediate mathematical statement is semantically equivalent to the source.

Per-language outcomes

Each language had 100 attempted source traces. Error is the number of pairs that never produced an accepted or deterministically rejected row after retries.

Language Accepted Rejected Error
Bulgarian (bg) 82 0 18
Bosnian (bs) 86 1 13
Catalan (ca) 81 0 19
Czech (cs) 82 0 18
Welsh (cy) 74 2 24
Danish (da) 83 0 17
German (de) 77 0 23
Greek (el) 76 1 23
Spanish (es) 76 0 24
Estonian (et) 69 0 31
Basque (eu) 72 0 28
Finnish (fi) 78 0 22
French (fr) 82 0 18
Irish (ga) 72 3 25
Galician (gl) 84 3 13
Croatian (hr) 84 1 15
Hungarian (hu) 71 0 29
Icelandic (is) 75 0 25
Italian (it) 75 0 25
Luxembourgish (lb) 79 0 21
Lithuanian (lt) 78 0 22
Latvian (lv) 88 0 12
Macedonian (mk) 91 0 9
Maltese (mt) 81 0 19
Dutch (nl) 74 0 26
Norwegian (no) 83 0 17
Polish (pl) 71 0 29
Portuguese (pt) 85 0 15
Romanian (ro) 86 0 14
Russian (ru) 72 0 28
Slovak (sk) 77 1 22
Slovenian (sl) 77 4 19
Albanian (sq) 93 0 7
Serbian (sr) 83 1 16
Swedish (sv) 76 0 24
Turkish (tr) 74 0 26
Ukrainian (uk) 83 0 17
Total 2,930 17 753

Dataset structure

The dataset has one train split. It is conversational SFT data with a translated user problem and an assistant response containing the translated <think> trace followed by the final answer.

from datasets import load_dataset

dataset = load_dataset(
    "openeurollm/reasoning-traces-multilingual",
    split="train",
)

swedish = dataset.filter(lambda row: row["language"] == "sv")
print(swedish[0]["messages"])

Fields

Field Description
id Stable 24-character hash of the source/language pair.
messages User problem and assistant <think> trace plus final answer.
language, language_name Target language code and English language name.
source_id Stable upstream source-row identifier.
source_dataset, source_subset, source_split Upstream provenance.
source_license License attached to the upstream source row.
translation_model, translation_method Translation provenance.
translation_metrics Ollama timing, token, host, chunk, retry, and placeholder metadata.
quality Automated gate decision and measured language/length/preservation signals.
source_metadata_json Lossless upstream metadata serialized as JSON.

Licensing and attribution

All 2,930 accepted pilot rows carry source_license: cc-by-4.0, so this pilot is marked CC BY 4.0. Users must preserve attribution and comply with the upstream Llama-Nemotron dataset card. The translation-pipeline software is Apache-2.0; that software license does not relicense dataset content. Future expansions must continue to expose licensing per row rather than assuming this pilot's uniform license distribution.

Intended uses

  • multilingual mathematical-reasoning SFT experiments;
  • cross-lingual reasoning and representation studies;
  • controlled language-mixture and ablation experiments;
  • evaluation of translation-based reasoning-data generation; and
  • pilot-scale downstream-solver comparisons before larger campaigns.

Maintain a strong high-quality English component in training mixtures and independently evaluate mathematical correctness, language quality, and reasoning-language consistency.

Limitations and risks

  • This is a small stratified pilot, not a representative sample of all mathematical reasoning.
  • The traces are synthetic source traces translated by a model, not human-authored explanations.
  • Accepted rows passed automated structural checks but not a systematic native-speaker audit.
  • Independent downstream-solver verification has not yet been completed.
  • A preserved final answer does not prove every translated intermediate claim is correct.
  • Low-resource and closely related languages remain difficult for automatic language identification.
  • Model translation can introduce unnatural phrasing, source-language leakage, or semantic drift.
  • Explicit reasoning traces can reproduce undesirable source reasoning patterns and should not be treated as factual references.
  • Yield varied by language; absent source/language pairs are not missing at random because failures were frequently caused by protected-placeholder handling on long traces.
  • Runtime host values describe the internal pilot workers and are not stable public endpoints.

Validation still required before public release

  1. A stratified native-speaker review across language families and reasoning-length strata.
  2. Independent answer and solver-accuracy verification on a fixed multilingual evaluation sample.
  3. Semantic equivalence checks focused on long, multi-chunk traces.
  4. Review of low-yield languages and systematic retry/fallback-model adjudication.
  5. PII and broader safety screening appropriate to the intended training use.

Reproducibility

The translation design, launch settings, and analysis scripts are maintained in the OpenEuroLLM reasoning-trace translation project. The pilot is append-only and resumable; accepted and rejected rows are stable, while failed source/language pairs can be retried with a fallback translator in a future version. A later release should use a new version tag and must not silently replace accepted text from this snapshot.

Citation

@misc{openeurollm_reasoning_traces_translategemma_pilot_2026,
  title        = {OpenEuroLLM Multilingual Mathematical Reasoning Traces: TranslateGemma Pilot},
  author       = {{OpenEuroLLM contributors}},
  year         = {2026},
  howpublished = {Hugging Face dataset},
  note         = {Private v0.1-pilot staging release}
}

Please also cite the upstream Llama-Nemotron dataset and any source papers requested by its dataset card.

Downloads last month
5