id string	prompt string	responses list	split_group string	source dict
nemotron_math_low:00cd7a54331876266e06	Solve the following math problem. Make sure to put the answer (and only answer) inside \boxed{}. Given a sequence $(a_n)_{n\in\mathbb{N}}$ and $\mu, \rho\in\mathbb{R}^+$, with the conditions $\sum_{i=0}^{+\infty}a_i=1$, $\sum_{i=0}^{+\infty}i.a_i=\mu$, and $\sum_{i=0}^{+\infty}i^2.a_i=\rho^2+\mu^2$, what is the maximu...	[ { "cot": "We need maximize entropy given mean and second moment constraints. It's a discrete distribution over nonnegative integers. Max entropy under given mean and variance is a truncated? Actually max entropy distribution with given mean and variance over nonnegative integers is a discrete Gaussian? But supp...	text:f879d8e55ca65967cca14ab0ba16c724	{ "dataset": "nvidia/Nemotron-Math-v2", "source": "nemotron_math_low", "bucket": "nemotron_math_low", "row": 298 }
nemotron_math_low:00a3c965d549f8c54722	Solve the following math problem. Make sure to put the answer (and only answer) inside \boxed{}. Let $ n $ be a positive integer with $ d $ digits, all different from zero. For $ k = 0, \ldots, d - 1 $, define $ n_k $ as the number obtained by moving the last $ k $ digits of $ n $ to the beginning. Define ...	[ { "cot": "We need probability that sum of counts for multiples of 2,3,5 equals 2d. For each k (0..d-1), n_k is some rotation. For a random nonzero-digit number, rotations equally likely? Condition: for each k, check divisibility by 2,3,5. Need total count across all k of being divisible by any of 2,3,5 sum equa...	text:64e779bbad960b6b98b19c46151b0b86	{ "dataset": "nvidia/Nemotron-Math-v2", "source": "nemotron_math_low", "bucket": "nemotron_math_low", "row": 565 }
nemotron_math_low:0030688ebd010261755a	Solve the following math problem. Make sure to put the answer (and only answer) inside \boxed{}. A graph $ G $ is defined as "good" if for every set $ V $ of vertices with cardinality $ m $, and the set $ S $ of all neighbors of vertices in $ V $ with cardinality $ n $, we have $ n \geq m $. What is a ne...	[ { "cot": "We need condition: minimum degree at least 1? Actually Hall's condition for bipartite? For any subset V, its neighbor set size >= \|V\| => graph has a matching that covers all vertices? That's condition for existence of a perfect matching in bipartite graph, but here graph not bipartite. Necessary condi...	text:d750c2facf2da136342ca3e38d70d6fd	{ "dataset": "nvidia/Nemotron-Math-v2", "source": "nemotron_math_low", "bucket": "nemotron_math_low", "row": 891 }
nemotron_math_low:00f8f73cf817c3d62945	Solve the following math problem. Make sure to put the answer (and only answer) inside \boxed{}. In a contest, the test paper consists of 4 multiple-choice questions, each with options $A$, $B$, and $C$. After the exam, the teacher found that for any three test papers, there exists at least one question where the answ...	[ { "cot": "We need max size of set of strings length4 over alphabet {A,B,C} such that any 3 distinct strings have a coordinate where they are all different (i.e., permutation of A,B,C). This is like property that no triple is \"rainbow-free\". Equivalent to code with no \"3-wise covering\". Known problem: maximu...	text:59db69704592c92ef0dda28df847f46d	{ "dataset": "nvidia/Nemotron-Math-v2", "source": "nemotron_math_low", "bucket": "nemotron_math_low", "row": 1011 }
nemotron_math_low:00ef86812ea55d956824	Solve the following math problem. Make sure to put the answer (and only answer) inside \boxed{}. How many ways can $m$ red balls and $n$ blue balls be arranged around a circle?	[ { "cot": "We need number of distinct circular arrangements of m red indistinguishable and n blue indistinguishable balls up to rotation (maybe reflection? Usually around a circle means up to rotation only). Count color sequences length m+n with given numbers modulo cyclic rotations. Number of binary necklaces o...	text:aab3116c9ccf00492e9ef7c98314a35f	{ "dataset": "nvidia/Nemotron-Math-v2", "source": "nemotron_math_low", "bucket": "nemotron_math_low", "row": 3306 }
nemotron_math_low:0012272dd4974bf879ca	"Solve the following math problem. Make sure to put the answer (and only answer) inside \\boxed{}.\n(...TRUNCATED)	[{"cot":"We need natural number solutions. Rearr: a^3 - a^2 + b^3 - b^2 = 2017ab. Factor a^2(a-1)+b^(...TRUNCATED)	text:d6593b40d35ad99d63ccf97622c48590	{"dataset":"nvidia/Nemotron-Math-v2","source":"nemotron_math_low","bucket":"nemotron_math_low","row"(...TRUNCATED)
nemotron_math_low:00933eacbe5a11acdd6e	"Solve the following math problem. Make sure to put the answer (and only answer) inside \\boxed{}.\n(...TRUNCATED)	[{"cot":"We need primes p such that (m^p + p)(n^p + p) is a perfect square infinitely often with m(...TRUNCATED)	text:cb07e5c8df72f836234879fec9dd2183	{"dataset":"nvidia/Nemotron-Math-v2","source":"nemotron_math_low","bucket":"nemotron_math_low","row"(...TRUNCATED)
nemotron_math_low:0017de72ddb1c524c457	"Solve the following math problem. Make sure to put the answer (and only answer) inside \\boxed{}.\n(...TRUNCATED)	[{"cot":"We need quadrilaterals where sum of distances from interior point to the four lines (extens(...TRUNCATED)	text:fa2b666b145148a0008542bc3ccb1b24	{"dataset":"nvidia/Nemotron-Math-v2","source":"nemotron_math_low","bucket":"nemotron_math_low","row"(...TRUNCATED)
nemotron_math_low:0085b4fcd1967b194dce	"Solve the following math problem. Make sure to put the answer (and only answer) inside \\boxed{}.\n(...TRUNCATED)	[{"cot":"We need possible b given a convex combination of points on unit circle and their squares. L(...TRUNCATED)	text:fad408f16d5688072653384f2ff161cb	{"dataset":"nvidia/Nemotron-Math-v2","source":"nemotron_math_low","bucket":"nemotron_math_low","row"(...TRUNCATED)
nemotron_math_low:000f0a127faa5ddf39ff	"Solve the following math problem. Make sure to put the answer (and only answer) inside \\boxed{}.\n(...TRUNCATED)	[{"cot":"We need additive over sums of arguments: sum_{k=1}^n f(k) = f(n(n+1)/2). Let S(n)=sum f(k).(...TRUNCATED)	text:65107fa1c8b19780c355b0967fe04a79	{"dataset":"nvidia/Nemotron-Math-v2","source":"nemotron_math_low","bucket":"nemotron_math_low","row"(...TRUNCATED)

End of preview.

thoughtbase-v2

Text and image prompts, each with one or more reasoning traces and a final response, collected from existing open datasets. Nothing here was generated for this release; rows were filtered, deduplicated and regrouped. Built for non-commercial research.

	count
prompts (train / validation)	2,740,885 / 27,510
reasoning traces (all responses)	4,722,758
image traces	934,278 (19.8%)
image files	45 tar shards under `images/`

Format

train.jsonl and validation.jsonl, one prompt per line:

{"id": "v3_gqa_1:…", "prompt": "What is the color of that vase?…",
 "image_paths": ["images/ab/ab12….jpg"],
 "responses": [{"cot": "The user wants…", "final_answer": "Green", "model": "v3_gqa_1"}],
 "split_group": "image:ab12…", "source": {"dataset": "nvidia/Nemotron-Image-Training-v3", "source": "v3_gqa_1", "row": 17}}

responses holds every distinct trace for the same prompt and images (e.g. several solutions of one math problem). model names the source the trace came from.
Multi-turn source rows become one prompt per turn: earlier turns keep their question and final answer, only the target turn has reasoning.
Grounding answers use <box>[[x1, y1, x2, y2], …]</box> with coordinates on a 0–1000 grid.
About 1% of prompts are in validation, split by image hash or whitespace-normalized prompt, so no image or prompt appears in both splits.
Length limits (Qwen3.5 tokenizer, real token counts): prompt + 256 tokens per image ≤ 4096, cot < 16384, final answer < 4096. Longer items were dropped, not truncated.

Use

hf download JonesLin/thoughtbase-v2 --repo-type dataset --local-dir thoughtbase-v2
cd thoughtbase-v2 && for t in images/*.tar; do tar -xf "$t"; done   # creates images/<sha[:2]>/<sha>.<ext>

Image paths in the JSONL are relative to the folder holding it.

Sources

manifest.json has prompts, responses and drops per source. Main sources (prompts / traces):

group	source	license of the source
math	nvidia/Nemotron-Math-v2 (low, medium)	CC-BY-4.0 / CC-BY-SA-4.0
math, code, Q&A	PrimeIntellect/SYNTHETIC-1 (verified score)	Apache-2.0
code, IF, chat, safety, multilingual	allenai/Dolci-Think-SFT-7B	ODC-BY-1.0
code	open-r1/codeforces-cots	CC-BY-4.0
science	nvidia/Nemotron-Science-v1, nvidia/OpenScienceReasoning-2	CC-BY-4.0
medical	FreedomIntelligence/medical-o1-reasoning-SFT	Apache-2.0
instruction following	nvidia/Nemotron-SFT-Instruction-Following-Chat-v3	mixed, see source
multilingual	nvidia/Nemotron-SFT-Multilingual-v2	CC-BY-4.0 / CC-BY-SA-4.0
chat	nvidia/Llama-Nemotron-Post-Training-Dataset	CC-BY-4.0
images	nvidia/Nemotron-Image-Training-v3 (aokvqa_2, gqa, chartqa, plotqa, figureqa, clevr, mulberry_1/2, flickr30k, toloka, zhwiki_1, unigeo, geometry3k, pmc_vqa, slake_med)	CC-BY-4.0 annotations; ChartQA labels GPL-3.0; zhwiki CC-BY-SA-4.0
images	Fancy-MLLM/R1-Onevision	Apache-2.0
images	remyxai/SpaceThinker (spatial reasoning)	Apache-2.0
images	HuggingFaceM4/A-OKVQA, derek-thomas/ScienceQA, LightChen2333/M3CoT	not stated / CC-BY-SA-4.0 / MIT

Images come from the original releases (COCO, GQA, Flickr30k, ChartQA, FigureQA, CLEVR, PMC-VQA, SLAKE, UniGeo, Geometry3K, Mulberry-SFT and others) and keep their own terms. Flickr30k images are for non-commercial research only. Check each source's license before any other use.

mulberry_2 traces were kept only when their final answer matched Mulberry-SFT's answer.

Downloads last month: 76

Total file size:

103 GB