DN-MOPD
Collection
Beyond Teacher Assignment: Domain-Normalized Multi-Teacher On-Policy Distillation. Data and models. • 2 items • Updated
Datasets:
Tasks:
Text Generation
Modalities:
Text
Formats:
json
Languages:
English
Size:
10K - 100K
ArXiv:
Tags:
on-policy-distillation
multi-teacher-distillation
reinforcement-learning
math
code
instruction-following
License:
prompt listlengths 1 1 | label stringlengths 1 10.8M | domain stringclasses 3
values | teacher stringclasses 3
values | metadata dict |
|---|---|---|---|---|
[
{
"role": "user",
"content": "Give practical advice about learning to swim.\n\nFollow ALL of these requirements exactly:\n- Begin your answer with \"In short:\".\n- Answer in exactly 2 paragraphs separated by a blank line."
}
] | [{"type": "starts_with", "value": "In short:"}, {"type": "paragraph_count", "n": 2}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 682
} |
[
{
"role": "user",
"content": "Evaluate the line integral \\(\\int_C(2ye^{x^2-z}\\cos(y^2)-9xy^2)dy+(12z-e^{x^2-z}\\sin(y^2))dz+(2xe^{x^2-z}\\sin(y^2)-3y^3)dx\\), where \\(C\\) is the broken line path from \\(A(0, \\sqrt{\\pi}, 3)\\) to \\(B(0, \\sqrt{\\frac{\\pi}{2}}, -1)\\) passing through the points \\((0... | e - 48 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 13934
} |
[
{
"role": "user",
"content": "Explain why someone might find winter mornings memorable.\n\nFollow ALL of these requirements exactly:\n- Answer in exactly 2 paragraphs separated by a blank line.\n- Your answer must not contain the word \"quietly\"."
}
] | [{"type": "paragraph_count", "n": 2}, {"type": "must_exclude", "values": ["quietly"]}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 957
} |
[
{
"role": "user",
"content": "Explain the last bus home to someone who has never encountered it.\n\nFollow ALL of these requirements exactly:\n- Begin your answer with \"Here is my reply:\".\n- Write your entire answer in capital letters."
}
] | [{"type": "starts_with", "value": "Here is my reply:"}, {"type": "all_caps"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 4760
} |
[
{
"role": "user",
"content": "In the tensor product \\( \\mathbb{Z}/n\\mathbb{Z} \\otimes_\\mathbb{Z} \\mathbb{Z}/m\\mathbb{Z} \\), where \\( m,n \\neq \\pm 1 \\), does \\( \\bar{a} \\otimes 1 = 0 \\) imply that \\( \\bar{a} = 0 \\)? Justify your answer.\nPlease reason step by step, and put your final answe... | No | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 8981
} |
[
{
"role": "user",
"content": "Write a short note to a friend about a windy balcony.\n\nFollow ALL of these requirements exactly:\n- Your answer must not contain the word \"harbour\", the word \"orange\".\n- Answer as exactly 2 numbered items, like '1. '.\n- Use at least 40 words."
}
] | [{"type": "must_exclude", "values": ["harbour", "orange"]}, {"type": "numbered_count", "n": 2}, {"type": "word_count_min", "n": 40}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 6168
} |
[
{
"role": "user",
"content": "List what someone should know about why shadows lengthen.\n\nFollow ALL of these requirements exactly:\n- Answer as exactly 4 bullet points, each starting with '- '.\n- Your answer must contain the word \"wooden\".\n- Your answer must not contain the word \"lantern\"."
}
] | [{"type": "bullet_count", "n": 4}, {"type": "must_include", "values": ["wooden"]}, {"type": "must_exclude", "values": ["lantern"]}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 5147
} |
[
{
"role": "user",
"content": "Simplify the complex number \\( \\frac{(7+5i\\sqrt{3})^{145}}{(92+48i\\sqrt{3})^{72}} \\) and express your answer in algebraic form.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 7 + 5i\sqrt{3} | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 621
} |
[
{
"role": "user",
"content": "Title: Clique in the Divisibility Graph\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\nAs you must know, the maximum clique problem in an arbitrary graph is *NP*-hard. Nevertheless, for some graphs of specific kinds it can be solved effecti... | {"inputs": ["8\n3 4 6 8 10 18 21 24", "5\n2 3 4 8 16", "2\n10 20", "2\n10 21", "5\n250000 333333 500000 666666 1000000", "50\n1 2 5 7 9 14 19 24 25 29 31 34 37 40 43 44 46 53 54 57 58 59 60 61 62 64 66 68 69 70 72 75 78 79 80 81 82 84 85 86 87 88 89 90 91 92 93 94 96 98", "20\n1 2 4 8 16 32 64 128 256 512 1024 2048 409... | code | code | {
"domain": "code",
"data_source": "codeforces",
"src_index": 19732
} |
[
{
"role": "user",
"content": "Haku Kale now wants to loot in a global scale. For that he needs the help of some underground gang leaders. But the problem is, he does not know the name of any gang leader. After a deep research, he got the name of gang leaders in an encrypted form. After spending months in de... | {"inputs": ["2\n3\nARCTV\nACADAPALA\nZHFGOSM\n4\nFJAOHVG\nAAAAA\nNUWRE\nIAT"], "outputs": ["RAM\nHARI"]} | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 24332
} |
[
{
"role": "user",
"content": "List what someone should know about a broken escalator.\n\nFollow ALL of these requirements exactly:\n- Use at most 60 words.\n- Your answer must contain the word \"wooden\", the word \"lantern\".\n- End your answer with \"THE END\"."
}
] | [{"type": "word_count_max", "n": 60}, {"type": "must_include", "values": ["wooden", "lantern"]}, {"type": "ends_with", "value": "THE END"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 1009
} |
[
{
"role": "user",
"content": "Determine whether a holomorphic function $f: \\mathbb{C} \\to \\mathbb{C}$ that is injective and has finite fibers must necessarily be a polynomial.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 26781
} |
[
{
"role": "user",
"content": "Give practical advice about a stack of unopened mail.\n\nFollow ALL of these requirements exactly:\n- Use at most 160 words.\n- Do not use any commas.\n- Use at least 30 words."
}
] | [{"type": "word_count_max", "n": 160}, {"type": "no_commas"}, {"type": "word_count_min", "n": 30}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 3180
} |
[
{
"role": "user",
"content": "Describe why kites fly without using technical jargon.\n\nFollow ALL of these requirements exactly:\n- Answer in exactly 4 paragraphs separated by a blank line.\n- Do not use any commas."
}
] | [{"type": "paragraph_count", "n": 4}, {"type": "no_commas"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 7259
} |
[
{
"role": "user",
"content": "Determine the values of \\( \\alpha \\) for which the integral \\( \\iint_{\\mathbb{R}^2} \\frac{dx\\,dy}{(x^2 - xy + y^2 + 1)^\\alpha} \\) converges.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | \alpha > 1 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 11425
} |
[
{
"role": "user",
"content": "The New Year celebrations in Berland last n days. Only this year the winter is snowless, that’s why the winter celebrations’ organizers should buy artificial snow. There are m snow selling companies in Berland. Every day the i-th company produces wi cubic meters of snow. Next d... | {"inputs": ["2 3 10\n4 4 4\n5 5 8\n1 2 5\n", "100 2 1000000000\n999999998 999999999\n1000000000 1000000000\n1 1\n", "10 10 100\n7 22 30 18 8 11 29 4 1 15\n739908515 103897339 292149487 627693889 321875108 621026883 878134409 301368128 491776213 273686163\n43011142 9735142 17133115 17374004 17689733 19577498 24702040 12... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 17012
} |
[
{
"role": "user",
"content": "Describe an empty theatre as it would appear to a first-time visitor.\n\nFollow ALL of these requirements exactly:\n- Write your entire answer in capital letters."
}
] | [{"type": "all_caps"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 1800
} |
[
{
"role": "user",
"content": "You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible by m, or tell that it is impossible.\n\nNumbers can be repeated in the original multiset and in the multiset of selected numbers, b... | {"inputs": ["3 3 3\n1 8 4\n", "4 3 5\n2 7 7 7\n", "3 2 3\n1 8 4\n", "15 8 10\n216175135 15241965 611723934 987180005 151601897 403701727 533996295 207637446 875331635 46172555 604086315 350146655 401084142 156540458 982110455\n", "2 2 100000\n0 1\n", "3 2 3\n1 2 3\n", "4 3 3\n5 1 4 7\n", "4 2 6\n5 5 5 5\n", "108 29 72\... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 2546
} |
[
{
"role": "user",
"content": "You are given a permutation p_1, p_2, ..., p_n. Recall that sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.\n\nFind three indices i, j and k such that: \n\n * 1 ≤ i < j < k ≤ n; \n * p_i < p_j and p_j > p_k. \n\nOr say that... | {"inputs": ["3\n4\n2 1 4 3\n6\n4 6 1 2 5 3\n5\n5 3 1 2 4\n", "3\n4\n2 1 4 3\n6\n4 6 1 2 5 3\n5\n5 3 1 2 4\n", "3\n4\n2 1 4 3\n6\n4 10 1 2 5 3\n5\n5 3 1 2 4\n", "3\n4\n2 1 4 3\n6\n4 12 1 2 5 3\n5\n5 7 1 2 4\n", "3\n4\n2 1 4 3\n6\n4 6 1 2 5 3\n5\n5 2 1 2 4\n", "3\n4\n2 1 4 3\n6\n4 6 1 2 5 3\n5\n8 3 1 2 4\n", "3\n4\n2 1 4... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 16870
} |
[
{
"role": "user",
"content": "Show that the process \\( e^{2B_t - 2t} \\) is a martingale with respect to the natural filtration of the Brownian motion \\( B_t \\).\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | e^{2B_t - 2t} | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 17760
} |
[
{
"role": "user",
"content": "Title: Twins\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\nImagine that you have a twin brother or sister. Having another person that looks exactly like you seems very unusual. It's hard to say if having something of an alter ego is good o... | {"inputs": ["2\n3 3", "3\n2 1 2", "1\n5", "5\n4 2 2 2 2", "7\n1 10 1 2 1 1 1", "5\n3 2 3 3 1", "2\n2 1", "3\n2 1 3", "6\n1 1 1 1 1 1", "7\n10 10 5 5 5 5 1", "20\n2 1 2 2 2 1 1 2 1 2 2 1 1 1 1 2 1 1 1 1", "20\n4 2 4 4 3 4 2 2 4 2 3 1 1 2 2 3 3 3 1 4", "20\n35 26 41 40 45 46 22 26 39 23 11 15 47 42 18 15 27 10 45 40", "2... | code | code | {
"domain": "code",
"data_source": "codeforces",
"src_index": 17224
} |
[
{
"role": "user",
"content": "Write a short description of how yeast works.\n\nFollow ALL of these requirements exactly:\n- Use at most 90 words.\n- Answer as exactly 4 bullet points, each starting with '- '."
}
] | [{"type": "word_count_max", "n": 90}, {"type": "bullet_count", "n": 4}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 238
} |
[
{
"role": "user",
"content": "Title: Balanced Substring\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\nYou are given a string *s* consisting only of characters 0 and 1. A substring [*l*,<=*r*] of *s* is a string *s**l**s**l*<=+<=1*s**l*<=+<=2... *s**r*, and its length e... | {"inputs": ["8\n11010111", "3\n111", "11\n00001000100", "10\n0100000000", "13\n0001000011010", "14\n00000100101011", "14\n01111101111111", "18\n110010101101111111", "11\n00010000011", "10\n1000010110", "15\n100000100000011", "18\n011010101110111101", "10\n0011011111", "3\n011", "14\n11111111111111", "65\n11001000110001... | code | code | {
"domain": "code",
"data_source": "codeforces",
"src_index": 2463
} |
[
{
"role": "user",
"content": "Polycarp has built his own web service. Being a modern web service it includes login feature. And that always implies password security problems.\n\nPolycarp decided to store the hash of the password, generated by the following algorithm: take the password $p$, consisting of l... | {
"inputs": [
"5\nabacaba\nzyxaabcaabkjh\nonetwothree\nthreetwoone\none\nzzonneyy\none\nnone\ntwenty\nten\n",
"2\nabacaba\nzyxaabcaabkjh\nonetwothree\nthreetwoone\n",
"1\na\nabcd\n",
"1\ndaaaaaaaa\nbbbbbbbbb\n"
],
"outputs": [
"YES\nYES\nNO\nYES\nNO\n",
"YES\nYES\n",
"YES\n",
"NO\n... | code | code | {
"domain": "code",
"data_source": "apps",
"src_index": 24480
} |
[
{
"role": "user",
"content": "Let $M$ be a right module over a ring $R$ with unity, and let $K \\leq A \\leq M$, where $A$ is a semisimple submodule of $M$ and $K$ is a simple submodule of $M$. Assume that the radical of $M$, $\\text{rad } M$, is zero. Is it true that $K$ is a direct summand of $M$?\nPlease... | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 5142
} |
[
{
"role": "user",
"content": "Let \\( f \\in C^2(\\mathbb{R}) \\) be a function such that \\((f(x))^2 \\le 1\\) and \\((f'(x))^2 + (f''(x))^2 \\le 1\\) for all \\(x \\in \\mathbb{R}\\). Determine whether it is true that \\((f(x))^2 + (f'(x))^2 \\le 1\\) for all \\(x \\in \\mathbb{R}\\).\nPlease reason step ... | True | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 49402
} |
[
{
"role": "user",
"content": "In some well-orderings of the real numbers, if $a$ is the $i$-th smallest number and $b$ is the $j$-th smallest number, is it true that $a+b$ is the $(i+j)$-th smallest number? Answer yes or no.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | No | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 28613
} |
[
{
"role": "user",
"content": "Every number may be factored in prime factors.\n\nFor example, the number 18 may be factored by its prime factors ``` 2 ``` and ```3```\n```\n18 = 2 . 3 . 3 = 2 . 3²\n```\nThe sum of the prime factors of 18 is ```2 + 3 + 3 = 8```\n\nBut some numbers like 70 are divisible by th... | {"fn_name": "mult_primefactor_sum", "inputs": [[10, 100], [80, 150], [90, 200]], "outputs": [[[16, 27, 30, 60, 70, 72, 84]], [[84, 105, 150]], [[105, 150, 180]]]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 3656
} |
[
{
"role": "user",
"content": "Explain why someone might find a lost umbrella memorable.\n\nFollow ALL of these requirements exactly:\n- Answer in exactly 3 paragraphs separated by a blank line."
}
] | [{"type": "paragraph_count", "n": 3}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 6070
} |
[
{
"role": "user",
"content": "Determine whether every subspace of a finite-dimensional vector space can be expressed as a direct summand. Provide a justification for your answer.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 39550
} |
[
{
"role": "user",
"content": "Problem description.\nChef is playing with 'n' set of planes. He notices that when two planes intersects a line is formed. Being that curious guy that chef already is, he wonders as to how many maximum possible line intersections can he obtain with his n set of planes.Given n s... | {"inputs": ["2\n2\n3", "2\n2\n0", "2\n2\n-1", "2\n2\n-2", "2\n0\n-2", "2\n-1\n-4", "2\n0\n-4", "2\n0\n-3", "2\n2\n-3", "2\n4\n-3", "2\n4\n-5", "2\n4\n-2", "2\n3\n-2", "2\n3\n0", "2\n0\n1", "2\n-4\n-2", "2\n-4\n0", "2\n-5\n0", "2\n-1\n-8", "2\n-1\n-5", "2\n0\n-5", "2\n1\n-8", "2\n1\n-11", "2\n2\n-11", "2\n2\n-13", "2\n2... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 2327
} |
[
{
"role": "user",
"content": "Write a simple function that takes polar coordinates (an angle in degrees and a radius) and returns the equivalent cartesian coordinates (rouded to 10 places).\n\n```\nFor example:\n\ncoordinates(90,1)\n=> (0.0, 1.0)\n\ncoordinates(45, 1)\n=> (0.7071067812, 0.7071067812)\n```\n... | {"fn_name": "coordinates", "inputs": [[90, 1], [90, 2], [0, 1], [45, 1], [1090, 10000], [-270, 1]], "outputs": [[[0.0, 1.0]], [[0.0, 2.0]], [[1.0, 0.0]], [[0.7071067812, 0.7071067812]], [[9848.0775301221, 1736.4817766693]], [[0.0, 1.0]]]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 8277
} |
[
{
"role": "user",
"content": "Let $R$ be a commutative ring and $P$ a prime ideal of $R$. Prove or disprove that $\\sqrt{P^{n}} = P$ for all $n \\in \\mathbb{N}$. \nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | \sqrt{P^{n}} = P | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 10139
} |
[
{
"role": "user",
"content": "Determine the Picard group of the projective space over the integers, \\( \\operatorname{Pic}(\\mathbb{P}^n_{\\mathbb{Z}}) \\).\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | \mathbb{Z} | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 18563
} |
[
{
"role": "user",
"content": "Mario is making up silly games again instead of reading Dostoevsky for school. The rules of his newest game follow. First he chooses a random word from the book. Then he splits the word in two arbitrary places to get three separate words. After that he reverses the order of the... | {"inputs": ["dcbagfekjih\n", "mobitel\n", "anakonda\n"], "outputs": ["abcdefghijk\n", "bometil\n", "aanadnok\n"]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 5237
} |
[
{
"role": "user",
"content": "Evaluate the integral \\( \\int_{-\\infty} ^{\\infty} \\frac{x \\sin{3x} }{x^4 +1}dx \\) and express it in the form \\( \\pi^a e^{\\frac{-b}{\\sqrt{c}}}\\sin \\big({\\frac {d}{\\sqrt{e}}}\\big) \\), where \\(a, b, c, d, e\\) are positive integers and \\(c\\) and \\(e\\) are squ... | 11 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 7716
} |
[
{
"role": "user",
"content": "Describe how compasses point north as it would appear to a first-time visitor.\n\nFollow ALL of these requirements exactly:\n- Your answer must contain the word \"lantern\".\n- Write your entire answer in capital letters."
}
] | [{"type": "must_include", "values": ["lantern"]}, {"type": "all_caps"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 7684
} |
[
{
"role": "user",
"content": "Write a short description of the taste of cold water.\n\nFollow ALL of these requirements exactly:\n- Answer in exactly 4 paragraphs separated by a blank line.\n- Answer in exactly 3 sentences.\n- Answer as exactly 2 numbered items, like '1. '."
}
] | [{"type": "paragraph_count", "n": 4}, {"type": "sentence_count", "n": 3}, {"type": "numbered_count", "n": 2}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 6309
} |
[
{
"role": "user",
"content": "Let $R$ be a commutative ring and $P$ be a matrix in $M_n(R)$. If $\\det(P)$ is a zero divisor in $R$, does there exist a nonzero matrix $A$ such that $PA = 0$? Provide a justification for your answer.\nPlease reason step by step, and put your final answer within \\boxed{}."
... | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 50043
} |
[
{
"role": "user",
"content": "Musicians of a popular band \"Flayer\" have announced that they are going to \"make their exit\" with a world tour. Of course, they will visit Berland as well.\n\nThere are n cities in Berland. People can travel between cities using two-directional train routes; there are exact... | {"inputs": ["4 2\n1 2 4\n2 3 7\n6 20 1 25\n", "3 3\n1 2 1\n2 3 1\n1 3 1\n30 10 20\n", "7 7\n1 6 745325\n2 3 3581176\n2 4 19\n3 6 71263060078\n5 4 141198\n7 4 163953\n5 6 15994\n1 297404206755 82096176217 14663411 187389745 21385 704393\n", "4 2\n1 2 7\n2 3 7\n6 20 1 25\n", "4 2\n1 2 4\n2 3 7\n6 20 1 37\n", "3 3\n1 2 2\... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 23091
} |
[
{
"role": "user",
"content": "Describe the hum of power lines without using technical jargon.\n\nFollow ALL of these requirements exactly:\n- Answer in exactly 2 paragraphs separated by a blank line.\n- Include at least 3 placeholders in square brackets, like [name]."
}
] | [{"type": "paragraph_count", "n": 2}, {"type": "placeholder_count", "n": 3}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 981
} |
[
{
"role": "user",
"content": "Write a brief reflection on the last bus home.\n\nFollow ALL of these requirements exactly:\n- Answer as exactly 3 bullet points, each starting with '- '.\n- Wrap your entire answer in << and >>.\n- Write your entire answer in capital letters."
}
] | [{"type": "bullet_count", "n": 3}, {"type": "wrapped_in", "open": "<<", "close": ">>"}, {"type": "all_caps"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 4178
} |
[
{
"role": "user",
"content": "Evaluate the integral \\( \\oint_C \\frac{z^3+2}{z^3-1}\\,dz \\) where \\( C \\) is a circle of radius 2 centered at the origin, using the residue theorem.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 0 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 43606
} |
[
{
"role": "user",
"content": "Title: Simple Molecules\n\nTime Limit: None seconds\n\nMemory Limit: None megabytes\n\nProblem Description:\nMad scientist Mike is busy carrying out experiments in chemistry. Today he will attempt to join three atoms into one molecule.\n\nA molecule consists of atoms, with some... | {"inputs": ["1 1 2", "3 4 5", "4 1 1", "1 1 1", "1000000 1000000 1000000", "3 11 8", "8 5 12", "1000000 500000 1", "1000000 500000 2", "2 2 2", "3 3 3", "4 4 4", "2 4 2", "10 5 14", "10 5 15", "10 4 16", "3 3 6", "9 95 90", "3 5 8", "5 8 13", "6 1 5", "59 54 56", "246 137 940", "7357 3578 9123", "93952 49553 83405", "6... | code | code | {
"domain": "code",
"data_source": "codeforces",
"src_index": 22656
} |
[
{
"role": "user",
"content": "Is it true that for any fixed $t_0 > 0$, there exists a Brownian motion $W^*$ such that for a given Brownian motion $W_t$, we have $W_t = W^*_{t+t_0} - W^*_{t_0}$?\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 37547
} |
[
{
"role": "user",
"content": "Write a function that takes a positive integer and returns the next smaller positive integer containing the same digits.\n\nFor example:\n\n```python\nnext_smaller(21) == 12\nnext_smaller(531) == 513\nnext_smaller(2071) == 2017\n```\n\nReturn -1 (for `Haskell`: return `Nothing`... | {"fn_name": "next_smaller", "inputs": [[21], [907], [531], [1027], [441], [123456798], [513], [351], [315], [153], [135], [100], [2071], [1207], [414], [123456789], [29009], [1234567908], [9999999999], [59884848483559], [1023456789], [51226262651257], [202233445566], [506789]], "outputs": [[12], [790], [513], [-1], [41... | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 4206
} |
[
{
"role": "user",
"content": "Find the maximum area of a hexagon that can be inscribed in the ellipse given by \\( \\frac{x^2}{16} + \\frac{y^2}{9} = 1 \\).\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 18\sqrt{3} | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 17121
} |
[
{
"role": "user",
"content": "In Ann's favorite book shop are as many as n books on math and economics. Books are numbered from 1 to n. Each of them contains non-negative number of problems.\n\nToday there is a sale: any subsegment of a segment from l to r can be bought at a fixed price. \n\nAnn decided tha... | {"inputs": ["4 1\n1 1 1 2\n1 1 1 1\n4\n1 2\n1 3\n1 4\n3 4\n", "4 0\n1 2 1 2\n0 0 0 0\n1\n1 4\n", "2 0\n1 2\n43 43\n3\n1 2\n2 2\n1 1\n", "10 -10\n1 2 1 2 1 1 2 2 2 1\n7 7 10 3 7 10 6 8 0 1\n10\n2 6\n10 10\n6 9\n5 8\n7 10\n2 7\n2 9\n2 7\n5 6\n2 8\n", "10 10\n1 1 1 1 1 2 1 2 1 2\n7 10 2 5 0 1 8 10 1 8\n10\n4 5\n1 3\n6 7\n... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 23941
} |
[
{
"role": "user",
"content": "Describe how pulleys lift as it would appear to a first-time visitor.\n\nFollow ALL of these requirements exactly:\n- End your answer with \"That is all.\".\n- Use at most 120 words."
}
] | [{"type": "ends_with", "value": "That is all."}, {"type": "word_count_max", "n": 120}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 3324
} |
[
{
"role": "user",
"content": "List what someone should know about how thermometers work.\n\nFollow ALL of these requirements exactly:\n- End your answer with \"-- done --\".\n- Begin your answer with \"In short:\"."
}
] | [{"type": "ends_with", "value": "-- done --"}, {"type": "starts_with", "value": "In short:"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 3099
} |
[
{
"role": "user",
"content": "Let $f: \\mathbb{R} \\to \\mathbb{R}$ be an arbitrary function with no assumed properties. Define the set $A = \\{ a \\in \\mathbb{R} : f \\text{ is unbounded on every neighborhood of } a \\}$. Is every $a \\in A$ an isolated point of $A$? Answer yes or no.\nPlease reason step ... | No | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 46966
} |
[
{
"role": "user",
"content": "Today, Wet Shark is given n bishops on a 1000 by 1000 grid. Both rows and columns of the grid are numbered from 1 to 1000. Rows are numbered from top to bottom, while columns are numbered from left to right.\n\nWet Shark thinks that two bishops attack each other if they share t... | {"inputs": ["3\n1 1\n2 3\n3 5\n", "5\n1 1\n1 5\n3 3\n5 1\n5 5\n", "1\n1 1\n", "2\n1000 1\n1000 1000\n", "10\n646 171\n816 449\n375 934\n950 299\n702 232\n657 81\n885 306\n660 304\n369 371\n798 657\n", "3\n259 770\n448 54\n926 667\n", "3\n859 96\n634 248\n808 72\n", "3\n987 237\n891 429\n358 145\n", "2\n1 1\n1000 1\n", ... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 10390
} |
[
{
"role": "user",
"content": "Determine whether the set \\( E' = \\{x \\in [0,1] : |x - \\frac{p}{q}| < q^{-2} \\text{ for finitely many } p,q \\in \\mathbb{N} \\} \\) has Lebesgue measure 0 or 1.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 0 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 22813
} |
[
{
"role": "user",
"content": "Compute the expected value of \\(E[(W_t)^2(W_s)^2]\\), where \\(W_t\\) and \\(W_s\\) are Wiener processes with \\(t > s\\).\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 2s^2 + st | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 31479
} |
[
{
"role": "user",
"content": "Explain why someone might find a forgotten password memorable.\n\nFollow ALL of these requirements exactly:\n- Do not use any commas.\n- Reply with valid JSON and nothing else."
}
] | [{"type": "no_commas"}, {"type": "valid_json"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 6926
} |
[
{
"role": "user",
"content": "Naruto has sneaked into the Orochimaru's lair and is now looking for Sasuke. There are T rooms there. Every room has a door into it, each door can be described by the number n of seals on it and their integer energies a_1, a_2, ..., a_n. All energies a_i are nonzero and do not ... | {"inputs": ["2\n2\n1 100\n4\n1 2 3 6\n", "2\n2\n1 100\n4\n1 2 3 6\n", "6\n6\n-1 1 1 1 1 1\n6\n1 -1 1 1 1 1\n6\n1 1 -1 1 1 1\n6\n1 1 1 -1 1 1\n6\n1 1 1 1 -1 1\n6\n1 1 1 1 1 -1\n", "2\n2\n1 110\n4\n1 2 3 6\n", "6\n6\n-1 1 1 1 1 1\n6\n1 -1 1 1 1 1\n6\n1 1 -1 1 2 1\n6\n1 1 1 -1 1 1\n6\n1 1 1 1 -1 1\n6\n1 1 1 1 1 -1\n", "2\... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 19877
} |
[
{
"role": "user",
"content": "Genos recently installed the game Zuma on his phone. In Zuma there exists a line of n gemstones, the i-th of which has color ci. The goal of the game is to destroy all the gemstones in the line as quickly as possible.\n\nIn one second, Genos is able to choose exactly one contin... | {"inputs": ["3\n1 2 3\n", "3\n1 2 1\n", "7\n1 4 4 2 3 2 1\n", "50\n30 17 31 15 10 3 39 36 5 29 16 11 31 2 38 1 32 40 7 15 39 34 24 11 4 23 9 35 39 32 4 5 14 37 10 34 11 33 30 14 4 34 23 10 34 34 26 34 26 16\n", "2\n1 2\n", "50\n13 17 20 5 14 19 4 17 9 13 10 19 16 13 17 2 18 3 1 9 19 4 19 10 17 12 16 20 10 11 15 10 3 19... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 12311
} |
[
{
"role": "user",
"content": "Congratulations! You are now the judge of a programming contest! You’ve been put in charge of a problem, and since your problem may not have unique correct output, you’ve got to write an output checker for it.\n\nYour problem is called “Good as Goldbach”, and it’s based on the ... | {"inputs": ["10 3 7\n", "10 3 7\n", "314\n159 265\n358\n", "22 19 3\n", "\n\n 60\n \n 29\n \n 31\n\t \n\t \n\t \n\t \n", "fred!\nsam!\ngeorge!\n"], "outputs": ["1\n", "1\n", "0\n", "1\n", "1\n", "0\n"]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 10387
} |
[
{
"role": "user",
"content": "You have $n$ coins, each of the same value of $1$.\n\nDistribute them into packets such that any amount $x$ ($1 \\leq x \\leq n$) can be formed using some (possibly one or all) number of these packets.\n\nEach packet may only be used entirely or not used at all. No packet may b... | {
"inputs": [
"6\n",
"2\n",
"1\n",
"1000000000\n",
"96145460\n",
"47814355\n",
"33554430\n",
"33554431\n",
"33554432\n",
"33554434\n",
"946942894\n",
"40052789\n",
"781222222\n",
"723061816\n",
"108461089\n",
"517188853\n",
"237913214\n",
"952679... | code | code | {
"domain": "code",
"data_source": "apps",
"src_index": 12622
} |
[
{
"role": "user",
"content": "Given that $Y_1$ and $Y_2$ have a bivariate normal distribution with $E(Y_1|Y_2) = 4.7 - 0.16Y_2$ and $E(Y_2|Y_1) = 0.8 - Y_1$, and a conditional variance of 3.64, find the correlation coefficient between $Y_1$ and $Y_2$. Provide your answer as a numerical value.\nPlease reason... | -0.4 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 13907
} |
[
{
"role": "user",
"content": "Explain learning to skate to someone who has never encountered it.\n\nFollow ALL of these requirements exactly:\n- Begin your answer with \"In short:\".\n- Do not use any commas."
}
] | [{"type": "starts_with", "value": "In short:"}, {"type": "no_commas"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 90
} |
[
{
"role": "user",
"content": "You are given an integer n and an integer k.\n\nIn one step you can do one of the following moves: \n\n * decrease n by 1; \n * divide n by k if n is divisible by k. \n\n\n\nFor example, if n = 27 and k = 3 you can do the following steps: 27 → 26 → 25 → 24 → 8 → 7 → 6 → 2 → 1... | {"inputs": ["2\n59 3\n1000000000000000000 10\n", "1\n2 99\n", "3\n99 97\n30 30\n20 25\n", "93\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n2 2\n... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 11078
} |
[
{
"role": "user",
"content": "Find the conditional expectation $E[X|XY]$ where $X$ and $Y$ are independent standard normal random variables.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | 0 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 26607
} |
[
{
"role": "user",
"content": "Two people are playing a game with a string s, consisting of lowercase latin letters. \n\nOn a player's turn, he should choose two consecutive equal letters in the string and delete them. \n\nFor example, if the string is equal to \"xaax\" than there is only one possible turn: ... | {"inputs": ["iiq\n", "abba\n", "abacaba\n", "aa\n", "axxxxbbaaa\n", "pogfjssywv\n", "caabbcd\n", "baaaab\n", "cxxbbc\n", "a\n", "caabbc\n", "abbbbbabba\n", "`a\n", "aaabbxxxxa\n", "pogfjssywu\n", "dcbbaac\n", "baaabb\n", "cbbxxc\n", "`\n", "cbabbc\n", "abbabbbbba\n", "ijq\n", "`bba\n", "abacaca\n", "a`\n", "axabbxaxxa\... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 7094
} |
[
{
"role": "user",
"content": "Let's call an array of non-negative integers $a_1, a_2, \\ldots, a_n$ a $k$-extension for some non-negative integer $k$ if for all possible pairs of indices $1 \\leq i, j \\leq n$ the inequality $k \\cdot |i - j| \\leq min(a_i, a_j)$ is satisfied. The expansion coefficient of t... | {
"inputs": [
"4\n6 4 5 5\n",
"3\n0 1 2\n",
"4\n821 500 479 717\n",
"2\n1000000000 1000000000\n",
"2\n0 0\n",
"3\n1000000000 1000000000 1000000000\n",
"2\n296202684 210139426\n",
"3\n425950796 368258337 278906507\n"
],
"outputs": [
"1",
"0",
"239",
"1000000000",
... | code | code | {
"domain": "code",
"data_source": "apps",
"src_index": 19587
} |
[
{
"role": "user",
"content": "Determine whether a non-Hausdorff compactification of \\(\\mathbb{Z}\\) with two points at infinity, whose neighborhood bases consist of sets with finite complements, is first countable.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 35470
} |
[
{
"role": "user",
"content": "Let $X_1, X_2, \\ldots$ be independent random variables with $\\Pr[X_i = \\sigma_i] = \\Pr[X_i = -\\sigma_i] = 1/2$ for $\\sigma_i \\geq 0$. Assume there exists a lower bound $A > 0$ such that $\\sigma_i > A$ for infinitely many $i$, and no upper bound on $\\sigma_i$. Define $S... | 0 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 45134
} |
[
{
"role": "user",
"content": "A New Alphabet has been developed for Internet communications. While the glyphs of the new alphabet don’t necessarily improve communications in any meaningful way, they certainly make us feel cooler.\n\nYou are tasked with creating a translation program to speed up the switch t... | {"inputs": ["All your base are belong to us.\n", "What's the Frequency, Kenneth?\n", "A new alphabet!\n"], "outputs": ["@11 `/0|_||Z 8@$3 @|Z3 8310[]\\[]6 ']['0 |_|$.\n", "\\/\\/[-]@'][''$ ']['[-]3 #|Z3(,)|_|3[]\\[](`/, |<3[]\\[][]\\[]3']['[-]?\n", "@ []\\[]3\\/\\/ @1|D[-]@83']['!\n"]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 16677
} |
[
{
"role": "user",
"content": "Determine whether there exists a positive integer \\( n \\) such that the fractional part of \\((3 + \\sqrt{5})^n\\) is greater than 0.99.\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | Yes | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 53314
} |
[
{
"role": "user",
"content": "You throw a ball vertically upwards with an initial speed `v (in km per hour)`. The height `h` of the ball at each time `t`\nis given by `h = v*t - 0.5*g*t*t` where `g` is Earth's gravity `(g ~ 9.81 m/s**2)`. A device is recording at every **tenth\nof second** the height of the... | {"fn_name": "max_ball", "inputs": [[37], [45], [99], [85], [136], [52], [16], [127], [137], [14]], "outputs": [[10], [13], [28], [24], [39], [15], [5], [36], [39], [4]]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 21091
} |
[
{
"role": "user",
"content": "Let \\(a, b, c\\) be non-negative real numbers such that \\(a^2 + b^2 + c^2 = 1\\). Determine the maximum value of the expression \\(2\\sqrt{6}ab + 8bc\\).\nPlease reason step by step, and put your final answer within \\boxed{}."
}
] | \sqrt{22} | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 4892
} |
[
{
"role": "user",
"content": "Write a program which counts and reports the number of each alphabetical letter. Ignore the case of characters.\n\nConstraints\n\n* The number of characters in the sentence < 1200\n\nInput\n\nA sentence in English is given in several lines.\n\nOutput\n\nPrints the number of alp... | {"inputs": ["This is a pen.", "This is ` pen.", "This si a pen.", "hTit si a pen.", "hTis ir a pen.", "hTis ri a pdn.", "hTis ri a odn.", "hTis ri a odo.", "hsiT rh a od.o", "Tsih is a od-o", "Tsih is ` od-o", "ihsT it ` od-o", "ihsU it ` od-o", "ihrU it ` od-o", "Uirh it ` p-do", "Uirh ti a p-do", "iUrh ti a q-do", "i... | code | code | {
"domain": "code",
"data_source": "codecontests",
"src_index": 6672
} |
[
{
"role": "user",
"content": "Determine the Hausdorff dimension of the set $A$ of non-recurrent walks on $\\mathbb{Z}$, where walks are identified with infinite binary sequences in the Cantor space $2^\\mathbb{N}$. A non-recurrent walk is defined as a sequence $x$ for which $\\frac{\\sum_{k=1}^n x(k)}{n} = ... | 1 | math | math | {
"domain": "math",
"data_source": "DeepMath-103K",
"src_index": 7955
} |
[
{
"role": "user",
"content": "Describe a bench by the river as it would appear to a first-time visitor.\n\nFollow ALL of these requirements exactly:\n- Write your entire answer in lowercase letters only."
}
] | [{"type": "all_lowercase"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 6226
} |
[
{
"role": "user",
"content": "Give practical advice about the sound of a distant train.\n\nFollow ALL of these requirements exactly:\n- Wrap your entire answer in << and >>.\n- Begin your answer with \"In short:\"."
}
] | [{"type": "wrapped_in", "open": "<<", "close": ">>"}, {"type": "starts_with", "value": "In short:"}] | ifeval | ifeval | {
"domain": "ifeval",
"data_source": "synthetic-ifeval-v1",
"src_index": 352
} |
[
{
"role": "user",
"content": "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 which returns the number of numerical palindrome... | {"fn_name": "palindrome", "inputs": [[2], [141221001], [1551], [13598], ["ACCDDCCA"], ["1551"], [-4505]], "outputs": [[0], [5], [2], [0], ["Not valid"], ["Not valid"], ["Not valid"]]} | code | code | {
"domain": "code",
"data_source": "taco",
"src_index": 16017
} |
[
{
"role": "user",
"content": "Petr likes to come up with problems about randomly generated data. This time problem is about random permutation. He decided to generate a random permutation this way: he takes identity permutation of numbers from $1$ to $n$ and then $3n$ times takes a random pair of different ... | {
"inputs": [
"5\n2 4 5 1 3\n"
],
"outputs": [
"Petr\n"
]
} | code | code | {
"domain": "code",
"data_source": "apps",
"src_index": 13789
} |
End of preview. Expand in Data Studio
DN-MOPD Training Prompts
These are the exact prompt sets used in the Qwen3.5 experiments of Beyond Teacher Assignment: Domain-Normalized Multi-Teacher On-Policy Distillation (DN-MOPD).
- Project page: https://lixin.ai/DN-MOPD
- Code: https://github.com/LiXin97/DN-MOPD
- Paper: arXiv:2609.35347
The code repository downloads these files into data/ with the same paths.
Files
| Config | File | Rows | Used by |
|---|---|---|---|
student |
student/train_3domain.jsonl |
2,700 (900 math, 900 code, 900 IF) | every student run: Label, DN-MOPD, single-teacher OPD, uniform pool, dynamic router, annealed injection, the controls, SeqKD-SFT generation |
teacher_math |
teacher/math_train.jsonl |
8,000 | GRPO math teachers |
teacher_code |
teacher/code_train.jsonl |
8,000 (917 MB, mostly test cases) | GRPO code teachers |
teacher_if |
teacher/if_train.jsonl |
8,000 | GRPO instruction-following (IF) teachers |
MANIFEST.json lists the sha256, size, row count and source counts of every file.
ids/student_math_code_ids.json lists the 1,800 math and code prompts selected for the student set.
Row schema
{"prompt": [{"content": "...", "role": "user"}],
"label": "...",
"domain": "math",
"teacher": "math",
"metadata": {"domain": "math", "data_source": "DeepMath-103K", "src_index": 13934}}
| Field | Meaning |
|---|---|
prompt |
One user message. The chat template is applied with enable_thinking=false. In teacher/if_train.jsonl the prompt is a plain string, which the trainer wraps as one user message. |
label |
math: the reference answer, graded by a rule-based math verifier. code: a JSON string {"inputs": [...], "outputs": [...]} of stdin/stdout test cases. IF: a JSON list of verifiable constraints. |
domain / metadata.domain |
math, code or ifeval. It selects the verifier and the teacher, and it is the domain DN-MOPD normalizes over. |
teacher |
The teacher that scores the prompt under label routing; always equal to domain. |
metadata.data_source, metadata.src_index |
The source dataset, and the row's position in its source pool. |
How the files were built
Math pool (57,046 prompts) comes from DeepMath-103K (rev. 5cf055d).
- Questions are deduplicated by text in first-occurrence order.
- A question is kept if any of its occurrences has difficulty ≥ 6.
- Each prompt is followed by the line "Please reason step by step, and put your final answer within \boxed{}."
Code pool (25,276 prompts) is every code row of Eurus-2-RL-Data (rev. 9776b13).
- The system message is dropped.
- Each user message is followed by the line "You need to think first then write the Python code."
IF prompts are 8,000 generated writing tasks.
- Each carries 1–3 verifiable constraints from a closed set of 19 types.
- Every constraint set is checked so that an empty answer fails it.
- No third-party text is used.
Student set.
- Math and code: 900 math and 900 code prompts, chosen before the Qwen3.5 experiments as prompts whose Qwen3-4B pass rate lay in [0.125, 0.875]. The pass rate was measured from 8 samples at temperature 1.0.
- IF: 900 of the IF prompts.
- The combined set was shuffled with seed 42.
Teacher pools start from the student rows of their domain and extend through the source pool to 8,000 rows, skipping duplicates. The IF teacher uses all 8,000 generated prompts.
data/build/build_data.py in the code repository rebuilds all four files byte for byte from the public sources. The one input it cannot recompute is the choice of the 1,800 student math/code prompts, which is published as ids.
Licenses
| Rows | Source | License |
|---|---|---|
| math | zwhe99/DeepMath-103K | MIT |
| code | PRIME-RL/Eurus-2-RL-Data | MIT |
IF (ifeval) |
generated by the DN-MOPD authors | CC BY 4.0 |
MANIFEST.json, ids/ |
DN-MOPD authors | CC BY 4.0 |
Eurus-2-RL-Data draws its code problems from four datasets:
- CodeContests (CC BY 4.0)
- TACO (Apache-2.0)
- APPS (MIT)
- Codeforces submissions (no license stated on its card)
The problem statements originate from competitive-programming sites, and their copyright stays with the original authors. See DATA_LICENSES.md for details.
Some code test cases contain strings that look like IP addresses or access keys. They come from programming problems about parsing such strings and are kept unchanged because the reward uses them.
Citation
@article{li2026dnmopd,
title = {Beyond Teacher Assignment: Domain-Normalized Multi-Teacher On-Policy Distillation},
author = {Li, Xin and Jiang, Hao and Gao, Xin and Wang, Annan and Xie, Yuchen and Guo, Jinghao and Qu, Xingwei and Zhang, Yichi and Yuen, Chau},
journal = {arXiv preprint arXiv:2609.35347},
year = {2026},
url = {https://arxiv.org/abs/2609.35347}
}
Please also cite the upstream datasets:
- DeepMath-103K (He et al., 2025)
- Eurus-2-RL-Data / PRIME (Cui et al., 2025)
- CodeContests (Li et al., 2022)
- TACO (Li et al., 2023)
- APPS (Hendrycks et al., 2021)
- Downloads last month
- -