name string | instruction string | description string | keywords list | schema_version string | config unknown | metadata unknown | files list | location string |
|---|---|---|---|---|---|---|---|---|
arxiv-answer-verifiers/construct-rm-0704-0918-6-n18 | Construct a counterexample to commutation of two-fold joins and tree initial degeneration with 18 leaves, and report the least join multiplicity.
Use a connected, simple, undirected tree T on vertices 1,...,34. Vertices 1,...,18 must have degree one and all other vertices degree three. Each edge has length one. For i<... | construct/rm_0704_0918__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_0918__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-0918-6-n18",
"version": "0.1.0",
"description": "construct/rm_0704_0918__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_0918__6"
]
}... | {
"subset": "construct",
"family": "rm_0704_0918__6",
"problem_key": "gaussian-tree-grassmann-secant-commutation",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:0704.0918",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": ... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-0918-6-n18 |
arxiv-answer-verifiers/construct-rm-0704-1032-2-m3-p26 | Let x_1,...,x_9 be algebraically independent indeterminates over Q.
For a 3 by 3 array T containing each of the integers 1,...,9 exactly once,
with its rows increasing strictly, define
p_T = product over rows r of product over 1 <= i < j <= 3 of
(x_{T[r,i]} - x_{T[r,j]}). Array indices in this definition start at 1.
A ... | construct/rm_0704_1032__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1032__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-1032-2-m3-p26",
"version": "0.1.0",
"description": "construct/rm_0704_1032__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1032__2"
]
... | {
"subset": "construct",
"family": "rm_0704_1032__2",
"problem_key": "kopeliovich-standard-tableau-coefficients",
"domain": "algebra",
"tier": "research",
"level": "hard",
"source": "arXiv:0704.1032",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-1032-2-m3-p26 |
arxiv-answer-verifiers/construct-rm-0704-1174-2-d4 | Fix Q(x,y,z)=xz-y^2 over C and d=4. Construct two nonzero products L=prod(j=1..d) L_j and L'=prod(j=1..d) L'_j of linear forms with integer coefficients of absolute value at most 1000000. A triple [a,b,c] denotes ax+by+cz and cannot be [0,0,0]. Repeated proportional factors are allowed.
For any factor list F=(F_1,...,F... | construct/rm_0704_1174__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1174__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-1174-2-d4",
"version": "0.1.0",
"description": "construct/rm_0704_1174__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1174__2"
]
},... | {
"subset": "construct",
"family": "rm_0704_1174__2",
"problem_key": "multipole-orbit-type-kernel-dimension",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:0704.1174",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-1174-2-d4 |
arxiv-answer-verifiers/construct-rm-0704-1540-0-k2 | Construct a negative-norm physical state in a twisted sector of an open free-bosonic permutation-type orbifold with K=2 copies of 26 bosons. The metric is g_0=-1, g_i=1 for i=1,...,25. Choose a permutation pi of the copies, an integer d in 1,...,26, and flip in {0,1}. The extra target-space automorphism multiplies coor... | construct/rm_0704_1540__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1540__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-1540-0-k2",
"version": "0.1.0",
"description": "construct/rm_0704_1540__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_1540__0"
]
},... | {
"subset": "construct",
"family": "rm_0704_1540__0",
"problem_key": "permutation-orbifold-extended-no-ghost",
"domain": "algebra",
"tier": "research",
"level": "easy",
"source": "arXiv:0704.1540",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-1540-0-k2 |
arxiv-answer-verifiers/construct-rm-0704-2007-0-n1 | Let k=F_2, the field with two elements. Let
R=(k[x,t,z_1,...,z_1]/J)_m, where m=(x,t,z_1,...,z_1) and
J=(xt, xz_i, tz_i, z_i z_j : 1<=i<=j<=1); xz_i and tz_i are included for every 1<=i<=1.
Let I=(x) in R and M=H_I^0(R)={u in R : x^s u=0 for some integer s>=1}.
The module M is generated by g_0=t and g_i=z_i for 1<=i<=1... | construct/rm_0704_2007__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_2007__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-2007-0-n1",
"version": "0.1.0",
"description": "construct/rm_0704_2007__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_2007__0"
]
},... | {
"subset": "construct",
"family": "rm_0704_2007__0",
"problem_key": "local_cohomology_endomorphism_commutativity",
"domain": "algebra",
"tier": "research",
"level": "easy",
"source": "arXiv:0704.2007",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-2007-0-n1 |
arxiv-answer-verifiers/construct-rm-0704-3727-0-d2 | In R^2, construct two injective affine maps phi_i(x)=A_i x+b_i that are strictly contractive in the Euclidean norm, and a nonempty compact set K satisfying K=phi_1(K) union phi_2(K). Construct a nonempty bounded open convex set U with phi_i(U) contained in U and phi_1(U) intersection phi_2(U) empty, while the self-affi... | construct/rm_0704_3727__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0704_3727__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0704-3727-0-d2",
"version": "0.1.0",
"description": "construct/rm_0704_3727__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0704_3727__0"
]
},... | {
"subset": "construct",
"family": "rm_0704_3727__0",
"problem_key": "self_affine_cosc_not_sosc",
"domain": "analysis",
"tier": "research",
"level": "easy",
"source": "arXiv:0704.3727",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5_4b_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0704-3727-0-d2 |
arxiv-answer-verifiers/construct-rm-0705-3954-0-n2 | Construct a counterexample to the following equivalence in dimension n=2, over the rational field Q.
Choose exactly n nonempty subsets A_1,...,A_n of [n]={1,...,n}. Let U be the distinct exponent vectors of all monomials x_{i_1}...x_{i_n} with i_j in A_j, let R=Q[x^u : u in U], and let C={sum_{u in U} t_u u : t_u>=0}.
... | construct/rm_0705_3954__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0705_3954__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0705-3954-0-n2",
"version": "0.1.0",
"description": "construct/rm_0705_3954__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0705_3954__0"
]
},... | {
"subset": "construct",
"family": "rm_0705_3954__0",
"problem_key": "stefan-conjecture-4-5",
"domain": "algebra",
"tier": "research",
"level": "easy",
"source": "arXiv:0705.3954",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5_4b_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0705-3954-0-n2 |
arxiv-answer-verifiers/construct-rm-0706-1379-0-n10 | For the fixed integer radix n=10, let [n]={0,...,n-1}. Construct
a nonempty period (p_1,...,p_L), 1 <= L <= 16, of permutations of [n]. Each p_j must
have all pairs (r-s,(p_j(r)-p_j(s)) mod (n+1)) distinct as 0 <= s < r < n varies.
Set f_i=p_{1+((i-1) mod L)} for every integer i>=1. For t in [0,1), use its
base-n expan... | construct/rm_0706_1379__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0706_1379__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0706-1379-0-n10",
"version": "0.1.0",
"description": "construct/rm_0706_1379__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0706_1379__0"
]
}... | {
"subset": "construct",
"family": "rm_0706_1379__0",
"problem_key": "digitwise-modulo-costas-real-displacement",
"domain": "combinatorics",
"tier": "research",
"level": "hard",
"source": "arXiv:0706.1379",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0706-1379-0-n10 |
arxiv-answer-verifiers/construct-rm-0706-3425-0-r5-k3 | Let F_5 be the free group on generators x_1,...,x_5. Set Gamma_1(F)=F and Gamma_{i+1}(F)=[Gamma_i(F),F], where [H,F] is generated by hgh^(-1)g^(-1) for h in H and g in F. Let G=F_5/Gamma_4(F_5), the free nilpotent group of rank 5 and class 3. Construct an integer 5 by 5 matrix A such that the endomorphism of G defined ... | construct/rm_0706_3425__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0706_3425__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0706-3425-0-r5-k3",
"version": "0.1.0",
"description": "construct/rm_0706_3425__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0706_3425__0"
]
... | {
"subset": "construct",
"family": "rm_0706_3425__0",
"problem_key": "free_nilpotent_finite_reidemeister",
"domain": "algebra",
"tier": "research",
"level": "hard",
"source": "arXiv:0706.3425",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0706-3425-0-r5-k3 |
arxiv-answer-verifiers/construct-rm-0706-4417-2-k17 | For the fixed parameter k=17, let RR(k) be the least positive integer N such that every 2-coloring of {1,...,N} has positive integers x,y,z,w in that set, all of one color, satisfying x+y+kz=3w. Repeated variable values are allowed. Let P(k)=floor((k+4)/3)^2+C(k). In the following cases all congruences are modulo 9: C(... | construct/rm_0706_4417__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_0706_4417__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0706-4417-2-k17",
"version": "0.1.0",
"description": "construct/rm_0706_4417__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0706_4417__2"
]
}... | {
"subset": "construct",
"family": "rm_0706_4417__2",
"problem_key": "discrepancy_x_plus_y_plus_kz_eq_3w",
"domain": "combinatorics",
"tier": "research",
"level": "easy",
"source": "arXiv:0706.4417",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0706-4417-2-k17 |
arxiv-answer-verifiers/construct-rm-0707-1459-8-n34 | For the fixed level N=34, exhibit a finite certificate of d(2,N)<D(2,N).
Let zeta_N=exp(2*pi*i/N). For positive integers s_1,...,s_k and residues i_1,...,i_k modulo N, with (s_1,i_1)!=(1,0), define
L_N(s_1,...,s_k | i_1,...,i_k)=sum_(n_1>...>n_k>0) zeta_N^(i_1*n_1+...+i_k*n_k)/(n_1^s_1...n_k^s_k).
The weight is s_1+...... | construct/rm_0707_1459__8 | [
"arxiv-answer-verifiers",
"construct",
"rm_0707_1459__8"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0707-1459-8-n34",
"version": "0.1.0",
"description": "construct/rm_0707_1459__8",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0707_1459__8"
]
}... | {
"subset": "construct",
"family": "rm_0707_1459__8",
"problem_key": "weight_two_cyclotomic_mpv_dimension_defect",
"domain": "number_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:0707.1459",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewar... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0707-1459-8-n34 |
arxiv-answer-verifiers/construct-rm-0707-3010-2-d25 | Fix d=25. For every pair of integers 0 <= j < k <= d, let
f_(j,k)(z) = (1/d) product_(t=j)^(k-1) (z-t)(conjugate(z)+d-t), and
D_(j,k)(x,y) = (-1)^(k-j-1) (f_(j,k)(z)-f_(j,k)(conjugate(z)))/(z-conjugate(z)),
where z=x+i*y and f_(j,k)(conjugate(z)) swaps z with conjugate(z) in both factors.
For k-j >= 2 the real zero set... | construct/rm_0707_3010__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_0707_3010__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0707-3010-2-d25",
"version": "0.1.0",
"description": "construct/rm_0707_3010__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0707_3010__2"
]
}... | {
"subset": "construct",
"family": "rm_0707_3010__2",
"problem_key": "pfeifle-binomial-oval-nonindexed-intersection",
"domain": "geometry",
"tier": "research",
"level": "research",
"source": "arXiv:0707.3010",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rew... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0707-3010-2-d25 |
arxiv-answer-verifiers/construct-rm-0708-1695-2-n40 | Construct a complemented semidistributive lattice L with exactly 40 elements whose atomic-cover components are not all isomorphic.
Label the elements 0,...,39; labels need not be a topological ordering. Submit an 40 by 40 matrix order with integer entries 0 or 1, where order[i][j]=1 exactly when i<=j in L. This relatio... | construct/rm_0708_1695__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_0708_1695__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0708-1695-2-n40",
"version": "0.1.0",
"description": "construct/rm_0708_1695__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0708_1695__2"
]
}... | {
"subset": "construct",
"family": "rm_0708_1695__2",
"problem_key": "complemented-semidistributive-regularity",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:0708.1695",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": ... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0708-1695-2-n40 |
arxiv-answer-verifiers/construct-rm-0709-0743-1-n7 | Let X = {1,...,7}. A partial bijection of X is an injective map from a subset of X into X. Encode it by a length-7 array a: a[i-1] is the image of i, or 0 if i is outside the domain. Composition applies the first map and then the second; an undefined intermediate image remains undefined.
Construct a nonempty set S of a... | construct/rm_0709_0743__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_0709_0743__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0709-0743-1-n7",
"version": "0.1.0",
"description": "construct/rm_0709_0743__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0709_0743__1"
]
},... | {
"subset": "construct",
"family": "rm_0709_0743__1",
"problem_key": "inclusion_minimal_semitransitive_unequal_r_classes",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:0709.0743",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0709-0743-1-n7 |
arxiv-answer-verifiers/construct-rm-0709-1570-0-p43-q53-r2963 | For the distinct odd primes p=43, q=53, r=2963, let Phi_{pqr}(x)=sum_{j=0}^{6469008} a_j x^j be the pqr-th cyclotomic polynomial, whose roots are precisely the primitive pqr-th roots of unity. Exhibit a zero-based exponent k with 0<=k<=6469008 and |a_k|>(p+1)/2. The coefficients a_j are integers. Return the instance pr... | construct/rm_0709_1570__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_0709_1570__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0709-1570-0-p43-q53-r2963",
"version": "0.1.0",
"description": "construct/rm_0709_1570__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0709_1570__0"... | {
"subset": "construct",
"family": "rm_0709_1570__0",
"problem_key": "sister_beiter_coefficient_counterexamples",
"domain": "number_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:0709.1570",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0709-1570-0-p43-q53-r2963 |
arxiv-answer-verifiers/construct-rm-0709-3259-5-n6 | Construct a finite simple graph G on the labelled vertex set {1,...,6} with the following two properties.
Define A_G in R^6 to consist of x_i-x_j=0 for every edge {i,j}. Let r_0 be the region containing (1,...,6), and let R_G(q)=sum_r q^d(r,r_0), where d counts the hyperplanes separating the two regions. First, R_G(q) ... | construct/rm_0709_3259__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_0709_3259__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-0709-3259-5-n6",
"version": "0.1.0",
"description": "construct/rm_0709_3259__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_0709_3259__5"
]
},... | {
"subset": "construct",
"family": "rm_0709_3259__5",
"problem_key": "opy-nice-elimination-q-factorization",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:0709.3259",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-0709-3259-5-n6 |
arxiv-answer-verifiers/construct-rm-1104-4534-2-n1 | On T^1=(R/Z)^1, construct real smooth vector fields b_1,b_2 and real smooth initial functions u_01,u_02 for which the viscosity solution of
(u_1)_t+|Du_1-b_1(x)|^2-|b_1(x)|^2+u_1-u_2=0,
(u_2)_t+|Du_2-b_2(x)|^2-|b_2(x)|^2+u_2-u_1=0
does not converge uniformly to a shared real constant as t tends to infinity. No divergen... | construct/rm_1104_4534__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1104_4534__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1104-4534-2-n1",
"version": "0.1.0",
"description": "construct/rm_1104_4534__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1104_4534__2"
]
},... | {
"subset": "construct",
"family": "rm_1104_4534__2",
"problem_key": "weakly_coupled_hj_constant_limit_without_divergence",
"domain": "analysis",
"tier": "research",
"level": "easy",
"source": "arXiv:1104.4534",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1104-4534-2-n1 |
arxiv-answer-verifiers/construct-rm-1309-0643-0-n18 | Construct a finite simple connected undirected graph H on exactly 18 vertices labeled 0,...,17, and a vertex v with the following properties.
The distance d(a,b) is the length of a shortest path. A vertex x is maximally distant from y if d(y,z)<=d(y,x) for every neighbor z of x. Distinct vertices x,y are mutually maxim... | construct/rm_1309_0643__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1309_0643__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1309-0643-0-n18",
"version": "0.1.0",
"description": "construct/rm_1309_0643__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1309_0643__0"
]
}... | {
"subset": "construct",
"family": "rm_1309_0643__0",
"problem_key": "rooted-product-matching-boundary-conjecture",
"domain": "graph_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:1309.0643",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewar... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1309-0643-0-n18 |
arxiv-answer-verifiers/construct-rm-1506-01091-5-s9 | Construct two different probability laws on isomorphism types of simple edge-weighted trees with 3 leaves. Each tree must be a star: one central vertex joined to three distinct leaves. Its three edge lengths must be positive integers summing to 9. Two such stars are isomorphic exactly when their unordered triples of ed... | construct/rm_1506_01091__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1506_01091__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1506-01091-5-s9",
"version": "0.1.0",
"description": "construct/rm_1506_01091__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1506_01091__5"
]
... | {
"subset": "construct",
"family": "rm_1506_01091__5",
"problem_key": "random-tree-length-law-identifiability",
"domain": "probability",
"tier": "research",
"level": "easy",
"source": "arXiv:1506.01091",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": ... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1506-01091-5-s9 |
arxiv-answer-verifiers/construct-rm-1610-03873-4-a10-l20 | Fix a=10, l=20, r=2, and n=l. The vertices are 1,...,l in cyclic order, with indices reduced modulo l to 1,...,l. Let H have exactly the unordered pairs contained in at least one block of a consecutive vertices. An a-clique is a set Q of a distinct vertices for which every pair is an edge of H. An a-clique-free edge su... | construct/rm_1610_03873__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1610_03873__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1610-03873-4-a10-l20",
"version": "0.1.0",
"description": "construct/rm_1610_03873__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1610_03873__4"
... | {
"subset": "construct",
"family": "rm_1610_03873__4",
"problem_key": "hyperweb-tightness",
"domain": "combinatorics",
"tier": "research",
"level": "hard",
"source": "arXiv:1610.03873",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5_4b_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1610-03873-4-a10-l20 |
arxiv-answer-verifiers/construct-rm-1703-03800-0-n8 | Let K_8 be the complete simple undirected graph with vertices 1 through 8. Partition all its 28 edges into the minimum possible number of nonempty layers. Each layer must be planar and have girth at least 4, meaning that it contains no triangle; a forest has girth infinity. A layer may have isolated vertices. Every uno... | construct/rm_1703_03800__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_03800__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-03800-0-n8",
"version": "0.1.0",
"description": "construct/rm_1703_03800__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_03800__0"
]
... | {
"subset": "construct",
"family": "rm_1703_03800__0",
"problem_key": "4_girth_thickness_complete_graph",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:1703.03800",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-03800-0-n8 |
arxiv-answer-verifiers/construct-rm-1703-05929-1-k5 | Construct a counterexample to complete transitivity for the following code, with k=5, q=4, c=3 and n=341.
Use F_4=F_2[a]/(a^2+a+1), encoding 0,1,a,a+1 by the integers 0,1,2,3. Supply a k-by-n matrix H whose columns represent all one-dimensional subspaces of F_4^k exactly once. Its row space must be invariant under righ... | construct/rm_1703_05929__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_05929__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-05929-1-k5",
"version": "0.1.0",
"description": "construct/rm_1703_05929__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_05929__1"
]
... | {
"subset": "construct",
"family": "rm_1703_05929__1",
"problem_key": "cyclic_hamming_concatenation_complete_transitivity",
"domain": "coding_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:1703.05929",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_f... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-05929-1-k5 |
arxiv-answer-verifiers/construct-rm-1703-06262-0-n2 | Work in R^2, with B_1 = {x: |x|<1}. Construct a counterexample to preservation of the upper contact boundary by quadratic blowup for the following hybrid double obstacle problem. Use rational polynomials u, psi of total degree at most 4 and f of total degree at most 2, and rational numbers c>0, M>0.
Define Omega(w)=B_... | construct/rm_1703_06262__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06262__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-06262-0-n2",
"version": "0.1.0",
"description": "construct/rm_1703_06262__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06262__0"
]
... | {
"subset": "construct",
"family": "rm_1703_06262__0",
"problem_key": "double_obstacle_upper_contact_blowup",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1703.06262",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-06262-0-n2 |
arxiv-answer-verifiers/construct-rm-1703-06347-4-q25 | Construct a finite projective plane of order q=25 and a polarity giving a counterexample to this implication: if S or E induces a triangle-free graph, the plane is PG(2,q) and its polarity has exactly q+1 absolute points.
Use points and lines indexed 0,...,650. There are 651 of each. Every line contains q+1 distinct po... | construct/rm_1703_06347__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06347__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-06347-4-q25",
"version": "0.1.0",
"description": "construct/rm_1703_06347__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06347__4"
]
... | {
"subset": "construct",
"family": "rm_1703_06347__4",
"problem_key": "polarity_triangle_free_partition_characterization",
"domain": "discrete_geometry",
"tier": "research",
"level": "hard",
"source": "arXiv:1703.06347",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-06347-4-q25 |
arxiv-answer-verifiers/construct-rm-1703-06690-2-n1 | Construct a counterexample in dimension n=1 to the following avoidance claim: when an Armijo/weak-Wolfe BFGS method minimizes a semi-algebraic strongly convex function with bounded sublevel sets from an absolutely continuous random initial point, every accepted iterate lies in the interior V of the set of twice differe... | construct/rm_1703_06690__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06690__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-06690-2-n1",
"version": "0.1.0",
"description": "construct/rm_1703_06690__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06690__2"
]
... | {
"subset": "construct",
"family": "rm_1703_06690__2",
"problem_key": "bfgs-semialgebraic-C2-avoidance",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1703.06690",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-06690-2-n1 |
arxiv-answer-verifiers/construct-rm-1703-06800-5-d1 | Let H=C^1, with standard basis indexed 0,...,0. Construct a POVM
E_1,...,E_n on H for which the equivalence below fails. You may choose 1<=n<=16.
Each E_alpha must be Hermitian, 0<=E_alpha<=I, and sum_alpha E_alpha=I.
For every unit Psi in H tensor H define p_(alpha,beta)(Psi)=
<Psi|E_alpha tensor E_beta|Psi> and t(Ps... | construct/rm_1703_06800__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06800__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-06800-5-d1",
"version": "0.1.0",
"description": "construct/rm_1703_06800__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_06800__5"
]
... | {
"subset": "construct",
"family": "rm_1703_06800__5",
"problem_key": "conical-design-nonregular-monotone-equivalence",
"domain": "algebra",
"tier": "research",
"level": "easy",
"source": "arXiv:1703.06800",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewar... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-06800-5-d1 |
arxiv-answer-verifiers/construct-rm-1703-07439-5-order04 | Work over the rational polynomial ring R=Q[a0,a1,b0,b1,b2,c0,c1,c2,c3].
Let I be generated by all five 2-by-2 minors of the following three matrices,
together with the polynomial h below:
[[a0*(b0-b2), a1*(b1-b2)], [b0,b1]],
[[a0*(c0-c2), a1*(c1-c2)], [c0,c1]],
[[b0*(c0-c3), b1*(c1-c3), b2*(c2-c3)], [c0,c1,c2]],
h=a0*b... | construct/rm_1703_07439__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_07439__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-07439-5-order04",
"version": "0.1.0",
"description": "construct/rm_1703_07439__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_07439__5"
... | {
"subset": "construct",
"family": "rm_1703_07439__5",
"problem_key": "monin-rana-groebner-degree-count",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:1703.07439",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qw... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-07439-5-order04 |
arxiv-answer-verifiers/construct-rm-1703-07461-0-n3 | Construct a counterexample to an ordinary local error bound for a reversible mass-action reaction network with two species A,B and exactly n=3 distinct reversible reactions. Each complex has between 1 and 3 molecules, and each reaction conserves A+B. Reaction j has reactant vector F[:,j] and product vector R[:,j], for ... | construct/rm_1703_07461__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_07461__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-07461-0-n3",
"version": "0.1.0",
"description": "construct/rm_1703_07461__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_07461__0"
]
... | {
"subset": "construct",
"family": "rm_1703_07461__0",
"problem_key": "mass_conserved_kinetics_metric_subregularity",
"domain": "analysis",
"tier": "research",
"level": "easy",
"source": "arXiv:1703.07461",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-07461-0-n3 |
arxiv-answer-verifiers/construct-rm-1703-08291-4-d5 | Work over the field F_2, with q=2 and r=1. Construct two nonempty sets K_1 and K_2 of distinct nonzero column vectors, spanning F_2^2 and F_2^5, respectively. Each set generates a binary linear code: for a row vector a, its codeword has coordinates a dot x (modulo 2), one for each column x. Every such codeword must hav... | construct/rm_1703_08291__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_08291__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-08291-4-d5",
"version": "0.1.0",
"description": "construct/rm_1703_08291__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_08291__4"
]
... | {
"subset": "construct",
"family": "rm_1703_08291__4",
"problem_key": "projective-divisible-code-embedding-interval",
"domain": "coding_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1703.08291",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-08291-4-d5 |
arxiv-answer-verifiers/construct-rm-1703-08327-2-d128 | For dimension d=128, exhibit finite rational exponents
p,q>d/(d-1) and a certified sequence witnessing failure of a uniform bound
for the spherical maximal operator on L^p(R^d;ell^q). Here
M_S f(x)=sup_{r>0} |integral_{S^{d-1}} f(x-r*theta) d sigma(theta)|,
sigma is normalized surface measure, and ||g||_p=(integral |g|... | construct/rm_1703_08327__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_08327__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-08327-2-d128",
"version": "0.1.0",
"description": "construct/rm_1703_08327__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_08327__2"
]... | {
"subset": "construct",
"family": "rm_1703_08327__2",
"problem_key": "vector_valued_spherical_maximal_full_range",
"domain": "analysis",
"tier": "research",
"level": "medium",
"source": "arXiv:1703.08327",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-08327-2-d128 |
arxiv-answer-verifiers/construct-rm-1703-10741-4-n10 | Construct a finite simple undirected graph G on the labelled vertex set {0,...,9} and an integer r with 2 <= r < 10, such that the minimum degree is exactly floor(10/2) + min{1,r-3} and m(G,r) > r. Here an initially infected set A evolves in simultaneous rounds: every uninfected vertex with at least r infected neighbou... | construct/rm_1703_10741__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1703_10741__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1703-10741-4-n10",
"version": "0.1.0",
"description": "construct/rm_1703_10741__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1703_10741__4"
]
... | {
"subset": "construct",
"family": "rm_1703_10741__4",
"problem_key": "bootstrap_min_degree_small_exceptions_literal_min",
"domain": "graph_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1703.10741",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_f... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1703-10741-4-n10 |
arxiv-answer-verifiers/construct-rm-1704-01562-4-n8 | For n=8, give an exact counterexample to the following rational-function identity for some integer 1<=i<=n:
G(1^(n-i) 0 1^(i-1);q,t,a)=(-qt)^(1-i)(a^(i-1)+a^i).
Here juxtaposition concatenates binary words and 1^j means j copies of 1. G is defined on the empty word and binary words containing a zero by the following re... | construct/rm_1704_01562__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_01562__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-01562-4-n8",
"version": "0.1.0",
"description": "construct/rm_1704_01562__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_01562__4"
]
... | {
"subset": "construct",
"family": "rm_1704_01562__4",
"problem_key": "hogancamp-hook-shadow-literal-normalization",
"domain": "algebra",
"tier": "research",
"level": "hard",
"source": "arXiv:1704.01562",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward":... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-01562-4-n8 |
arxiv-answer-verifiers/construct-rm-1704-01892-2-m10-chi3 | Construct a family of exactly 10 distinct polygonal paths in the plane. Each path consists of one or two nonzero closed straight line segments joined consecutively; specify it by two or three distinct points in traversal order. Intersections at endpoints count as intersections. Its disjointness graph has one vertex per... | construct/rm_1704_01892__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_01892__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-01892-2-m10-chi3",
"version": "0.1.0",
"description": "construct/rm_1704_01892__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_01892__2"
... | {
"subset": "construct",
"family": "rm_1704_01892__2",
"problem_key": "two_segment_disjointness_chi_boundedness",
"domain": "discrete_geometry",
"tier": "research",
"level": "medium",
"source": "arXiv:1704.01892",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-01892-2-m10-chi3 |
arxiv-answer-verifiers/construct-rm-1704-04385-5-e1 | Let e=1, N=2^e=2, and let A_N=F_2[x,y]/(x^N,y^N),
where F_2 is the field with two elements. A polynomial is represented uniquely
as a sum of c_ij x^i y^j with 0<=i,j<N and c_ij in {0,1}.
All polynomial and matrix operations are performed in this quotient ring.
Let H_N be the group of 2 by 2 matrices of determinant one ... | construct/rm_1704_04385__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_04385__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-04385-5-e1",
"version": "0.1.0",
"description": "construct/rm_1704_04385__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_04385__5"
]
... | {
"subset": "construct",
"family": "rm_1704_04385__5",
"problem_key": "weil-restriction-unipotent-borel-exponent",
"domain": "algebra",
"tier": "research",
"level": "easy",
"source": "arXiv:1704.04385",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-04385-5-e1 |
arxiv-answer-verifiers/construct-rm-1704-05115-2-n5 | Construct a symmetric 5-by-5 integer matrix A with zero diagonal and off-diagonal entries between 0 and 9, inclusive, together with a perfect elimination ordering (PEO). An ordering p of vertices [n] is a PEO if A[y,z] >= min(A[x,y], A[x,z]) for every triple occurring in the order x before y before z.
Require that no ... | construct/rm_1704_05115__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_05115__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-05115-2-n5",
"version": "0.1.0",
"description": "construct/rm_1704_05115__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_05115__2"
]
... | {
"subset": "construct",
"family": "rm_1704_05115__2",
"problem_key": "sfs-perfect-elimination-ordering",
"domain": "combinatorics",
"tier": "research",
"level": "easy",
"source": "arXiv:1704.05115",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-05115-2-n5 |
arxiv-answer-verifiers/construct-rm-1704-05335-2-d2 | Construct a certificate that a log-covariance likelihood is not convex.
Let D=2, L=D and n=1. For a real symmetric positive definite D by D
matrix C define f_C(X)=L*tr(X+C exp(-X)) on all complex Hermitian matrices X.
Here exp denotes the matrix exponential, tr the trace. Such C is an admissible
observation because C=e... | construct/rm_1704_05335__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_05335__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-05335-2-d2",
"version": "0.1.0",
"description": "construct/rm_1704_05335__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_05335__2"
]
... | {
"subset": "construct",
"family": "rm_1704_05335__2",
"problem_key": "mulog-log-likelihood-nonconvexity",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1704.05335",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-05335-2-d2 |
arxiv-answer-verifiers/construct-rm-1704-07735-1-n102 | Construct a real unit equiangular tight frame of n=102 vectors in R^51, together with a nonzero vector in its integer span whose norm is strictly less than 1.
Encode the frame by its Seidel matrix S: an n by n symmetric integer matrix with zero diagonal, off-diagonal entries in {-1,1}, and S^2=(n-1)I. Its Gram matrix i... | construct/rm_1704_07735__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07735__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-07735-1-n102",
"version": "0.1.0",
"description": "construct/rm_1704_07735__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07735__1"
]... | {
"subset": "construct",
"family": "rm_1704_07735__1",
"problem_key": "integer_spans_of_real_equiangular_tight_frames",
"domain": "geometry",
"tier": "research",
"level": "hard",
"source": "arXiv:1704.07735",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewa... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-07735-1-n102 |
arxiv-answer-verifiers/construct-rm-1704-07752-7-n4 | Construct two distinct 4 x 4 x 4 alternating sign hypermatrices A and B with equal weighted projections. An alternating sign hypermatrix has entries in {-1,0,1}. On every line obtained by fixing any two of its three indices, the nonzero entries must form a nonempty alternating sequence beginning and ending with +1. Ind... | construct/rm_1704_07752__7 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07752__7"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-07752-7-n4",
"version": "0.1.0",
"description": "construct/rm_1704_07752__7",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07752__7"
]
... | {
"subset": "construct",
"family": "rm_1704_07752__7",
"problem_key": "ashm_projection_noninjectivity",
"domain": "combinatorics",
"tier": "research",
"level": "easy",
"source": "arXiv:1704.07752",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-07752-7-n4 |
arxiv-answer-verifiers/construct-rm-1704-07930-0-k4 | Let k=4, p=2, and s=k+1/2. Construct a one-dimensional counterexample to bounded multiplication on the intrinsic Sobolev-Slobodeckij space W^{s,2}(Omega), in the following finite polynomial representation.
Choose rational numbers a<c<b and set Omega=(a,c) union (c,b), an open subset of R. Choose a polynomial phi(x)=su... | construct/rm_1704_07930__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07930__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-07930-0-k4",
"version": "0.1.0",
"description": "construct/rm_1704_07930__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_07930__0"
]
... | {
"subset": "construct",
"family": "rm_1704_07930__0",
"problem_key": "smooth_multipliers_intrinsic_slobodeckij_arbitrary_open_sets",
"domain": "analysis",
"tier": "research",
"level": "medium",
"source": "arXiv:1704.07930",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"gl... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-07930-0-k4 |
arxiv-answer-verifiers/construct-rm-1704-08184-0-n3-p99of100-l1of10 | Let D={z in C: |z|<1}, n=3, p=99/100, and lambda=1/10. Exhibit a normalized meromorphic f on D with f(0)=0, f'(0)=1, no pole in |z|<p, and |z/f(z)-z(z/f(z))'-1|<lambda for every z in D, whose expansion f(z)=z+sum_{k>=2} a_k*z^k satisfies
|a_n| > p^(1-n)*sum_{j=0}^{n-1}(lambda*p^2)^j.
Use this finite encoding: choose re... | construct/rm_1704_08184__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1704_08184__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1704-08184-0-n3-p99of100-l1of10",
"version": "0.1.0",
"description": "construct/rm_1704_08184__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1704_0... | {
"subset": "construct",
"family": "rm_1704_08184__0",
"problem_key": "meromorphic_U_lambda_coefficient_conjecture",
"domain": "analysis",
"tier": "research",
"level": "easy",
"source": "arXiv:1704.08184",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1704-08184-0-n3-p99of100-l1of10 |
arxiv-answer-verifiers/construct-rm-1705-01758-0-n3 | Construct an integer 3 by 3 matrix A and an integer z for which z belongs to Phi(A) but not Theta(A). Each entry of A and z must lie between -1000000 and 1000000, inclusive. Integer matrices are regarded as complex matrices.
Indices range from 1 to 3. Define r_i = sum_{k != i} |a_ik| and r_i^j = r_i - |a_ij| for j != i... | construct/rm_1705_01758__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1705_01758__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1705-01758-0-n3",
"version": "0.1.0",
"description": "construct/rm_1705_01758__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1705_01758__0"
]
... | {
"subset": "construct",
"family": "rm_1705_01758__0",
"problem_key": "li-li-li-phi-theta-inclusion",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1705.01758",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwe... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1705-01758-0-n3 |
arxiv-answer-verifiers/construct-rm-1705-02658-2-g32 | Let N_0 = {0,1,2,...}. A numerical semigroup is a subset S of N_0 containing 0, closed under addition, with finite complement. Its genus is the number of missing positive integers. In this instance g = 32.
Call S 1-hyperelliptic if exactly one of 2 and 4 belongs to S and 6 belongs to S. Let c be its conductor (the leas... | construct/rm_1705_02658__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1705_02658__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1705-02658-2-g32",
"version": "0.1.0",
"description": "construct/rm_1705_02658__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1705_02658__2"
]
... | {
"subset": "construct",
"family": "rm_1705_02658__2",
"problem_key": "hyperelliptic_canonical_weight_unique_maximizer",
"domain": "number_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1705.02658",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1705-02658-2-g32 |
arxiv-answer-verifiers/construct-rm-1705-05686-6-r1 | Construct a certificate that finite local inverse-system recovery fails at socle degree r=1.
Work over Q, in R=Q[[x,y]], with contraction module Gamma=Q_DP[X,Y]. The monomial x^a y^b sends X^[i]Y^[j] to X^[i-a]Y^[j-b] if i>=a and j>=b, and to zero otherwise. Brackets denote divided powers, so contraction has no factori... | construct/rm_1705_05686__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1705_05686__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1705-05686-6-r1",
"version": "0.1.0",
"description": "construct/rm_1705_05686__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1705_05686__6"
]
... | {
"subset": "construct",
"family": "rm_1705_05686__6",
"problem_key": "local_gorenstein_finite_recovery",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1705.05686",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1705-05686-6-r1 |
arxiv-answer-verifiers/construct-rm-1705-09100-0-p5d1 | Fix N=1, s=3/4, mu2=1, and p=5/1. With these N and s the fractional Sobolev critical exponent is infinity, so p satisfies the required subcritical range. Construct rational mu1>1 and beta>p-1 such that
f(tau)=(1+tau^2)/(mu1+2*beta*tau^p+tau^(2*p))^(1/p), tau>=0,
has local minima at 0 and tau1>0 and local maxima at tau2... | construct/rm_1705_09100__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1705_09100__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1705-09100-0-p5d1",
"version": "0.1.0",
"description": "construct/rm_1705_09100__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1705_09100__0"
]... | {
"subset": "construct",
"family": "rm_1705_09100__0",
"problem_key": "fractional-system-interior-minimum-comparison",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1705.09100",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1705-09100-0-p5d1 |
arxiv-answer-verifiers/construct-rm-1705-10353-10-n6 | For n=6, construct a certificate of a negative elementary-symmetric coefficient as follows.
Use [n]={1,...,n} and interpret vertex indices modulo n. Choose integers a_1,...,a_n
with 0<=a_i<=n-1 and a_i-1<=a_(i+1). Let Gamma have exactly the directed edges
i->i+s for 1<=s<=a_i. A corner is an ordered pair (i,j) absent f... | construct/rm_1705_10353__10 | [
"arxiv-answer-verifiers",
"construct",
"rm_1705_10353__10"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1705-10353-10-n6",
"version": "0.1.0",
"description": "construct/rm_1705_10353__10",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1705_10353__10"
... | {
"subset": "construct",
"family": "rm_1705_10353__10",
"problem_key": "alexandersson_panova_conjecture_46",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1705.10353",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1705-10353-10-n6 |
arxiv-answer-verifiers/construct-rm-1706-00986-15-q3-p2-m1 | Construct an exact certificate of a nontrivial continuous deformation
of the following partial complex Hadamard matrix. Such a matrix has entries
of absolute value one and pairwise orthogonal rows.
Put q=3, p=2, w=exp(2*pi*i/3), and t_0=0, t_1=2. The matrix H has three
rows indexed by a=0,1,2 and six columns indexed b... | construct/rm_1706_00986__15 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_00986__15"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-00986-15-q3-p2-m1",
"version": "0.1.0",
"description": "construct/rm_1706_00986__15",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_00986__15... | {
"subset": "construct",
"family": "rm_1706_00986__15",
"problem_key": "arithmetic_isolation_mcnulty_weigert",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1706.00986",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-00986-15-q3-p2-m1 |
arxiv-answer-verifiers/construct-rm-1706-01212-6-n4-q9 | For n=4, let [n]={1,...,n} and let P have vertices 0,...,8. Its complete list of strict order relations is 0<1, 0<2, 1<2; all other pairs are incomparable. A family consists of distinct subsets of [n]. A copy of P is an injective map from its vertices to sets such that each strict order relation maps to proper inclusio... | construct/rm_1706_01212__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_01212__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-01212-6-n4-q9",
"version": "0.1.0",
"description": "construct/rm_1706_01212__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_01212__6"
... | {
"subset": "construct",
"family": "rm_1706_01212__6",
"problem_key": "trace_closed_poset_arrow",
"domain": "combinatorics",
"tier": "research",
"level": "medium",
"source": "arXiv:1706.01212",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-01212-6-n4-q9 |
arxiv-answer-verifiers/construct-rm-1706-02516-2-m15 | Let m=15. The graph M_(2m) has vertices 1,...,2m, ring edges {i,i+1} with labels modulo 2m, and rung edges {i,i+m} for 1<=i<=m. Its cut polytope is the convex hull in R^(3m) of the vectors delta_S, whose coordinate on an edge is 1 exactly when one endpoint belongs to S.
For an odd divisor t>1 of m, C(m,t) is the cycle... | construct/rm_1706_02516__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_02516__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-02516-2-m15",
"version": "0.1.0",
"description": "construct/rm_1706_02516__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_02516__2"
]
... | {
"subset": "construct",
"family": "rm_1706_02516__2",
"problem_key": "mobius_ladder_cycle_facet_orbits",
"domain": "geometry",
"tier": "research",
"level": "medium",
"source": "arXiv:1706.02516",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"q... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-02516-2-m15 |
arxiv-answer-verifiers/construct-rm-1706-03879-0-n12 | Construct a finite simple undirected connected graph G on vertices 0,...,11, other than the star K_1,11, with tmc(G) <= vmc(G), together with the following exact certificates.
A total coloring assigns colors to all vertices and edges. It is TMC if every pair of vertices has a path whose edges and internal vertices shar... | construct/rm_1706_03879__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_03879__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-03879-0-n12",
"version": "0.1.0",
"description": "construct/rm_1706_03879__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_03879__0"
]
... | {
"subset": "construct",
"family": "rm_1706_03879__0",
"problem_key": "tmc-versus-vmc-nonstar",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1706.03879",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-03879-0-n12 |
arxiv-answer-verifiers/construct-rm-1706-04476-0-m23 | Construct a connected loopless multigraph G on vertices 0,1,2,3,4 with exactly 23 edges, counting parallel edges separately, and a permitted vertex order for which Conditional_Greedy stops with an uncolored edge. Require chi'(G) > Delta(G)+1, where Delta is maximum degree and chi' is the minimum number of colors in a p... | construct/rm_1706_04476__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-04476-0-m23",
"version": "0.1.0",
"description": "construct/rm_1706_04476__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__0"
]
... | {
"subset": "construct",
"family": "rm_1706_04476__0",
"problem_key": "goldberg-conditional-greedy",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:1706.04476",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-04476-0-m23 |
arxiv-answer-verifiers/construct-rm-1706-04476-2-m31 | Construct a connected loopless undirected multigraph G on n=5 vertices, labelled 0,...,4, with exactly m=31 edges counted with multiplicity, and a permitted vertex order for which the following algorithm fails. Give G by a symmetric n by n matrix A of nonnegative integers with zero diagonal; A[u][v] counts parallel edg... | construct/rm_1706_04476__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-04476-2-m31",
"version": "0.1.0",
"description": "construct/rm_1706_04476__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__2"
]
... | {
"subset": "construct",
"family": "rm_1706_04476__2",
"problem_key": "goldberg_conditional_greedy_failure",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1706.04476",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-04476-2-m31 |
arxiv-answer-verifiers/construct-rm-1706-04476-3-w14 | Construct a connected loopless multigraph on vertices 0,1,2,3,4, with at most 6 parallel edges between each pair, together with a vertex order for which the following procedure halts with an uncolored edge. Its density must equal 14 and exceed its maximum degree plus one.
For S a vertex subset of size at least two, le... | construct/rm_1706_04476__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-04476-3-w14",
"version": "0.1.0",
"description": "construct/rm_1706_04476__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_04476__3"
]
... | {
"subset": "construct",
"family": "rm_1706_04476__3",
"problem_key": "goldberg-conditional-greedy",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1706.04476",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-04476-3-w14 |
arxiv-answer-verifiers/construct-rm-1706-05187-5-g4 | Fix g=4. Let Gamma_g be g oriented circles with their
base points identified to one vertex. The group G=(Z_2)^g semidirect S_g
acts by independently reversing circle orientations and by permuting circles.
Let d_g be the smallest d admitting a faithful orthogonal G-action on the
unit sphere S^d and a G-equivariant embed... | construct/rm_1706_05187__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_05187__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-05187-5-g4",
"version": "0.1.0",
"description": "construct/rm_1706_05187__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_05187__5"
]
... | {
"subset": "construct",
"family": "rm_1706_05187__5",
"problem_key": "bouquet_equivariant_sphere_dimension",
"domain": "geometry",
"tier": "research",
"level": "easy",
"source": "arXiv:1706.05187",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-05187-5-g4 |
arxiv-answer-verifiers/construct-rm-1706-05444-3-ell4 | For ell = 4, construct a finite set A of nonnegative integers. It must contain 0, have exactly 32 elements, and have maximum either 162 or 324. Put N = 243. For all x,y,z in A, including repeated elements and with no ordering restriction, the congruence x = 2*y-z (mod N) must imply x=y=z. Also, for every integer r, the... | construct/rm_1706_05444__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_05444__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-05444-3-ell4",
"version": "0.1.0",
"description": "construct/rm_1706_05444__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_05444__3"
]... | {
"subset": "construct",
"family": "rm_1706_05444__3",
"problem_key": "near_modular_power_of_three_maximum",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1706.05444",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-05444-3-ell4 |
arxiv-answer-verifiers/construct-rm-1706-06994-8-n32 | For n=32, let [n]={1,...,n}. Exhibit a nonempty set A of distinct
three-element subsets of [n]. Its lower shadow is the set of all two-element
subsets contained in at least one member of A. The upper shadow of that lower
shadow is the set of all three-element subsets of [n] containing at least one
pair in the lower sha... | construct/rm_1706_06994__8 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_06994__8"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-06994-8-n32",
"version": "0.1.0",
"description": "construct/rm_1706_06994__8",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_06994__8"
]
... | {
"subset": "construct",
"family": "rm_1706_06994__8",
"problem_key": "triple_system_lower_upper_shadow",
"domain": "combinatorics",
"tier": "research",
"level": "medium",
"source": "arXiv:1706.06994",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-06994-8-n32 |
arxiv-answer-verifiers/construct-rm-1706-07085-1-n10 | Construct a finite simple connected undirected graph G on the vertex set {0,...,9} that is not an even cycle and whose Laplacian simplex is 2-reflexive.
The Laplacian is L[i,i]=degree(i), L[i,j]=-1 when {i,j} is an edge, and L[i,j]=0 otherwise. Define n=10, and let V[i,j]=sum(L[i,k] for k=0,...,j), for 0<=i<n and 0<=j<... | construct/rm_1706_07085__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07085__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-07085-1-n10",
"version": "0.1.0",
"description": "construct/rm_1706_07085__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07085__1"
]
... | {
"subset": "construct",
"family": "rm_1706_07085__1",
"problem_key": "noncycle-2-reflexive-laplacian-simplex",
"domain": "discrete_geometry",
"tier": "research",
"level": "research",
"source": "arXiv:1706.07085",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-07085-1-n10 |
arxiv-answer-verifiers/construct-rm-1706-07267-1-h5 | For h = 5, exhibit a compact connected PL 3-manifold M with exactly
h non-spherical boundary components for which D_G(M) != k_bar(M) + G.
Here G is the sum of boundary genera for orientable components and half the
genera for nonorientable components. The sufficient certificate below is the
certificate class accepted in... | construct/rm_1706_07267__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07267__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-07267-1-h5",
"version": "0.1.0",
"description": "construct/rm_1706_07267__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07267__1"
]
... | {
"subset": "construct",
"family": "rm_1706_07267__1",
"problem_key": "gurau_degree_generalized_gem_complexity_boundary",
"domain": "geometry",
"tier": "research",
"level": "easy",
"source": "arXiv:1706.07267",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_re... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-07267-1-h5 |
arxiv-answer-verifiers/construct-rm-1706-07607-9-a5 | A random tree starts with two connected vertices. Each new vertex attaches by one edge to an existing vertex of degree d with probability proportional to f(d). Fix f(1)=5, and let f(j)=b for every integer j>=2, where you must choose a positive rational number b. This is an admissible subclass of bounded positive attach... | construct/rm_1706_07607__9 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07607__9"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-07607-9-a5",
"version": "0.1.0",
"description": "construct/rm_1706_07607__9",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_07607__9"
]
... | {
"subset": "construct",
"family": "rm_1706_07607__9",
"problem_key": "pa-empirical-variance-monotonicity",
"domain": "probability",
"tier": "research",
"level": "research",
"source": "arXiv:1706.07607",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": ... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-07607-9-a5 |
arxiv-answer-verifiers/construct-rm-1706-08076-3-n3 | Construct a counterexample to preservation of balancedness by the following rule on N={1,2,3}.
A transferable-utility game is a function v on all subsets of N, with v(empty)=0. For a payoff x, write x(S)=sum_{i in S} x_i and e(S,x)=v(S)-x(S). The prenucleolus is the efficient payoff x(N)=v(N) that lexicographically min... | construct/rm_1706_08076__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_08076__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-08076-3-n3",
"version": "0.1.0",
"description": "construct/rm_1706_08076__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_08076__3"
]
... | {
"subset": "construct",
"family": "rm_1706_08076__3",
"problem_key": "modified_kohlberg_arbitrary_retained_necessity",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1706.08076",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_f... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-08076-3-n3 |
arxiv-answer-verifiers/construct-rm-1706-08387-1-m10 | Work in the untwisted affine Lie algebra of type D4, with roots normalized to squared length 2. In R^4 the positive finite roots are e_i-e_j and e_i+e_j (1<=i<j<=4), the simple roots are e1-e2,e2-e3,e3-e4,e3+e4, and rho=(3,2,1,0). The root lattice is Q={g in Z^4: sum_i g_i is even}. The finite Weyl group W consists of ... | construct/rm_1706_08387__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1706_08387__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1706-08387-1-m10",
"version": "0.1.0",
"description": "construct/rm_1706_08387__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1706_08387__1"
]
... | {
"subset": "construct",
"family": "rm_1706_08387__1",
"problem_key": "kac_wakimoto_deligne_character_conjecture",
"domain": "algebra",
"tier": "research",
"level": "hard",
"source": "arXiv:1706.08387",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1706-08387-1-m10 |
arxiv-answer-verifiers/construct-rm-1707-03525-5-k8 | Work in SU(2) Chern-Simons theory at the positive integer level k=8.
For a framed link L in S^3, let J_ab(L) be its unreduced Wilson-loop expectation,
normalized by the S^3 vacuum partition function, at q=exp(2*pi*i/(k+2)).
The integrable colors are spins a/2 and b/2, with a,b integers from 0 to k.
For the zero-framed ... | construct/rm_1707_03525__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1707_03525__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1707-03525-5-k8",
"version": "0.1.0",
"description": "construct/rm_1707_03525__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1707_03525__5"
]
... | {
"subset": "construct",
"family": "rm_1707_03525__5",
"problem_key": "su2_link_state_factorization",
"domain": "geometry",
"tier": "research",
"level": "hard",
"source": "arXiv:1707.03525",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1707-03525-5-k8 |
arxiv-answer-verifiers/construct-rm-1707-05766-6-d2-p113 | On T^d = R^d/Z^d, exp(t*Delta) multiplies Fourier frequency
k in Z^d by exp(-4*pi^2*t*sum_i k_i^2). For an N-point set X define
E(X,t) = ||N - sum_{x in X} exp(t*Delta) delta_x||_infinity.
Here d=2, p=113 is prime, and N=q=p^d=12769. The Cartesian p-grid is
Lambda_p={(i_1/p,i_2/p): 0<=i_1,i_2<p}. Exhibit a finite subgr... | construct/rm_1707_05766__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1707_05766__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1707-05766-6-d2-p113",
"version": "0.1.0",
"description": "construct/rm_1707_05766__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1707_05766__6"
... | {
"subset": "construct",
"family": "rm_1707_05766__6",
"problem_key": "torus_heat_cartesian_grid_uniform_optimality",
"domain": "analysis",
"tier": "research",
"level": "hard",
"source": "arXiv:1707.05766",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1707-05766-6-d2-p113 |
arxiv-answer-verifiers/construct-rm-1707-06149-1-n3-y2 | Construct centered spaces on X={0,1,2} and Y={0,1}, with distinguished point x=0.
A centered structure nu assigns to each point z a collection nu(z) of subsets containing z. Collections may be empty; subsets use integer point labels with no repetitions, and no subset may occur twice in a collection.
A map f:X->Y is cen... | construct/rm_1707_06149__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1707_06149__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1707-06149-1-n3-y2",
"version": "0.1.0",
"description": "construct/rm_1707_06149__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1707_06149__1"
... | {
"subset": "construct",
"family": "rm_1707_06149__1",
"problem_key": "centered-restricted-germ-converse",
"domain": "other",
"tier": "research",
"level": "research",
"source": "arXiv:1707.06149",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"q... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1707-06149-1-n3-y2 |
arxiv-answer-verifiers/construct-rm-1707-07302-4-n20 | Construct a non-principal monomial ideal I in Q[x,y] with exactly 20 minimal monomial generators and with mu(I^2) <= mu(I). Here mu(J) is the number of minimal generators of an ideal J, and I^2 is the ideal generated by all products of two generators of I.
Submit exactly 20 distinct pairs [a,b] of nonnegative integers,... | construct/rm_1707_07302__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1707_07302__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1707-07302-4-n20",
"version": "0.1.0",
"description": "construct/rm_1707_07302__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1707_07302__4"
]
... | {
"subset": "construct",
"family": "rm_1707_07302__4",
"problem_key": "bivariate_monomial_ideal_tiny_square",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1707.07302",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1707-07302-4-n20 |
arxiv-answer-verifiers/construct-rm-1707-09677-3-m32 | Let D={z in C: |z|<1}. Give the space A^2(D) of square-integrable
holomorphic functions its inner product from ordinary planar area measure.
Let P be the orthogonal projection from L^2(D) onto A^2(D), and let
T_phi f=P(phi*f). Write S_phi=T_phi^*T_phi-T_phi T_phi^*.
An operator is hyponormal if <S_phi f,f> >= 0 for eve... | construct/rm_1707_09677__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1707_09677__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1707-09677-3-m32",
"version": "0.1.0",
"description": "construct/rm_1707_09677__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1707_09677__3"
]
... | {
"subset": "construct",
"family": "rm_1707_09677__3",
"problem_key": "bergman-hyponormal-toeplitz-image-area",
"domain": "analysis",
"tier": "research",
"level": "medium",
"source": "arXiv:1707.09677",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1707-09677-3-m32 |
arxiv-answer-verifiers/construct-rm-1708-00095-5-p7 | Let p=7 and n=p-1. Arithmetic in coordinates is modulo p.
In PG(2,p), a point is a nonzero vector in F_p^3 up to nonzero scalar multiplication.
A line with vector l consists of the points X satisfying l dot X=0.
The dual plane interchanges points and lines.
Construct a quasigroup on {0,...,n-1} with operation table q[... | construct/rm_1708_00095__5 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00095__5"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-00095-5-p7",
"version": "0.1.0",
"description": "construct/rm_1708_00095__5",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00095__5"
]
... | {
"subset": "construct",
"family": "rm_1708_00095__5",
"problem_key": "triangular-net-isotopy-versus-isomorphism",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1708.00095",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-00095-5-p7 |
arxiv-answer-verifiers/construct-rm-1708-00095-6-p11 | Let p=11, n=p-1, and X={0,...,n-1}. Construct a binary operation
on X whose table A satisfies all of the following. Each row and each column
is a permutation of X, so (X,A) is a quasigroup. There is no e in X such that
A[e][x]=A[x][e]=x for every x in X. Supply three bijections alpha, beta, gamma
from X to {1,...,p-1} ... | construct/rm_1708_00095__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00095__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-00095-6-p11",
"version": "0.1.0",
"description": "construct/rm_1708_00095__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00095__6"
]
... | {
"subset": "construct",
"family": "rm_1708_00095__6",
"problem_key": "quasigroup-ternary-ring-isomorphism-replacement",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:1708.00095",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_re... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-00095-6-p11 |
arxiv-answer-verifiers/construct-rm-1708-00704-1-n32 | Construct a simple undirected graph G on the labeled vertices 0,...,31.
It must remain connected after deletion of any set of at most two vertices,
and its minimum degree must be at least 3. Its circumference (the maximum
number of vertices in a simple cycle) must be c=31.
For integers t define f(n,t,c)=(c-t+1)(c-t)/2+... | construct/rm_1708_00704__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00704__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-00704-1-n32",
"version": "0.1.0",
"description": "construct/rm_1708_00704__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_00704__1"
]
... | {
"subset": "construct",
"family": "rm_1708_00704__1",
"problem_key": "ma_ning_circumference_stability_counterexamples",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1708.00704",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_f... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-00704-1-n32 |
arxiv-answer-verifiers/construct-rm-1708-01201-0-n2 | Construct a counterexample to antisymmetry in dimension n=2.
Give rational structure constants c[i-1][j-1][k-1] for a bilinear multiplication
on the real vector space with basis beta={v_1,v_2}, where v_1=1. The multiplication
must be associative, commutative, and have v_1 as its identity.
The algebra must be a unital n... | construct/rm_1708_01201__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01201__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-01201-0-n2",
"version": "0.1.0",
"description": "construct/rm_1708_01201__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01201__0"
]
... | {
"subset": "construct",
"family": "rm_1708_01201__0",
"problem_key": "bedell_nil_basis_antisymmetry",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1708.01201",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwe... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-01201-0-n2 |
arxiv-answer-verifiers/construct-rm-1708-01284-3-n14-r7 | For n=14 and r=7, exhibit a simple undirected graph G on vertices 0,...,n-1 whose present edges are coloured from {1,...,r}. Require (r+1)*delta(G) >= r*(n-r-1)+1, where delta(G) is its minimum degree, and require that V(G) cannot be covered by at most r monochromatic components. A monochromatic component is a connecte... | construct/rm_1708_01284__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01284__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-01284-3-n14-r7",
"version": "0.1.0",
"description": "construct/rm_1708_01284__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01284__3"
... | {
"subset": "construct",
"family": "rm_1708_01284__3",
"problem_key": "bal-debiasio-component-cover",
"domain": "graph_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1708.01284",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"q... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-01284-3-n14-r7 |
arxiv-answer-verifiers/construct-rm-1708-01607-0-k7-r5 | For k=7 and r=5, exhibit a finite simple graph with n < 4r-k-2 vertices and a specified partition into k labelled independent parts, such that the graph contains no K_r and deleting any two distinct parts leaves a K_(r-1). A K_t is a set of t vertices with an edge between every pair. Empty labelled parts are allowed. T... | construct/rm_1708_01607__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01607__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-01607-0-k7-r5",
"version": "0.1.0",
"description": "construct/rm_1708_01607__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_01607__0"
... | {
"subset": "construct",
"family": "rm_1708_01607__0",
"problem_key": "partite_beta2_equality",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:1708.01607",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5_4... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-01607-0-k7-r5 |
arxiv-answer-verifiers/construct-rm-1708-02418-0-n11-m9 | Let M=(S^9 x CG_{11,1})/((v,V)~(-v,conjugate(V))), where S^9 is the unit sphere in R^10 and CG_{11,1} is the manifold of complex lines in C^11. Thus M is a closed smooth manifold of real dimension 29. Let w_i(M) in H^i(M;F_2) be the i-th Stiefel--Whitney class of its tangent bundle, and let [M]_2 be its mod-2 fundament... | construct/rm_1708_02418__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_02418__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-02418-0-n11-m9",
"version": "0.1.0",
"description": "construct/rm_1708_02418__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_02418__0"
... | {
"subset": "construct",
"family": "rm_1708_02418__0",
"problem_key": "generalized_dold_grassmann_nonbounding",
"domain": "geometry",
"tier": "research",
"level": "hard",
"source": "arXiv:1708.02418",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-02418-0-n11-m9 |
arxiv-answer-verifiers/construct-rm-1708-03010-3-q13-s19 | For the parameters below, exhibit a counterexample to the containment I^(hn-h+1) subseteq I^n for a radical homogeneous ideal.
Work in R=F_13[x,y,z], with F_13 the integers modulo the prime 13. Choose exactly 19 distinct points S in the projective plane P^2(F_13). Represent each point as [x,y,z] with entries in {0,...... | construct/rm_1708_03010__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_03010__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-03010-3-q13-s19",
"version": "0.1.0",
"description": "construct/rm_1708_03010__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_03010__3"
... | {
"subset": "construct",
"family": "rm_1708_03010__3",
"problem_key": "harbourne-containment-radical-homogeneous",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:1708.03010",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward":... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-03010-3-q13-s19 |
arxiv-answer-verifiers/construct-rm-1708-03190-3-n9-m9 | For the fixed parameters n=9 and m=9, exhibit an
extremizing object witnessing failure of at least one of the claims below.
A is an indexed list (a_1,...,a_n), with 0 <= a_i <= m-1. Repeated entries
and zero entries are allowed. For 0 <= K <= m-1, define
S_m(A,K) = sum_{j=0}^K sum_{T subset of {1,...,n}}
(... | construct/rm_1708_03190__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_03190__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-03190-3-n9-m9",
"version": "0.1.0",
"description": "construct/rm_1708_03190__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_03190__3"
... | {
"subset": "construct",
"family": "rm_1708_03190__3",
"problem_key": "jacobsthal_tverberg_extrema_literal_recurrence",
"domain": "number_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:1708.03190",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-03190-3-n9-m9 |
arxiv-answer-verifiers/construct-rm-1708-04674-0-a6-l5 | Construct a finite digraph D with vertex set {0,...,11}. Its two independent partite sets are X={0,...,5} and Y={6,...,11}; thus a=6. Every arc must go between X and Y. Loops and repeated arcs are forbidden; opposite arcs are allowed. D must be strongly connected: for every ordered pair of distinct vertices there must ... | construct/rm_1708_04674__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_04674__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-04674-0-a6-l5",
"version": "0.1.0",
"description": "construct/rm_1708_04674__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_04674__0"
... | {
"subset": "construct",
"family": "rm_1708_04674__0",
"problem_key": "adamus-weakened-bipancyclicity-literal",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1708.04674",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewa... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-04674-0-a6-l5 |
arxiv-answer-verifiers/construct-rm-1708-04849-7-n10-w10 | In R^10, let e_i be the i-th unit vector, indexed i=0,...,9.
The weight lattice is P=Z^10 union (Z+1/2)^10. The positive Type B_10
roots are e_i for 0 <= i < 10, and e_i-e_j and e_i+e_j for
0 <= i < j < 10. A central-firing move sends w to w+alpha for a
positive root alpha exactly when sum_i w_i*alpha_i=0.
Use the fix... | construct/rm_1708_04849__7 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_04849__7"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-04849-7-n10-w10",
"version": "0.1.0",
"description": "construct/rm_1708_04849__7",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_04849__7"
... | {
"subset": "construct",
"family": "rm_1708_04849__7",
"problem_key": "type_b_connected_dominant_central_firing",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1708.04849",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_r... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-04849-7-n10-w10 |
arxiv-answer-verifiers/construct-rm-1708-05245-14-n6 | For n_vertices = 6, exhibit a finite abstract simplicial complex X triangulating a connected closed surface that violates
sum_{k>=2} dim_Q(pi_k(X) tensor Q) <= sum_{k>=0} dim_Q H^k(X;Q).
Require the sum on the left to be finite, and X to have finite reduced Lusternik--Schnirelmann category. Simple connectivity is not a... | construct/rm_1708_05245__14 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_05245__14"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-05245-14-n6",
"version": "0.1.0",
"description": "construct/rm_1708_05245__14",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_05245__14"
... | {
"subset": "construct",
"family": "rm_1708_05245__14",
"problem_key": "hilali-connected-cw-literal",
"domain": "geometry",
"tier": "research",
"level": "easy",
"source": "arXiv:1708.05245",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"qwen3_5... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-05245-14-n6 |
arxiv-answer-verifiers/construct-rm-1708-05779-3-n14-k4 | For the fixed parameters n=14 and k=4, exhibit a connected, simple,
undirected graph G on the labeled vertices 0,...,n-1 satisfying the strict
inequality below. For distinct vertices u,v, d_G(u,v) is the number of edges
in a shortest u-v path. For a set S of k vertices, d_G(S) is the minimum
number of edges in a connec... | construct/rm_1708_05779__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_05779__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-05779-3-n14-k4",
"version": "0.1.0",
"description": "construct/rm_1708_05779__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_05779__3"
... | {
"subset": "construct",
"family": "rm_1708_05779__3",
"problem_key": "dankelmann_oellermann_swart_average_steiner_distance",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:1708.05779",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-05779-3-n14-k4 |
arxiv-answer-verifiers/construct-rm-1708-07373-3-d3 | Construct a diameter-Ramsey 3-simplex whose circumcenter is outside its convex hull.
A d-simplex means the vertex set of d+1 affinely independent points in Euclidean d-space. Its circumcenter is the center of the sphere through all vertices. A finite set A is diameter-Ramsey if, for every positive integer r, some finit... | construct/rm_1708_07373__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1708_07373__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1708-07373-3-d3",
"version": "0.1.0",
"description": "construct/rm_1708_07373__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1708_07373__3"
]
... | {
"subset": "construct",
"family": "rm_1708_07373__3",
"problem_key": "corsten_frankl_diameter_ramsey_simplex",
"domain": "geometry",
"tier": "research",
"level": "research",
"source": "arXiv:1708.07373",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward":... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1708-07373-3-d3 |
arxiv-answer-verifiers/construct-rm-1709-01792-0-n23 | Fix the odd integer n=23. For a>0 and real rho define
Gamma(rho) = integral from 0 to 1 of sqrt(1+[a(x-1/2)+n*pi*rho*cos(n*pi*x)]^2) dx
- integral from 0 to 1 of sqrt(1+a^2(x-1/2)^2) dx.
Construct a reduced rational a=p/q in (0,1000] for which Gamma'(0)>0.
This is a certificate that Gamma(rho)>0 for every ... | construct/rm_1709_01792__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_01792__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-01792-0-n23",
"version": "0.1.0",
"description": "construct/rm_1709_01792__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_01792__0"
]
... | {
"subset": "construct",
"family": "rm_1709_01792__0",
"problem_key": "melan-cable-shortening-without-slope-bound",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1709.01792",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewa... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-01792-0-n23 |
arxiv-answer-verifiers/construct-rm-1709-03069-2-n14 | Let n=14. The integral dihedral quandle ring is the free abelian group on a_0,...,a_(n-1), with bilinear multiplication a_i a_j=a_((2j-i) mod n). Its augmentation ideal Delta consists of the elements whose coefficients sum to zero. Write e_i=a_i-a_0 for 1<=i<n; coefficient vectors below are in this ordered basis. Let D... | construct/rm_1709_03069__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03069__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-03069-2-n14",
"version": "0.1.0",
"description": "construct/rm_1709_03069__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03069__2"
]
... | {
"subset": "construct",
"family": "rm_1709_03069__2",
"problem_key": "bps-dihedral-quandle-augmentation-quotients",
"domain": "algebra",
"tier": "research",
"level": "medium",
"source": "arXiv:1709.03069",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-03069-2-n14 |
arxiv-answer-verifiers/construct-rm-1709-03179-0-n5-k4 | Construct a connected, finite, simple undirected graph G on the labelled vertices 0,...,4, for k=4, with sep**_k(G) < sep*_k(G), and certify this inequality with rational data.
Let R_k(G) consist of all nonempty vertex sets A with |A| <= k for which the induced graph G[A] is connected. A singleton is connected. Let |bo... | construct/rm_1709_03179__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03179__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-03179-0-n5-k4",
"version": "0.1.0",
"description": "construct/rm_1709_03179__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03179__0"
... | {
"subset": "construct",
"family": "rm_1709_03179__0",
"problem_key": "fractional-separation-cover-partition",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1709.03179",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewar... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-03179-0-n5-k4 |
arxiv-answer-verifiers/construct-rm-1709-03179-2-n12-k11 | For n=12 and k=11, exhibit a finite simple undirected graph G on V={0,...,n-1} with sep_k**(G)<sep_k*(G).
Let R_k contain every nonempty vertex set A with |A|<=k whose induced graph is connected; singletons are connected. Write c(A) for the number of edges with exactly one endpoint in A. Define sep_k* as the minimum of... | construct/rm_1709_03179__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03179__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-03179-2-n12-k11",
"version": "0.1.0",
"description": "construct/rm_1709_03179__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03179__2"
... | {
"subset": "construct",
"family": "rm_1709_03179__2",
"problem_key": "lovasz-fractional-separation-cover-partition",
"domain": "graph_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1709.03179",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-03179-2-n12-k11 |
arxiv-answer-verifiers/construct-rm-1709-03885-0-n6-u113 | For a simple undirected graph V on [n]={1,...,n}, let d4(V) be the probability distribution of the isomorphism class of V[S], where S is chosen uniformly from all four-element subsets of [n]. Let Q(n,4) be the convex hull of d4(V) over all simple graphs V on [n]. This is equivalent to the marginal polytope of exchangea... | construct/rm_1709_03885__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03885__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-03885-0-n6-u113",
"version": "0.1.0",
"description": "construct/rm_1709_03885__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_03885__0"
... | {
"subset": "construct",
"family": "rm_1709_03885__0",
"problem_key": "exchangeable_graph_marginal_vertex",
"domain": "graph_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1709.03885",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-03885-0-n6-u113 |
arxiv-answer-verifiers/construct-rm-1709-04773-0-n10 | Let n=10, N=104, and L=[1, 25, 27]. Define an undirected simple graph with vertex set Z_N={0,1,...,N-1}, with x adjacent to x+j and x-j modulo N for each j in L. Every edge has unit length. For distinct vertices x,y, let sigma_xy be the number of shortest x-y paths, and sigma_xy(e) the number of those paths containing ... | construct/rm_1709_04773__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_04773__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-04773-0-n10",
"version": "0.1.0",
"description": "construct/rm_1709_04773__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_04773__0"
]
... | {
"subset": "construct",
"family": "rm_1709_04773__0",
"problem_key": "circulant-edge-betweenness-uniformity-conjecture-2-1",
"domain": "graph_theory",
"tier": "research",
"level": "research",
"source": "arXiv:1709.04773",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-04773-0-n10 |
arxiv-answer-verifiers/construct-rm-1709-05595-1-n3-m3 | Let n=3 and m=3. Work over the complex numbers. For d>=1, M_d is the space of d by d complex matrices, E_ab is its matrix unit with a 1 in row a and column b, and J_d=Span_C{E_ab:1<=a,b<=d, a!=b}.
For a self-adjoint traceless subspace X of M_d, define chi0(X) as the least positive integer r such that C^d has a basis x_... | construct/rm_1709_05595__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_05595__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-05595-1-n3-m3",
"version": "0.1.0",
"description": "construct/rm_1709_05595__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_05595__1"
... | {
"subset": "construct",
"family": "rm_1709_05595__1",
"problem_key": "kim_mehta_arbitrary_basis_cartesian_chi0",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1709.05595",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward"... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-05595-1-n3-m3 |
arxiv-answer-verifiers/construct-rm-1709-08604-1-n8 | Construct an exterior-support obstruction for the one-dimensional divergence equation. Fix G=U(1), identify its Lie algebra with R, set the connection a=0, and let K=(-1/2,1/2). For a real exponent s, dot H^s(R) consists of tempered distributions whose Fourier transforms are measurable functions with finite integral of... | construct/rm_1709_08604__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1709_08604__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1709-08604-1-n8",
"version": "0.1.0",
"description": "construct/rm_1709_08604__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1709_08604__1"
]
... | {
"subset": "construct",
"family": "rm_1709_08604__1",
"problem_key": "low_dimensional_covariant_divergence_exterior_support",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1709.08604",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1709-08604-1-n8 |
arxiv-answer-verifiers/construct-rm-1710-01787-2 | Construct an exact certificate that a one-period Kelly maximum-drawdown chance-constrained allocation set is nonconvex. There are exactly two assets and two distinct possible return vectors x[0],x[1] in R^2, with positive probabilities p[0],p[1] summing to one. You choose the return vectors, probabilities, epsilon, del... | construct/rm_1710_01787__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_01787__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-01787-2",
"version": "0.1.0",
"description": "construct/rm_1710_01787__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_01787__2"
]
},... | {
"subset": "construct",
"family": "rm_1710_01787__2",
"problem_key": "kelly_probabilistic_maximum_drawdown_convexity",
"domain": "probability",
"tier": "research",
"level": "research",
"source": "arXiv:1710.01787",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_fla... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-01787-2 |
arxiv-answer-verifiers/construct-rm-1710-02709-2-n1-m1-x2 | Fix k=3, n=1, m=1, x=2. Let PC be the set of directed plane
product-coproduct prographs made from x ordered initial strands by applying exactly
n operators with one input and k ordered outputs, and m operators with k ordered
inputs and one output. Operators attach to consecutive strands, all edges point
upward, and gra... | construct/rm_1710_02709__2 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_02709__2"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-02709-2-n1-m1-x2",
"version": "0.1.0",
"description": "construct/rm_1710_02709__2",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_02709__2"
... | {
"subset": "construct",
"family": "rm_1710_02709__2",
"problem_key": "prograph-tableau-conjecture-5-1",
"domain": "combinatorics",
"tier": "research",
"level": "easy",
"source": "arXiv:1710.02709",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-02709-2-n1-m1-x2 |
arxiv-answer-verifiers/construct-rm-1710-02710-3-n3 | Let D={z in C: |z|<1} and let A² be the space of analytic functions
f(z)=sum_{k>=0} c_k z^k with ||f||_A²²=sum_{k>=0} |c_k|²/(k+1).
The inner product is linear in the first variable. Set n=3 and
M_n={f in A²: f^(r)(1/2)=0 for every integer 0<=r<n}.
For bounded analytic f set ||f||_infinity=sup_{z in D}|f(z)|; for an
un... | construct/rm_1710_02710__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_02710__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-02710-3-n3",
"version": "0.1.0",
"description": "construct/rm_1710_02710__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_02710__3"
]
... | {
"subset": "construct",
"family": "rm_1710_02710__3",
"problem_key": "seco-bergman-norm-ratio-innerness",
"domain": "analysis",
"tier": "research",
"level": "research",
"source": "arXiv:1710.02710",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-02710-3-n3 |
arxiv-answer-verifiers/construct-rm-1710-04241-0-N512 | For prime p=2, stage n=2, and group order N=512, exhibit a finite p-group G witnessing failure of stage separation.
For a finite p-group G define G^(0)=G, G^(j+1)=[G^(j),G^(j)], and dl(G) as the least j with G^(j)={1}. The commutator is [x,y]=x^(-1)y^(-1)xy. ATI(A) is the list of cyclic prime-power factors of a finite... | construct/rm_1710_04241__0 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_04241__0"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-04241-0-N512",
"version": "0.1.0",
"description": "construct/rm_1710_04241__0",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_04241__0"
]... | {
"subset": "construct",
"family": "rm_1710_04241__0",
"problem_key": "stage_separation_p_class_towers",
"domain": "number_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:1710.04241",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-04241-0-N512 |
arxiv-answer-verifiers/construct-rm-1710-05332-6-c2-3-3-14 | There are four boxes labeled 1,2,3,4, with positive search costs
(c_1,c_2,c_3,c_4)=(2, 3, 3, 14). A Hider places exactly two balls, at most one
per box. A Searcher commits to a permutation of the four boxes and opens
them in that order until both balls have been found. The regret is the sum
of the costs of empty boxes ... | construct/rm_1710_05332__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05332__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-05332-6-c2-3-3-14",
"version": "0.1.0",
"description": "construct/rm_1710_05332__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05332__6"
... | {
"subset": "construct",
"family": "rm_1710_05332__6",
"problem_key": "single_look_regret_proportional_support",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1710.05332",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_re... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-05332-6-c2-3-3-14 |
arxiv-answer-verifiers/construct-rm-1710-05332-7-c10-17-18-69 | Four boxes, labelled 1, 2, 3, 4, have search costs [10, 17, 18, 69]. A Hider puts exactly two balls in distinct boxes. A Searcher chooses a permutation of all four boxes and opens boxes in that order until finding both balls. Regret is the sum of the costs of empty boxes opened before the second ball is found. The Hide... | construct/rm_1710_05332__7 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05332__7"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-05332-7-c10-17-18-69",
"version": "0.1.0",
"description": "construct/rm_1710_05332__7",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05332__... | {
"subset": "construct",
"family": "rm_1710_05332__7",
"problem_key": "single_look_regret_restricted_product",
"domain": "other",
"tier": "research",
"level": "hard",
"source": "arXiv:1710.05332",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"q... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-05332-7-c10-17-18-69 |
arxiv-answer-verifiers/construct-rm-1710-05946-40-n10 | Let n=10, T^n=R^n/Z^n with coordinates x_1,...,x_n, and I=(-pi/(n+1),pi/(n+1)). Define phi(t)=cos((n+1)t/2)^(2/(n+1)) and g_ref=dt^2+phi(t)^2 sum_i dx_i^2 on T^n x I.
Construct a smooth Riemannian metric g on this open band with g>=g_ref as quadratic forms, scalar curvature Sc(g)>=n(n+1) everywhere, and g unequal to g_... | construct/rm_1710_05946__40 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05946__40"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-05946-40-n10",
"version": "0.1.0",
"description": "construct/rm_1710_05946__40",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_05946__40"
... | {
"subset": "construct",
"family": "rm_1710_05946__40",
"problem_key": "open_torical_band_literal_metric_equality",
"domain": "geometry",
"tier": "research",
"level": "research",
"source": "arXiv:1710.05946",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_rewa... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-05946-40-n10 |
arxiv-answer-verifiers/construct-rm-1710-06490-6-n5 | For rank n=5, construct a permutation w of {1,...,2n} such that
w(i)+w(2n+1-i)=2n+1 for every 1<=i<=n. Use one-line notation indexed from 1.
Define r_w(p,q)=#{k<=q : w(k)>=p} and the coessential set
E(w)={(p,q): 2<=p<=2n, 1<=q<2n,
w^(-1)(p-1)<=q<w^(-1)(p), w(q)<p<=w(q+1)}.
Require that every (p,q) in E(w) sati... | construct/rm_1710_06490__6 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_06490__6"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-06490-6-n5",
"version": "0.1.0",
"description": "construct/rm_1710_06490__6",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_06490__6"
]
... | {
"subset": "construct",
"family": "rm_1710_06490__6",
"problem_key": "hultman-kostant-kumar-root-products",
"domain": "algebra",
"tier": "research",
"level": "hard",
"source": "arXiv:1710.06490",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1,
"q... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-06490-6-n5 |
arxiv-answer-verifiers/construct-rm-1710-08025-11-r3-n6 | For r = 3 and n = 6, exhibit a finite certificate against the
following all-orders identity: s_r(m) = 2(r-2)m + C_r for every integer
m >= n_0, where n_0 = 2(r-2) and C_r depends only on r.
Here s_r(m) is the minimum number of edges in a simple graph on m vertices
whose edges are coloured from an infinite palette, whi... | construct/rm_1710_08025__11 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08025__11"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-08025-11-r3-n6",
"version": "0.1.0",
"description": "construct/rm_1710_08025__11",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08025__11"
... | {
"subset": "construct",
"family": "rm_1710_08025__11",
"problem_key": "rainbow-clique-saturation-all-orders",
"domain": "graph_theory",
"tier": "research",
"level": "easy",
"source": "arXiv:1710.08025",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": ... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-08025-11-r3-n6 |
arxiv-answer-verifiers/construct-rm-1710-08025-4-r3-n7 | For r=3, let s_r(t) be the minimum number of edges in a
simple t-vertex graph whose edges have nonnegative integer colors, with no
restriction on the number of colors, subject to these two conditions:
(i) no r vertices form a complete graph with all edge colors distinct;
(ii) adding any missing edge in any nonnegative ... | construct/rm_1710_08025__4 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08025__4"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-08025-4-r3-n7",
"version": "0.1.0",
"description": "construct/rm_1710_08025__4",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08025__4"
... | {
"subset": "construct",
"family": "rm_1710_08025__4",
"problem_key": "rainbow_clique_saturation_all_orders",
"domain": "graph_theory",
"tier": "research",
"level": "hard",
"source": "arXiv:1710.08025",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward": 1... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-08025-4-r3-n7 |
arxiv-answer-verifiers/construct-rm-1710-08486-1-k12 | For k=12, exhibit a rational finite blow-up template whose limiting
mean of pi_3 on induced seven-vertex subgraphs is strictly greater than 21.
For a simple graph H, pi_3(H) is the minimum sum of clique orders over
partitions of E(H) into edge-disjoint copies of K_2 and K_3. An edge costs 2
and a triangle costs 3.
You... | construct/rm_1710_08486__1 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08486__1"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-08486-1-k12",
"version": "0.1.0",
"description": "construct/rm_1710_08486__1",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_08486__1"
]
... | {
"subset": "construct",
"family": "rm_1710_08486__1",
"problem_key": "seven_vertex_integral_triangle_decomposition",
"domain": "graph_theory",
"tier": "research",
"level": "medium",
"source": "arXiv:1710.08486",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-08486-1-k12 |
arxiv-answer-verifiers/construct-rm-1710-09434-3-n4-r3 | Let n=4, r=3, and [n]={1,...,n}, in cyclic order. Construct a nonempty family F of distinct nonempty subsets of [n] and a coloring that disproves the inequality below for these parameters.
The cyclic distance of x,y is min(|x-y|, n-|x-y|). A member of F is r-stable when all its distinct elements have cyclic distance a... | construct/rm_1710_09434__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1710_09434__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1710-09434-3-n4-r3",
"version": "0.1.0",
"description": "construct/rm_1710_09434__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1710_09434__3"
... | {
"subset": "construct",
"family": "rm_1710_09434__3",
"problem_key": "frick-stable-kneser-colorability-defect",
"domain": "combinatorics",
"tier": "research",
"level": "research",
"source": "arXiv:1710.09434",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_re... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1710-09434-3-n4-r3 |
arxiv-answer-verifiers/construct-rm-1711-00985-3-p7 | Work over the finite field F_7, with all coefficients reduced modulo 7.
Let g=sl_2(F_7) have basis e,f,h and brackets [e,f]=h, [h,e]=2e,
[h,f]=-2f. Write a(n)=a tensor t^n. The affine brackets are
[a(n),b(r)]=[a,b](n+r)+n delta_(n+r,0) <a,b> K,
where <e,f>=<f,e>=1, <h,h>=2 and all other basis pairings are zero.
Let M b... | construct/rm_1711_00985__3 | [
"arxiv-answer-verifiers",
"construct",
"rm_1711_00985__3"
] | 1.4 | {
"schema_version": "1.4",
"artifacts": [],
"task": {
"name": "arxiv-answer-verifiers/construct-rm-1711-00985-3-p7",
"version": "0.1.0",
"description": "construct/rm_1711_00985__3",
"authors": [],
"keywords": [
"arxiv-answer-verifiers",
"construct",
"rm_1711_00985__3"
]
... | {
"subset": "construct",
"family": "rm_1711_00985__3",
"problem_key": "restricted-affine-sl2-boundary-simplicity",
"domain": "algebra",
"tier": "research",
"level": "research",
"source": "arXiv:1711.00985",
"source_license": "CC-BY-4.0",
"first_solved_by": "z-ai/glm-5.3-flash",
"glm_5_3_flash_reward... | [
"environment/Dockerfile",
"environment/instance.json",
"instruction.md",
"solution/solve.sh",
"task.toml",
"tests/check.py",
"tests/instance.json",
"tests/run.py",
"tests/test.sh"
] | tasks/construct-rm-1711-00985-3-p7 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.