dataset_key large_stringclasses 9
values | messages listlengths 2 26 | images listlengths 0 0 | source large_stringclasses 8
values | source_config large_stringclasses 3
values | source_split large_stringclasses 1
value | task_family large_stringclasses 3
values | is_multimodal bool 1
class | system_prompt_variant large_stringclasses 3
values | sample_weight float64 0.45 8.99 | quality_score float64 0.92 1 | dedup_key large_stringlengths 64 64 | token_length_est int64 11 12k | privacy_redacted bool 1
class | contains_compacted_reasoning bool 1
class | split_group_id large_stringlengths 1 36 | ingest_manifest_id large_stringclasses 9
values | window_id large_stringlengths 40 42 ⌀ |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
opus_reasoning | [
{
"content": [
{
"text": "Out of a batch of 30 apples, 1/6 are considered too small and 1/3 are not ripe. How many apples in the batch are considered perfect?",
"type": "text"
}
],
"role": "user"
},
{
"content": [
{
"text": "## Solution\n\n**Step 1: Find... | [] | nohurry/Opus-4.6-Reasoning-3000x-filtered | default | train | reasoning | false | none | 1.035415 | 1 | c593d5741a301ba956e7f217dc607e7a74e7fa7dd1bc2d3790c52b6970809a49 | 218 | true | false | metamath_1613 | 096ff1867c5329e3 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:\n\n2332 \n110011 \n54322345 \n\nFor a given number `num`, write a function to test if it's a numerical palindrome or no... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | none | 1.077585 | 1 | dce8abc61831f810b7b9387540c46a023307ed76890f04cdda65c0fddb19c439 | 1,549 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "You are a coding and reasoning assistant. Prefer correct, runnable, well-structured solutions and concise explanations.",
"type": "text"
}
],
"role": "system"
},
{
"content": [
{
"text": "A palindrome is a word, phrase, number, ... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | code_default | 1.077585 | 1 | 1562f81cdc6034013ee338d691939bee9784e98b7d9d08d3bdb77d551a8ff2ea | 2,065 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:\n\n2332 \n110011 \n54322345 \n\nFor a given number `num`, write a function to test if it's a numerical palindrome or no... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | none | 1.077585 | 1 | 396db2959d1943f822a0e84e61910417d6bc83ffbc93614b19678b338c5761c7 | 2,310 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:\n\n2332 \n110011 \n54322345 \n\nFor a given number `num`, write a function to test if it's a numerical palindrome or no... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | none | 1.077585 | 1 | fcb4e2433c15d8def4c154d7c689e715f2bab83d6ec7927e3bf5df1dcaf4a8c5 | 1,366 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward as forward. Examples of numerical palindromes are:\n\n2332 \n110011 \n54322345 \n\nFor a given number `num`, write a function to test if it's a numerical palindrome or no... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | none | 1.077585 | 1 | b6285cd316b8f0b412f1fb58b9315a8336329acc10a16b5975b04fbd85cfe715 | 1,283 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | canonical_default | 1.077585 | 1 | 646670b5ed0840fbf4297e396220dbba688de4e6159188d2ad89285dcde47ba2 | 1,735 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | canonical_default | 1.077585 | 1 | ad0c4e03b33630da0112dd9d497ade587f40fe93932f3bb2cee6f7ef1307f41e | 3,139 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "You are a coding and reasoning assistant. Prefer correct, runnable, well-structured solutions and concise explanations.",
"type": "text"
}
],
"role": "system"
},
{
"content": [
{
"text": "A palindrome is a word, phrase, number, ... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | code_default | 1.077585 | 1 | a21c2524727a7d98a864a55f02bfe53d643f9b38ba1a918e0dac7413a713501a | 1,873 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_seed_sft | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | microsoft/rStar-Coder | seed_sft | train | code | false | canonical_default | 1.077585 | 1 | 64a1d8bd4e4b63cc81bc85c077ab4add144382c6096be20db195d24fd709c2b3 | 4,304 | true | false | seed_2453 | 85b1b6df57eb2fd5 | null |
rstar_synthetic_sft | [
{
"content": [
{
"text": "Problem Description:\nA child named Ravi collects stamps in a unique way. He collects stamps in series, and each series starts from a stamp with ID 1 and ends with a stamp with ID equal to the series size. For example, if Ravi collects two series of stamps, the first seri... | [] | microsoft/rStar-Coder | synthetic_sft | train | code | false | none | 0.450746 | 0.92 | e546b5e39f0f4e3204e1fb8ce8f92d4f5b38649738598f08c57a2c21451c9066 | 3,464 | true | false | 3644 | 86c5667d7c2237fe | null |
code_feedback | [
{
"content": [
{
"text": "Develop a Python function, which not only determines if a given string represents a palindrome—meaning it is identical when read forwards and backwards—but also ensures that it includes each English vowel, those being 'a', 'e', 'i', 'o', and 'u'. The function must be capa... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | d647ee5f3ca98e38eff853553e6744202ad1b6f6550b0199e9c286b76dcc44ac | 811 | true | false | 3644 | e7f6b3009edf201c | null |
roman_reasoning | [
{
"content": [
{
"text": "For the Lie algebra sl(2, C), construct the weight diagram for the adjoint representation. Identify the roots and the Weyl group actions. Visualize how the Lie bracket [h, e] = 2e acts as a 'raising operator' in the weight space.",
"type": "text"
}
],
... | [] | Roman1111111/gemini-3-pro-10000x-hard-high-reasoning | default | train | reasoning | false | none | 0.807223 | 1 | d1d8d1cbf7e820f3804c1e025447c5ff6bdc0f4bddf31cfd315527b50a340af9 | 922 | true | false | 3644 | 8fd99e129637c59f | null |
code_feedback | [
{
"content": [
{
"text": "You are working on a medical management system that uses Frappe framework for database operations. Your task is to create a Python function that updates the database based on certain conditions. The database contains two tables: `tabActual` and `tabTreatment Plan`. The fu... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | 14bd70f4a893495daca0bf294fefc156a7f2a6523a0700a1ffaf532a012d020b | 1,257 | true | false | 4263 | e7f6b3009edf201c | null |
code_feedback | [
{
"content": [
{
"text": "Given a huge text data T (up to 1 million characters), locate the first appearing position, the count, and the last appearing position of a specific sequence q in T. Also, implement a function to ignore case sensitivity. For example, T = \"Internationalization\", q = \"t\... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | b01ff24adfef2f7e04fe30ad93a8e7cad5273a283c4e1cdc2975e7881a1c3c9e | 680 | true | false | 23824 | e7f6b3009edf201c | null |
roman_reasoning | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | Roman1111111/gemini-3-pro-10000x-hard-high-reasoning | default | train | reasoning | false | canonical_default | 0.807223 | 1 | 97eb01a1dca22d02402574c592c12ec915e490adfb60e1361fa7fd9cf6dac92c | 1,075 | true | false | 851 | 8fd99e129637c59f | null |
reed_reasoning | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | reedmayhew/gemini-3.1-pro-2048-reasoning-1100x | default | train | reasoning | false | canonical_default | 1.81648 | 1 | 06a5d3a40830a2312566df5d7d4a90ce9209f9e3871fc2b07a224de887893789 | 108 | true | false | 851 | 231cd7ccf5739afe | null |
opus_reasoning | [
{
"content": [
{
"text": "It can be proven that a permutation $$$b$$$ that satisfies the condition above always exists.",
"type": "text"
}
],
"role": "user"
},
{
"content": [
{
"text": "# Theoretical Framework for Permutation Existence Proofs\n\nI notice... | [] | nohurry/Opus-4.6-Reasoning-3000x-filtered | default | train | reasoning | false | none | 1.035415 | 1 | 1674a3a85947fcd2324a275ee55ce229ec4a17ed7d37fa5c9873ceb381cb2f2b | 495 | true | false | drive_minimax_m2.1_questions_15744 | 096ff1867c5329e3 | null |
code_feedback | [
{
"content": [
{
"text": "Create a Python script that implements a Circular Doubly Linked List data structure with the following additional functionalities:\n\n1. Implement a method to insert a node at the beginning of the circular doubly linked list.\n2. Implement a method to insert a node at the... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | 0ef2e9bc547b7d547028ff44877732cf66f7621b5186c7b23c2d40cfd9fe1571 | 3,137 | true | false | 22183 | e7f6b3009edf201c | null |
code_feedback | [
{
"content": [
{
"text": "Design an algorithm to check if two given binary trees are identical, where each node contains an integer value, a character value, and a timestamp value. The algorithm should also compare the character values of the corresponding nodes and return true only if both the in... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | 8817807abcaf816eb728c0ef06fc71051ebf203c2c86500e9ba3688083c0dcb5 | 1,619 | true | false | 21605 | e7f6b3009edf201c | null |
rstar_synthetic_sft | [
{
"content": [
{
"text": "You are a multimodal coding and reasoning assistant. Be accurate, concise, and helpful. For visual tasks, ground answers in the provided image or document. For coding tasks, prefer correct, runnable, well-structured solutions. Do not reveal hidden chain-of-thought or inte... | [] | microsoft/rStar-Coder | synthetic_sft | train | code | false | canonical_default | 0.450746 | 0.92 | 42e103b9c9080618a69e504803917aa26afe0827d644e873fa5c7f099d9b1dd3 | 1,987 | true | false | 6564 | 86c5667d7c2237fe | null |
code_feedback | [
{
"content": [
{
"text": "Write a code to find the product of all odd numbers between 1 and 20.",
"type": "text"
}
],
"role": "user"
},
{
"content": [
{
"text": "Sure, to accomplish this task, I will write a Python script that applies a filter for odd nu... | [] | m-a-p/Code-Feedback | default | train | code | false | none | 0.686092 | 1 | 63d5712b593645c161af79f9345f0a83270100b18c1d3d28b4f9f7e102c5de73 | 681 | true | false | 6564 | e7f6b3009edf201c | null |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 63