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
2 values
translation_method
stringclasses
1 value
translation_metrics
dict
quality
dict
source_metadata_json
stringclasses
99 values
ccb7ff5dec5b335a726d7411
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nОпростете: $(\\sqrt{5})^4$." }, { "role": "assistant", "content": "<think>\nДобре, трябва да опростя (√5)^4. Хм, да помислим. Спомням си, че когато имате ква...
bg
Bulgarian
nemotron-math-10099
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 51756510742, "load_duration": 243514770, "prompt_eval_count": 679, "prompt_eval_duration": 937348892, "eval_count": 686, "eval_duration": 50175911584, "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.033044846577498, "preserved_token_ratio": 1, "source_copy_ratio": 0.1527114967462039, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-10099", "license": "cc-by-4.0", "pilot_length_stratum": "lt-2k", "pilot_reasoning_chars": 1136, "pilot_stream_index": 10099, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", ...
79c01e34bc5404cf5ef4da1b
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНамерете всички функции \\( f: \\mathbb{R}^+ \\to \\mathbb{R}^+ \\), които удовлетворяват за всички \\( x, y \\in \\mathbb{R}^+ \\),\n\\[ f(x^3 + y) = f(x)^3 + \\frac{f(...
bg
Bulgarian
nemotron-math-10821
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 685934718685, "load_duration": 2616870638, "prompt_eval_count": 8409, "prompt_eval_duration": 11273537998, "eval_count": 9116, "eval_duration": 667056215108, "done_reason": "stop", "host": "http://127.0.0.1:11434", "chunk_count": 11, "initial_chunk_count": 11, "request_count": ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.1065437590438931, "preserved_token_ratio": 1, "source_copy_ratio": 0.23875, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-10821", "license": "cc-by-4.0", "pilot_length_stratum": "10k-20k", "pilot_reasoning_chars": 16981, "pilot_stream_index": 10821, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano...
892e467087c3c64055c0d34e
[ { "role": "user", "content": "Решете следния математически проблем. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nЗа уравнението \\(x^2 + 4x + y^2 + 6y = -12\\), намерете центъра на окръжността." }, { "role": "assistant", "content": "<think>\nДобре, нека видим. Трябва да...
bg
Bulgarian
nemotron-math-10952
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 94154430829, "load_duration": 456014950, "prompt_eval_count": 1194, "prompt_eval_duration": 1619859287, "eval_count": 1251, "eval_duration": 91329260901, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 2, "initial_chunk_count": 2, "request_count": 2, "...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0988700564971752, "preserved_token_ratio": 1, "source_copy_ratio": 0.2539481996209728, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-10952", "license": "cc-by-4.0", "pilot_length_stratum": "2k-5k", "pilot_reasoning_chars": 2255, "pilot_stream_index": 10952, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano", ...
7d39d4613390aab02feba7f2
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНека $z = z(x, y)$ е неявната функция, дефинирана от уравнението $3e^z + z^3 = x - y + f(x^2y^2, e^{1+2xy})$, където $f$ е диференцируема функция. Определете израза за $...
bg
Bulgarian
nemotron-math-11073
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 263267200115, "load_duration": 967847411, "prompt_eval_count": 3392, "prompt_eval_duration": 4428014111, "eval_count": 3502, "eval_duration": 255834339143, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 4, "initial_chunk_count": 4, "request_count": 4, ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0429887410440122, "preserved_token_ratio": 1, "source_copy_ratio": 0.3990061654550474, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-11073", "license": "cc-by-4.0", "pilot_length_stratum": "5k-10k", "pilot_reasoning_chars": 5286, "pilot_stream_index": 11073, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano",...
18289f9816d777abd830199b
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНамерете всички растящи функции \\( f: \\mathbb{N} \\to \\mathbb{N} \\), такива че \\( f(m \\cdot n) = f(m) \\cdot f(n) \\) и \\( f(2) = 2 \\)." }, { "role": "as...
bg
Bulgarian
nemotron-math-11399
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 469044517767, "load_duration": 1947282750, "prompt_eval_count": 5539, "prompt_eval_duration": 7479077299, "eval_count": 6232, "eval_duration": 456070203779, "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.143054091314573, "preserved_token_ratio": 1, "source_copy_ratio": 0.1707382310984308, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-11399", "license": "cc-by-4.0", "pilot_length_stratum": "10k-20k", "pilot_reasoning_chars": 10432, "pilot_stream_index": 11399, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano...
a8fb0415ec0cf514aee1efeb
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНамерете всички функции \\( f : \\mathbb{R}^+ \\to \\mathbb{R}^+ \\), за които е вярно, че\n\\[ f\\left(\\frac{1}{f(x) + y}\\right) = f(x) + \\frac{f\\left(\\frac{x}{y}\...
bg
Bulgarian
nemotron-math-11428
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{ "total_duration": 477577244442, "load_duration": 1560319666, "prompt_eval_count": 5427, "prompt_eval_duration": 7247442160, "eval_count": 6362, "eval_duration": 465143612446, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 7, "initial_chunk_count": 7, "request_count": 7, ...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0583867320015077, "preserved_token_ratio": 1, "source_copy_ratio": 0.083, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-11428", "license": "cc-by-4.0", "pilot_length_stratum": "gte-20k", "pilot_reasoning_chars": 24556, "pilot_stream_index": 11428, "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", "...
bde77fc6fbc932af5bdc7528
[ { "role": "user", "content": "Решете следната математическа задача. Уверете се, че отговорът (и само отговорът) е поставен в \\boxed{}.\n\nНамерете всички функции \\( f: \\mathbb{R} \\to \\mathbb{R} \\), такива че за всички положителни реални числа \\( x \\), \\( y \\) и \\( z \\) е изпълнено:\n\\[ f(x^2 + ...
bg
Bulgarian
nemotron-math-11535
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
gemma4:31b
faithful_trace_translation
{ "total_duration": 1428681768439, "load_duration": 1564079109, "prompt_eval_count": 10561, "prompt_eval_duration": 15840950889, "eval_count": 12022, "eval_duration": 1404323423530, "done_reason": "stop", "host": "http://127.0.0.1:11435", "chunk_count": 8, "initial_chunk_count": 8, "request_count"...
{ "accepted": true, "reasons": [], "language_confidence": 1, "length_ratio": 1.0633877840909092, "preserved_token_ratio": 1, "source_copy_ratio": 0.11158333333333334, "unexpected_scripts": [], "expected_script_present": true }
{"category": "math", "generator": "Qwen-2.5-32B-Instruct, DeepSeek-R1", "id": "nemotron-math-11535", "license": "cc-by-4.0", "pilot_length_stratum": "gte-20k", "pilot_reasoning_chars": 26226, "pilot_stream_index": 11535, "reasoning": "on", "system_prompt": "detailed thinking on", "used_in_training": "Ultra, Super, Nano...
88a78e92fb583a35f7197630
[{"role":"user","content":"Решете следната математическа задача. У(...TRUNCATED)
bg
Bulgarian
nemotron-math-11537
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{"total_duration":860667527729,"load_duration":4489075053,"prompt_eval_count":10896,"prompt_eval_dur(...TRUNCATED)
{"accepted":true,"reasons":[],"language_confidence":1.0,"length_ratio":1.0960379409149295,"preserved(...TRUNCATED)
"{\"category\": \"math\", \"generator\": \"Qwen-2.5-32B-Instruct, DeepSeek-R1\", \"id\": \"nemotron-(...TRUNCATED)
2954bff996255f92041672ff
[{"role":"user","content":"Решете следния математически проблем. У(...TRUNCATED)
bg
Bulgarian
nemotron-math-11544
nvidia/Llama-Nemotron-Post-Training-Dataset
SFT
math
cc-by-4.0
translategemma:27b
faithful_trace_translation
{"total_duration":144249067204,"load_duration":646965509,"prompt_eval_count":1774,"prompt_eval_durat(...TRUNCATED)
{"accepted":true,"reasons":[],"language_confidence":1.0,"length_ratio":1.0695006747638327,"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 — Two-Stage Pilot

Release status: private v0.2-pilot staging dataset. All published rows passed the deterministic translation gates described below. This pilot has not yet completed a systematic native-speaker audit or independent downstream-solver verification and is not a final production training release.

This dataset contains 3,425 accepted translations sampled from 100 mathematical reasoning traces into 37 non-English OpenEuroLLM target languages. Accepted rows represent 99 source problems: the remaining source, nemotron-math-13867, had malformed source <think> tags and therefore produced no accepted translation in any target language. Each published row preserves an already-solved source problem, its step-by-step <think> trace, and final answer. Translation was performed faithfully; the translation models were instructed not to solve the problem again.

The release combines a primary TranslateGemma campaign with a Gemma 4 fallback pass over every source/language pair that did not pass the primary campaign. English passthrough rows are not included.

Release summary

Item Value
Release v0.2-pilot
Translation period 2026-07-28 to 2026-08-16
Source problems sampled and attempted 100
Source problems represented in published rows 99
Target languages 37 non-English languages
Attempted source/language pairs 3,700
Accepted and published 3,425 (92.6%)
Final deterministic rejections 208 (5.6%)
Final terminal errors 67 (1.8%)
Likely-untranslated accepted rows 0
Primary-model accepted rows 2,930 (translategemma:27b)
Fallback-model accepted rows 495 (gemma4:31b)
Accepted source license 3,425 × CC BY 4.0
Parquet SHA-256 4670076027dc160fa8408204e7cb651fbcff2062a94209b7ad2f47f59a0a4d37
Parquet download size 14,896,283 bytes

Rejected rows and error logs are not included in the published train split. The 3,700 attempted pairs all have one final accepted, rejected, or error outcome. The final accepted yield is 92.6%, up from 79.2% in v0.1-pilot.

What changed in v0.2

  • Added 495 accepted fallback translations produced by gemma4:31b.
  • Increased accepted coverage from 2,930/3,700 to 3,425/3,700.
  • Preserved every row from v0.1-pilot; fallback output was appended only for previously absent source/language pairs.
  • Recomputed per-language outcomes and dataset metadata.
  • Added release/v0.2-pilot.json with machine-readable counts, provenance, and checksum.

Source data and sampling

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

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

Every published 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 every target language, supporting aligned multilingual comparisons.

Translation procedure

Primary pass

  • Model: translategemma:27b (TranslateGemma 27B, Q4_K_M Ollama build)
  • Hardware: two NVIDIA L4 GPUs, one Ollama worker per GPU
  • Decoding: temperature 0.0
  • Context / generation cap: 4,096 / 4,096 tokens
  • Initial chunk limits: 4,500 source characters and 64 protected spans
  • Prompt style: TranslateGemma-specific
  • Accepted: 2,930/3,700 pairs

Fallback pass

  • Manifest: all 770 pairs not accepted by the primary pass
  • Model: gemma4:31b through Ollama
  • Hardware: two NVIDIA L4 GPUs, one Ollama worker per GPU
  • Context / generation cap: 8,192 / 8,192 tokens
  • Initial chunk limits: 4,500 source characters and 64 protected spans
  • Prompt style: generic chunked translation
  • Accepted: 495/770 pairs
  • Rejected: 208/770 pairs
  • Terminal errors: 67/770 pairs

Both passes used faithful_trace_translation. Long documents were translated in semantic chunks, reassembled, and accepted only after deterministic validation. Runtime values in translation_metrics are Ollama nanoseconds. Internal host values document the worker used and are not stable public endpoints.

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 structural markers;
  6. a plausible translated/source length ratio; and
  7. no high source-copy similarity indicating an untranslated output.

No accepted row crossed the likely-untranslated threshold. Final fallback rejection flags were unexpected script: 177, malformed source think tags: 37, expected script missing: 7, protected token loss: 1. A rejected row may carry more than one flag, so flag counts need not sum to the number of rejected rows. Representative terminal errors were protected-placeholder mismatches and generation-cap exhaustion. These gates detect structural and linguistic failures; they do not prove semantic equivalence or mathematical correctness of every intermediate statement.

Final per-language outcomes

Each language had 100 attempted source traces. Error denotes a pair that did not produce an accepted or deterministically rejected fallback result. Only accepted rows are published.

Language Accepted Rejected Error
Bulgarian (bg) 96 2 2
Bosnian (bs) 95 3 2
Catalan (ca) 97 1 2
Czech (cs) 94 5 1
Welsh (cy) 82 14 4
Danish (da) 99 1 0
German (de) 99 1 0
Greek (el) 86 11 3
Spanish (es) 99 1 0
Estonian (et) 79 18 3
Basque (eu) 77 15 8
Finnish (fi) 96 2 2
French (fr) 99 1 0
Irish (ga) 78 13 9
Galician (gl) 94 4 2
Croatian (hr) 94 4 2
Hungarian (hu) 78 19 3
Icelandic (is) 94 4 2
Italian (it) 98 1 1
Luxembourgish (lb) 90 6 4
Lithuanian (lt) 86 12 2
Latvian (lv) 89 10 1
Macedonian (mk) 99 1 0
Maltese (mt) 81 15 4
Dutch (nl) 99 1 0
Norwegian (no) 99 1 0
Polish (pl) 97 2 1
Portuguese (pt) 98 1 1
Romanian (ro) 95 3 2
Russian (ru) 97 1 2
Slovak (sk) 90 9 1
Slovenian (sl) 87 13 0
Albanian (sq) 99 1 0
Serbian (sr) 89 9 2
Swedish (sv) 98 1 1
Turkish (tr) 99 1 0
Ukrainian (uk) 99 1 0
Total 3,425 208 67

Dataset structure

The dataset has one train split containing conversational SFT rows. The translated user message contains the problem; the assistant message contains 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 Translated 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 Timing, token, worker, chunk, retry, and placeholder metadata.
quality Automated gate decision and language/length/preservation signals.
source_metadata_json Lossless upstream metadata serialized as JSON.

Licensing and attribution

All 3,425 published 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.

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 mathematical reasoning.
  • Source traces and their translations are model-generated, 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 detection.
  • 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.
  • Coverage varies by language and missing pairs are not random; long traces and protected-token handling caused a substantial share of failures.
  • Two translation models and prompt styles are present; consumers can filter on translation_model when a homogeneous subset is required.

Validation still required before public release

  1. Stratified native-speaker review across language families and reasoning-length strata.
  2. Independent answer and solver-accuracy verification on a fixed multilingual sample.
  3. Semantic-equivalence checks focused on long, multi-chunk traces.
  4. Targeted review of low-coverage languages and fallback-model rows.
  5. PII and broader safety screening appropriate to the intended training use.

Reproducibility and versioning

v0.2-pilot is append-only relative to v0.1-pilot: all original accepted text is preserved and only newly accepted fallback rows are added. Stable IDs are derived from the source/language pair. Use translation_model and translation_metrics.prompt_style to distinguish stages. The machine-readable release manifest records exact counts and the Parquet checksum.

Citation

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

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

Downloads last month
16