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-even-degree-partition-l4-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 2], [0, 8], [0, 9], [0, 16], [1, 2], [1, 3], [1, 8], [1, 9], [1, 12], [1, 16], [2, 4], [2, 5], [2, 6], [2, 10], [2, 11], [2, 12], [2, 13], [2, 15], [2, 16], [2, 17], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], ... | {"n": 18, "edges": [[0, 2], [0, 8], [0, 9], [0, 16], [1, 2], [1, 3], [1, 8], [1, 9], [1, 12], [1, 16], [2, 4], [2, 5], [2, 6], [2, 10], [2, 11], [2, 12], [2, 13], [2, 15], [2, 16], [2, 17], [3, 5], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 16], [3, 17], [4, 7], [4, 8], [4, 9], [4, 11], [4... | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l4-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 1], [0, 3], [0, 9], [0, 10], [0, 13], [0, 14], [0, 15], [1, 3], [1, 4], [1, 5], [1, 6], [1, 10], [1, 11], [1, 14], [1, 15], [1, 16], [1, 17], [2, 4], [2, 9], [2, 10], [2, 12], [2, 15], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13]... | {"n": 18, "edges": [[0, 1], [0, 3], [0, 9], [0, 10], [0, 13], [0, 14], [0, 15], [1, 3], [1, 4], [1, 5], [1, 6], [1, 10], [1, 11], [1, 14], [1, 15], [1, 16], [1, 17], [2, 4], [2, 9], [2, 10], [2, 12], [2, 15], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 5], [4, 6], [4, 8], [4, 10], [4, 13], ... | null | null | null | {"groups": [2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l4-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 8], [0, 11], [0, 17], [1, 5], [1, 6], [1, 17], [2, 4], [2, 8], [2, 11], [2, 14], [2, 15], [2, 17], [3, 4], [3, 5], [3, 6], [3, 10], [3, 11], [3, 15], [4, 8], [4, 10], [4, 11], [4, 13], [4, 15], [4, 17], [5, 6], [5, 7], [5, 12], [5, 17], [6, 8]... | {"n": 18, "edges": [[0, 8], [0, 11], [0, 17], [1, 5], [1, 6], [1, 17], [2, 4], [2, 8], [2, 11], [2, 14], [2, 15], [2, 17], [3, 4], [3, 5], [3, 6], [3, 10], [3, 11], [3, 15], [4, 8], [4, 10], [4, 11], [4, 13], [4, 15], [4, 17], [5, 6], [5, 7], [5, 12], [5, 17], [6, 8], [6, 15], [7, 11], [7, 15], [8, 9], [8, 10], [8, 11]... | null | null | null | {"groups": [2, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l4-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 4 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 18 vertices labelled 0..17 and edge list
[[0, 6], [0, 8], [0, 16], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 15], [1, 16], [2, 3], [2, 4], [2, 8], [2, 9], [2, 10], [2, 11], [2, 15], [2, 16], [2, 17], [3, 4], [3, 5], [3, 6], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 9], [4... | {"n": 18, "edges": [[0, 6], [0, 8], [0, 16], [1, 6], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 15], [1, 16], [2, 3], [2, 4], [2, 8], [2, 9], [2, 10], [2, 11], [2, 15], [2, 16], [2, 17], [3, 4], [3, 5], [3, 6], [3, 9], [3, 11], [3, 13], [4, 5], [4, 6], [4, 9], [4, 10], [4, 11], [4, 13], [4, 14], [4, 15], [4, 16], [... | null | null | null | {"groups": [2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l5-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 2], [0, 3], [0, 7], [0, 8], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 18], [0, 20], [0, 21], [0, 27], [1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 14], [1, 15], [1, 16], [1, 18], [1, 20], [1, 21], [1, 22], [1, 27], [2, 4... | {"n": 28, "edges": [[0, 2], [0, 3], [0, 7], [0, 8], [0, 11], [0, 12], [0, 14], [0, 15], [0, 17], [0, 18], [0, 20], [0, 21], [0, 27], [1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 14], [1, 15], [1, 16], [1, 18], [1, 20], [1, 21], [1, 22], [1, 27], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [... | null | null | null | {"groups": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l5-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 2], [0, 5], [0, 23], [1, 3], [1, 4], [1, 12], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 24], [1, 27], [2, 11], [2, 20], [3, 11], [3, 17], [3, 19], [3, 21], [3, 22], [3, 27], [4, 21], [4, 22], [4, 27], [5, 6], [5, 7], [5, 9], [5, 10], [5... | {"n": 28, "edges": [[0, 2], [0, 5], [0, 23], [1, 3], [1, 4], [1, 12], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 24], [1, 27], [2, 11], [2, 20], [3, 11], [3, 17], [3, 19], [3, 21], [3, 22], [3, 27], [4, 21], [4, 22], [4, 27], [5, 6], [5, 7], [5, 9], [5, 10], [5, 13], [5, 14], [5, 15], [5, 17], [5, 23], [5, 25], [... | null | null | null | {"groups": [1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l5-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 14], [0, 17], [0, 20], [0, 23], [0, 25], [0, 27], [1, 9], [1, 11], [1, 13], [1, 15], [1, 16], [1, 18], [1, 21], [1, 27], [2, 3], [2, 5], [2, 6], [2, 11], [2, 12], [2, 14], [2, 17], [2, 1... | {"n": 28, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 14], [0, 17], [0, 20], [0, 23], [0, 25], [0, 27], [1, 9], [1, 11], [1, 13], [1, 15], [1, 16], [1, 18], [1, 21], [1, 27], [2, 3], [2, 5], [2, 6], [2, 11], [2, 12], [2, 14], [2, 17], [2, 19], [2, 24], [2, 25], [3, 5], [3, 14], [3, 16], [3, 1... | null | null | null | {"groups": [2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l5-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 3], [0, 4], [0, 7], [0, 14], [0, 19], [0, 22], [0, 23], [0, 24], [1, 7], [1, 15], [1, 20], [2, 5], [2, 10], [2, 12], [2, 15], [2, 17], [2, 20], [2, 21], [2, 23], [2, 24], [2, 26], [3, 4], [3, 5], [3, 7], [3, 18], [3, 20], [3, 23], [3, ... | {"n": 28, "edges": [[0, 1], [0, 3], [0, 4], [0, 7], [0, 14], [0, 19], [0, 22], [0, 23], [0, 24], [1, 7], [1, 15], [1, 20], [2, 5], [2, 10], [2, 12], [2, 15], [2, 17], [2, 20], [2, 21], [2, 23], [2, 24], [2, 26], [3, 4], [3, 5], [3, 7], [3, 18], [3, 20], [3, 23], [3, 25], [3, 27], [4, 7], [4, 12], [4, 14], [4, 15], [4, ... | null | null | null | {"groups": [1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l5-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 3], [0, 6], [0, 9], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [1, 2], [1, 6], [1, 12], [1, 13], [1, 14], [1, 16], [1, 18], [1, 19], [1, 23], [1, 24], [1, 25], [... | {"n": 28, "edges": [[0, 1], [0, 3], [0, 6], [0, 9], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 27], [1, 2], [1, 6], [1, 12], [1, 13], [1, 14], [1, 16], [1, 18], [1, 19], [1, 23], [1, 24], [1, 25], [1, 26], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8... | null | null | null | {"groups": [2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l5-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 4], [0, 17], [0, 24], [1, 2], [1, 6], [1, 7], [1, 12], [1, 17], [1, 19], [1, 24], [1, 25], [2, 4], [2, 8], [2, 9], [2, 15], [2, 17], [3, 8], [3, 10], [3, 15], [3, 16], [3, 18], [3, 22], [3, 25], [3, 26], [3, 27], [4, 5], [4, 6], [4, 9]... | {"n": 28, "edges": [[0, 1], [0, 4], [0, 17], [0, 24], [1, 2], [1, 6], [1, 7], [1, 12], [1, 17], [1, 19], [1, 24], [1, 25], [2, 4], [2, 8], [2, 9], [2, 15], [2, 17], [3, 8], [3, 10], [3, 15], [3, 16], [3, 18], [3, 22], [3, 25], [3, 26], [3, 27], [4, 5], [4, 6], [4, 9], [4, 11], [4, 12], [4, 15], [4, 17], [4, 20], [4, 24... | null | null | null | {"groups": [2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l5-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 5], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 18], [0, 20], [0, 21], [0, 22], [0, 25], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 14], [1, 16], [1, 18], [1, 19], [1, 21], [1, 22], [1, 25], [2, 5], [2, 7], [2, 8... | {"n": 28, "edges": [[0, 5], [0, 8], [0, 11], [0, 14], [0, 15], [0, 16], [0, 18], [0, 20], [0, 21], [0, 22], [0, 25], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 14], [1, 16], [1, 18], [1, 19], [1, 21], [1, 22], [1, 25], [2, 5], [2, 7], [2, 8], [2, 11], [2, 12], [2, 14], [2, 16], [2, 17], [2, 1... | null | null | null | {"groups": [1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l5-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12],... | {"n": 28, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 9], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [1, 2], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 18], [1, 20]... | null | null | null | {"groups": [1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l5-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 20], [0, 21], [0, 22], [0, 23], [0, 27], [1, 2], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 19... | {"n": 28, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 6], [0, 7], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 20], [0, 21], [0, 22], [0, 23], [0, 27], [1, 2], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 19], [1, 20], [1, 23], [1, 26], [1, 27], [2, 4], [2, 6]... | null | null | null | {"groups": [2, 2, 1, 1, 2, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l5-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 5 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 28 vertices labelled 0..27 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 10], [0, 13], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 26], [0, 27], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 12], [1, 13], [1, 15], [1, 16]... | {"n": 28, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 10], [0, 13], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 26], [0, 27], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 12], [1, 13], [1, 15], [1, 16], [1, 21], [1, 22], [1, 24], [1, 26], [1, 27], [2, 3]... | null | null | null | {"groups": [2, 1, 2, 1, 2, 1, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l6-s0 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 20], [0, 22], [0, 23], [0, 26], [0, 28], [0, 29], [0, 31], [0, 34], [0, 36], [0, 37], [0, 38], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [1, 12], [1, ... | {"n": 40, "edges": [[0, 2], [0, 4], [0, 5], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 20], [0, 22], [0, 23], [0, 26], [0, 28], [0, 29], [0, 31], [0, 34], [0, 36], [0, 37], [0, 38], [1, 3], [1, 5], [1, 6], [1, 8], [1, 9], [1, 12], [1, 14], [1, 16], [1, 19], [1, 21], [1, 22], [1, 29], [1,... | null | null | null | {"groups": [1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1, 2]} | 1 |
construct-rlve-even-degree-partition-l6-s1 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0,... | {"n": 40, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 14], [0, 15], [0, 16], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 36], [0, 38], [0, 39], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7]... | null | null | null | {"groups": [2, 1, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l6-s2 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 5], [0, 8], [0, 10], [0, 14], [0, 18], [0, 19], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 11], [1, 14], [1... | {"n": 40, "edges": [[0, 5], [0, 8], [0, 10], [0, 14], [0, 18], [0, 19], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 11], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [... | null | null | null | {"groups": [2, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l6-s3 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 1], [0, 4], [0, 5], [0, 8], [0, 9], [0, 10], [0, 13], [0, 19], [0, 21], [0, 22], [0, 23], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 38], [1, 2], [1, 5], [1, 13], [1, 16], [1, 17], [1, 19], [1, 21], [1, 22], [1... | {"n": 40, "edges": [[0, 1], [0, 4], [0, 5], [0, 8], [0, 9], [0, 10], [0, 13], [0, 19], [0, 21], [0, 22], [0, 23], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [0, 38], [1, 2], [1, 5], [1, 13], [1, 16], [1, 17], [1, 19], [1, 21], [1, 22], [1, 25], [1, 26], [1, 29], [1, 32], [1, 33], [1, 34], [... | null | null | null | {"groups": [1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l6-s4 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 13], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 25], [0, 27], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 36], [0, 37], [0, 38], [0, 39], [1, 7], [1, 8], [1, ... | {"n": 40, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 12], [0, 13], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 25], [0, 27], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 36], [0, 37], [0, 38], [0, 39], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [1,... | null | null | null | {"groups": [1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l6-s5 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 2], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 13], [0, 15], [0, 16], [0, 24], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [0, 39], [1, 2], [1, 5], [1, 6], [1, 9], [1, 11], [1, 13], [1, 14], [1, 15], [1, 19], [1,... | {"n": 40, "edges": [[0, 2], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 13], [0, 15], [0, 16], [0, 24], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [0, 37], [0, 39], [1, 2], [1, 5], [1, 6], [1, 9], [1, 11], [1, 13], [1, 14], [1, 15], [1, 19], [1, 20], [1, 21], [1, 22], [1, 25], [1, 27], [1, 30], [1... | null | null | null | {"groups": [1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l6-s6 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 30], [0, 35], [0, 36], [0, 38], [0, 39], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], ... | {"n": 40, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 14], [0, 15], [0, 16], [0, 17], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 30], [0, 35], [0, 36], [0, 38], [0, 39], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 18], [1, 19],... | null | null | null | {"groups": [1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2]} | 1 |
construct-rlve-even-degree-partition-l6-s7 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [1, 9], [1, 12], [1, 17], [1, 21], [1, 23], ... | {"n": 40, "edges": [[0, 4], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 13], [0, 14], [0, 15], [0, 17], [0, 18], [0, 19], [0, 21], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [0, 36], [1, 9], [1, 12], [1, 17], [1, 21], [1, 23], [1, 25], [1, 31], [1, 34], [2, 6], [2, 7], [2, 8], [2... | null | null | null | {"groups": [2, 2, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1]} | 1 |
construct-rlve-even-degree-partition-l6-s8 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 1], [0, 3], [0, 7], [0, 9], [0, 16], [0, 17], [0, 21], [0, 24], [0, 25], [0, 33], [0, 34], [0, 35], [0, 37], [1, 4], [1, 5], [1, 6], [1, 7], [1, 14], [1, 19], [1, 39], [2, 4], [2, 7], [2, 11], [2, 12], [2, 19], [3, 7], [3, 8], [3, 12], [3, 16]... | {"n": 40, "edges": [[0, 1], [0, 3], [0, 7], [0, 9], [0, 16], [0, 17], [0, 21], [0, 24], [0, 25], [0, 33], [0, 34], [0, 35], [0, 37], [1, 4], [1, 5], [1, 6], [1, 7], [1, 14], [1, 19], [1, 39], [2, 4], [2, 7], [2, 11], [2, 12], [2, 19], [3, 7], [3, 8], [3, 12], [3, 16], [3, 17], [3, 20], [3, 21], [3, 24], [3, 28], [3, 31... | null | null | null | {"groups": [2, 1, 1, 2, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1]} | 1 |
construct-rlve-even-degree-partition-l6-s9 | construct | rlve_even_degree_partition | gallai_even_partition | graph_theory | competition | 6 | RLVE-Gym/even_degree_graph_partitioning | MIT | [
"agentic_trivial"
] | An undirected simple graph has 40 vertices labelled 0..39 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35],... | {"n": 40, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 39], [1, 3], [1, 8], [1, 10], ... | null | null | null | {"groups": [2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1]} | 1 |
construct-rlve-graph-isomorphism-l1-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 5 edges.
G1 edges: [[1, 4], [2, 3], [2, 4], [1, 3], [0, 3]]
G2 edges: [[1, 4], [1, 3], [2, 3], [0, 3], [0, 4]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is ... | {"n": 5, "edges1": [[1, 4], [2, 3], [2, 4], [1, 3], [0, 3]], "edges2": [[1, 4], [1, 3], [2, 3], [0, 3], [0, 4]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 0, 1, 3, 4]} | 1 |
construct-rlve-graph-isomorphism-l1-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 3 edges.
G1 edges: [[0, 4], [1, 4], [0, 3]]
G2 edges: [[0, 2], [3, 4], [0, 3]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edge of G2.
Answer format: {... | {"n": 5, "edges1": [[0, 4], [1, 4], [0, 3]], "edges2": [[0, 2], [3, 4], [0, 3]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 4, 1, 2, 3]} | 1 |
construct-rlve-graph-isomorphism-l1-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 5 edges.
G1 edges: [[2, 3], [0, 1], [0, 4], [1, 4], [0, 2]]
G2 edges: [[1, 3], [2, 3], [2, 4], [0, 2], [0, 4]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is ... | {"n": 5, "edges1": [[2, 3], [0, 1], [0, 4], [1, 4], [0, 2]], "edges2": [[1, 3], [2, 3], [2, 4], [0, 2], [0, 4]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 0, 3, 1, 4]} | 1 |
construct-rlve-graph-isomorphism-l1-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 5 edges.
G1 edges: [[0, 3], [3, 4], [0, 2], [2, 3], [2, 4]]
G2 edges: [[0, 4], [2, 4], [1, 2], [0, 1], [1, 4]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is ... | {"n": 5, "edges1": [[0, 3], [3, 4], [0, 2], [2, 3], [2, 4]], "edges2": [[0, 4], [2, 4], [1, 2], [0, 1], [1, 4]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 3, 4, 1, 2]} | 1 |
construct-rlve-graph-isomorphism-l1-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 4 edges.
G1 edges: [[1, 2], [2, 3], [0, 3], [0, 2]]
G2 edges: [[0, 3], [1, 3], [3, 4], [0, 1]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edge of G2.
... | {"n": 5, "edges1": [[1, 2], [2, 3], [0, 3], [0, 2]], "edges2": [[0, 3], [1, 3], [3, 4], [0, 1]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [1, 4, 3, 0, 2]} | 1 |
construct-rlve-graph-isomorphism-l1-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 7 edges.
G1 edges: [[1, 2], [0, 2], [0, 1], [3, 4], [1, 4], [0, 4], [1, 3]]
G2 edges: [[1, 2], [0, 3], [2, 3], [0, 4], [1, 4], [1, 3], [0, 1]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1... | {"n": 5, "edges1": [[1, 2], [0, 2], [0, 1], [3, 4], [1, 4], [0, 4], [1, 3]], "edges2": [[1, 2], [0, 3], [2, 3], [0, 4], [1, 4], [1, 3], [0, 1]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 1, 4, 2, 3]} | 1 |
construct-rlve-graph-isomorphism-l1-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 5 edges.
G1 edges: [[1, 3], [2, 4], [1, 2], [0, 1], [0, 4]]
G2 edges: [[2, 3], [1, 2], [1, 4], [0, 1], [0, 3]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is ... | {"n": 5, "edges1": [[1, 3], [2, 4], [1, 2], [0, 1], [0, 4]], "edges2": [[2, 3], [1, 2], [1, 4], [0, 1], [0, 3]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [2, 1, 0, 4, 3]} | 1 |
construct-rlve-graph-isomorphism-l1-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 5 edges.
G1 edges: [[1, 2], [1, 3], [3, 4], [0, 1], [2, 4]]
G2 edges: [[0, 4], [3, 4], [1, 2], [2, 4], [0, 1]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is ... | {"n": 5, "edges1": [[1, 2], [1, 3], [3, 4], [0, 1], [2, 4]], "edges2": [[0, 4], [3, 4], [1, 2], [2, 4], [0, 1]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [3, 4, 0, 2, 1]} | 1 |
construct-rlve-graph-isomorphism-l1-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 3 edges.
G1 edges: [[2, 4], [1, 3], [0, 1]]
G2 edges: [[1, 3], [0, 4], [0, 2]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edge of G2.
Answer format: {... | {"n": 5, "edges1": [[2, 4], [1, 3], [0, 1]], "edges2": [[1, 3], [0, 4], [0, 2]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [4, 0, 3, 2, 1]} | 1 |
construct-rlve-graph-isomorphism-l1-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 1 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 5 vertices labelled 0..4 and 6 edges.
G1 edges: [[2, 4], [0, 2], [3, 4], [0, 1], [0, 3], [1, 2]]
G2 edges: [[1, 3], [2, 4], [3, 4], [1, 2], [0, 1], [0, 3]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if ... | {"n": 5, "edges1": [[2, 4], [0, 2], [3, 4], [0, 1], [0, 3], [1, 2]], "edges2": [[1, 3], [2, 4], [3, 4], [1, 2], [0, 1], [0, 3]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [3, 0, 1, 4, 2]} | 1 |
construct-rlve-graph-isomorphism-l2-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 4 edges.
G1 edges: [[6, 7], [4, 7], [1, 3], [4, 6]]
G2 edges: [[2, 6], [5, 7], [0, 6], [0, 2]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edge of G2.
... | {"n": 8, "edges1": [[6, 7], [4, 7], [1, 3], [4, 6]], "edges2": [[2, 6], [5, 7], [0, 6], [0, 2]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [4, 7, 3, 5, 6, 1, 0, 2]} | 1 |
construct-rlve-graph-isomorphism-l2-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 7 edges.
G1 edges: [[1, 3], [5, 7], [3, 4], [1, 5], [1, 2], [6, 7], [0, 2]]
G2 edges: [[4, 5], [2, 5], [1, 2], [0, 7], [5, 7], [4, 6], [3, 6]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1... | {"n": 8, "edges1": [[1, 3], [5, 7], [3, 4], [1, 5], [1, 2], [6, 7], [0, 2]], "edges2": [[4, 5], [2, 5], [1, 2], [0, 7], [5, 7], [4, 6], [3, 6]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 5, 7, 2, 1, 4, 3, 6]} | 1 |
construct-rlve-graph-isomorphism-l2-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 15 edges.
G1 edges: [[2, 4], [6, 7], [5, 6], [0, 2], [2, 6], [1, 3], [0, 7], [0, 5], [2, 7], [3, 5], [1, 4], [2, 3], [0, 6], [4, 6], [0, 4]]
G2 edges: [[2, 6], [0, 3], [3, 6], [1, 2], [1, 4], [0, 2], [3, 5], [1, 3], [5, 6], [1, 6], [6, 7], [4... | {"n": 8, "edges1": [[2, 4], [6, 7], [5, 6], [0, 2], [2, 6], [1, 3], [0, 7], [0, 5], [2, 7], [3, 5], [1, 4], [2, 3], [0, 6], [4, 6], [0, 4]], "edges2": [[2, 6], [0, 3], [3, 6], [1, 2], [1, 4], [0, 2], [3, 5], [1, 3], [5, 6], [1, 6], [6, 7], [4, 7], [0, 7], [2, 5], [2, 3]], "family": "rlve_graph_isomorphism", "subset": "... | null | null | null | {"p": [3, 4, 6, 7, 1, 0, 2, 5]} | 1 |
construct-rlve-graph-isomorphism-l2-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 12 edges.
G1 edges: [[1, 4], [1, 3], [3, 7], [0, 5], [4, 6], [3, 6], [2, 3], [4, 7], [1, 5], [4, 5], [3, 4], [0, 3]]
G2 edges: [[5, 7], [5, 6], [6, 7], [1, 5], [3, 4], [3, 5], [1, 7], [2, 7], [4, 7], [3, 6], [0, 7], [2, 5]]
Find a bijection ... | {"n": 8, "edges1": [[1, 4], [1, 3], [3, 7], [0, 5], [4, 6], [3, 6], [2, 3], [4, 7], [1, 5], [4, 5], [3, 4], [0, 3]], "edges2": [[5, 7], [5, 6], [6, 7], [1, 5], [3, 4], [3, 5], [1, 7], [2, 7], [4, 7], [3, 6], [0, 7], [2, 5]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [4, 6, 0, 7, 5, 3, 2, 1]} | 1 |
construct-rlve-graph-isomorphism-l2-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 4 edges.
G1 edges: [[5, 6], [1, 7], [1, 4], [0, 4]]
G2 edges: [[0, 3], [1, 5], [3, 6], [0, 7]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1 if and only if (p(u), p(v)) is an edge of G2.
... | {"n": 8, "edges1": [[5, 6], [1, 7], [1, 4], [0, 4]], "edges2": [[0, 3], [1, 5], [3, 6], [0, 7]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [7, 3, 4, 2, 0, 1, 5, 6]} | 1 |
construct-rlve-graph-isomorphism-l2-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 7 edges.
G1 edges: [[0, 3], [3, 6], [2, 4], [5, 7], [1, 5], [1, 6], [0, 5]]
G2 edges: [[1, 3], [2, 4], [5, 6], [0, 1], [3, 7], [1, 2], [4, 7]]
Find a bijection p from the vertices of G1 to the vertices of G2 such that (u, v) is an edge of G1... | {"n": 8, "edges1": [[0, 3], [3, 6], [2, 4], [5, 7], [1, 5], [1, 6], [0, 5]], "edges2": [[1, 3], [2, 4], [5, 6], [0, 1], [3, 7], [1, 2], [4, 7]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [3, 2, 5, 7, 6, 1, 4, 0]} | 1 |
construct-rlve-graph-isomorphism-l2-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 15 edges.
G1 edges: [[0, 1], [1, 6], [0, 4], [3, 6], [3, 7], [0, 6], [0, 2], [4, 7], [3, 5], [1, 4], [0, 3], [2, 3], [1, 2], [5, 7], [1, 5]]
G2 edges: [[4, 5], [2, 3], [3, 7], [0, 7], [5, 6], [0, 5], [1, 5], [2, 4], [1, 2], [5, 7], [0, 2], [2... | {"n": 8, "edges1": [[0, 1], [1, 6], [0, 4], [3, 6], [3, 7], [0, 6], [0, 2], [4, 7], [3, 5], [1, 4], [0, 3], [2, 3], [1, 2], [5, 7], [1, 5]], "edges2": [[4, 5], [2, 3], [3, 7], [0, 7], [5, 6], [0, 5], [1, 5], [2, 4], [1, 2], [5, 7], [0, 2], [2, 6], [3, 6], [0, 4], [0, 1]], "family": "rlve_graph_isomorphism", "subset": "... | null | null | null | {"p": [0, 5, 1, 2, 7, 6, 4, 3]} | 1 |
construct-rlve-graph-isomorphism-l2-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 21 edges.
G1 edges: [[2, 5], [2, 7], [5, 7], [1, 4], [4, 6], [1, 7], [3, 5], [0, 2], [1, 5], [3, 6], [6, 7], [3, 7], [1, 2], [2, 4], [4, 7], [2, 3], [0, 6], [4, 5], [1, 3], [0, 5], [2, 6]]
G2 edges: [[1, 4], [0, 3], [5, 7], [4, 6], [2, 6], [0... | {"n": 8, "edges1": [[2, 5], [2, 7], [5, 7], [1, 4], [4, 6], [1, 7], [3, 5], [0, 2], [1, 5], [3, 6], [6, 7], [3, 7], [1, 2], [2, 4], [4, 7], [2, 3], [0, 6], [4, 5], [1, 3], [0, 5], [2, 6]], "edges2": [[1, 4], [0, 3], [5, 7], [4, 6], [2, 6], [0, 5], [3, 4], [4, 5], [1, 3], [2, 3], [1, 6], [1, 7], [0, 1], [3, 5], [3, 6], ... | null | null | null | {"p": [7, 2, 6, 4, 0, 5, 1, 3]} | 1 |
construct-rlve-graph-isomorphism-l2-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 18 edges.
G1 edges: [[3, 4], [2, 4], [3, 5], [2, 3], [1, 2], [5, 7], [2, 6], [1, 5], [0, 2], [3, 6], [0, 1], [0, 7], [4, 7], [1, 6], [0, 3], [4, 5], [1, 7], [1, 3]]
G2 edges: [[4, 7], [3, 4], [2, 4], [1, 5], [4, 5], [0, 2], [3, 6], [5, 6], [1... | {"n": 8, "edges1": [[3, 4], [2, 4], [3, 5], [2, 3], [1, 2], [5, 7], [2, 6], [1, 5], [0, 2], [3, 6], [0, 1], [0, 7], [4, 7], [1, 6], [0, 3], [4, 5], [1, 7], [1, 3]], "edges2": [[4, 7], [3, 4], [2, 4], [1, 5], [4, 5], [0, 2], [3, 6], [5, 6], [1, 2], [1, 4], [2, 6], [0, 7], [6, 7], [4, 6], [0, 1], [3, 5], [5, 7], [0, 5]],... | null | null | null | {"p": [7, 5, 6, 4, 2, 1, 3, 0]} | 1 |
construct-rlve-graph-isomorphism-l2-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 2 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 8 vertices labelled 0..7 and 12 edges.
G1 edges: [[5, 7], [1, 5], [4, 6], [3, 7], [3, 4], [6, 7], [2, 7], [1, 7], [3, 6], [0, 3], [2, 5], [5, 6]]
G2 edges: [[3, 4], [1, 7], [2, 5], [6, 7], [0, 2], [2, 7], [1, 4], [3, 7], [2, 6], [4, 7], [5, 6], [4, 6]]
Find a bijection ... | {"n": 8, "edges1": [[5, 7], [1, 5], [4, 6], [3, 7], [3, 4], [6, 7], [2, 7], [1, 7], [3, 6], [0, 3], [2, 5], [5, 6]], "edges2": [[3, 4], [1, 7], [2, 5], [6, 7], [0, 2], [2, 7], [1, 4], [3, 7], [2, 6], [4, 7], [5, 6], [4, 6]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [0, 1, 3, 2, 5, 4, 6, 7]} | 1 |
construct-rlve-graph-isomorphism-l3-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 36 edges.
G1 edges: [[0, 1], [7, 8], [6, 7], [9, 11], [1, 3], [3, 9], [3, 5], [5, 7], [1, 11], [3, 7], [3, 10], [4, 10], [5, 8], [6, 11], [5, 9], [1, 2], [7, 10], [4, 8], [1, 10], [2, 10], [7, 9], [2, 8], [0, 5], [0, 8], [4, 5], [0, 3], [2,... | {"n": 12, "edges1": [[0, 1], [7, 8], [6, 7], [9, 11], [1, 3], [3, 9], [3, 5], [5, 7], [1, 11], [3, 7], [3, 10], [4, 10], [5, 8], [6, 11], [5, 9], [1, 2], [7, 10], [4, 8], [1, 10], [2, 10], [7, 9], [2, 8], [0, 5], [0, 8], [4, 5], [0, 3], [2, 6], [2, 5], [8, 9], [1, 6], [5, 6], [5, 10], [1, 8], [2, 7], [4, 7], [5, 11]], ... | null | null | null | {"p": [4, 3, 2, 0, 5, 6, 7, 10, 8, 11, 1, 9]} | 1 |
construct-rlve-graph-isomorphism-l3-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 42 edges.
G1 edges: [[1, 5], [2, 9], [0, 4], [6, 10], [2, 10], [2, 6], [6, 7], [1, 9], [7, 11], [2, 4], [0, 6], [1, 7], [5, 11], [0, 10], [3, 11], [0, 11], [3, 8], [0, 7], [1, 11], [9, 10], [3, 4], [7, 8], [1, 4], [0, 9], [1, 8], [2, 3], [7... | {"n": 12, "edges1": [[1, 5], [2, 9], [0, 4], [6, 10], [2, 10], [2, 6], [6, 7], [1, 9], [7, 11], [2, 4], [0, 6], [1, 7], [5, 11], [0, 10], [3, 11], [0, 11], [3, 8], [0, 7], [1, 11], [9, 10], [3, 4], [7, 8], [1, 4], [0, 9], [1, 8], [2, 3], [7, 9], [8, 9], [6, 8], [5, 10], [0, 1], [9, 11], [0, 2], [0, 5], [4, 6], [1, 10],... | null | null | null | {"p": [5, 4, 1, 2, 7, 11, 9, 8, 3, 6, 10, 0]} | 1 |
construct-rlve-graph-isomorphism-l3-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 42 edges.
G1 edges: [[8, 9], [6, 9], [0, 9], [9, 11], [0, 8], [3, 5], [7, 8], [5, 8], [8, 11], [0, 5], [9, 10], [2, 11], [5, 6], [4, 7], [3, 7], [6, 8], [3, 4], [10, 11], [7, 9], [1, 8], [0, 3], [3, 8], [0, 2], [0, 7], [0, 1], [1, 7], [4, 8... | {"n": 12, "edges1": [[8, 9], [6, 9], [0, 9], [9, 11], [0, 8], [3, 5], [7, 8], [5, 8], [8, 11], [0, 5], [9, 10], [2, 11], [5, 6], [4, 7], [3, 7], [6, 8], [3, 4], [10, 11], [7, 9], [1, 8], [0, 3], [3, 8], [0, 2], [0, 7], [0, 1], [1, 7], [4, 8], [1, 10], [4, 11], [2, 5], [7, 10], [1, 11], [2, 8], [8, 10], [7, 11], [6, 10]... | null | null | null | {"p": [4, 11, 0, 8, 3, 1, 7, 6, 10, 2, 9, 5]} | 1 |
construct-rlve-graph-isomorphism-l3-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 16 edges.
G1 edges: [[4, 11], [8, 10], [1, 3], [5, 9], [0, 11], [1, 7], [0, 3], [0, 10], [6, 9], [0, 6], [3, 5], [1, 8], [3, 7], [4, 6], [7, 8], [2, 11]]
G2 edges: [[0, 3], [3, 6], [7, 11], [0, 9], [1, 4], [3, 9], [2, 9], [4, 11], [4, 6], [... | {"n": 12, "edges1": [[4, 11], [8, 10], [1, 3], [5, 9], [0, 11], [1, 7], [0, 3], [0, 10], [6, 9], [0, 6], [3, 5], [1, 8], [3, 7], [4, 6], [7, 8], [2, 11]], "edges2": [[0, 3], [3, 6], [7, 11], [0, 9], [1, 4], [3, 9], [2, 9], [4, 11], [4, 6], [10, 11], [0, 6], [5, 8], [1, 7], [2, 4], [1, 8], [5, 6]], "family": "rlve_graph... | null | null | null | {"p": [4, 0, 10, 6, 7, 5, 1, 3, 9, 8, 2, 11]} | 1 |
construct-rlve-graph-isomorphism-l3-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 49 edges.
G1 edges: [[3, 7], [3, 10], [2, 11], [5, 9], [0, 6], [2, 3], [0, 2], [1, 11], [3, 9], [2, 5], [0, 8], [1, 4], [9, 11], [1, 9], [2, 8], [10, 11], [1, 2], [8, 11], [4, 7], [4, 5], [6, 8], [0, 5], [1, 8], [6, 10], [1, 7], [3, 8], [3,... | {"n": 12, "edges1": [[3, 7], [3, 10], [2, 11], [5, 9], [0, 6], [2, 3], [0, 2], [1, 11], [3, 9], [2, 5], [0, 8], [1, 4], [9, 11], [1, 9], [2, 8], [10, 11], [1, 2], [8, 11], [4, 7], [4, 5], [6, 8], [0, 5], [1, 8], [6, 10], [1, 7], [3, 8], [3, 4], [4, 10], [2, 6], [5, 8], [2, 9], [7, 10], [4, 8], [3, 6], [7, 9], [9, 10], ... | null | null | null | {"p": [4, 0, 5, 7, 10, 1, 6, 3, 9, 11, 2, 8]} | 1 |
construct-rlve-graph-isomorphism-l3-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 29 edges.
G1 edges: [[1, 5], [1, 8], [0, 2], [4, 11], [7, 8], [5, 8], [0, 8], [6, 10], [6, 9], [8, 9], [1, 11], [2, 5], [0, 6], [0, 3], [3, 8], [8, 10], [0, 11], [0, 9], [1, 10], [6, 7], [0, 5], [7, 10], [1, 2], [3, 7], [2, 8], [4, 7], [1, ... | {"n": 12, "edges1": [[1, 5], [1, 8], [0, 2], [4, 11], [7, 8], [5, 8], [0, 8], [6, 10], [6, 9], [8, 9], [1, 11], [2, 5], [0, 6], [0, 3], [3, 8], [8, 10], [0, 11], [0, 9], [1, 10], [6, 7], [0, 5], [7, 10], [1, 2], [3, 7], [2, 8], [4, 7], [1, 9], [9, 11], [0, 4]], "edges2": [[0, 5], [0, 10], [4, 6], [1, 6], [6, 10], [5, 1... | null | null | null | {"p": [6, 5, 2, 9, 7, 4, 1, 11, 0, 10, 3, 8]} | 1 |
construct-rlve-graph-isomorphism-l3-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 9 edges.
G1 edges: [[8, 10], [6, 10], [8, 11], [0, 10], [1, 10], [1, 9], [6, 8], [8, 9], [0, 9]]
G2 edges: [[2, 9], [1, 9], [3, 9], [3, 7], [1, 3], [3, 11], [10, 11], [9, 10], [7, 10]]
Find a bijection p from the vertices of G1 to the vert... | {"n": 12, "edges1": [[8, 10], [6, 10], [8, 11], [0, 10], [1, 10], [1, 9], [6, 8], [8, 9], [0, 9]], "edges2": [[2, 9], [1, 9], [3, 9], [3, 7], [1, 3], [3, 11], [10, 11], [9, 10], [7, 10]], "family": "rlve_graph_isomorphism", "subset": "construct"} | null | null | null | {"p": [11, 7, 0, 5, 4, 8, 1, 6, 9, 10, 3, 2]} | 1 |
construct-rlve-graph-isomorphism-l3-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 49 edges.
G1 edges: [[1, 11], [1, 5], [4, 6], [8, 11], [1, 7], [2, 11], [2, 9], [3, 6], [5, 6], [3, 8], [3, 10], [9, 11], [8, 9], [0, 3], [2, 10], [2, 6], [8, 10], [10, 11], [9, 10], [4, 8], [1, 2], [1, 10], [6, 8], [3, 11], [7, 10], [6, 10... | {"n": 12, "edges1": [[1, 11], [1, 5], [4, 6], [8, 11], [1, 7], [2, 11], [2, 9], [3, 6], [5, 6], [3, 8], [3, 10], [9, 11], [8, 9], [0, 3], [2, 10], [2, 6], [8, 10], [10, 11], [9, 10], [4, 8], [1, 2], [1, 10], [6, 8], [3, 11], [7, 10], [6, 10], [0, 10], [2, 3], [0, 5], [5, 9], [0, 4], [1, 6], [3, 7], [5, 8], [0, 7], [7, ... | null | null | null | {"p": [3, 10, 4, 9, 2, 1, 0, 11, 8, 5, 7, 6]} | 1 |
construct-rlve-graph-isomorphism-l3-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 29 edges.
G1 edges: [[9, 10], [4, 6], [2, 4], [6, 11], [1, 5], [5, 8], [3, 5], [9, 11], [2, 11], [5, 11], [5, 9], [1, 3], [1, 9], [2, 10], [1, 4], [2, 7], [3, 6], [0, 6], [2, 3], [0, 8], [0, 7], [0, 4], [4, 9], [10, 11], [7, 10], [0, 3], [8... | {"n": 12, "edges1": [[9, 10], [4, 6], [2, 4], [6, 11], [1, 5], [5, 8], [3, 5], [9, 11], [2, 11], [5, 11], [5, 9], [1, 3], [1, 9], [2, 10], [1, 4], [2, 7], [3, 6], [0, 6], [2, 3], [0, 8], [0, 7], [0, 4], [4, 9], [10, 11], [7, 10], [0, 3], [8, 9], [2, 5], [4, 7]], "edges2": [[7, 11], [3, 10], [1, 6], [3, 5], [1, 10], [0,... | null | null | null | {"p": [3, 7, 4, 9, 10, 8, 1, 2, 5, 11, 0, 6]} | 1 |
construct-rlve-graph-isomorphism-l3-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 3 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 23 edges.
G1 edges: [[3, 7], [6, 7], [0, 4], [0, 6], [2, 8], [5, 9], [1, 11], [4, 9], [0, 1], [0, 9], [1, 6], [3, 8], [1, 9], [0, 5], [2, 11], [3, 11], [2, 9], [1, 3], [2, 5], [8, 9], [6, 8], [2, 3], [7, 10]]
G2 edges: [[7, 9], [5, 10], [1,... | {"n": 12, "edges1": [[3, 7], [6, 7], [0, 4], [0, 6], [2, 8], [5, 9], [1, 11], [4, 9], [0, 1], [0, 9], [1, 6], [3, 8], [1, 9], [0, 5], [2, 11], [3, 11], [2, 9], [1, 3], [2, 5], [8, 9], [6, 8], [2, 3], [7, 10]], "edges2": [[7, 9], [5, 10], [1, 2], [6, 9], [4, 8], [6, 7], [9, 11], [5, 6], [4, 11], [3, 7], [0, 9], [4, 7], ... | null | null | null | {"p": [9, 0, 5, 8, 3, 6, 11, 1, 4, 7, 2, 10]} | 1 |
construct-rlve-graph-isomorphism-l4-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 84 edges.
G1 edges: [[14, 17], [12, 17], [5, 8], [1, 11], [12, 13], [10, 14], [16, 17], [3, 12], [8, 16], [15, 17], [6, 13], [3, 17], [9, 14], [3, 13], [9, 16], [7, 12], [9, 12], [4, 6], [5, 6], [3, 9], [1, 6], [8, 12], [7, 16], [0, 9], [9,... | {"n": 18, "edges1": [[14, 17], [12, 17], [5, 8], [1, 11], [12, 13], [10, 14], [16, 17], [3, 12], [8, 16], [15, 17], [6, 13], [3, 17], [9, 14], [3, 13], [9, 16], [7, 12], [9, 12], [4, 6], [5, 6], [3, 9], [1, 6], [8, 12], [7, 16], [0, 9], [9, 17], [13, 14], [3, 6], [11, 16], [0, 12], [13, 16], [3, 5], [11, 15], [0, 3], [... | null | null | null | {"p": [5, 10, 15, 9, 0, 6, 8, 11, 4, 12, 14, 3, 13, 16, 1, 7, 17, 2]} | 1 |
construct-rlve-graph-isomorphism-l4-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 53 edges.
G1 edges: [[2, 3], [8, 12], [0, 15], [2, 12], [7, 12], [1, 7], [9, 13], [11, 15], [1, 12], [8, 10], [9, 17], [6, 16], [0, 1], [0, 9], [7, 13], [5, 14], [11, 13], [14, 16], [7, 17], [6, 10], [2, 10], [0, 2], [5, 6], [0, 11], [3, 11... | {"n": 18, "edges1": [[2, 3], [8, 12], [0, 15], [2, 12], [7, 12], [1, 7], [9, 13], [11, 15], [1, 12], [8, 10], [9, 17], [6, 16], [0, 1], [0, 9], [7, 13], [5, 14], [11, 13], [14, 16], [7, 17], [6, 10], [2, 10], [0, 2], [5, 6], [0, 11], [3, 11], [15, 16], [12, 14], [0, 14], [7, 14], [3, 8], [7, 16], [0, 3], [2, 4], [6, 7]... | null | null | null | {"p": [0, 7, 1, 15, 2, 9, 6, 16, 12, 10, 17, 11, 3, 5, 4, 8, 13, 14]} | 1 |
construct-rlve-graph-isomorphism-l4-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 114 edges.
G1 edges: [[11, 15], [0, 1], [0, 8], [4, 15], [0, 10], [13, 17], [1, 13], [5, 9], [9, 14], [11, 16], [5, 14], [15, 16], [1, 15], [1, 5], [3, 15], [9, 10], [12, 17], [0, 16], [11, 13], [5, 16], [2, 15], [12, 16], [0, 12], [10, 16]... | {"n": 18, "edges1": [[11, 15], [0, 1], [0, 8], [4, 15], [0, 10], [13, 17], [1, 13], [5, 9], [9, 14], [11, 16], [5, 14], [15, 16], [1, 15], [1, 5], [3, 15], [9, 10], [12, 17], [0, 16], [11, 13], [5, 16], [2, 15], [12, 16], [0, 12], [10, 16], [4, 11], [0, 5], [8, 12], [5, 11], [5, 6], [3, 17], [1, 14], [1, 12], [7, 15], ... | null | null | null | {"p": [8, 9, 10, 15, 14, 0, 13, 11, 3, 2, 7, 5, 6, 12, 1, 17, 4, 16]} | 1 |
construct-rlve-graph-isomorphism-l4-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 68 edges.
G1 edges: [[16, 17], [8, 16], [3, 9], [10, 16], [3, 11], [5, 16], [1, 10], [4, 16], [12, 17], [2, 12], [1, 4], [9, 16], [11, 17], [5, 10], [6, 15], [0, 6], [7, 15], [6, 16], [8, 11], [0, 16], [8, 9], [1, 6], [8, 12], [0, 15], [5, ... | {"n": 18, "edges1": [[16, 17], [8, 16], [3, 9], [10, 16], [3, 11], [5, 16], [1, 10], [4, 16], [12, 17], [2, 12], [1, 4], [9, 16], [11, 17], [5, 10], [6, 15], [0, 6], [7, 15], [6, 16], [8, 11], [0, 16], [8, 9], [1, 6], [8, 12], [0, 15], [5, 9], [3, 8], [3, 15], [2, 10], [0, 4], [7, 13], [12, 14], [6, 7], [1, 11], [5, 11... | null | null | null | {"p": [6, 5, 12, 9, 7, 17, 3, 4, 16, 8, 0, 2, 1, 15, 10, 11, 14, 13]} | 1 |
construct-rlve-graph-isomorphism-l4-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 114 edges.
G1 edges: [[0, 14], [7, 9], [12, 13], [2, 8], [10, 12], [6, 12], [5, 14], [3, 13], [7, 16], [10, 14], [0, 17], [11, 13], [1, 7], [2, 17], [2, 5], [3, 15], [3, 17], [4, 12], [15, 17], [10, 15], [6, 14], [2, 10], [7, 13], [12, 14],... | {"n": 18, "edges1": [[0, 14], [7, 9], [12, 13], [2, 8], [10, 12], [6, 12], [5, 14], [3, 13], [7, 16], [10, 14], [0, 17], [11, 13], [1, 7], [2, 17], [2, 5], [3, 15], [3, 17], [4, 12], [15, 17], [10, 15], [6, 14], [2, 10], [7, 13], [12, 14], [4, 6], [8, 12], [3, 8], [5, 13], [3, 11], [8, 10], [5, 17], [1, 8], [11, 17], [... | null | null | null | {"p": [2, 1, 9, 8, 5, 0, 10, 7, 12, 4, 16, 15, 11, 14, 17, 13, 6, 3]} | 1 |
construct-rlve-graph-isomorphism-l4-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 99 edges.
G1 edges: [[1, 4], [3, 9], [12, 17], [3, 14], [0, 16], [12, 16], [0, 5], [0, 1], [2, 7], [9, 15], [4, 13], [3, 7], [1, 2], [3, 10], [7, 9], [1, 14], [15, 17], [10, 15], [14, 15], [2, 10], [9, 11], [4, 12], [6, 7], [5, 16], [10, 11... | {"n": 18, "edges1": [[1, 4], [3, 9], [12, 17], [3, 14], [0, 16], [12, 16], [0, 5], [0, 1], [2, 7], [9, 15], [4, 13], [3, 7], [1, 2], [3, 10], [7, 9], [1, 14], [15, 17], [10, 15], [14, 15], [2, 10], [9, 11], [4, 12], [6, 7], [5, 16], [10, 11], [1, 13], [9, 13], [7, 14], [15, 16], [12, 13], [5, 14], [9, 12], [7, 10], [4,... | null | null | null | {"p": [17, 0, 8, 11, 7, 9, 2, 6, 4, 16, 1, 5, 13, 3, 10, 12, 14, 15]} | 1 |
construct-rlve-graph-isomorphism-l4-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 68 edges.
G1 edges: [[4, 11], [7, 9], [7, 11], [10, 16], [3, 15], [12, 17], [10, 15], [0, 10], [15, 16], [13, 14], [12, 14], [4, 7], [1, 11], [7, 16], [3, 11], [1, 5], [8, 13], [9, 12], [4, 13], [5, 15], [5, 12], [2, 11], [4, 6], [6, 7], [2... | {"n": 18, "edges1": [[4, 11], [7, 9], [7, 11], [10, 16], [3, 15], [12, 17], [10, 15], [0, 10], [15, 16], [13, 14], [12, 14], [4, 7], [1, 11], [7, 16], [3, 11], [1, 5], [8, 13], [9, 12], [4, 13], [5, 15], [5, 12], [2, 11], [4, 6], [6, 7], [2, 17], [3, 4], [3, 12], [10, 13], [6, 16], [2, 4], [0, 4], [7, 13], [2, 12], [0,... | null | null | null | {"p": [12, 8, 13, 10, 16, 4, 1, 0, 9, 17, 6, 2, 7, 5, 15, 3, 11, 14]} | 1 |
construct-rlve-graph-isomorphism-l4-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 53 edges.
G1 edges: [[1, 16], [4, 15], [4, 17], [1, 12], [3, 6], [13, 16], [2, 3], [7, 16], [8, 11], [8, 9], [4, 5], [2, 13], [11, 13], [3, 9], [7, 8], [7, 15], [3, 12], [8, 13], [1, 6], [0, 8], [5, 13], [7, 12], [9, 16], [4, 9], [5, 9], [1... | {"n": 18, "edges1": [[1, 16], [4, 15], [4, 17], [1, 12], [3, 6], [13, 16], [2, 3], [7, 16], [8, 11], [8, 9], [4, 5], [2, 13], [11, 13], [3, 9], [7, 8], [7, 15], [3, 12], [8, 13], [1, 6], [0, 8], [5, 13], [7, 12], [9, 16], [4, 9], [5, 9], [13, 14], [7, 11], [0, 2], [4, 12], [11, 15], [14, 15], [5, 12], [7, 13], [3, 8], ... | null | null | null | {"p": [16, 15, 7, 8, 17, 13, 4, 3, 0, 2, 6, 5, 14, 10, 1, 12, 11, 9]} | 1 |
construct-rlve-graph-isomorphism-l4-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 114 edges.
G1 edges: [[7, 9], [10, 15], [8, 10], [3, 13], [0, 4], [0, 2], [2, 14], [3, 11], [9, 13], [3, 17], [10, 14], [0, 1], [5, 12], [3, 5], [12, 15], [5, 14], [1, 2], [9, 15], [11, 16], [9, 11], [12, 14], [6, 12], [5, 9], [14, 17], [1,... | {"n": 18, "edges1": [[7, 9], [10, 15], [8, 10], [3, 13], [0, 4], [0, 2], [2, 14], [3, 11], [9, 13], [3, 17], [10, 14], [0, 1], [5, 12], [3, 5], [12, 15], [5, 14], [1, 2], [9, 15], [11, 16], [9, 11], [12, 14], [6, 12], [5, 9], [14, 17], [1, 8], [5, 10], [0, 5], [1, 5], [6, 8], [6, 11], [2, 9], [2, 10], [0, 7], [11, 14],... | null | null | null | {"p": [5, 0, 16, 3, 12, 7, 10, 11, 9, 17, 1, 14, 8, 6, 4, 15, 13, 2]} | 1 |
construct-rlve-graph-isomorphism-l4-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 4 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 84 edges.
G1 edges: [[3, 16], [4, 17], [4, 6], [11, 15], [2, 11], [14, 16], [11, 14], [6, 17], [13, 17], [10, 14], [11, 17], [2, 6], [5, 6], [2, 15], [1, 14], [7, 15], [2, 16], [10, 13], [4, 16], [0, 10], [1, 17], [3, 11], [4, 9], [8, 13], ... | {"n": 18, "edges1": [[3, 16], [4, 17], [4, 6], [11, 15], [2, 11], [14, 16], [11, 14], [6, 17], [13, 17], [10, 14], [11, 17], [2, 6], [5, 6], [2, 15], [1, 14], [7, 15], [2, 16], [10, 13], [4, 16], [0, 10], [1, 17], [3, 11], [4, 9], [8, 13], [1, 7], [1, 9], [7, 8], [5, 12], [1, 2], [10, 12], [5, 17], [3, 8], [7, 14], [9,... | null | null | null | {"p": [2, 14, 9, 11, 15, 8, 0, 1, 3, 7, 16, 4, 10, 6, 5, 12, 17, 13]} | 1 |
construct-rlve-graph-isomorphism-l5-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 48 edges.
G1 edges: [[14, 19], [11, 22], [3, 5], [15, 17], [1, 24], [3, 8], [17, 19], [15, 23], [3, 12], [6, 10], [4, 24], [0, 25], [2, 5], [8, 18], [2, 15], [15, 19], [3, 9], [5, 18], [0, 15], [22, 23], [15, 16], [8, 16], [1, 9], [0, 12], ... | {"n": 26, "edges1": [[14, 19], [11, 22], [3, 5], [15, 17], [1, 24], [3, 8], [17, 19], [15, 23], [3, 12], [6, 10], [4, 24], [0, 25], [2, 5], [8, 18], [2, 15], [15, 19], [3, 9], [5, 18], [0, 15], [22, 23], [15, 16], [8, 16], [1, 9], [0, 12], [12, 19], [16, 17], [5, 14], [1, 6], [20, 24], [3, 14], [3, 4], [9, 13], [6, 21]... | null | null | null | {"p": [1, 11, 19, 21, 12, 6, 20, 9, 16, 13, 0, 15, 23, 17, 25, 22, 14, 8, 10, 3, 18, 2, 24, 4, 5, 7]} | 1 |
construct-rlve-graph-isomorphism-l5-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 48 edges.
G1 edges: [[4, 14], [7, 14], [6, 8], [4, 13], [15, 25], [5, 11], [0, 9], [19, 21], [0, 16], [11, 21], [5, 14], [2, 4], [1, 12], [11, 13], [1, 25], [14, 17], [10, 17], [2, 18], [2, 19], [6, 21], [7, 9], [11, 25], [7, 10], [4, 7], [... | {"n": 26, "edges1": [[4, 14], [7, 14], [6, 8], [4, 13], [15, 25], [5, 11], [0, 9], [19, 21], [0, 16], [11, 21], [5, 14], [2, 4], [1, 12], [11, 13], [1, 25], [14, 17], [10, 17], [2, 18], [2, 19], [6, 21], [7, 9], [11, 25], [7, 10], [4, 7], [10, 13], [0, 10], [1, 22], [8, 24], [10, 18], [7, 17], [2, 25], [6, 18], [4, 19]... | null | null | null | {"p": [24, 11, 9, 21, 3, 8, 1, 6, 10, 18, 20, 12, 2, 22, 16, 17, 5, 0, 23, 7, 25, 15, 13, 4, 19, 14]} | 1 |
construct-rlve-graph-isomorphism-l5-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 211 edges.
G1 edges: [[9, 17], [17, 21], [4, 24], [6, 25], [7, 21], [11, 15], [11, 13], [3, 6], [9, 15], [5, 23], [7, 23], [3, 25], [13, 23], [0, 7], [13, 15], [0, 18], [5, 11], [12, 13], [10, 14], [12, 15], [0, 17], [1, 4], [4, 23], [10, 2... | {"n": 26, "edges1": [[9, 17], [17, 21], [4, 24], [6, 25], [7, 21], [11, 15], [11, 13], [3, 6], [9, 15], [5, 23], [7, 23], [3, 25], [13, 23], [0, 7], [13, 15], [0, 18], [5, 11], [12, 13], [10, 14], [12, 15], [0, 17], [1, 4], [4, 23], [10, 20], [5, 15], [10, 12], [1, 18], [4, 6], [16, 20], [4, 17], [7, 9], [6, 8], [15, 2... | null | null | null | {"p": [0, 7, 1, 10, 18, 4, 12, 3, 6, 5, 8, 14, 23, 2, 24, 22, 13, 11, 17, 19, 16, 21, 9, 20, 15, 25]} | 1 |
construct-rlve-graph-isomorphism-l5-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 48 edges.
G1 edges: [[7, 11], [4, 22], [8, 17], [6, 24], [7, 21], [20, 25], [7, 15], [14, 21], [1, 17], [12, 15], [8, 15], [7, 10], [11, 12], [18, 25], [23, 24], [11, 23], [7, 23], [3, 15], [0, 10], [2, 8], [5, 25], [12, 25], [1, 11], [1, 1... | {"n": 26, "edges1": [[7, 11], [4, 22], [8, 17], [6, 24], [7, 21], [20, 25], [7, 15], [14, 21], [1, 17], [12, 15], [8, 15], [7, 10], [11, 12], [18, 25], [23, 24], [11, 23], [7, 23], [3, 15], [0, 10], [2, 8], [5, 25], [12, 25], [1, 11], [1, 13], [9, 25], [10, 20], [9, 20], [5, 10], [7, 12], [13, 15], [15, 23], [10, 24], ... | null | null | null | {"p": [10, 12, 3, 13, 2, 17, 19, 16, 1, 22, 11, 15, 6, 24, 21, 5, 8, 20, 4, 7, 0, 23, 9, 18, 25, 14]} | 1 |
construct-rlve-graph-isomorphism-l5-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 113 edges.
G1 edges: [[18, 19], [20, 23], [11, 23], [4, 14], [15, 17], [24, 25], [10, 19], [17, 22], [14, 23], [12, 21], [5, 8], [0, 24], [10, 20], [11, 13], [3, 20], [3, 22], [0, 3], [0, 17], [15, 20], [20, 22], [2, 9], [20, 21], [0, 8], [... | {"n": 26, "edges1": [[18, 19], [20, 23], [11, 23], [4, 14], [15, 17], [24, 25], [10, 19], [17, 22], [14, 23], [12, 21], [5, 8], [0, 24], [10, 20], [11, 13], [3, 20], [3, 22], [0, 3], [0, 17], [15, 20], [20, 22], [2, 9], [20, 21], [0, 8], [5, 10], [12, 20], [9, 16], [3, 17], [0, 10], [17, 19], [12, 24], [8, 12], [3, 14]... | null | null | null | {"p": [12, 4, 20, 15, 5, 25, 1, 3, 2, 14, 21, 19, 23, 11, 13, 7, 16, 10, 8, 18, 6, 0, 24, 22, 9, 17]} | 1 |
construct-rlve-graph-isomorphism-l5-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 48 edges.
G1 edges: [[6, 21], [3, 8], [0, 8], [4, 15], [8, 13], [0, 19], [4, 22], [13, 18], [20, 22], [6, 11], [13, 25], [1, 25], [2, 13], [22, 24], [6, 14], [15, 22], [13, 23], [12, 23], [11, 23], [7, 14], [15, 16], [2, 15], [1, 5], [0, 3]... | {"n": 26, "edges1": [[6, 21], [3, 8], [0, 8], [4, 15], [8, 13], [0, 19], [4, 22], [13, 18], [20, 22], [6, 11], [13, 25], [1, 25], [2, 13], [22, 24], [6, 14], [15, 22], [13, 23], [12, 23], [11, 23], [7, 14], [15, 16], [2, 15], [1, 5], [0, 3], [5, 12], [16, 25], [4, 23], [11, 20], [8, 20], [6, 23], [4, 9], [21, 22], [0, ... | null | null | null | {"p": [11, 21, 18, 4, 20, 16, 6, 15, 10, 24, 12, 0, 13, 3, 14, 17, 7, 1, 9, 8, 25, 23, 5, 22, 19, 2]} | 1 |
construct-rlve-graph-isomorphism-l5-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 81 edges.
G1 edges: [[3, 19], [10, 11], [2, 20], [15, 21], [8, 11], [2, 23], [6, 22], [10, 14], [2, 9], [6, 13], [8, 9], [3, 22], [3, 16], [0, 15], [2, 12], [12, 18], [7, 24], [2, 21], [2, 4], [3, 7], [11, 18], [1, 17], [1, 14], [15, 17], [... | {"n": 26, "edges1": [[3, 19], [10, 11], [2, 20], [15, 21], [8, 11], [2, 23], [6, 22], [10, 14], [2, 9], [6, 13], [8, 9], [3, 22], [3, 16], [0, 15], [2, 12], [12, 18], [7, 24], [2, 21], [2, 4], [3, 7], [11, 18], [1, 17], [1, 14], [15, 17], [19, 24], [1, 21], [16, 21], [0, 6], [6, 11], [9, 20], [5, 22], [19, 25], [2, 3],... | null | null | null | {"p": [5, 17, 20, 21, 2, 6, 18, 19, 8, 1, 12, 22, 15, 11, 3, 9, 25, 24, 10, 14, 7, 13, 16, 23, 4, 0]} | 1 |
construct-rlve-graph-isomorphism-l5-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 146 edges.
G1 edges: [[10, 22], [9, 20], [9, 10], [10, 20], [1, 9], [7, 21], [4, 11], [14, 18], [1, 15], [2, 11], [4, 7], [16, 21], [8, 18], [15, 21], [7, 18], [13, 22], [8, 12], [1, 16], [6, 12], [7, 23], [22, 24], [6, 20], [8, 19], [15, 1... | {"n": 26, "edges1": [[10, 22], [9, 20], [9, 10], [10, 20], [1, 9], [7, 21], [4, 11], [14, 18], [1, 15], [2, 11], [4, 7], [16, 21], [8, 18], [15, 21], [7, 18], [13, 22], [8, 12], [1, 16], [6, 12], [7, 23], [22, 24], [6, 20], [8, 19], [15, 16], [7, 22], [12, 14], [14, 25], [4, 19], [8, 14], [3, 4], [15, 20], [0, 20], [0,... | null | null | null | {"p": [16, 4, 13, 24, 20, 17, 19, 8, 25, 1, 14, 9, 18, 0, 10, 23, 22, 21, 11, 7, 3, 2, 12, 15, 5, 6]} | 1 |
construct-rlve-graph-isomorphism-l5-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 113 edges.
G1 edges: [[4, 9], [7, 25], [2, 5], [12, 22], [12, 23], [4, 25], [13, 17], [6, 18], [0, 4], [4, 20], [18, 19], [20, 25], [20, 22], [6, 12], [3, 24], [2, 18], [0, 19], [4, 19], [19, 21], [24, 25], [16, 17], [12, 20], [6, 13], [22,... | {"n": 26, "edges1": [[4, 9], [7, 25], [2, 5], [12, 22], [12, 23], [4, 25], [13, 17], [6, 18], [0, 4], [4, 20], [18, 19], [20, 25], [20, 22], [6, 12], [3, 24], [2, 18], [0, 19], [4, 19], [19, 21], [24, 25], [16, 17], [12, 20], [6, 13], [22, 25], [17, 25], [3, 14], [0, 3], [3, 16], [18, 25], [11, 22], [16, 24], [9, 17], ... | null | null | null | {"p": [23, 25, 12, 14, 0, 9, 4, 17, 2, 7, 21, 1, 10, 5, 24, 19, 22, 15, 3, 6, 20, 13, 11, 16, 8, 18]} | 1 |
construct-rlve-graph-isomorphism-l5-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 5 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 26 vertices labelled 0..25 and 113 edges.
G1 edges: [[0, 16], [0, 21], [2, 19], [6, 17], [9, 14], [4, 7], [11, 24], [0, 20], [2, 8], [9, 22], [2, 20], [5, 21], [9, 17], [7, 21], [19, 23], [4, 25], [7, 8], [4, 15], [11, 18], [6, 25], [8, 12], [0, 9], [6, 23], [21, 23], [9... | {"n": 26, "edges1": [[0, 16], [0, 21], [2, 19], [6, 17], [9, 14], [4, 7], [11, 24], [0, 20], [2, 8], [9, 22], [2, 20], [5, 21], [9, 17], [7, 21], [19, 23], [4, 25], [7, 8], [4, 15], [11, 18], [6, 25], [8, 12], [0, 9], [6, 23], [21, 23], [9, 13], [16, 18], [11, 13], [2, 18], [1, 3], [12, 17], [6, 11], [13, 22], [17, 25]... | null | null | null | {"p": [7, 12, 0, 13, 17, 19, 21, 10, 11, 20, 3, 5, 24, 18, 22, 15, 14, 4, 1, 25, 16, 2, 8, 6, 9, 23]} | 1 |
construct-rlve-graph-isomorphism-l6-s0 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges.
G1 edges: [[15, 32], [17, 36], [13, 18], [22, 28], [15, 23], [25, 33], [24, 25], [18, 33], [1, 29], [5, 8], [27, 30], [3, 24], [5, 32], [12, 33], [16, 29], [3, 25], [0, 26], [1, 6], [5, 17], [22, 27], [8, 14], [6, 33], [14, 30], ... | {"n": 40, "edges1": [[15, 32], [17, 36], [13, 18], [22, 28], [15, 23], [25, 33], [24, 25], [18, 33], [1, 29], [5, 8], [27, 30], [3, 24], [5, 32], [12, 33], [16, 29], [3, 25], [0, 26], [1, 6], [5, 17], [22, 27], [8, 14], [6, 33], [14, 30], [6, 29], [4, 31], [2, 7], [10, 30], [8, 31], [2, 3], [2, 11], [17, 26], [5, 38], ... | null | null | null | {"p": [10, 19, 20, 12, 37, 30, 1, 36, 28, 18, 38, 27, 14, 17, 0, 22, 11, 5, 25, 34, 3, 15, 16, 29, 6, 7, 26, 9, 23, 2, 32, 35, 31, 33, 8, 24, 21, 39, 4, 13]} | 1 |
construct-rlve-graph-isomorphism-l6-s1 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 351 edges.
G1 edges: [[22, 38], [17, 19], [1, 25], [17, 27], [19, 25], [13, 29], [22, 30], [5, 34], [25, 32], [0, 16], [28, 30], [16, 30], [29, 38], [9, 20], [2, 29], [25, 26], [12, 26], [4, 30], [26, 36], [20, 31], [13, 33], [18, 34], [5, ... | {"n": 40, "edges1": [[22, 38], [17, 19], [1, 25], [17, 27], [19, 25], [13, 29], [22, 30], [5, 34], [25, 32], [0, 16], [28, 30], [16, 30], [29, 38], [9, 20], [2, 29], [25, 26], [12, 26], [4, 30], [26, 36], [20, 31], [13, 33], [18, 34], [5, 33], [18, 26], [5, 37], [11, 15], [6, 9], [6, 14], [21, 39], [19, 32], [24, 39], ... | null | null | null | {"p": [21, 36, 13, 11, 34, 8, 0, 6, 10, 19, 22, 31, 18, 24, 37, 3, 9, 7, 39, 17, 38, 27, 33, 28, 12, 20, 15, 4, 16, 25, 5, 2, 14, 35, 26, 1, 23, 32, 30, 29]} | 1 |
construct-rlve-graph-isomorphism-l6-s2 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 429 edges.
G1 edges: [[4, 36], [30, 34], [0, 6], [27, 32], [19, 26], [22, 31], [26, 29], [7, 34], [10, 12], [8, 38], [2, 16], [20, 33], [15, 23], [3, 10], [19, 35], [1, 26], [3, 39], [4, 16], [17, 36], [0, 24], [18, 38], [21, 39], [15, 17],... | {"n": 40, "edges1": [[4, 36], [30, 34], [0, 6], [27, 32], [19, 26], [22, 31], [26, 29], [7, 34], [10, 12], [8, 38], [2, 16], [20, 33], [15, 23], [3, 10], [19, 35], [1, 26], [3, 39], [4, 16], [17, 36], [0, 24], [18, 38], [21, 39], [15, 17], [7, 26], [4, 29], [12, 14], [32, 39], [13, 32], [14, 34], [20, 29], [11, 24], [1... | null | null | null | {"p": [30, 27, 10, 37, 33, 29, 0, 32, 31, 13, 19, 17, 8, 38, 6, 21, 39, 25, 20, 2, 16, 11, 12, 18, 34, 7, 26, 14, 24, 22, 36, 4, 28, 15, 1, 9, 5, 35, 3, 23]} | 1 |
construct-rlve-graph-isomorphism-l6-s3 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 117 edges.
G1 edges: [[11, 39], [3, 24], [2, 31], [11, 20], [22, 36], [14, 26], [1, 11], [3, 15], [15, 31], [27, 36], [24, 39], [11, 29], [7, 36], [0, 16], [1, 13], [11, 35], [4, 14], [8, 33], [25, 31], [3, 32], [1, 18], [12, 22], [28, 37],... | {"n": 40, "edges1": [[11, 39], [3, 24], [2, 31], [11, 20], [22, 36], [14, 26], [1, 11], [3, 15], [15, 31], [27, 36], [24, 39], [11, 29], [7, 36], [0, 16], [1, 13], [11, 35], [4, 14], [8, 33], [25, 31], [3, 32], [1, 18], [12, 22], [28, 37], [6, 21], [6, 25], [19, 26], [0, 39], [3, 22], [26, 37], [9, 14], [4, 29], [8, 39... | null | null | null | {"p": [16, 23, 8, 11, 18, 21, 26, 19, 0, 20, 37, 2, 34, 7, 4, 3, 6, 29, 15, 12, 1, 9, 28, 25, 39, 13, 30, 27, 22, 33, 10, 36, 5, 24, 14, 38, 31, 35, 32, 17]} | 1 |
construct-rlve-graph-isomorphism-l6-s4 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 507 edges.
G1 edges: [[0, 23], [14, 24], [31, 35], [7, 16], [11, 34], [17, 31], [4, 24], [23, 39], [1, 18], [21, 26], [3, 29], [4, 22], [27, 28], [36, 39], [2, 22], [22, 23], [11, 22], [30, 38], [19, 35], [1, 36], [28, 33], [1, 17], [3, 38]... | {"n": 40, "edges1": [[0, 23], [14, 24], [31, 35], [7, 16], [11, 34], [17, 31], [4, 24], [23, 39], [1, 18], [21, 26], [3, 29], [4, 22], [27, 28], [36, 39], [2, 22], [22, 23], [11, 22], [30, 38], [19, 35], [1, 36], [28, 33], [1, 17], [3, 38], [24, 35], [14, 28], [12, 13], [0, 6], [21, 35], [19, 34], [24, 25], [14, 21], [... | null | null | null | {"p": [3, 32, 24, 25, 22, 38, 2, 20, 27, 37, 21, 31, 15, 28, 11, 18, 39, 26, 34, 14, 29, 30, 4, 12, 23, 10, 33, 35, 8, 0, 17, 1, 5, 16, 6, 9, 7, 36, 19, 13]} | 1 |
construct-rlve-graph-isomorphism-l6-s5 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 429 edges.
G1 edges: [[13, 37], [14, 22], [8, 12], [33, 39], [4, 34], [18, 36], [12, 14], [15, 24], [9, 39], [31, 35], [15, 39], [13, 34], [2, 20], [24, 39], [9, 19], [5, 25], [19, 28], [10, 15], [12, 30], [8, 38], [1, 24], [29, 39], [15, 2... | {"n": 40, "edges1": [[13, 37], [14, 22], [8, 12], [33, 39], [4, 34], [18, 36], [12, 14], [15, 24], [9, 39], [31, 35], [15, 39], [13, 34], [2, 20], [24, 39], [9, 19], [5, 25], [19, 28], [10, 15], [12, 30], [8, 38], [1, 24], [29, 39], [15, 21], [16, 37], [25, 38], [3, 29], [25, 35], [8, 36], [9, 11], [27, 36], [3, 27], [... | null | null | null | {"p": [21, 0, 36, 9, 39, 37, 32, 2, 14, 23, 30, 8, 35, 1, 25, 38, 28, 6, 27, 24, 31, 11, 19, 33, 20, 29, 7, 26, 12, 4, 34, 10, 22, 18, 15, 17, 3, 5, 13, 16]} | 1 |
construct-rlve-graph-isomorphism-l6-s6 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 585 edges.
G1 edges: [[33, 36], [8, 25], [28, 30], [5, 8], [4, 9], [1, 12], [2, 18], [11, 25], [0, 13], [4, 5], [24, 31], [12, 14], [2, 32], [2, 17], [20, 35], [10, 37], [16, 22], [1, 5], [22, 31], [38, 39], [33, 35], [9, 18], [9, 33], [9, ... | {"n": 40, "edges1": [[33, 36], [8, 25], [28, 30], [5, 8], [4, 9], [1, 12], [2, 18], [11, 25], [0, 13], [4, 5], [24, 31], [12, 14], [2, 32], [2, 17], [20, 35], [10, 37], [16, 22], [1, 5], [22, 31], [38, 39], [33, 35], [9, 18], [9, 33], [9, 28], [2, 6], [34, 35], [23, 28], [0, 9], [22, 38], [12, 23], [5, 27], [2, 21], [2... | null | null | null | {"p": [26, 17, 6, 24, 12, 34, 37, 33, 1, 16, 30, 19, 11, 18, 39, 27, 28, 4, 5, 22, 7, 8, 36, 15, 13, 2, 25, 0, 38, 32, 3, 31, 29, 21, 35, 9, 10, 14, 20, 23]} | 1 |
construct-rlve-graph-isomorphism-l6-s7 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 507 edges.
G1 edges: [[15, 17], [13, 22], [4, 23], [34, 36], [15, 23], [17, 22], [3, 7], [11, 23], [13, 26], [0, 21], [8, 35], [4, 31], [20, 25], [9, 23], [13, 27], [7, 12], [19, 28], [21, 32], [4, 15], [22, 24], [28, 29], [21, 30], [23, 39... | {"n": 40, "edges1": [[15, 17], [13, 22], [4, 23], [34, 36], [15, 23], [17, 22], [3, 7], [11, 23], [13, 26], [0, 21], [8, 35], [4, 31], [20, 25], [9, 23], [13, 27], [7, 12], [19, 28], [21, 32], [4, 15], [22, 24], [28, 29], [21, 30], [23, 39], [21, 34], [7, 17], [31, 38], [22, 37], [0, 6], [8, 12], [8, 25], [3, 12], [2, ... | null | null | null | {"p": [36, 30, 39, 14, 10, 28, 34, 4, 1, 38, 29, 16, 12, 7, 6, 3, 32, 17, 20, 22, 26, 24, 33, 0, 35, 9, 19, 18, 5, 15, 27, 37, 11, 23, 31, 13, 21, 25, 8, 2]} | 1 |
construct-rlve-graph-isomorphism-l6-s8 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges.
G1 edges: [[13, 34], [17, 28], [17, 29], [1, 26], [0, 38], [30, 31], [8, 31], [0, 37], [34, 36], [8, 28], [6, 8], [4, 5], [19, 23], [25, 31], [19, 28], [7, 39], [11, 30], [0, 22], [30, 33], [4, 27], [5, 6], [1, 32], [26, 32], [18... | {"n": 40, "edges1": [[13, 34], [17, 28], [17, 29], [1, 26], [0, 38], [30, 31], [8, 31], [0, 37], [34, 36], [8, 28], [6, 8], [4, 5], [19, 23], [25, 31], [19, 28], [7, 39], [11, 30], [0, 22], [30, 33], [4, 27], [5, 6], [1, 32], [26, 32], [18, 34], [12, 31], [21, 36], [17, 27], [21, 24], [12, 13], [1, 22], [11, 13], [13, ... | null | null | null | {"p": [15, 39, 8, 17, 23, 34, 1, 20, 13, 22, 4, 27, 3, 14, 19, 37, 9, 25, 30, 18, 26, 12, 0, 35, 11, 24, 10, 28, 29, 16, 38, 2, 5, 7, 6, 33, 36, 31, 21, 32]} | 1 |
construct-rlve-graph-isomorphism-l6-s9 | construct | rlve_graph_isomorphism | graph_isomorphism | graph_theory | competition | 6 | RLVE-Gym/graph_isomorphism | MIT | [
"agentic_trivial",
"np_search"
] | Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges.
G1 edges: [[12, 36], [18, 24], [5, 7], [1, 19], [13, 35], [13, 25], [22, 29], [8, 9], [7, 12], [3, 26], [2, 25], [8, 17], [9, 15], [0, 12], [6, 28], [7, 27], [13, 18], [17, 39], [24, 36], [9, 11], [22, 31], [10, 21], [22, 25], [2... | {"n": 40, "edges1": [[12, 36], [18, 24], [5, 7], [1, 19], [13, 35], [13, 25], [22, 29], [8, 9], [7, 12], [3, 26], [2, 25], [8, 17], [9, 15], [0, 12], [6, 28], [7, 27], [13, 18], [17, 39], [24, 36], [9, 11], [22, 31], [10, 21], [22, 25], [2, 21], [2, 17], [18, 27], [19, 30], [30, 37], [12, 28], [14, 23], [5, 20], [10, 2... | null | null | null | {"p": [37, 35, 3, 21, 28, 4, 25, 7, 38, 10, 23, 16, 17, 5, 22, 29, 8, 33, 39, 36, 14, 1, 2, 34, 9, 32, 12, 26, 31, 20, 19, 18, 30, 27, 13, 24, 15, 11, 0, 6]} | 1 |
construct-rlve-grid-parity-construction-l1-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 2 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
11
11
Answer format: {"grid": [row_0, ..., row_1]} where each row is a ... | {"parity": ["11", "11"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11", "11"]} | 1 |
construct-rlve-grid-parity-construction-l1-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
010
010
Answer format: {"grid": [row_0, ..., row_1]} where each row is ... | {"parity": ["010", "010"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["001", "001"]} | 1 |
construct-rlve-grid-parity-construction-l1-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 2 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
00
00
Answer format: {"grid": [row_0, ..., row_1]} where each row is a ... | {"parity": ["00", "00"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00", "00"]} | 1 |
construct-rlve-grid-parity-construction-l1-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
000
000
000
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["000", "000", "000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["000", "000", "000"]} | 1 |
construct-rlve-grid-parity-construction-l1-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 2 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
01
11
01
Answer format: {"grid": [row_0, ..., row_2]} where each row is... | {"parity": ["01", "11", "01"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11", "01", "11"]} | 1 |
construct-rlve-grid-parity-construction-l1-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
010
001
010
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["010", "001", "010"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["011", "110", "011"]} | 1 |
construct-rlve-grid-parity-construction-l1-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
001
011
Answer format: {"grid": [row_0, ..., row_1]} where each row is ... | {"parity": ["001", "011"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["111", "011"]} | 1 |
construct-rlve-grid-parity-construction-l1-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
101
110
011
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["101", "110", "011"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["111", "111", "011"]} | 1 |
construct-rlve-grid-parity-construction-l1-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
010
110
001
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["010", "110", "001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["000", "010", "001"]} | 1 |
construct-rlve-grid-parity-construction-l1-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 1 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
100
110
001
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["100", "110", "001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["101", "001", "000"]} | 1 |
construct-rlve-grid-parity-construction-l2-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 5 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
00000
00000
Answer format: {"grid": [row_0, ..., row_1]} where each row... | {"parity": ["00000", "00000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00000", "00000"]} | 1 |
construct-rlve-grid-parity-construction-l2-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 5 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
01001
10111
Answer format: {"grid": [row_0, ..., row_1]} where each row... | {"parity": ["01001", "10111"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["10111", "11011"]} | 1 |
construct-rlve-grid-parity-construction-l2-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 5 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
11111
01100
00011
Answer format: {"grid": [row_0, ..., row_2]} where ea... | {"parity": ["11111", "01100", "00011"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11110", "10010", "01101"]} | 1 |
construct-rlve-grid-parity-construction-l2-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 4 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
0111
0011
1011
1101
Answer format: {"grid": [row_0, ..., row_3]} where ... | {"parity": ["0111", "0011", "1011", "1101"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0010", "0000", "0001", "1000"]} | 1 |
construct-rlve-grid-parity-construction-l2-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 5 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
00011
01011
11000
11110
Answer format: {"grid": [row_0, ..., row_3]} wh... | {"parity": ["00011", "01011", "11000", "11110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00000", "00011", "01111", "01101"]} | 1 |
construct-rlve-grid-parity-construction-l2-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 3 binary matrix G (entries 0/1) whose parity matrix equals P below. The parity of cell (i, j) is the XOR of G[i][j] and its up/down/left/right neighbours inside the grid (cells outside the grid count as 0).
P (one row per line):
000
111
100
Answer format: {"grid": [row_0, ..., row_2]} where each row... | {"parity": ["000", "111", "100"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["001", "011", "010"]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.