task_id stringlengths 23 52 | subset stringclasses 1
value | family stringclasses 80
values | problem_key stringclasses 75
values | domain stringclasses 8
values | tier stringclasses 2
values | level stringclasses 6
values | source stringclasses 80
values | license stringclasses 3
values | tags listlengths 0 4 | prompt stringlengths 308 37k | instance stringlengths 56 37.8k | direction null | baseline null | best_known null | reference_answer stringlengths 8 198k | reference_reward float64 1 1 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
construct-rlve-smallest-enclosing-circle-l6-s6 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(5, 48)
(6, 110)
(7, 114)
(8, 68)
(8, 172)
(9, 81)
(9, 104)
(12, 181)
(13, 64)
(15, 31)
(17, 17)
(19, 177)
(22, 141)
(23, 8)
(23, 138)
(24, 17)
(28, 70)
(29, 93)
(29, 171)
(30, 237)
(35, 39)
(36, 47)
(37, 167)
(38, 200)
(40, 212)
(43, 31)
(44, 170)
(45, 90)
(48, 60)
(49, 7... | {"points": [[5, 48], [6, 110], [7, 114], [8, 68], [8, 172], [9, 81], [9, 104], [12, 181], [13, 64], [15, 31], [17, 17], [19, 177], [22, 141], [23, 8], [23, 138], [24, 17], [28, 70], [29, 93], [29, 171], [30, 237], [35, 39], [36, 47], [37, 167], [38, 200], [40, 212], [43, 31], [44, 170], [45, 90], [48, 60], [49, 73], [5... | null | null | null | {"x": 123.32022372941073, "y": 119.54042984233243, "r": 150.01804817698215} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s7 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(1, 89)
(1, 155)
(5, 73)
(5, 128)
(9, 212)
(15, 219)
(20, 150)
(25, 10)
(25, 46)
(27, 113)
(28, 59)
(30, 129)
(31, 229)
(32, 219)
(37, 141)
(43, 46)
(43, 209)
(49, 126)
(50, 31)
(53, 31)
(56, 93)
(56, 237)
(57, 206)
(58, 143)
(61, 117)
(65, 233)
(67, 119)
(67, 196)
(71, 23... | {"points": [[1, 89], [1, 155], [5, 73], [5, 128], [9, 212], [15, 219], [20, 150], [25, 10], [25, 46], [27, 113], [28, 59], [30, 129], [31, 229], [32, 219], [37, 141], [43, 46], [43, 209], [49, 126], [50, 31], [53, 31], [56, 93], [56, 237], [57, 206], [58, 143], [61, 117], [65, 233], [67, 119], [67, 196], [71, 23], [71,... | null | null | null | {"x": 121.5, "y": 113.5, "r": 149.9083053079442} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s8 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(3, 138)
(3, 145)
(5, 64)
(8, 14)
(8, 98)
(11, 115)
(13, 117)
(14, 53)
(14, 201)
(15, 221)
(16, 77)
(19, 32)
(22, 12)
(25, 43)
(25, 206)
(29, 94)
(32, 3)
(35, 1)
(35, 190)
(38, 144)
(40, 31)
(44, 18)
(44, 204)
(45, 20)
(45, 216)
(46, 92)
(47, 128)
(47, 131)
(49, 154)
(52, ... | {"points": [[3, 138], [3, 145], [5, 64], [8, 14], [8, 98], [11, 115], [13, 117], [14, 53], [14, 201], [15, 221], [16, 77], [19, 32], [22, 12], [25, 43], [25, 206], [29, 94], [32, 3], [35, 1], [35, 190], [38, 144], [40, 31], [44, 18], [44, 204], [45, 20], [45, 216], [46, 92], [47, 128], [47, 131], [49, 154], [52, 66], [... | null | null | null | {"x": 122.59178232732305, "y": 119.31895885058407, "r": 155.63855457641233} | 1 |
construct-rlve-smallest-enclosing-circle-l6-s9 | construct | rlve_smallest_enclosing_circle | minimum_enclosing_circle | geometry | competition | 6 | RLVE-Gym/smallest_circle | MIT | [
"agentic_trivial"
] | You are given 120 lattice points in the plane:
(1, 222)
(2, 38)
(2, 174)
(8, 32)
(9, 56)
(11, 134)
(12, 15)
(12, 211)
(13, 50)
(13, 204)
(21, 206)
(22, 160)
(26, 183)
(26, 220)
(30, 129)
(30, 235)
(31, 147)
(33, 175)
(34, 178)
(35, 36)
(38, 220)
(41, 146)
(43, 23)
(43, 211)
(47, 61)
(47, 124)
(48, 31)
(54, 236)
(54, 24... | {"points": [[1, 222], [2, 38], [2, 174], [8, 32], [9, 56], [11, 134], [12, 15], [12, 211], [13, 50], [13, 204], [21, 206], [22, 160], [26, 183], [26, 220], [30, 129], [30, 235], [31, 147], [33, 175], [34, 178], [35, 36], [38, 220], [41, 146], [43, 23], [43, 211], [47, 61], [47, 124], [48, 31], [54, 236], [54, 240], [55... | null | null | null | {"x": 115.5, "y": 116.0, "r": 156.03284910656492} | 1 |
construct-rlve-subgraph-isomorphism-l1-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[0, 2], [1, 2]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[1, 4], [3, 4], [0, 3], [0, 4], [0, 1], [2, 4]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an ... | {"n1": 3, "n2": 5, "edges1": [[0, 2], [1, 2]], "edges2": [[1, 4], [3, 4], [0, 3], [0, 4], [0, 1], [2, 4]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 3, 4]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[0, 1]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[0, 2], [2, 3], [1, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if and only if (p(u),... | {"n1": 3, "n2": 5, "edges1": [[0, 1]], "edges2": [[0, 2], [2, 3], [1, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 0, 4]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[0, 3]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[0, 1], [1, 4]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if and only if (p(u), p(v)) i... | {"n1": 4, "n2": 5, "edges1": [[0, 3]], "edges2": [[0, 1], [1, 4]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [4, 2, 3, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[0, 1]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[2, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edg... | {"n1": 3, "n2": 5, "edges1": [[0, 1]], "edges2": [[2, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 3, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[1, 2], [2, 3], [1, 3]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[0, 3], [0, 2], [2, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if an... | {"n1": 4, "n2": 5, "edges1": [[1, 2], [2, 3], [1, 3]], "edges2": [[0, 3], [0, 2], [2, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [1, 3, 2, 0]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[0, 2]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[1, 2], [0, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if and only if (p(u), p(v)) i... | {"n1": 3, "n2": 5, "edges1": [[0, 2]], "edges2": [[1, 2], [0, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 1, 3]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[0, 3], [0, 1], [1, 3], [0, 2]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[0, 2], [0, 1], [1, 2], [0, 3], [2, 4]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v... | {"n1": 4, "n2": 5, "edges1": [[0, 3], [0, 1], [1, 3], [0, 2]], "edges2": [[0, 2], [0, 1], [1, 2], [0, 3], [2, 4]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 2, 3, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..4 with edges
[[0, 3], [0, 1], [2, 3]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[2, 3], [0, 1], [1, 2]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if an... | {"n1": 5, "n2": 5, "edges1": [[0, 3], [0, 1], [2, 3]], "edges2": [[2, 3], [0, 1], [1, 2]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [1, 0, 3, 2, 4]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[0, 2], [1, 2]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[0, 1], [2, 4], [0, 3], [1, 4]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if an... | {"n1": 3, "n2": 5, "edges1": [[0, 2], [1, 2]], "edges2": [[0, 1], [2, 4], [0, 3], [1, 4]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 4, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l1-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..2 with edges
[[1, 2]]
G2 is an undirected simple graph on vertices 0..4 with edges
[[2, 4], [0, 2], [1, 2], [0, 1]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertices, (u, v) is an edge of G1 if and only i... | {"n1": 3, "n2": 5, "edges1": [[1, 2]], "edges2": [[2, 4], [0, 2], [1, 2], [0, 1]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [3, 0, 2]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[0, 1], [0, 2], [1, 2]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[4, 5], [4, 7], [1, 2], [2, 3], [5, 7], [3, 6], [2, 7]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertice... | {"n1": 4, "n2": 8, "edges1": [[0, 1], [0, 2], [1, 2]], "edges2": [[4, 5], [4, 7], [1, 2], [2, 3], [5, 7], [3, 6], [2, 7]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [5, 4, 7, 6]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..4 with edges
[[0, 4], [0, 2], [0, 3], [2, 3]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[2, 6], [5, 6], [2, 4], [0, 6], [5, 7], [4, 6], [3, 5], [0, 1], [1, 6], [1, 5], [0, 3], [3, 6]]
Find an injective map p from the vertices of G1 to the vertices of ... | {"n1": 5, "n2": 8, "edges1": [[0, 4], [0, 2], [0, 3], [2, 3]], "edges2": [[2, 6], [5, 6], [2, 4], [0, 6], [5, 7], [4, 6], [3, 5], [0, 1], [1, 6], [1, 5], [0, 3], [3, 6]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [6, 7, 2, 4, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[0, 1], [0, 3]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[0, 4], [0, 1], [1, 7], [2, 5], [3, 6], [2, 3], [2, 6], [0, 6], [3, 5], [6, 7], [2, 7], [1, 5], [4, 6], [5, 7], [1, 6]]
Find an injective map p from the vertices of G1 to the vert... | {"n1": 4, "n2": 8, "edges1": [[0, 1], [0, 3]], "edges2": [[0, 4], [0, 1], [1, 7], [2, 5], [3, 6], [2, 3], [2, 6], [0, 6], [3, 5], [6, 7], [2, 7], [1, 5], [4, 6], [5, 7], [1, 6]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [5, 1, 4, 2]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[0, 2], [1, 2], [1, 5], [1, 6], [2, 4], [0, 1], [5, 6], [4, 6], [2, 6], [1, 3], [2, 3], [0, 5], [3, 4], [1, 4], [3, 6]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[2, 7], [0, 1], [2, 5], [1, 3], [2, 4], [2, 3], [4, 6], [1, 2], [0, 2], [3, ... | {"n1": 7, "n2": 8, "edges1": [[0, 2], [1, 2], [1, 5], [1, 6], [2, 4], [0, 1], [5, 6], [4, 6], [2, 6], [1, 3], [2, 3], [0, 5], [3, 4], [1, 4], [3, 6]], "edges2": [[2, 7], [0, 1], [2, 5], [1, 3], [2, 4], [2, 3], [4, 6], [1, 2], [0, 2], [3, 4], [5, 6], [0, 4], [0, 6], [3, 7], [1, 6], [1, 7], [1, 5], [4, 5], [5, 7], [3, 5]... | null | null | null | {"p": [0, 1, 2, 7, 3, 6, 5]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..4 with edges
[[0, 2], [0, 3], [1, 4]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[3, 7], [1, 2], [2, 4], [0, 1], [1, 4], [5, 7], [0, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v of G1 vertice... | {"n1": 5, "n2": 8, "edges1": [[0, 2], [0, 3], [1, 4]], "edges2": [[3, 7], [1, 2], [2, 4], [0, 1], [1, 4], [5, 7], [0, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [7, 2, 5, 3, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[1, 3], [1, 2]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[5, 7], [2, 3], [0, 5], [3, 5], [2, 5], [2, 4], [1, 6], [1, 7], [1, 3], [6, 7], [0, 2], [1, 2], [4, 7], [2, 6], [5, 6]]
Find an injective map p from the vertices of G1 to the vert... | {"n1": 4, "n2": 8, "edges1": [[1, 3], [1, 2]], "edges2": [[5, 7], [2, 3], [0, 5], [3, 5], [2, 5], [2, 4], [1, 6], [1, 7], [1, 3], [6, 7], [0, 2], [1, 2], [4, 7], [2, 6], [5, 6]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [4, 5, 6, 0]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[1, 3], [0, 3]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[0, 6], [3, 7], [0, 7], [5, 6], [1, 4], [0, 1], [0, 2], [3, 5], [1, 3], [4, 5], [5, 7], [1, 5]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for... | {"n1": 4, "n2": 8, "edges1": [[1, 3], [0, 3]], "edges2": [[0, 6], [3, 7], [0, 7], [5, 6], [1, 4], [0, 1], [0, 2], [3, 5], [1, 3], [4, 5], [5, 7], [1, 5]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 6, 4, 0]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..3 with edges
[[0, 2]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[3, 7], [6, 7], [1, 6], [0, 2], [3, 6], [1, 3], [4, 5], [1, 4], [5, 6], [1, 7], [2, 7], [0, 3]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every p... | {"n1": 4, "n2": 8, "edges1": [[0, 2]], "edges2": [[3, 7], [6, 7], [1, 6], [0, 2], [3, 6], [1, 3], [4, 5], [1, 4], [5, 6], [1, 7], [2, 7], [0, 3]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [5, 2, 4, 3]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[4, 5], [0, 5], [0, 4], [1, 2], [1, 4], [0, 1], [2, 4], [2, 5], [2, 6], [1, 6]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[0, 1], [3, 4], [3, 5], [0, 6], [1, 4], [0, 2], [2, 4], [0, 5], [2, 3], [3, 6], [2, 5], [0, 4], [6, 7], [1, 6], [2, ... | {"n1": 7, "n2": 8, "edges1": [[4, 5], [0, 5], [0, 4], [1, 2], [1, 4], [0, 1], [2, 4], [2, 5], [2, 6], [1, 6]], "edges2": [[0, 1], [3, 4], [3, 5], [0, 6], [1, 4], [0, 2], [2, 4], [0, 5], [2, 3], [3, 6], [2, 5], [0, 4], [6, 7], [1, 6], [2, 6]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [3, 4, 0, 7, 2, 5, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l2-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[0, 5], [3, 4], [1, 2], [2, 3], [0, 3], [1, 6], [2, 4], [1, 5], [5, 6], [0, 1], [3, 5], [1, 3], [0, 6], [0, 2], [2, 6]]
G2 is an undirected simple graph on vertices 0..7 with edges
[[5, 7], [1, 4], [2, 5], [3, 7], [0, 7], [0, 3], [0, 1], [3, 5], [1, 6], [1, ... | {"n1": 7, "n2": 8, "edges1": [[0, 5], [3, 4], [1, 2], [2, 3], [0, 3], [1, 6], [2, 4], [1, 5], [5, 6], [0, 1], [3, 5], [1, 3], [0, 6], [0, 2], [2, 6]], "edges2": [[5, 7], [1, 4], [2, 5], [3, 7], [0, 7], [0, 3], [0, 1], [3, 5], [1, 6], [1, 2], [3, 4], [2, 6], [2, 3], [0, 4], [0, 2], [1, 3], [4, 6], [0, 6]], "family": "rl... | null | null | null | {"p": [0, 1, 2, 3, 5, 4, 6]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[3, 5], [4, 6], [3, 6], [4, 5], [0, 2], [1, 6], [0, 3], [3, 4], [2, 6], [0, 4], [5, 6], [0, 5], [1, 3], [2, 4], [1, 2], [2, 5], [1, 5]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[3, 10], [9, 11], [8, 11], [2, 7], [5, 8], [1, 3], [2, 3], ... | {"n1": 7, "n2": 12, "edges1": [[3, 5], [4, 6], [3, 6], [4, 5], [0, 2], [1, 6], [0, 3], [3, 4], [2, 6], [0, 4], [5, 6], [0, 5], [1, 3], [2, 4], [1, 2], [2, 5], [1, 5]], "edges2": [[3, 10], [9, 11], [8, 11], [2, 7], [5, 8], [1, 3], [2, 3], [0, 2], [6, 8], [5, 6], [3, 11], [1, 5], [4, 5], [0, 10], [4, 8], [1, 4], [2, 11],... | null | null | null | {"p": [0, 7, 11, 1, 3, 10, 5]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..7 with edges
[[4, 6], [2, 4], [0, 4], [6, 7], [1, 4], [1, 5], [0, 6], [2, 3], [4, 5], [3, 7], [1, 7], [0, 1], [0, 3], [4, 7], [3, 5], [2, 7]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[1, 6], [5, 9], [0, 10], [3, 4], [3, 10], [0, 3], [1, 8], [6, 10], ... | {"n1": 8, "n2": 12, "edges1": [[4, 6], [2, 4], [0, 4], [6, 7], [1, 4], [1, 5], [0, 6], [2, 3], [4, 5], [3, 7], [1, 7], [0, 1], [0, 3], [4, 7], [3, 5], [2, 7]], "edges2": [[1, 6], [5, 9], [0, 10], [3, 4], [3, 10], [0, 3], [1, 8], [6, 10], [4, 6], [0, 8], [7, 8], [0, 6], [2, 8], [1, 11], [4, 5], [1, 5], [8, 11], [5, 10],... | null | null | null | {"p": [4, 6, 7, 8, 10, 11, 9, 0]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..10 with edges
[[8, 9], [5, 7], [4, 9], [5, 9], [7, 9], [5, 6], [2, 9], [0, 6], [7, 10], [8, 10], [2, 10], [1, 6], [6, 10], [9, 10], [4, 6], [3, 9], [1, 7], [1, 9], [3, 8], [2, 8], [0, 1], [3, 7], [1, 5], [0, 9], [2, 4], [0, 5], [1, 8], [0, 4], [4, 7], [1, 4], [6, 7], [2, ... | {"n1": 11, "n2": 12, "edges1": [[8, 9], [5, 7], [4, 9], [5, 9], [7, 9], [5, 6], [2, 9], [0, 6], [7, 10], [8, 10], [2, 10], [1, 6], [6, 10], [9, 10], [4, 6], [3, 9], [1, 7], [1, 9], [3, 8], [2, 8], [0, 1], [3, 7], [1, 5], [0, 9], [2, 4], [0, 5], [1, 8], [0, 4], [4, 7], [1, 4], [6, 7], [2, 7], [0, 3], [0, 10], [5, 8], [4... | null | null | null | {"p": [4, 8, 3, 9, 7, 11, 0, 10, 1, 2, 5]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[1, 4], [1, 2], [2, 6]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[2, 7], [1, 11], [0, 5], [4, 6], [1, 3], [1, 10], [2, 8], [5, 7], [8, 11], [0, 2], [6, 11], [6, 10], [7, 9], [3, 5], [5, 11], [7, 8]]
Find an injective map p from the ver... | {"n1": 7, "n2": 12, "edges1": [[1, 4], [1, 2], [2, 6]], "edges2": [[2, 7], [1, 11], [0, 5], [4, 6], [1, 3], [1, 10], [2, 8], [5, 7], [8, 11], [0, 2], [6, 11], [6, 10], [7, 9], [3, 5], [5, 11], [7, 8]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [11, 2, 7, 3, 0, 10, 9]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..10 with edges
[[2, 9], [3, 4], [3, 5], [9, 10], [1, 5], [0, 8], [1, 2], [7, 8], [2, 4], [0, 2], [7, 9], [1, 9], [2, 8], [8, 9], [4, 10], [7, 10], [4, 5], [5, 9], [1, 10], [3, 10], [6, 9], [6, 10], [6, 7], [0, 6], [4, 7], [1, 7], [5, 7], [3, 8], [0, 3], [0, 10], [5, 6], [1... | {"n1": 11, "n2": 12, "edges1": [[2, 9], [3, 4], [3, 5], [9, 10], [1, 5], [0, 8], [1, 2], [7, 8], [2, 4], [0, 2], [7, 9], [1, 9], [2, 8], [8, 9], [4, 10], [7, 10], [4, 5], [5, 9], [1, 10], [3, 10], [6, 9], [6, 10], [6, 7], [0, 6], [4, 7], [1, 7], [5, 7], [3, 8], [0, 3], [0, 10], [5, 6], [1, 3], [0, 7], [0, 9], [0, 1], [... | null | null | null | {"p": [11, 2, 1, 7, 0, 8, 10, 5, 6, 9, 4]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..5 with edges
[[1, 3], [1, 2]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[0, 5], [4, 9], [5, 11], [9, 11], [3, 4], [1, 10], [5, 10], [4, 8], [1, 11]]
Find an injective map p from the vertices of G1 to the vertices of G2 such that for every pair u != v... | {"n1": 6, "n2": 12, "edges1": [[1, 3], [1, 2]], "edges2": [[0, 5], [4, 9], [5, 11], [9, 11], [3, 4], [1, 10], [5, 10], [4, 8], [1, 11]], "family": "rlve_subgraph_isomorphism", "subset": "construct"} | null | null | null | {"p": [6, 11, 9, 5, 2, 7]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..6 with edges
[[1, 4], [2, 6], [0, 4], [4, 6], [4, 5], [1, 5], [1, 2], [2, 5], [1, 3]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[2, 5], [4, 11], [0, 1], [6, 8], [6, 7], [3, 10], [0, 4], [1, 11], [2, 9], [3, 8], [2, 8], [4, 10], [3, 6], [10, 11], [1, 3... | {"n1": 7, "n2": 12, "edges1": [[1, 4], [2, 6], [0, 4], [4, 6], [4, 5], [1, 5], [1, 2], [2, 5], [1, 3]], "edges2": [[2, 5], [4, 11], [0, 1], [6, 8], [6, 7], [3, 10], [0, 4], [1, 11], [2, 9], [3, 8], [2, 8], [4, 10], [3, 6], [10, 11], [1, 3], [5, 9], [6, 10], [9, 11], [4, 9], [1, 5], [0, 8], [1, 9], [1, 6], [4, 6], [6, 9... | null | null | null | {"p": [5, 6, 10, 7, 1, 3, 11]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..8 with edges
[[2, 8], [1, 3], [3, 8], [2, 4], [1, 8], [4, 8], [0, 5], [1, 7], [0, 7], [5, 6], [1, 6], [1, 5], [3, 6], [5, 8], [0, 8], [6, 8]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[4, 10], [0, 7], [1, 5], [2, 8], [0, 3], [3, 9], [1, 3], [10, 11], ... | {"n1": 9, "n2": 12, "edges1": [[2, 8], [1, 3], [3, 8], [2, 4], [1, 8], [4, 8], [0, 5], [1, 7], [0, 7], [5, 6], [1, 6], [1, 5], [3, 6], [5, 8], [0, 8], [6, 8]], "edges2": [[4, 10], [0, 7], [1, 5], [2, 8], [0, 3], [3, 9], [1, 3], [10, 11], [0, 9], [3, 8], [1, 9], [9, 10], [8, 9], [0, 8], [1, 2], [3, 11], [2, 5], [5, 10],... | null | null | null | {"p": [9, 2, 6, 4, 11, 1, 5, 8, 10]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..5 with edges
[[2, 5], [3, 4], [1, 5], [2, 3], [2, 4], [0, 3], [1, 2]]
G2 is an undirected simple graph on vertices 0..11 with edges
[[3, 5], [6, 11], [0, 10], [2, 5], [7, 8], [6, 9], [9, 10], [0, 6], [4, 6], [0, 11], [5, 10], [7, 11], [3, 8], [0, 8], [6, 8], [2, 9], [10, ... | {"n1": 6, "n2": 12, "edges1": [[2, 5], [3, 4], [1, 5], [2, 3], [2, 4], [0, 3], [1, 2]], "edges2": [[3, 5], [6, 11], [0, 10], [2, 5], [7, 8], [6, 9], [9, 10], [0, 6], [4, 6], [0, 11], [5, 10], [7, 11], [3, 8], [0, 8], [6, 8], [2, 9], [10, 11], [0, 2], [5, 6], [1, 8], [1, 11], [4, 8], [0, 3], [4, 11], [0, 1], [1, 7], [0,... | null | null | null | {"p": [9, 7, 8, 6, 5, 1]} | 1 |
construct-rlve-subgraph-isomorphism-l3-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..10 with edges
[[3, 8], [1, 3], [7, 9], [0, 9], [5, 6], [4, 9], [0, 7], [1, 8], [2, 5], [0, 3], [4, 5], [0, 10], [6, 7], [3, 7], [2, 6], [1, 7], [1, 5], [3, 5], [3, 6], [1, 2], [4, 8], [5, 8], [2, 4], [0, 8], [4, 10], [8, 9], [5, 7], [6, 8], [2, 9], [2, 7], [2, 10], [6, 9]... | {"n1": 11, "n2": 12, "edges1": [[3, 8], [1, 3], [7, 9], [0, 9], [5, 6], [4, 9], [0, 7], [1, 8], [2, 5], [0, 3], [4, 5], [0, 10], [6, 7], [3, 7], [2, 6], [1, 7], [1, 5], [3, 5], [3, 6], [1, 2], [4, 8], [5, 8], [2, 4], [0, 8], [4, 10], [8, 9], [5, 7], [6, 8], [2, 9], [2, 7], [2, 10], [6, 9], [0, 6], [2, 8], [7, 8], [0, 4... | null | null | null | {"p": [7, 8, 6, 3, 0, 2, 5, 1, 11, 9, 10]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..8 with edges
[[3, 7], [1, 4], [0, 6], [0, 3], [5, 6], [6, 7], [0, 1], [0, 7], [1, 2], [1, 3], [2, 4], [1, 5], [4, 7], [1, 7], [0, 4], [2, 6], [0, 8]]
G2 is an undirected simple graph on vertices 0..17 with edges
[[12, 16], [4, 10], [3, 7], [5, 8], [3, 5], [0, 16], [7, 12]... | {"n1": 9, "n2": 18, "edges1": [[3, 7], [1, 4], [0, 6], [0, 3], [5, 6], [6, 7], [0, 1], [0, 7], [1, 2], [1, 3], [2, 4], [1, 5], [4, 7], [1, 7], [0, 4], [2, 6], [0, 8]], "edges2": [[12, 16], [4, 10], [3, 7], [5, 8], [3, 5], [0, 16], [7, 12], [8, 16], [7, 9], [2, 3], [8, 13], [0, 14], [10, 15], [2, 12], [5, 12], [5, 9], [... | null | null | null | {"p": [13, 10, 0, 4, 8, 15, 14, 11, 12]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..16 with edges
[[3, 11], [5, 12], [2, 16], [5, 7], [6, 15], [1, 9], [5, 8], [10, 12], [9, 16], [12, 13], [5, 9], [12, 14], [9, 14], [10, 13], [1, 6], [0, 10], [3, 4], [1, 12], [3, 8], [11, 15]]
G2 is an undirected simple graph on vertices 0..17 with edges
[[0, 1], [0, 7], ... | {"n1": 17, "n2": 18, "edges1": [[3, 11], [5, 12], [2, 16], [5, 7], [6, 15], [1, 9], [5, 8], [10, 12], [9, 16], [12, 13], [5, 9], [12, 14], [9, 14], [10, 13], [1, 6], [0, 10], [3, 4], [1, 12], [3, 8], [11, 15]], "edges2": [[0, 1], [0, 7], [0, 5], [10, 15], [3, 9], [2, 3], [6, 9], [7, 12], [7, 15], [2, 10], [4, 6], [12, ... | null | null | null | {"p": [5, 12, 14, 4, 13, 15, 3, 10, 11, 17, 0, 6, 7, 1, 8, 9, 16]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..16 with edges
[[6, 12], [3, 13], [3, 12], [0, 5], [9, 13], [1, 10], [3, 8], [2, 11], [2, 9], [4, 8], [3, 4], [12, 13], [6, 14], [7, 15], [6, 16], [5, 9], [6, 8], [10, 11], [9, 16], [6, 9], [8, 11], [7, 10], [8, 9], [1, 8], [10, 14], [8, 13], [5, 13], [1, 16], [5, 6], [6, ... | {"n1": 17, "n2": 18, "edges1": [[6, 12], [3, 13], [3, 12], [0, 5], [9, 13], [1, 10], [3, 8], [2, 11], [2, 9], [4, 8], [3, 4], [12, 13], [6, 14], [7, 15], [6, 16], [5, 9], [6, 8], [10, 11], [9, 16], [6, 9], [8, 11], [7, 10], [8, 9], [1, 8], [10, 14], [8, 13], [5, 13], [1, 16], [5, 6], [6, 10], [11, 14], [8, 10], [10, 15... | null | null | null | {"p": [14, 9, 13, 4, 6, 2, 1, 11, 15, 10, 5, 12, 8, 7, 16, 0, 3]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..17 with edges
[[10, 11], [14, 17], [3, 17], [1, 16], [9, 17], [5, 6], [0, 7], [7, 11], [6, 10], [5, 11], [2, 17], [10, 14], [2, 16], [13, 14], [5, 16], [1, 5], [8, 17], [4, 15], [8, 11], [5, 14], [4, 14], [5, 13], [3, 11], [12, 14], [16, 17], [1, 13], [1, 3], [10, 16], [0... | {"n1": 18, "n2": 18, "edges1": [[10, 11], [14, 17], [3, 17], [1, 16], [9, 17], [5, 6], [0, 7], [7, 11], [6, 10], [5, 11], [2, 17], [10, 14], [2, 16], [13, 14], [5, 16], [1, 5], [8, 17], [4, 15], [8, 11], [5, 14], [4, 14], [5, 13], [3, 11], [12, 14], [16, 17], [1, 13], [1, 3], [10, 16], [0, 17], [5, 8], [1, 2], [7, 15],... | null | null | null | {"p": [1, 17, 11, 10, 8, 4, 16, 15, 2, 3, 5, 12, 7, 14, 13, 6, 9, 0]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..17 with edges
[[6, 16], [8, 15], [0, 12], [7, 13], [8, 13], [13, 16], [0, 1], [1, 6], [3, 13], [11, 14], [6, 7], [8, 16], [8, 12], [2, 7], [6, 8], [4, 17], [10, 12], [0, 10], [12, 16], [7, 10], [2, 6], [15, 16], [8, 11], [12, 13], [11, 12], [2, 3], [1, 5], [3, 7], [14, 15... | {"n1": 18, "n2": 18, "edges1": [[6, 16], [8, 15], [0, 12], [7, 13], [8, 13], [13, 16], [0, 1], [1, 6], [3, 13], [11, 14], [6, 7], [8, 16], [8, 12], [2, 7], [6, 8], [4, 17], [10, 12], [0, 10], [12, 16], [7, 10], [2, 6], [15, 16], [8, 11], [12, 13], [11, 12], [2, 3], [1, 5], [3, 7], [14, 15], [4, 7], [2, 4], [1, 9], [3, ... | null | null | null | {"p": [6, 3, 17, 4, 15, 1, 2, 12, 0, 8, 5, 14, 11, 13, 10, 7, 16, 9]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..15 with edges
[[0, 9], [3, 11], [5, 9], [8, 15], [5, 13], [0, 7], [8, 14], [8, 12], [0, 14], [6, 14], [3, 7], [5, 12], [4, 8], [8, 10], [9, 11], [7, 15], [2, 7], [8, 13], [0, 1], [9, 14], [6, 13], [0, 12], [5, 7], [12, 14], [1, 2], [9, 13], [3, 9], [4, 15], [11, 14], [0, ... | {"n1": 16, "n2": 18, "edges1": [[0, 9], [3, 11], [5, 9], [8, 15], [5, 13], [0, 7], [8, 14], [8, 12], [0, 14], [6, 14], [3, 7], [5, 12], [4, 8], [8, 10], [9, 11], [7, 15], [2, 7], [8, 13], [0, 1], [9, 14], [6, 13], [0, 12], [5, 7], [12, 14], [1, 2], [9, 13], [3, 9], [4, 15], [11, 14], [0, 4], [0, 5], [2, 3], [1, 11], [3... | null | null | null | {"p": [13, 10, 8, 0, 16, 2, 4, 5, 15, 11, 7, 12, 3, 6, 17, 14]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..10 with edges
[[2, 7], [7, 10], [2, 4], [2, 3], [6, 9], [3, 8], [7, 8], [1, 4], [2, 9], [4, 6], [0, 1], [1, 5], [2, 8], [1, 8], [1, 10], [7, 9], [5, 9], [1, 7]]
G2 is an undirected simple graph on vertices 0..17 with edges
[[7, 11], [10, 15], [1, 4], [6, 8], [8, 15], [12,... | {"n1": 11, "n2": 18, "edges1": [[2, 7], [7, 10], [2, 4], [2, 3], [6, 9], [3, 8], [7, 8], [1, 4], [2, 9], [4, 6], [0, 1], [1, 5], [2, 8], [1, 8], [1, 10], [7, 9], [5, 9], [1, 7]], "edges2": [[7, 11], [10, 15], [1, 4], [6, 8], [8, 15], [12, 13], [3, 6], [0, 1], [6, 13], [9, 17], [3, 16], [9, 15], [7, 8], [0, 2], [0, 10],... | null | null | null | {"p": [5, 16, 13, 8, 11, 10, 2, 3, 6, 0, 4]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..14 with edges
[[6, 7], [3, 4], [2, 4], [6, 8], [0, 11], [2, 14], [4, 13], [8, 9], [2, 3], [0, 9], [10, 14], [1, 12], [8, 11], [1, 9], [3, 10], [5, 13], [3, 7], [8, 13], [0, 1], [1, 7], [1, 3], [4, 9], [10, 11], [1, 5], [5, 8], [2, 12], [3, 9], [1, 6], [5, 12], [2, 5], [4,... | {"n1": 15, "n2": 18, "edges1": [[6, 7], [3, 4], [2, 4], [6, 8], [0, 11], [2, 14], [4, 13], [8, 9], [2, 3], [0, 9], [10, 14], [1, 12], [8, 11], [1, 9], [3, 10], [5, 13], [3, 7], [8, 13], [0, 1], [1, 7], [1, 3], [4, 9], [10, 11], [1, 5], [5, 8], [2, 12], [3, 9], [1, 6], [5, 12], [2, 5], [4, 10], [12, 13]], "edges2": [[7,... | null | null | null | {"p": [15, 4, 1, 11, 5, 7, 6, 3, 10, 14, 16, 2, 0, 13, 9]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..9 with edges
[[0, 4], [5, 9], [5, 8], [3, 8], [1, 2], [0, 2], [2, 5], [0, 9], [4, 7], [1, 9], [2, 8], [4, 9]]
G2 is an undirected simple graph on vertices 0..17 with edges
[[3, 5], [8, 15], [5, 7], [6, 15], [3, 7], [8, 17], [3, 10], [2, 8], [9, 17], [15, 17], [5, 16], [0,... | {"n1": 10, "n2": 18, "edges1": [[0, 4], [5, 9], [5, 8], [3, 8], [1, 2], [0, 2], [2, 5], [0, 9], [4, 7], [1, 9], [2, 8], [4, 9]], "edges2": [[3, 5], [8, 15], [5, 7], [6, 15], [3, 7], [8, 17], [3, 10], [2, 8], [9, 17], [15, 17], [5, 16], [0, 3], [4, 8], [5, 10], [2, 12], [7, 15], [5, 8], [0, 8], [0, 12], [7, 14], [11, 13... | null | null | null | {"p": [7, 16, 13, 17, 3, 11, 2, 0, 9, 5]} | 1 |
construct-rlve-subgraph-isomorphism-l4-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..15 with edges
[[10, 12], [2, 3], [10, 14], [2, 14], [2, 13], [7, 8], [4, 6], [5, 9], [2, 6], [3, 7], [0, 2], [14, 15], [8, 15], [1, 2], [4, 13], [0, 9], [4, 14], [3, 9], [1, 5], [3, 13], [5, 10], [0, 7], [7, 11], [2, 10], [2, 12], [0, 14], [0, 1], [11, 13], [3, 15], [4, 8... | {"n1": 16, "n2": 18, "edges1": [[10, 12], [2, 3], [10, 14], [2, 14], [2, 13], [7, 8], [4, 6], [5, 9], [2, 6], [3, 7], [0, 2], [14, 15], [8, 15], [1, 2], [4, 13], [0, 9], [4, 14], [3, 9], [1, 5], [3, 13], [5, 10], [0, 7], [7, 11], [2, 10], [2, 12], [0, 14], [0, 1], [11, 13], [3, 15], [4, 8], [7, 9], [6, 13], [7, 12], [6... | null | null | null | {"p": [16, 1, 0, 10, 2, 9, 17, 6, 7, 11, 5, 14, 3, 12, 15, 8]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..17 with edges
[[7, 15], [0, 6], [8, 9], [8, 15], [15, 17], [3, 7], [8, 13], [3, 16], [3, 11], [1, 13], [3, 15], [11, 13], [8, 10], [0, 4], [1, 3], [3, 14], [15, 16], [12, 15]]
G2 is an undirected simple graph on vertices 0..25 with edges
[[6, 21], [0, 21], [15, 20], [0, 1... | {"n1": 18, "n2": 26, "edges1": [[7, 15], [0, 6], [8, 9], [8, 15], [15, 17], [3, 7], [8, 13], [3, 16], [3, 11], [1, 13], [3, 15], [11, 13], [8, 10], [0, 4], [1, 3], [3, 14], [15, 16], [12, 15]], "edges2": [[6, 21], [0, 21], [15, 20], [0, 12], [11, 15], [13, 22], [5, 12], [1, 18], [7, 10], [9, 22], [6, 10], [9, 19], [5, ... | null | null | null | {"p": [1, 24, 14, 5, 25, 8, 18, 10, 11, 4, 9, 20, 13, 15, 23, 7, 12, 2]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..25 with edges
[[10, 19], [9, 14], [10, 13], [16, 17], [22, 24], [9, 16], [6, 14], [13, 16], [10, 23], [14, 15], [0, 17], [6, 19], [2, 16], [16, 25], [7, 22], [23, 25], [11, 16], [1, 20], [13, 17], [5, 10], [12, 13], [16, 21], [7, 23], [11, 19], [2, 23], [7, 16], [3, 12], ... | {"n1": 26, "n2": 26, "edges1": [[10, 19], [9, 14], [10, 13], [16, 17], [22, 24], [9, 16], [6, 14], [13, 16], [10, 23], [14, 15], [0, 17], [6, 19], [2, 16], [16, 25], [7, 22], [23, 25], [11, 16], [1, 20], [13, 17], [5, 10], [12, 13], [16, 21], [7, 23], [11, 19], [2, 23], [7, 16], [3, 12], [12, 19], [15, 16], [7, 13], [2... | null | null | null | {"p": [23, 12, 24, 22, 1, 16, 20, 21, 17, 6, 19, 25, 18, 3, 10, 7, 5, 15, 8, 14, 9, 13, 11, 0, 4, 2]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..12 with edges
[[9, 12], [6, 9], [4, 11], [5, 11], [7, 10], [2, 3], [0, 3], [9, 10], [5, 8], [0, 7], [5, 9], [6, 8], [1, 4], [0, 2], [1, 2], [3, 12], [8, 10], [8, 11], [4, 6], [1, 7], [2, 5], [1, 6], [3, 4], [2, 8], [0, 1], [8, 9], [1, 10], [3, 6], [2, 10], [6, 7], [1, 9],... | {"n1": 13, "n2": 26, "edges1": [[9, 12], [6, 9], [4, 11], [5, 11], [7, 10], [2, 3], [0, 3], [9, 10], [5, 8], [0, 7], [5, 9], [6, 8], [1, 4], [0, 2], [1, 2], [3, 12], [8, 10], [8, 11], [4, 6], [1, 7], [2, 5], [1, 6], [3, 4], [2, 8], [0, 1], [8, 9], [1, 10], [3, 6], [2, 10], [6, 7], [1, 9], [5, 10], [0, 4], [4, 12], [2, ... | null | null | null | {"p": [16, 20, 21, 11, 25, 22, 24, 1, 7, 19, 8, 5, 10]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..13 with edges
[[6, 11], [0, 13], [8, 12], [3, 9], [10, 12], [9, 13], [0, 9], [2, 5], [2, 4], [0, 4], [1, 6], [9, 11], [1, 4], [7, 10], [3, 6], [1, 12], [2, 10], [7, 13], [11, 12], [6, 7], [5, 6], [3, 7], [4, 13], [5, 13], [8, 11], [2, 6], [0, 7], [4, 10], [1, 11], [0, 10]... | {"n1": 14, "n2": 26, "edges1": [[6, 11], [0, 13], [8, 12], [3, 9], [10, 12], [9, 13], [0, 9], [2, 5], [2, 4], [0, 4], [1, 6], [9, 11], [1, 4], [7, 10], [3, 6], [1, 12], [2, 10], [7, 13], [11, 12], [6, 7], [5, 6], [3, 7], [4, 13], [5, 13], [8, 11], [2, 6], [0, 7], [4, 10], [1, 11], [0, 10], [7, 8], [1, 13], [7, 11], [4,... | null | null | null | {"p": [2, 19, 10, 4, 18, 12, 24, 5, 21, 3, 7, 8, 0, 20]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..15 with edges
[[4, 9], [7, 12], [5, 6], [3, 5], [1, 2], [10, 13], [7, 13], [8, 12], [1, 14], [4, 5], [2, 15], [2, 12], [1, 4], [4, 15], [3, 6], [3, 4]]
G2 is an undirected simple graph on vertices 0..25 with edges
[[1, 6], [18, 21], [1, 22], [3, 13], [5, 13], [10, 19], [2... | {"n1": 16, "n2": 26, "edges1": [[4, 9], [7, 12], [5, 6], [3, 5], [1, 2], [10, 13], [7, 13], [8, 12], [1, 14], [4, 5], [2, 15], [2, 12], [1, 4], [4, 15], [3, 6], [3, 4]], "edges2": [[1, 6], [18, 21], [1, 22], [3, 13], [5, 13], [10, 19], [2, 14], [0, 3], [2, 24], [6, 14], [11, 18], [1, 19], [6, 10], [7, 24], [6, 18], [1,... | null | null | null | {"p": [8, 4, 0, 18, 6, 23, 21, 5, 9, 25, 15, 24, 22, 13, 19, 14]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..23 with edges
[[6, 10], [7, 22], [4, 15], [2, 19], [9, 12], [8, 11], [7, 14], [14, 23], [2, 10], [14, 17], [0, 8], [13, 15], [3, 16], [0, 6], [1, 3], [5, 8], [18, 22], [6, 16], [1, 4], [19, 22], [8, 14], [7, 19], [15, 23], [8, 18], [10, 23], [8, 22], [3, 12], [1, 15], [14... | {"n1": 24, "n2": 26, "edges1": [[6, 10], [7, 22], [4, 15], [2, 19], [9, 12], [8, 11], [7, 14], [14, 23], [2, 10], [14, 17], [0, 8], [13, 15], [3, 16], [0, 6], [1, 3], [5, 8], [18, 22], [6, 16], [1, 4], [19, 22], [8, 14], [7, 19], [15, 23], [8, 18], [10, 23], [8, 22], [3, 12], [1, 15], [14, 16], [3, 9], [19, 23], [12, 2... | null | null | null | {"p": [24, 0, 16, 3, 4, 8, 12, 19, 2, 10, 6, 13, 17, 23, 21, 9, 20, 14, 7, 25, 1, 18, 22, 15]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..23 with edges
[[2, 20], [1, 2], [12, 17], [6, 16], [3, 18], [2, 9], [20, 22], [3, 9], [2, 12], [7, 11], [18, 23], [9, 12], [1, 4], [0, 11], [13, 18], [14, 21], [0, 12], [13, 16], [1, 9], [8, 15], [6, 22], [5, 22], [3, 21], [2, 23], [10, 13], [9, 17], [4, 16], [6, 23], [6,... | {"n1": 24, "n2": 26, "edges1": [[2, 20], [1, 2], [12, 17], [6, 16], [3, 18], [2, 9], [20, 22], [3, 9], [2, 12], [7, 11], [18, 23], [9, 12], [1, 4], [0, 11], [13, 18], [14, 21], [0, 12], [13, 16], [1, 9], [8, 15], [6, 22], [5, 22], [3, 21], [2, 23], [10, 13], [9, 17], [4, 16], [6, 23], [6, 11], [14, 17], [4, 21], [0, 15... | null | null | null | {"p": [7, 11, 5, 16, 21, 23, 3, 2, 13, 25, 17, 8, 19, 14, 18, 9, 4, 12, 10, 24, 22, 20, 0, 6]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..18 with edges
[[0, 17], [6, 12], [1, 2], [4, 6], [5, 8], [0, 10], [6, 16], [0, 16], [12, 17], [11, 13], [0, 9], [5, 7], [10, 17], [1, 16], [11, 16], [7, 16], [5, 16], [4, 10], [15, 16], [13, 15], [7, 18], [8, 11], [7, 8]]
G2 is an undirected simple graph on vertices 0..25... | {"n1": 19, "n2": 26, "edges1": [[0, 17], [6, 12], [1, 2], [4, 6], [5, 8], [0, 10], [6, 16], [0, 16], [12, 17], [11, 13], [0, 9], [5, 7], [10, 17], [1, 16], [11, 16], [7, 16], [5, 16], [4, 10], [15, 16], [13, 15], [7, 18], [8, 11], [7, 8]], "edges2": [[20, 22], [9, 17], [7, 18], [13, 23], [0, 14], [1, 4], [23, 24], [7, ... | null | null | null | {"p": [7, 14, 0, 10, 21, 23, 25, 8, 22, 11, 16, 12, 1, 15, 19, 3, 13, 4, 9]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..15 with edges
[[5, 15], [1, 11], [10, 14], [3, 11], [4, 13], [2, 14], [0, 3], [6, 15], [8, 15], [1, 14], [4, 9], [9, 11], [6, 10], [8, 12], [4, 10], [7, 15], [13, 14], [0, 6], [2, 12], [3, 14], [0, 15], [0, 10], [7, 12], [11, 15], [11, 14], [3, 12], [1, 12], [9, 10], [4, ... | {"n1": 16, "n2": 26, "edges1": [[5, 15], [1, 11], [10, 14], [3, 11], [4, 13], [2, 14], [0, 3], [6, 15], [8, 15], [1, 14], [4, 9], [9, 11], [6, 10], [8, 12], [4, 10], [7, 15], [13, 14], [0, 6], [2, 12], [3, 14], [0, 15], [0, 10], [7, 12], [11, 15], [11, 14], [3, 12], [1, 12], [9, 10], [4, 15], [7, 8], [2, 15]], "edges2"... | null | null | null | {"p": [23, 10, 8, 3, 14, 6, 0, 2, 22, 1, 21, 4, 20, 13, 9, 7]} | 1 |
construct-rlve-subgraph-isomorphism-l5-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..24 with edges
[[12, 13], [19, 23], [4, 23], [2, 13], [3, 21], [8, 24], [20, 22], [0, 11], [20, 24], [15, 20], [2, 11], [0, 22], [1, 13], [17, 22], [12, 24], [8, 17], [11, 24], [14, 15], [4, 17], [1, 5], [12, 22], [10, 17], [11, 19], [4, 20], [6, 15], [14, 19], [7, 10], [3... | {"n1": 25, "n2": 26, "edges1": [[12, 13], [19, 23], [4, 23], [2, 13], [3, 21], [8, 24], [20, 22], [0, 11], [20, 24], [15, 20], [2, 11], [0, 22], [1, 13], [17, 22], [12, 24], [8, 17], [11, 24], [14, 15], [4, 17], [1, 5], [12, 22], [10, 17], [11, 19], [4, 20], [6, 15], [14, 19], [7, 10], [3, 23], [4, 18], [0, 4], [12, 16... | null | null | null | {"p": [6, 17, 23, 15, 9, 8, 12, 0, 16, 22, 13, 1, 5, 4, 7, 11, 14, 20, 25, 10, 3, 21, 18, 19, 24]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s0 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..31 with edges
[[6, 27], [16, 18], [18, 21], [24, 30], [17, 29], [9, 25], [2, 8], [6, 24], [3, 19], [14, 29], [21, 25], [5, 30], [8, 17], [1, 17], [16, 19], [19, 25], [9, 20], [9, 26], [8, 26], [2, 15], [2, 6], [23, 25], [0, 25], [1, 3], [6, 11], [2, 26], [17, 22], [15, 27... | {"n1": 32, "n2": 36, "edges1": [[6, 27], [16, 18], [18, 21], [24, 30], [17, 29], [9, 25], [2, 8], [6, 24], [3, 19], [14, 29], [21, 25], [5, 30], [8, 17], [1, 17], [16, 19], [19, 25], [9, 20], [9, 26], [8, 26], [2, 15], [2, 6], [23, 25], [0, 25], [1, 3], [6, 11], [2, 26], [17, 22], [15, 27], [1, 19], [7, 16], [4, 26], [... | null | null | null | {"p": [7, 34, 5, 18, 2, 22, 15, 3, 17, 6, 29, 32, 35, 33, 13, 10, 12, 14, 0, 24, 28, 9, 19, 23, 1, 27, 30, 26, 8, 31, 21, 11]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s1 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..26 with edges
[[12, 17], [5, 26], [2, 5], [1, 10], [3, 25], [3, 12], [20, 25], [1, 21], [11, 14], [1, 3], [10, 18], [6, 12], [6, 17], [21, 26], [1, 22], [25, 26], [6, 18], [10, 13], [4, 10], [20, 23], [2, 12], [8, 16], [23, 25], [15, 18], [12, 23], [7, 23], [8, 9], [1, 4]... | {"n1": 27, "n2": 36, "edges1": [[12, 17], [5, 26], [2, 5], [1, 10], [3, 25], [3, 12], [20, 25], [1, 21], [11, 14], [1, 3], [10, 18], [6, 12], [6, 17], [21, 26], [1, 22], [25, 26], [6, 18], [10, 13], [4, 10], [20, 23], [2, 12], [8, 16], [23, 25], [15, 18], [12, 23], [7, 23], [8, 9], [1, 4], [16, 20], [9, 22], [9, 15], [... | null | null | null | {"p": [29, 3, 23, 24, 33, 10, 28, 2, 35, 22, 34, 9, 17, 25, 15, 14, 19, 13, 5, 1, 7, 6, 11, 27, 31, 4, 30]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s2 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..21 with edges
[[16, 21], [7, 11], [1, 19], [1, 18], [0, 2], [6, 14], [5, 21], [4, 17], [3, 18], [11, 18], [2, 7], [6, 15], [10, 12], [10, 21], [11, 16], [2, 16], [2, 5], [9, 14], [2, 15], [0, 14], [2, 12], [6, 11], [1, 21], [19, 21], [3, 6], [2, 18], [7, 20], [0, 3], [6, ... | {"n1": 22, "n2": 36, "edges1": [[16, 21], [7, 11], [1, 19], [1, 18], [0, 2], [6, 14], [5, 21], [4, 17], [3, 18], [11, 18], [2, 7], [6, 15], [10, 12], [10, 21], [11, 16], [2, 16], [2, 5], [9, 14], [2, 15], [0, 14], [2, 12], [6, 11], [1, 21], [19, 21], [3, 6], [2, 18], [7, 20], [0, 3], [6, 20], [16, 20], [8, 17], [8, 21]... | null | null | null | {"p": [8, 15, 26, 33, 1, 24, 16, 9, 21, 18, 35, 27, 0, 7, 4, 31, 30, 3, 20, 25, 14, 10]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s3 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..35 with edges
[[31, 32], [24, 32], [6, 15], [23, 25], [19, 25], [8, 27], [21, 22], [8, 11], [24, 30], [6, 7], [6, 23], [8, 20], [5, 12], [12, 13], [19, 27], [9, 28], [20, 28], [0, 13], [4, 22], [1, 11], [11, 24], [3, 26], [18, 33], [7, 30], [9, 17], [19, 23], [6, 11], [23... | {"n1": 36, "n2": 36, "edges1": [[31, 32], [24, 32], [6, 15], [23, 25], [19, 25], [8, 27], [21, 22], [8, 11], [24, 30], [6, 7], [6, 23], [8, 20], [5, 12], [12, 13], [19, 27], [9, 28], [20, 28], [0, 13], [4, 22], [1, 11], [11, 24], [3, 26], [18, 33], [7, 30], [9, 17], [19, 23], [6, 11], [23, 34], [15, 20], [20, 21], [3, ... | null | null | null | {"p": [25, 2, 18, 32, 16, 23, 15, 11, 5, 22, 1, 34, 14, 7, 30, 26, 17, 6, 10, 27, 9, 13, 12, 19, 28, 21, 33, 20, 31, 4, 35, 0, 3, 29, 24, 8]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s4 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..25 with edges
[[16, 18], [4, 17], [2, 11], [7, 16], [2, 14], [13, 16], [15, 18], [1, 3], [16, 24], [8, 19], [14, 25], [2, 4], [15, 22], [1, 7], [18, 19], [9, 25], [5, 16], [17, 20], [8, 17], [18, 23], [2, 12], [5, 12], [1, 13], [5, 20], [0, 22], [4, 5], [5, 7], [0, 9], [5... | {"n1": 26, "n2": 36, "edges1": [[16, 18], [4, 17], [2, 11], [7, 16], [2, 14], [13, 16], [15, 18], [1, 3], [16, 24], [8, 19], [14, 25], [2, 4], [15, 22], [1, 7], [18, 19], [9, 25], [5, 16], [17, 20], [8, 17], [18, 23], [2, 12], [5, 12], [1, 13], [5, 20], [0, 22], [4, 5], [5, 7], [0, 9], [5, 23], [4, 16], [2, 5], [2, 16]... | null | null | null | {"p": [21, 10, 24, 23, 35, 22, 2, 6, 30, 27, 0, 15, 28, 31, 34, 8, 26, 32, 25, 11, 33, 9, 14, 4, 16, 3]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s5 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..27 with edges
[[5, 25], [1, 10], [1, 13], [6, 12], [11, 22], [6, 18], [13, 18], [5, 26], [8, 10], [17, 18], [10, 15], [2, 27], [5, 27], [19, 22], [15, 26], [0, 3], [1, 7], [17, 27], [7, 10], [4, 17], [12, 18], [8, 20], [3, 21], [17, 25], [3, 9], [20, 24], [10, 24], [17, 2... | {"n1": 28, "n2": 36, "edges1": [[5, 25], [1, 10], [1, 13], [6, 12], [11, 22], [6, 18], [13, 18], [5, 26], [8, 10], [17, 18], [10, 15], [2, 27], [5, 27], [19, 22], [15, 26], [0, 3], [1, 7], [17, 27], [7, 10], [4, 17], [12, 18], [8, 20], [3, 21], [17, 25], [3, 9], [20, 24], [10, 24], [17, 23], [12, 23], [9, 23], [18, 21]... | null | null | null | {"p": [19, 17, 5, 10, 11, 16, 3, 35, 12, 29, 0, 7, 14, 26, 8, 28, 25, 15, 31, 23, 20, 2, 30, 18, 13, 24, 4, 34]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s6 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..22 with edges
[[9, 20], [14, 17], [10, 11], [7, 14], [5, 14], [7, 18], [8, 19], [2, 17], [1, 18], [13, 22], [8, 15], [5, 10], [14, 22], [8, 14], [16, 17], [5, 16], [20, 21], [2, 19], [4, 7], [0, 11], [12, 20], [13, 19], [10, 22], [0, 13], [5, 18], [8, 13], [3, 8], [10, 19... | {"n1": 23, "n2": 36, "edges1": [[9, 20], [14, 17], [10, 11], [7, 14], [5, 14], [7, 18], [8, 19], [2, 17], [1, 18], [13, 22], [8, 15], [5, 10], [14, 22], [8, 14], [16, 17], [5, 16], [20, 21], [2, 19], [4, 7], [0, 11], [12, 20], [13, 19], [10, 22], [0, 13], [5, 18], [8, 13], [3, 8], [10, 19], [4, 20], [1, 17], [1, 4], [1... | null | null | null | {"p": [9, 18, 1, 22, 21, 13, 20, 29, 31, 19, 34, 33, 0, 24, 4, 32, 27, 30, 35, 11, 28, 23, 6]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s7 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..30 with edges
[[7, 9], [10, 13], [2, 20], [7, 17], [0, 29], [11, 24], [3, 23], [4, 20], [13, 27], [12, 17], [23, 26], [14, 18], [1, 11], [1, 5], [16, 27], [5, 20], [8, 24], [7, 24], [14, 27], [24, 30], [10, 20], [18, 27], [11, 15], [9, 15], [22, 25], [19, 28], [1, 20], [1... | {"n1": 31, "n2": 36, "edges1": [[7, 9], [10, 13], [2, 20], [7, 17], [0, 29], [11, 24], [3, 23], [4, 20], [13, 27], [12, 17], [23, 26], [14, 18], [1, 11], [1, 5], [16, 27], [5, 20], [8, 24], [7, 24], [14, 27], [24, 30], [10, 20], [18, 27], [11, 15], [9, 15], [22, 25], [19, 28], [1, 20], [19, 26], [7, 28], [6, 25], [1, 2... | null | null | null | {"p": [7, 0, 29, 11, 13, 24, 6, 23, 4, 8, 21, 30, 10, 35, 20, 19, 3, 31, 28, 15, 12, 22, 17, 2, 5, 33, 26, 14, 1, 25, 18]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s8 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..26 with edges
[[7, 23], [13, 16], [12, 21], [4, 13], [1, 21], [4, 25], [0, 3], [7, 15], [24, 26], [22, 26], [11, 19], [6, 16], [9, 20], [6, 17], [10, 11], [1, 15], [0, 13], [2, 20], [0, 9], [17, 19], [3, 13], [10, 15], [18, 23], [3, 15], [6, 24], [5, 14], [13, 18], [8, 22... | {"n1": 27, "n2": 36, "edges1": [[7, 23], [13, 16], [12, 21], [4, 13], [1, 21], [4, 25], [0, 3], [7, 15], [24, 26], [22, 26], [11, 19], [6, 16], [9, 20], [6, 17], [10, 11], [1, 15], [0, 13], [2, 20], [0, 9], [17, 19], [3, 13], [10, 15], [18, 23], [3, 15], [6, 24], [5, 14], [13, 18], [8, 22], [19, 23], [8, 17], [0, 26], ... | null | null | null | {"p": [33, 13, 1, 7, 30, 24, 2, 25, 18, 19, 5, 34, 11, 22, 3, 14, 0, 15, 31, 35, 8, 20, 29, 28, 21, 12, 32]} | 1 |
construct-rlve-subgraph-isomorphism-l6-s9 | construct | rlve_subgraph_isomorphism | induced_subgraph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/subgraph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | G1 is an undirected simple graph on vertices 0..30 with edges
[[3, 24], [11, 24], [4, 5], [11, 12], [0, 4], [16, 19], [23, 25], [4, 11], [7, 18], [11, 14], [1, 3], [16, 29], [2, 3], [0, 5], [0, 22], [10, 19], [0, 26], [1, 6], [13, 15], [1, 5], [9, 12], [2, 24], [1, 14], [3, 9], [7, 8], [27, 29], [18, 26], [15, 21], [5,... | {"n1": 31, "n2": 36, "edges1": [[3, 24], [11, 24], [4, 5], [11, 12], [0, 4], [16, 19], [23, 25], [4, 11], [7, 18], [11, 14], [1, 3], [16, 29], [2, 3], [0, 5], [0, 22], [10, 19], [0, 26], [1, 6], [13, 15], [1, 5], [9, 12], [2, 24], [1, 14], [3, 9], [7, 8], [27, 29], [18, 26], [15, 21], [5, 20], [11, 20], [5, 29], [8, 28... | null | null | null | {"p": [29, 14, 5, 25, 6, 21, 31, 12, 22, 13, 19, 10, 20, 1, 28, 23, 11, 18, 2, 27, 7, 16, 34, 8, 15, 4, 9, 17, 33, 26, 0]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.