Datasets:
record_index int64 0 2.85M | input_sha256 stringlengths 64 64 | prompt_sha256 stringlengths 64 64 | dataset stringclasses 14
values | split stringclasses 3
values | source stringclasses 255
values | upstream_id stringlengths 3 111 | bucket stringclasses 6
values | messages_json stringlengths 38 43.3k | prompt stringlengths 8 43.1k | prompt_token_count int64 12 8.18k | generation_seed int64 19,787B 9,223,178,596B | enable_thinking bool 1
class | worker int64 0 7 | executor_worker int64 0 383 | completion stringlengths 273 2.42M | completion_input_ids listlengths 73 32.8k | completion_token_count int64 73 32.8k | finish_reason stringclasses 2
values | stop_reason stringclasses 0
values | sampling_json stringlengths 144 149 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | 4cd10e7f48de72d5ca8ead7e92818225ee4d17a491f8d3c11841493d8aeeebdf | b2e88f0c24b253fcc81f56e0d8cdda2fd7d597a28ad1626f9ec5e74d326259f9 | nvidia/Nemotron-Math-Proofs-v1 | lean | mathstack | 801ee08e-699e-46e9-a19b-f40713a5a5cf | math_reasoning | [{"role":"user","content":"Can axioms (2) and (3) for a vector space be replaced by a single axiom stating $(u + v) + w = v + (u + w)$, where axiom (2) is $u + v = v + u$ (commutativity of vector addition) and axiom (3) is $(u + v) + w = u + (v + w)$ (associativity of vector addition)?"}] | Can axioms (2) and (3) for a vector space be replaced by a single axiom stating $(u + v) + w = v + (u + w)$, where axiom (2) is $u + v = v + u$ (commutativity of vector addition) and axiom (3) is $(u + v) + w = u + (v + w)$ (associativity of vector addition)? | 98 | 2,350,112,525,385,240,600 | true | 0 | 233 | Here's a thinking process that leads to the answer:
1. **Analyze the Request:**
* The user is asking about vector space axioms.
* Specifically, they want to know if the combination of Commutativity ($u+v = v+u$) and Associativity ($(u+v)+w = u+(v+w)$) can be replaced by a single modified axiom: $(u+v)+w =... | [
8160,
579,
264,
7047,
1817,
421,
11177,
310,
279,
4087,
25,
271,
16,
13,
220,
2972,
2014,
53983,
279,
5952,
64700,
198,
262,
348,
256,
561,
1156,
369,
9859,
883,
4471,
3433,
3731,
87069,
13,
198,
262,
348,
256,
43274,
11,
781,
1318,... | 11,492 | stop | null | {"max_tokens":32768,"min_p":0.0,"presence_penalty":1.5,"repetition_penalty":1.0,"seed":2350112525385240655,"temperature":1.0,"top_k":20,"top_p":0.95} |
8 | 19da465f34b9046e98cc03bd9bc6ce934eeee1bf5804639e7675c576e306eb52 | acb5e0dfe76d8bed31a7c8d3c7bea74251d7a9e181735801e261c0c401f6e2d2 | allenai/tulu-3-sft-mixture | train | allenai/tulu-3-sft-personas-math-grade | personas_math_easy_718do1h0opuzm1xqexuk8mj6 | math_reasoning | [{"role":"user","content":"A documentary filmmaker is creating a new film about music eras, inspired by their parents' experiences. Their parents have vivid memories from three distinct music eras: the 70s, 80s, and 90s. The filmmaker plans to dedicate a different number of minutes to each era in their documentary. The... | A documentary filmmaker is creating a new film about music eras, inspired by their parents' experiences. Their parents have vivid memories from three distinct music eras: the 70s, 80s, and 90s. The filmmaker plans to dedicate a different number of minutes to each era in their documentary. They want to allocate 5 minute... | 146 | 1,158,505,509,149,101,300 | true | 0 | 233 | Here's a thinking process that leads to the solution:
1. **Analyze the Request:**
* **Goal:** Determine the duration (in minutes) of three segments in a documentary film.
* **Context:** Music eras (70s, 80s, 90s).
* **Constraints/Conditions:**
* Different number of minutes for each era (im... | [
8160,
579,
264,
7047,
1817,
421,
11177,
310,
279,
6093,
25,
271,
16,
13,
220,
2972,
2014,
53983,
279,
5952,
64700,
198,
262,
348,
256,
2972,
38663,
64700,
28924,
279,
7836,
318,
258,
4276,
8,
314,
2250,
20006,
303,
264,
24164,
4383,
... | 3,422 | stop | null | {"max_tokens":32768,"min_p":0.0,"presence_penalty":1.5,"repetition_penalty":1.0,"seed":1158505509149101309,"temperature":1.0,"top_k":20,"top_p":0.95} |
16 | 6eef7c95271baf6b0a07530a5d30b33038137708ace315deb921556adb79d1ba | 07e39f63f8e0a9cc2db7ed020a1d8ac47555970d334eaccb9d3cf06c06480ba3 | open-r1/Mixture-of-Thoughts | train | open-r1/OpenR1-Math-220k | 6eef7c95271baf6b0a07530a5d30b33038137708ace315deb921556adb79d1ba | math_reasoning | "[{\"role\":\"user\",\"content\":\"A positive real number $ A $ rounds to 20, and another positive r(...TRUNCATED) | "A positive real number $ A $ rounds to 20, and another positive real number $ B $ rounds to 23. Wha(...TRUNCATED) | 132 | 4,466,572,672,884,949,000 | true | 0 | 233 | "Let $ A $ and $ B $ be positive real numbers.\nThe problem states that $ A $ rounds to 20 and $ B $(...TRUNCATED) | [9764,393,357,393,321,393,417,393,381,6572,1865,4947,13,198,760,3377,5134,421,393,357,393,18937,310,(...TRUNCATED) | 22,301 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":44(...TRUNCATED) |
24 | 0d398a906bd50892cd4dcd5bff363d9126ccd06777d49dcc4d527ece98b5c90a | 032ed27725c75a473085a5cb6968c0850f05510d02c7f58b156748ca865a20ae | nvidia/Nemotron-Math-Proofs-v1 | lean | mathstack | 223ffa6c-9703-5a1a-b817-5507bc500e49 | math_reasoning | "[{\"role\":\"user\",\"content\":\"Consider the maps \\\\( f: U_1 \\\\to \\\\mathbb{R}^2 \\\\) and \(...TRUNCATED) | "Consider the maps \\( f: U_1 \\to \\mathbb{R}^2 \\) and \\( g: U_2 \\to \\mathbb{R}^2 \\), where \\(...TRUNCATED) | 158 | 6,666,357,848,287,119,000 | true | 0 | 233 | "Here's a thinking process that leads to the solution:\n\n1. **Analyze the Problem Statement:**\n\n(...TRUNCATED) | [8160,579,264,7047,1817,421,11177,310,279,6093,25,271,16,13,220,2972,2014,53983,279,21397,21085,6470(...TRUNCATED) | 20,084 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":66(...TRUNCATED) |
32 | 18fc978757b099910d9c5fcb6cd8575fca4f7fa76fba8377353bb1d3cd3297f9 | 67e26abfeb5ad4a2901b8d89f9d29722c39ca4b2ccf51b67d4fae4deb72cefd8 | open-r1/Mixture-of-Thoughts | train | open-r1/OpenR1-Math-220k | 18fc978757b099910d9c5fcb6cd8575fca4f7fa76fba8377353bb1d3cd3297f9 | math_reasoning | "[{\"role\":\"user\",\"content\":\"4・132 There are three unknowns $x, y, z$ satisfying the followi(...TRUNCATED) | "4・132 There are three unknowns $x, y, z$ satisfying the following equations\n$$\\left\\{\\begin{a(...TRUNCATED) | 118 | 6,544,489,971,557,554,000 | true | 0 | 233 | "Here is a thinking process to solve the problem:\n\n1. **Analyze the Given System:**\n The prob(...TRUNCATED) | [8160,369,264,7047,1817,310,11290,279,3377,25,271,16,13,220,2972,2014,53983,279,15767,717,64700,198,(...TRUNCATED) | 10,126 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":65(...TRUNCATED) |
40 | 76691b08dcf253cff23042a329f5beab3f929d83d77ea71552a5a5ea9acc7c4e | 9263f26edf629f57e3d6ade473516a30c8648a1e6f11369ccbe986d7ed91c252 | AI-MO/NuminaMath-1.5 | train | inequalities | 76691b08dcf253cff23042a329f5beab3f929d83d77ea71552a5a5ea9acc7c4e | math_reasoning | "[{\"role\":\"user\",\"content\":\"Example 5.2.2. Suppose that \\\\(a, b, c\\\\) are the side-length(...TRUNCATED) | "Example 5.2.2. Suppose that \\(a, b, c\\) are the side-lengths of a triangle. Prove that\n\\[a^{2} (...TRUNCATED) | 71 | 2,305,908,496,094,920,000 | true | 0 | 233 | "Here's a thinking process that leads to the suggested proof:\n\n1. **Analyze the Request:**\n *(...TRUNCATED) | [8160,579,264,7047,1817,421,11177,310,279,11488,10741,25,271,16,13,220,2972,2014,53983,279,5952,6470(...TRUNCATED) | 32,768 | length | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":23(...TRUNCATED) |
48 | 7f64dd58416a977e0f59e42b5005b740edb71f3b33c3dad933b1f697521e7d04 | 1792eff7a8dd24ace0113d1ac0d04a22994df42e1ea4ba30365d9901e7c62496 | nvidia/Nemotron-Math-Proofs-v1 | lean | mathstack | 6bc76a9b-6e90-53bc-a192-d422435b8d4e | math_reasoning | "[{\"role\":\"user\",\"content\":\"Describe all zero divisors in $\\\\mathbb{Z}_{p^k}$ where $p$ is (...TRUNCATED) | "Describe all zero divisors in $\\mathbb{Z}_{p^k}$ where $p$ is a prime number and $k$ is a natural (...TRUNCATED) | 107 | 8,774,195,447,708,313,000 | true | 0 | 233 | "Here's a thinking process that leads to the description of all zero divisors in $\\mathbb{Z}_{p^k}$(...TRUNCATED) | [8160,579,264,7047,1817,421,11177,310,279,3874,314,660,6942,3319,39852,303,56014,10065,5876,90,57,49(...TRUNCATED) | 7,121 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":87(...TRUNCATED) |
56 | eee3631953427ecdad7dee9e3f70ec1ae32bd8e26ee27bdac9e35d7574409fe6 | 3f95468141613e0346aa93624a6fb72660cde56b4c962eee039dc2aedcfd70b3 | nvidia/Nemotron-Math-Proofs-v1 | lean | mathstack | 3d7e172f-af1f-5eea-9b61-2ee7288cc579 | math_reasoning | "[{\"role\":\"user\",\"content\":\"Show that $\\\\tau=\\\\{\\\\Bbb{R},\\\\emptyset,(q,\\\\infty):q\\(...TRUNCATED) | "Show that $\\tau=\\{\\Bbb{R},\\emptyset,(q,\\infty):q\\in\\Bbb{Q}\\}$ is not a topology on $\\Bbb{R(...TRUNCATED) | 52 | 3,940,684,081,648,681,000 | true | 0 | 233 | "Here's a thinking process that leads to the explanation of why $\\tau=\\{\\Bbb{R},\\emptyset,(q,\\i(...TRUNCATED) | [8160,579,264,7047,1817,421,11177,310,279,15673,314,3069,56014,28190,33289,34521,33,5876,90,49,2069,(...TRUNCATED) | 9,569 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":39(...TRUNCATED) |
64 | fc1ff66935e34b9e133049386e1c9058997fba670e86288a362933364679af2e | 4a196ca5d64167f32dc758ff63344ad2211fdd7a95c5aba9d9924e0fe44a6386 | open-r1/Mixture-of-Thoughts | train | open-r1/OpenR1-Math-220k | fc1ff66935e34b9e133049386e1c9058997fba670e86288a362933364679af2e | math_reasoning | "[{\"role\":\"user\",\"content\":\"8、A number lies between 2013 and 2156, and when divided by $5, (...TRUNCATED) | "8、A number lies between 2013 and 2156, and when divided by $5, 11, 13$ the remainders are the sam(...TRUNCATED) | 60 | 5,160,825,770,595,501,000 | true | 0 | 233 | "Let the number be $N$.\nThe problem states that $2013 < N < 2156$.\nWe are given that $N$ leaves th(...TRUNCATED) | [9764,279,1324,381,393,45,12576,198,760,3377,5134,421,393,17,15,16,18,361,443,361,220,17,16,20,21,12(...TRUNCATED) | 18,587 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":51(...TRUNCATED) |
72 | f0ecd01dc42d42aaed13897c925b7ec91c5756b4d842719192d1c7694dacb62b | 1955399def2655f9ee274bb2771c1a322137dff7cb8d8c1195da0ae60b845c92 | AI-MO/NuminaMath-1.5 | train | cn_k12 | f0ecd01dc42d42aaed13897c925b7ec91c5756b4d842719192d1c7694dacb62b | math_reasoning | "[{\"role\":\"user\",\"content\":\"In the polar coordinate system, given circle $O: \\\\rho = \\\\co(...TRUNCATED) | "In the polar coordinate system, given circle $O: \\rho = \\cos \\theta + \\sin \\theta$ and line $l(...TRUNCATED) | 150 | 2,057,649,062,290,879,000 | true | 0 | 233 | "Here's a thinking process to solve the problem:\n\n1. **Understand the Goal:** The user wants to f(...TRUNCATED) | [8160,579,264,7047,1817,310,11290,279,3377,25,271,16,13,220,2972,15771,2598,279,38622,64700,561,1156(...TRUNCATED) | 10,171 | stop | null | "{\"max_tokens\":32768,\"min_p\":0.0,\"presence_penalty\":1.5,\"repetition_penalty\":1.0,\"seed\":20(...TRUNCATED) |
End of preview. Expand in Data Studio
qwen-9b-3m
Multi-domain SFT-target dataset: ~3,000,000 prompts, each with ONE completion generated offline by Qwen/Qwen3.5-9B (thinking mode). Exported snapshot from an offline queue pipeline; repartitioned into 512 parquet shards.
Columns (21)
record_index, input_sha256, prompt_sha256, dataset, split, source, upstream_id, bucket, messages_json, prompt, prompt_token_count, generation_seed, enable_thinking, worker, executor_worker, completion, completion_input_ids, completion_token_count, finish_reason, stop_reason, sampling_json
Load
from datasets import load_dataset
ds = load_dataset("dipta007/qwen-9b-3m", split="train")
- Downloads last month
- 57