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-grid-parity-construction-l2-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 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
10
01
01
Answer format: {"grid": [row_0, ..., row_3]} where each row... | {"parity": ["00", "10", "01", "01"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00", "00", "10", "10"]} | 1 |
construct-rlve-grid-parity-construction-l2-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 5 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):
10001
01110
01110
01110
10001
Answer format: {"grid": [row_0, ..., row_4... | {"parity": ["10001", "01110", "01110", "01110", "10001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11111", "11111", "11111", "11111", "11111"]} | 1 |
construct-rlve-grid-parity-construction-l2-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 5 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
11
10
11
Answer format: {"grid": [row_0, ..., row_4]} where each ... | {"parity": ["00", "00", "11", "10", "11"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["01", "11", "01", "11", "11"]} | 1 |
construct-rlve-grid-parity-construction-l2-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 2 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 5 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):
1110
0100
0110
0010
0111
Answer format: {"grid": [row_0, ..., row_4]} w... | {"parity": ["1110", "0100", "0110", "0010", "0111"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["1101", "1111", "1111", "1111", "1011"]} | 1 |
construct-rlve-grid-parity-construction-l3-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 8 x 6 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):
100000
110110
000001
010110
101001
111000
001101
001000
Answer format: {... | {"parity": ["100000", "110110", "000001", "010110", "101001", "111000", "001101", "001000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["011011", "000000", "101101", "100000", "001011", "010001", "001000", "000000"]} | 1 |
construct-rlve-grid-parity-construction-l3-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 6 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):
0001
1101
0000
0000
1000
0111
Answer format: {"grid": [row_0, ..., row_5... | {"parity": ["0001", "1101", "0000", "0000", "1000", "0111"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0001", "0010", "1011", "1010", "0000", "0010"]} | 1 |
construct-rlve-grid-parity-construction-l3-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 8 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):
0110
0010
1011
0110
0010
1000
0100
0100
Answer format: {"grid": [row_0, ... | {"parity": ["0110", "0010", "1011", "0110", "0010", "1000", "0100", "0100"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["1000", "1010", "0001", "0010", "0000", "0000", "1000", "1000"]} | 1 |
construct-rlve-grid-parity-construction-l3-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 6 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):
101010
000011
000110
011001
Answer format: {"grid": [row_0, ..., row_3]}... | {"parity": ["101010", "000011", "000110", "011001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["111110", "110111", "111111", "101111"]} | 1 |
construct-rlve-grid-parity-construction-l3-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 7 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
01
01
10
00
11
01
Answer format: {"grid": [row_0, ..., row_6]} where... | {"parity": ["11", "01", "01", "10", "00", "11", "01"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11", "11", "10", "01", "11", "01", "11"]} | 1 |
construct-rlve-grid-parity-construction-l3-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 8 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):
10000000
11000000
10000000
00000000
Answer format: {"grid": [row_0, ...,... | {"parity": ["10000000", "11000000", "10000000", "00000000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00000000", "10000000", "00000000", "00000000"]} | 1 |
construct-rlve-grid-parity-construction-l3-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | 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):
01000
00001
01111
Answer format: {"grid": [row_0, ..., row_2]} where ea... | {"parity": ["01000", "00001", "01111"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["10000", "10000", "01001"]} | 1 |
construct-rlve-grid-parity-construction-l3-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 6 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
00001
00000
00010
10111
11010
Answer format: {"grid": [row_0, ...,... | {"parity": ["00011", "00001", "00000", "00010", "10111", "11010"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00001", "00000", "00000", "00000", "00010", "10000"]} | 1 |
construct-rlve-grid-parity-construction-l3-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 6 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
00
00
10
11
01
Answer format: {"grid": [row_0, ..., row_5]} where ea... | {"parity": ["11", "00", "00", "10", "11", "01"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11", "11", "11", "11", "01", "11"]} | 1 |
construct-rlve-grid-parity-construction-l3-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 3 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 6 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):
001111
100000
110110
100110
Answer format: {"grid": [row_0, ..., row_3]}... | {"parity": ["001111", "100000", "110110", "100110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["000101", "000010", "100010", "000011"]} | 1 |
construct-rlve-grid-parity-construction-l4-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 11 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):
111
111
111
100
100
100
001
110
110
011
110
Answer format: {"grid": [ro... | {"parity": ["111", "111", "111", "100", "100", "100", "001", "110", "110", "011", "110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["111", "101", "101", "111", "011", "111", "101", "011", "111", "111", "110"]} | 1 |
construct-rlve-grid-parity-construction-l4-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 8 x 9 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):
001100100
000110010
011011111
110100000
001000000
101100010
001001111
011... | {"parity": ["001100100", "000110010", "011011111", "110100000", "001000000", "101100010", "001001111", "011101100"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["101101011", "101101100", "001011011", "101110011", "011010111", "000100001", "111000110", "011000111"]} | 1 |
construct-rlve-grid-parity-construction-l4-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 9 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):
1111
0111
0100
1001
1011
0110
0111
1010
1100
Answer format: {"grid": [ro... | {"parity": ["1111", "0111", "0100", "1001", "1011", "0110", "0111", "1010", "1100"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0100", "0001", "0000", "0101", "0100", "0000", "0010", "0000", "1000"]} | 1 |
construct-rlve-grid-parity-construction-l4-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 12 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
10
00
11
00
01
11
01
00
00
00
11
Answer format: {"grid": [row_0, ...... | {"parity": ["00", "10", "00", "11", "00", "01", "11", "01", "00", "00", "00", "11"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["10", "11", "00", "11", "11", "11", "10", "11", "11", "11", "11", "11"]} | 1 |
construct-rlve-grid-parity-construction-l4-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 5 x 9 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):
100011000
001101111
001111001
110000011
010011111
Answer format: {"grid"... | {"parity": ["100011000", "001101111", "001111001", "110000011", "010011111"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["101110111", "000111010", "101001011", "100111011", "100011000"]} | 1 |
construct-rlve-grid-parity-construction-l4-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 6 x 11 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):
11101101000
01011100001
01010100110
10100101000
10000011001
11000110100
... | {"parity": ["11101101000", "01011100001", "01010100110", "10100101000", "10000011001", "11000110100"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["10111010110", "01111111001", "01011000000", "11101111111", "10111010110", "11111110111"]} | 1 |
construct-rlve-grid-parity-construction-l4-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 7 x 11 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):
10110001011
11000100100
10001001010
00111110010
01111110101
01101111010
... | {"parity": ["10110001011", "11000100100", "10001001010", "00111110010", "01111110101", "01101111010", "10111000010"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00111111011", "11101111011", "10111101111", "11111110111", "11111111111", "11111111100", "11101111111"]} | 1 |
construct-rlve-grid-parity-construction-l4-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 8 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):
11000
10000
10000
11010
10010
01111
00001
01110
Answer format: {"grid": ... | {"parity": ["11000", "10000", "10000", "11010", "10010", "01111", "00001", "01110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["10000", "00000", "00000", "10000", "00010", "00101", "00000", "00100"]} | 1 |
construct-rlve-grid-parity-construction-l4-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 10 x 9 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):
000000000
000000000
000000000
000000000
000000000
000000000
000000000
00... | {"parity": ["000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000", "000000000"]} | 1 |
construct-rlve-grid-parity-construction-l4-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 4 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 10 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):
0100101011
1110011001
0100101100
0001110001
Answer format: {"grid": [ro... | {"parity": ["0100101011", "1110011001", "0100101100", "0001110001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["1001001110", "1011011110", "1111011010", "1001110001"]} | 1 |
construct-rlve-grid-parity-construction-l5-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 16 x 10 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):
1111001001
0100101001
1101000010
0111011110
1000101000
0001011001
10010... | {"parity": ["1111001001", "0100101001", "1101000010", "0111011110", "1000101000", "0001011001", "1001000111", "1010011001", "0011010001", "1111011000", "0001111001", "1110000011", "1110111011", "1101000111", "1100101111", "1001100101"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0000110000", "1110000001", "0001011010", "0000000000", "0110000100", "0001100110", "0101000100", "0101001111", "0010101011", "0000110110", "1100110010", "0010000000", "0101110001", "0000010000", "1000001110", "0000101010"]} | 1 |
construct-rlve-grid-parity-construction-l5-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 15 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
10
11
00
01
00
01
01
01
10
10
01
00
00
00
Answer format: {"grid": [r... | {"parity": ["00", "10", "11", "00", "01", "00", "01", "01", "01", "10", "10", "01", "00", "00", "00"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00", "00", "10", "00", "10", "10", "01", "00", "00", "01", "01", "00", "00", "00", "00"]} | 1 |
construct-rlve-grid-parity-construction-l5-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 4 x 11 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):
10111100001
00000101000
01000001011
10100111001
Answer format: {"grid":... | {"parity": ["10111100001", "00000101000", "01000001011", "10100111001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["11110111111", "11011111111", "11111101001", "11100111011"]} | 1 |
construct-rlve-grid-parity-construction-l5-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 3 x 13 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):
1111000100000
1100100100000
0001110010000
Answer format: {"grid": [row_... | {"parity": ["1111000100000", "1100100100000", "0001110010000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0110011000000", "0110100000000", "0010001100000"]} | 1 |
construct-rlve-grid-parity-construction-l5-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 14 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):
01101001101001
00110010001011
Answer format: {"grid": [row_0, ..., row_... | {"parity": ["01101001101001", "00110010001011"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["01101001100111", "11100111110011"]} | 1 |
construct-rlve-grid-parity-construction-l5-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 13 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):
11001
00000
00110
01000
11101
01101
01000
00110
00001
00000
01011
00110
... | {"parity": ["11001", "00000", "00110", "01000", "11101", "01101", "01000", "00110", "00001", "00000", "01011", "00110", "10110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["01001", "00110", "00000", "00000", "01000", "00001", "00110", "00000", "00000", "00001", "00011", "01110", "10000"]} | 1 |
construct-rlve-grid-parity-construction-l5-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 14 x 6 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):
100011
000001
001110
011010
010010
100101
010010
001000
010100
010000
10... | {"parity": ["100011", "000001", "001110", "011010", "010010", "100101", "010010", "001000", "010100", "010000", "100011", "111100", "011010", "100000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["101000", "001111", "111111", "011111", "001011", "010101", "011011", "100111", "101001", "011100", "010011", "000011", "101011", "110001"]} | 1 |
construct-rlve-grid-parity-construction-l5-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 13 x 10 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):
0010011100
0010101100
1001010100
1110101111
0101011111
0101001001
10010... | {"parity": ["0010011100", "0010101100", "1001010100", "1110101111", "0101011111", "0101001001", "1001011010", "1011010111", "1011001011", "1011100110", "1010111101", "1100100101", "1100011110"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["0101101010", "1110010111", "0010110100", "0001000101", "1111110110", "0011111011", "1111001111", "1100010111", "0110101010", "1111110111", "1010101110", "1111101111", "0001001101"]} | 1 |
construct-rlve-grid-parity-construction-l5-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 2 x 15 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):
100111011000010
101111010001101
Answer format: {"grid": [row_0, ..., ro... | {"parity": ["100111011000010", "101111010001101"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["111110101111101", "111011111111011"]} | 1 |
construct-rlve-grid-parity-construction-l5-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 5 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 18 x 18 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):
001101011100110110
000011011010110001
010011110011110111
11100011000000... | {"parity": ["001101011100110110", "000011011010110001", "010011110011110111", "111000110000001000", "110110100001110001", "000110110010100000", "110000100011111100", "100001010010111101", "101100100101101110", "110000000001100010", "011100011000100111", "010111101011010010", "011011000101101010", "110001101110001111", ... | null | null | null | {"grid": ["001000000100000000", "010001010010110110", "110000000000110000", "001010100000001001", "010010000000100111", "000011000000000010", "010000010010000000", "001011011100111110", "101001001011100000", "001000000000000000", "000101001010000010", "011001100011100000", "110100110100000000", "000101100000001010", "0... | 1 |
construct-rlve-grid-parity-construction-l6-s0 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 14 x 22 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):
1101010100111000100111
1100110011001100101101
0101101010010011101011
11... | {"parity": ["1101010100111000100111", "1100110011001100101101", "0101101010010011101011", "1100100101100100011101", "1101010000110010001111", "0100101110111001001010", "0011100010001110011110", "1101100001111011101000", "1111101110100011001110", "1000110001100100111010", "0100000100010100010011", "101010110000111111001... | null | null | null | {"grid": ["0011001010111100111101", "1001101110100011111110", "0001111101000101101101", "1110111101011100010100", "1001000001101011000110", "1100001111100110110010", "1111111000001010000011", "1000011001110011101000", "1110111111011100100111", "0011101001011011011100", "0011000001111000010111", "0011001111111011111101"... | 1 |
construct-rlve-grid-parity-construction-l6-s1 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 11 x 16 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):
0110000010010001
0011011100000111
0000000011111101
1011011011000111
110... | {"parity": ["0110000010010001", "0011011100000111", "0000000011111101", "1011011011000111", "1100011111101010", "1010111111110100", "1001001111110100", "1011110111111010", "0100001111111110", "0100111111111110", "0010000000000001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["1011111111111111", "1111111101101111", "1111011011111110", "1001111111101111", "1010111111111111", "1111111111111011", "0111111111111011", "1101001111111111", "1101111111111111", "1001111111111111", "0111111111111111"]} | 1 |
construct-rlve-grid-parity-construction-l6-s2 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 6 x 19 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):
1101110101100000001
1000010100111111101
0100011100001110011
100011011011... | {"parity": ["1101110101100000001", "1000010100111111101", "0100011100001110011", "1000110110111110110", "0001101001001101001", "1111010100101001001"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["1111011110111111111", "1011111001111111111", "1110111100111111100", "1011111110101110110", "1111110110100101011", "1101110111011110111"]} | 1 |
construct-rlve-grid-parity-construction-l6-s3 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 8 x 17 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):
00011000010110111
00100100100011010
01011001000000000
10100000010111110
... | {"parity": ["00011000010110111", "00100100100011010", "01011001000000000", "10100000010111110", "10110101110011000", "01110110000000101", "00110111010000001", "01110110010000000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00000000001000010", "00011000001010000", "00000000110000000", "01000000000010000", "01000000100000110", "00010100000000001", "00000000100000000", "00100010100000000"]} | 1 |
construct-rlve-grid-parity-construction-l6-s4 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 22 x 10 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):
0111000110
0010010000
1010000010
1110111000
0111110111
1111000000
01010... | {"parity": ["0111000110", "0010010000", "1010000010", "1110111000", "0111110111", "1111000000", "0101010000", "1101100100", "1101010100", "0101011110", "1011101011", "1001111111", "1011010001", "1110110001", "1001110011", "1100110000", "0101100001", "1101101001", "1010011001", "0100100011", "1101110101", "1110000010"],... | null | null | null | {"grid": ["0010000100", "0000001000", "0000001000", "1010010110", "0101000001", "0000000010", "1010000110", "1110011011", "0010000010", "0100001000", "1001000000", "0000000011", "0000111011", "1010000010", "0101001101", "1110000000", "1100111101", "1000111000", "1100000000", "0000100001", "1001010000", "0010001100"]} | 1 |
construct-rlve-grid-parity-construction-l6-s5 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 22 x 6 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):
000000
000000
000000
000000
000000
000000
000000
000000
000000
000000
00... | {"parity": ["000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "100000", "110000", "100000", "000000", "010000", "101100", "001110", "111000", "101000", "000000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "000000", "100000", "000000", "000000", "000000", "010000", "010100", "101000", "000000", "000000"]} | 1 |
construct-rlve-grid-parity-construction-l6-s6 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 16 x 24 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):
100110101110001001000001
100111100001011110011111
100001111111010010111... | {"parity": ["100110101110001001000001", "100111100001011110011111", "100001111111010010111101", "010001001111010000010111", "101000001110000111101011", "111110010101111011001001", "010011000110111001101111", "001101110110101000011110", "010000011111010100111100", "011000000110010111011100", "011100011010001011001010", ... | null | null | null | {"grid": ["111011111101001111111111", "110111010111111110111111", "011110001111101101111110", "111011111111101100111111", "011110111111111110110111", "111111101110010111010110", "111111101111110111101111", "110011101111001101111111", "111111011111101111001111", "111101111111011111110101", "111111100111110111110110", "1... | 1 |
construct-rlve-grid-parity-construction-l6-s7 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 20 x 14 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):
01001101000110
01101000110001
01101100011011
10110110010101
11110000000... | {"parity": ["01001101000110", "01101000110001", "01101100011011", "10110110010101", "11110000000110", "01100110011100", "10101101000000", "01101110101110", "10100001011000", "00100010100110", "00001100101111", "00000101100100", "10101100000000", "01110111011110", "00011001101010", "01000101110110", "00011001001010", "0... | null | null | null | {"grid": ["11011011101011", "01001100001110", "01000001001111", "11000011100011", "11010010001110", "00101100110000", "11010111011010", "10010011110011", "01000100011000", "11011100001111", "01101100101000", "01010011001100", "10110101111110", "01111011110001", "01110011001011", "11001110100011", "00000010001001", "110... | 1 |
construct-rlve-grid-parity-construction-l6-s8 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 9 x 18 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):
110011000110010100
001001010000100010
100111101001111011
111000000101001... | {"parity": ["110011000110010100", "001001010000100010", "100111101001111011", "111000000101001111", "101101111000110010", "010011011001100010", "101011001111001000", "100101010010001010", "101111101000110101"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["001011001101001011", "101011110111101100", "101011111110101011", "100101100010111111", "101111101101111010", "101111011010111110", "011010110110000101", "100110010100111011", "000110010011011111"]} | 1 |
construct-rlve-grid-parity-construction-l6-s9 | construct | rlve_grid_parity_construction | lights_out_gf2 | algebra | competition | 6 | RLVE-Gym/grid_parity_construction | MIT | [
"agentic_trivial"
] | Construct an 10 x 17 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):
10011010110001001
10101100000100111
00111111001111110
11001010000101010... | {"parity": ["10011010110001001", "10101100000100111", "00111111001111110", "11001010000101010", "00001111000001101", "11011111101100011", "11001010000111000", "10100001011010110", "11101011010101010", "10111000101110000"], "family": "rlve_grid_parity_construction", "subset": "construct"} | null | null | null | {"grid": ["00010000100000110", "10100011000000000", "00001000000100001", "10000000000001101", "00000010000011010", "10001000000100011", "00000001100001101", "01000000010001010", "01000000000000000", "01001011000100000"]} | 1 |
construct-rlve-imp-party-l1-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [... | {"n": 3, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset"... | null | null | null | {"clique": [1, 4, 5]} | 1 |
construct-rlve-imp-party-l1-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 5], [0, 8], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 5], [2, 6], [2, 7], [2, 8], [4, 5], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]]
It is guaranteed that the graph contains a clique of size 6. Find any clique of size 3: 3 distin... | {"n": 3, "edges": [[0, 5], [0, 8], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 5], [2, 6], [2, 7], [2, 8], [4, 5], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [1, 2, 6]} | 1 |
construct-rlve-imp-party-l1-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 2], [0, 6], [0, 7], [0, 8], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [3, 5], [3, 6], [3, 7], [3, 8], [4, 6], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]]
It is guaranteed that the graph contains a cliqu... | {"n": 3, "edges": [[0, 2], [0, 6], [0, 7], [0, 8], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [3, 5], [3, 6], [3, 7], [3, 8], [4, 6], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [2, 5, 6]} | 1 |
construct-rlve-imp-party-l1-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 5], [0, 7], [1, 2], [1, 3], [1, 5], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]]
It is guaranteed that the graph contains a clique of size 6. Find any cl... | {"n": 3, "edges": [[0, 5], [0, 7], [1, 2], [1, 3], [1, 5], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [5, 6, 8]} | 1 |
construct-rlve-imp-party-l1-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [... | {"n": 3, "edges": [[0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset": "const... | null | null | null | {"clique": [5, 6, 7]} | 1 |
construct-rlve-imp-party-l1-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 4], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [3, 4], [3, 6], [3, 7], [3, 8], [4, 6], [4, 7], [4, 8], [5, 7], [5, 8], [6, 7], [7, 8]]
It is guaranteed that the graph contains a cliqu... | {"n": 3, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 4], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [3, 4], [3, 6], [3, 7], [3, 8], [4, 6], [4, 7], [4, 8], [5, 7], [5, 8], [6, 7], [7, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [0, 7, 8]} | 1 |
construct-rlve-imp-party-l1-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [1, 2], [1, 4], [1, 6], [1, 7], [2, 4], [2, 6], [2, 7], [4, 6], [4, 7], [6, 7]]
It is guaranteed that the graph contains a clique of size 6. Find any clique of size 3: 3 distinct vertices every two of which a... | {"n": 3, "edges": [[0, 1], [0, 2], [0, 4], [0, 6], [0, 7], [1, 2], [1, 4], [1, 6], [1, 7], [2, 4], [2, 6], [2, 7], [4, 6], [4, 7], [6, 7]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [0, 2, 6]} | 1 |
construct-rlve-imp-party-l1-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [... | {"n": 3, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 7], [0, 8], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset"... | null | null | null | {"clique": [2, 7, 8]} | 1 |
construct-rlve-imp-party-l1-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8]]
... | {"n": 3, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [2, 3], [2, 4], [2, 5], [2, 6], [2, 8], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [4, 5, 6]} | 1 |
construct-rlve-imp-party-l1-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 1 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 9 vertices labelled 0..8 and edge list
[[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]]
It is guaranteed that the graph contains a clique of siz... | {"n": 3, "edges": [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]], "family": "rlve_imp_party", "subset": "construct"} | null | null | null | {"clique": [5, 6, 7]} | 1 |
construct-rlve-imp-party-l2-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 1], [0, 2], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13], [3, 6], [3, 7], [3, 8], [3, 10],... | {"n": 5, "edges": [[0, 1], [0, 2], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 13], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 13], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13], [3, 6], [3, 7], [3, 8], [3, 10], [4, 6], [4, 10], [4, 13], [5, 6], [5, 7], [5, 8], [5,... | null | null | null | {"clique": [5, 6, 7, 9, 13]} | 1 |
construct-rlve-imp-party-l2-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 6], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 13], [3, 14... | {"n": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 13], [1, 2], [1, 6], [2, 3], [2, 5], [2, 6], [2, 8], [2, 9], [2, 10], [2, 11], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 13], [3, 14], [4, 5], [5, 6], [5, 8], [5, 9], [5, 10], [5, 11], [... | null | null | null | {"clique": [0, 3, 6, 9, 11]} | 1 |
construct-rlve-imp-party-l2-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 8], [0, 13], [1, 10], [1, 11], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 5], [3, 13], [3, 14], [4, 5], [4, 7], [4, 8], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11]... | {"n": 5, "edges": [[0, 8], [0, 13], [1, 10], [1, 11], [2, 4], [2, 5], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 5], [3, 13], [3, 14], [4, 5], [4, 7], [4, 8], [4, 10], [4, 11], [4, 12], [4, 13], [4, 14], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [5, 14], [7, 8], [7, 10], [7, 11],... | null | null | null | {"clique": [2, 5, 7, 11, 12]} | 1 |
construct-rlve-imp-party-l2-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 12], [1, 14], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 14], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [4, 12], [4, 14], [6, 7], [6, 8], [6, 9], [6, 11], [6, 12], [6, ... | {"n": 5, "edges": [[1, 2], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 12], [1, 14], [2, 4], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 12], [2, 14], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [4, 12], [4, 14], [6, 7], [6, 8], [6, 9], [6, 11], [6, 12], [6, 14], [7, 8], [7, 9], [7, 11], [7, 12], [7, 14], [8, 9]... | null | null | null | {"clique": [2, 4, 8, 11, 12]} | 1 |
construct-rlve-imp-party-l2-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 13], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 11], [2, 13], [3, 4], [3, 5]... | {"n": 5, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 13], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 11], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3... | null | null | null | {"clique": [1, 3, 4, 8, 11]} | 1 |
construct-rlve-imp-party-l2-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 14], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [4, 5], [4, 6], [4, 7], [4... | {"n": 5, "edges": [[0, 9], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 14], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 11], [2, 13], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 11], [4, 5], [4, 6], [4, 7], [4, 8], [4, 9], [4, 11], [5, 6], [5, 7], [5, 8], [5, 9],... | null | null | null | {"clique": [2, 4, 5, 7, 11]} | 1 |
construct-rlve-imp-party-l2-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 12], [2, 13], [2, 14], [3, 4], [3, 5], [3, 6], [... | {"n": 5, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 12], [0, 14], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 12], [2, 13], [2, 14], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, ... | null | null | null | {"clique": [0, 3, 5, 6, 14]} | 1 |
construct-rlve-imp-party-l2-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 2], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [1, 13], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, ... | {"n": 5, "edges": [[0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [1, 2], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 12], [1, 13], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 5], [3, 6], [3, 9], [3, 12], [3, 13]... | null | null | null | {"clique": [2, 5, 9, 10, 14]} | 1 |
construct-rlve-imp-party-l2-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 2], [0, 5], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 9], [4, 5], [4, 7], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [... | {"n": 5, "edges": [[0, 2], [0, 5], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [1, 10], [2, 5], [2, 7], [2, 8], [2, 9], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 9], [4, 5], [4, 7], [5, 7], [5, 8], [5, 9], [5, 10], [5, 11], [5, 12], [5, 13], [6, 9], [6, 13], [7, 8], [7, 9], [7, 10], [7, 11], [7, ... | null | null | null | {"clique": [0, 2, 5, 8, 10]} | 1 |
construct-rlve-imp-party-l2-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 2 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 15 vertices labelled 0..14 and edge list
[[0, 2], [0, 6], [0, 10], [0, 12], [0, 13], [0, 14], [1, 2], [1, 8], [1, 10], [1, 11], [1, 14], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 5], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13],... | {"n": 5, "edges": [[0, 2], [0, 6], [0, 10], [0, 12], [0, 13], [0, 14], [1, 2], [1, 8], [1, 10], [1, 11], [1, 14], [2, 3], [2, 5], [2, 6], [2, 7], [2, 8], [2, 10], [2, 11], [2, 12], [2, 13], [2, 14], [3, 5], [3, 6], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [4, 5], [4, 6], [4, 8], [4, 10], [4, 12], [4... | null | null | null | {"clique": [2, 5, 8, 11, 14]} | 1 |
construct-rlve-imp-party-l3-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [... | null | null | null | {"clique": [5, 10, 11, 12, 14, 16, 17, 21]} | 1 |
construct-rlve-imp-party-l3-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 14], [1, 15], [1, 16], [... | null | null | null | {"clique": [0, 1, 7, 9, 10, 16, 17, 22]} | 1 |
construct-rlve-imp-party-l3-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], ... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 19], [0, 20], [0, 21], [0, 22], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], ... | null | null | null | {"clique": [4, 6, 8, 14, 15, 16, 19, 22]} | 1 |
construct-rlve-imp-party-l3-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 5], [0, 7], [0, 8], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19]... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 5], [0, 7], [0, 8], [0, 13], [0, 14], [0, 16], [0, 17], [0, 18], [0, 20], [0, 21], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 23], [2, 4], [2, 5], [2, 6], [... | null | null | null | {"clique": [1, 7, 8, 13, 14, 17, 18, 23]} | 1 |
construct-rlve-imp-party-l3-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 6], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 20], [1, 22], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 12], [2, 13], [2, 14], [... | {"n": 8, "edges": [[0, 6], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 20], [1, 22], [2, 3], [2, 4], [2, 5], [2, 6], [2, 7], [2, 8], [2, 9], [2, 10], [2, 12], [2, 13], [2, 14], [2, 15], [2, 16], [2, 17], [2, 18], [2, 20], [2, 22], [... | null | null | null | {"clique": [1, 2, 5, 6, 7, 9, 12, 16]} | 1 |
construct-rlve-imp-party-l3-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 13], [1, 15], [1, 18], [1, 19],... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [1, 2], [1, 4], [1, 5], [1, 6], [1, 7], [1, 9], [1, 10], [1, 11], [1, 13], [1, 15], [1, 18], [1, 19], [1, 20], [1, 21], [1, 23], [2, 4], [2, 5], [2, 6], [2... | null | null | null | {"clique": [0, 1, 2, 6, 7, 10, 15, 21]} | 1 |
construct-rlve-imp-party-l3-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1... | null | null | null | {"clique": [1, 2, 3, 6, 8, 11, 22, 23]} | 1 |
construct-rlve-imp-party-l3-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 11], [1, 12], [1, 13], [1, 14], [... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 11], [0, 12], [0, 13], [0, 14], [0, 17], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 9], [1, 11], [1, 12], [1, 13], [1, 14], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 22], [... | null | null | null | {"clique": [1, 4, 5, 6, 8, 12, 13, 18]} | 1 |
construct-rlve-imp-party-l3-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1... | null | null | null | {"clique": [1, 2, 5, 13, 15, 17, 20, 22]} | 1 |
construct-rlve-imp-party-l3-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 3 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 24 vertices labelled 0..23 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 12], [1, 15], [1, 16], [1,... | {"n": 8, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 14], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 12], [1, 15], [1, 16], [1, 17], [1, 18], [1, 20], [1, 21], [1, 22], [1, 23], [2,... | null | null | null | {"clique": [0, 3, 4, 5, 6, 16, 17, 20]} | 1 |
construct-rlve-imp-party-l4-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 3], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 20], [0, 21], [0, 22], [0, 23], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 33], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, ... | {"n": 12, "edges": [[0, 1], [0, 3], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 20], [0, 21], [0, 22], [0, 23], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 33], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1,... | null | null | null | {"clique": [1, 3, 8, 10, 14, 15, 16, 19, 23, 25, 28, 35]} | 1 |
construct-rlve-imp-party-l4-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [1, 4], [1... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 7], [0, 8], [0, 11], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 32], [0, 33], [0, 34], [1, 4], [1, 6], [1, 7], [1, 8], [1, 9], [1, 11], [1, 13], [1, 1... | null | null | null | {"clique": [0, 4, 7, 8, 17, 20, 21, 24, 26, 27, 28, 29]} | 1 |
construct-rlve-imp-party-l4-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 6], [0, 10], [0, 13], [0, 17], [0, 18], [0, 21], [0, 23], [0, 27], [0, 32], [1, 14], [1, 18], [1, 28], [1, 35], [2, 4], [2, 5], [2, 8], [2, 10], [2, 13], [2, 17], [2, 35], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 1... | {"n": 12, "edges": [[0, 6], [0, 10], [0, 13], [0, 17], [0, 18], [0, 21], [0, 23], [0, 27], [0, 32], [1, 14], [1, 18], [1, 28], [1, 35], [2, 4], [2, 5], [2, 8], [2, 10], [2, 13], [2, 17], [2, 35], [3, 4], [3, 5], [3, 6], [3, 7], [3, 8], [3, 9], [3, 10], [3, 11], [3, 12], [3, 13], [3, 14], [3, 15], [3, 17], [3, 18], [3, ... | null | null | null | {"clique": [4, 5, 7, 8, 9, 11, 13, 14, 15, 21, 23, 27]} | 1 |
construct-rlve-imp-party-l4-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 18], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 31], [0, 33], [0, 34], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], ... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 18], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 31], [0, 33], [0, 34], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 12], [1, 13], [1, 18], [1... | null | null | null | {"clique": [0, 1, 3, 5, 7, 13, 20, 24, 26, 28, 34, 35]} | 1 |
construct-rlve-imp-party-l4-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1... | {"n": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 23], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8],... | null | null | null | {"clique": [6, 7, 11, 14, 16, 17, 19, 23, 25, 27, 31, 33]} | 1 |
construct-rlve-imp-party-l4-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 26], [0, 27], [0, 28], [0, 33], [0, 34], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], ... | {"n": 12, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 26], [0, 27], [0, 28], [0, 33], [0, 34], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18],... | null | null | null | {"clique": [1, 7, 8, 9, 11, 14, 18, 22, 28, 33, 34, 35]} | 1 |
construct-rlve-imp-party-l4-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0,... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 35], [1, 2], [1, 3], [1, ... | null | null | null | {"clique": [1, 2, 3, 9, 11, 12, 14, 18, 20, 25, 27, 30]} | 1 |
construct-rlve-imp-party-l4-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 31], [0, 33], [0, 34], [0, 35], [1, 14], [1, 16], [1, 20], [1, 25], [2, 17], ... | {"n": 12, "edges": [[0, 3], [0, 5], [0, 6], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 20], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 31], [0, 33], [0, 34], [0, 35], [1, 14], [1, 16], [1, 20], [1, 25], [2, 17], [2, 18], [3, 5], [3, 6], [3, 8], [3, 9], [3, 10], [3,... | null | null | null | {"clique": [0, 6, 8, 9, 11, 14, 25, 26, 27, 31, 33, 35]} | 1 |
construct-rlve-imp-party-l4-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8... | {"n": 12, "edges": [[0, 1], [0, 5], [0, 7], [0, 8], [0, 9], [0, 11], [0, 13], [0, 14], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14... | null | null | null | {"clique": [1, 5, 8, 9, 21, 22, 24, 26, 28, 30, 31, 32]} | 1 |
construct-rlve-imp-party-l4-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 4 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 36 vertices labelled 0..35 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 14], [0, 15], [0, 17], [0, 18], [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, ... | {"n": 12, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 14], [0, 15], [0, 17], [0, 18], [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], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6],... | null | null | null | {"clique": [0, 1, 2, 4, 8, 15, 21, 22, 23, 26, 31, 33]} | 1 |
construct-rlve-imp-party-l5-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0,... | {"n": 18, "edges": [[0, 1], [0, 2], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0, 38], [0, 39], [0... | null | null | null | {"clique": [2, 5, 8, 10, 13, 16, 19, 20, 21, 24, 31, 38, 41, 43, 44, 49, 51, 53]} | 1 |
construct-rlve-imp-party-l5-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 30], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0... | {"n": 18, "edges": [[0, 1], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 24], [0, 25], [0, 26], [0, 30], [0, 33], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 40], [0, 41], [0, 43], [0, 45], [0, 48], [0, 50], [... | null | null | null | {"clique": [4, 5, 6, 7, 8, 16, 20, 24, 30, 33, 37, 38, 40, 41, 43, 48, 50, 51]} | 1 |
construct-rlve-imp-party-l5-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 30], [0, 31], [0, 32], [0, 34], [0, 35], [0... | {"n": 18, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 15], [0, 16], [0, 17], [0, 19], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 29], [0, 30], [0, 31], [0, 32], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 39], [0, 40], [0, 43], [... | null | null | null | {"clique": [4, 9, 12, 16, 17, 23, 25, 35, 37, 38, 39, 40, 43, 46, 47, 48, 50, 51]} | 1 |
construct-rlve-imp-party-l5-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 11], [0, 17], [0, 18], [0, 21], [0, 27], [0, 28], [0, 30], [0, 31], [0, 35], [0, 41], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1... | {"n": 18, "edges": [[0, 11], [0, 17], [0, 18], [0, 21], [0, 27], [0, 28], [0, 30], [0, 31], [0, 35], [0, 41], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20], [1, 21], [1, 22], [1, 23], [1, 25], [1, 26], [1, 27], [... | null | null | null | {"clique": [4, 8, 10, 11, 12, 19, 21, 22, 25, 27, 30, 31, 33, 35, 38, 41, 42, 50]} | 1 |
construct-rlve-imp-party-l5-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 5], [0, 16], [0, 17], [0, 33], [0, 43], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 19], [1, 22], [1, 23], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 31], [1, 33], [1, 38], [1... | {"n": 18, "edges": [[0, 5], [0, 16], [0, 17], [0, 33], [0, 43], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 19], [1, 22], [1, 23], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 31], [1, 33], [1, 38], [1, 40], [1, 41], [1, 42], [1, 43], [1, 44], [1, 45], [... | null | null | null | {"clique": [2, 9, 14, 15, 16, 17, 19, 22, 23, 26, 28, 38, 41, 43, 45, 46, 49, 51]} | 1 |
construct-rlve-imp-party-l5-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 3], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 40], [... | {"n": 18, "edges": [[0, 1], [0, 3], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 12], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 38], [0, 40], [0, 41], [0, 42], [0, 45], [0, 50], [0, 51], [0, 53], ... | null | null | null | {"clique": [3, 6, 8, 10, 14, 16, 18, 21, 24, 25, 26, 28, 31, 35, 38, 40, 47, 53]} | 1 |
construct-rlve-imp-party-l5-s6 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0,... | {"n": 18, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 9], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 33], [0, 34], [0, 35], [0, 37], [0, 38], [0, 39], [0... | null | null | null | {"clique": [2, 16, 19, 25, 28, 29, 31, 33, 34, 35, 38, 39, 40, 42, 43, 44, 51, 52]} | 1 |
construct-rlve-imp-party-l5-s7 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, ... | {"n": 18, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0,... | null | null | null | {"clique": [0, 2, 11, 13, 15, 16, 17, 18, 19, 24, 27, 34, 36, 42, 43, 44, 47, 53]} | 1 |
construct-rlve-imp-party-l5-s8 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 3], [0, 5], [0, 8], [0, 15], [0, 22], [0, 31], [0, 36], [0, 37], [0, 42], [0, 48], [1, 2], [1, 3], [1, 5], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 20], [1, 22], [1, 24], [1, 25], [1, 26], [1,... | {"n": 18, "edges": [[0, 3], [0, 5], [0, 8], [0, 15], [0, 22], [0, 31], [0, 36], [0, 37], [0, 42], [0, 48], [1, 2], [1, 3], [1, 5], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 20], [1, 22], [1, 24], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 31], [1, 32], [1, 33], [1... | null | null | null | {"clique": [3, 7, 8, 10, 12, 13, 14, 15, 18, 24, 27, 32, 34, 37, 38, 45, 50, 51]} | 1 |
construct-rlve-imp-party-l5-s9 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 5 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 54 vertices labelled 0..53 and edge list
[[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 31], [0, 34], [0, 36], [0, 38], [0... | {"n": 18, "edges": [[0, 1], [0, 3], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 15], [0, 16], [0, 18], [0, 19], [0, 20], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 31], [0, 34], [0, 36], [0, 38], [0, 40], [0, 41], [0, 46], [0, 47], [0, 48], [0, 50], [... | null | null | null | {"clique": [5, 7, 10, 15, 19, 20, 22, 23, 24, 26, 27, 28, 29, 38, 40, 41, 47, 48]} | 1 |
construct-rlve-imp-party-l6-s0 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, ... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0,... | null | null | null | {"clique": [2, 7, 8, 12, 13, 15, 16, 17, 20, 23, 25, 27, 32, 35, 36, 43, 46, 48, 54, 60, 63, 64, 67, 68, 74]} | 1 |
construct-rlve-imp-party-l6-s1 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, ... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35], [0, 36], [0,... | null | null | null | {"clique": [1, 3, 15, 19, 20, 21, 22, 23, 26, 28, 30, 31, 33, 42, 43, 47, 51, 55, 57, 59, 63, 65, 69, 72, 74]} | 1 |
construct-rlve-imp-party-l6-s2 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [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], [0, 28], [0, 29], [0, 31], [0, ... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [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], [0, 28], [0, 29], [0, 31], [0, 32], [0, 33], [0, 34], [0, 35], [0, 37], [0, 38], [0,... | null | null | null | {"clique": [1, 3, 5, 9, 16, 17, 23, 26, 35, 39, 40, 41, 42, 47, 51, 52, 54, 56, 57, 59, 60, 61, 66, 73, 74]} | 1 |
construct-rlve-imp-party-l6-s3 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 3], [0, 12], [0, 19], [0, 29], [0, 35], [0, 39], [0, 48], [0, 66], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 10], [1, 12], [1, 13], [1, 14], [1, 16], [1, 19], [1, 20], [1, 21], [1, 23], [1, 24], [1, 25], [1, 27], [1, 29], [1, 30], [1... | {"n": 25, "edges": [[0, 3], [0, 12], [0, 19], [0, 29], [0, 35], [0, 39], [0, 48], [0, 66], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 10], [1, 12], [1, 13], [1, 14], [1, 16], [1, 19], [1, 20], [1, 21], [1, 23], [1, 24], [1, 25], [1, 27], [1, 29], [1, 30], [1, 32], [1, 33], [1, 35], [1, 37], [1, 38], [1, 39], [... | null | null | null | {"clique": [1, 3, 4, 5, 10, 13, 23, 24, 25, 29, 30, 32, 33, 35, 38, 39, 42, 48, 55, 60, 61, 63, 64, 65, 70]} | 1 |
construct-rlve-imp-party-l6-s4 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 17], [0, 18], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 40], [0, 41], [0, 42], [0... | {"n": 25, "edges": [[0, 1], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 10], [0, 11], [0, 12], [0, 17], [0, 18], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 27], [0, 29], [0, 31], [0, 33], [0, 34], [0, 35], [0, 36], [0, 37], [0, 40], [0, 41], [0, 42], [0, 43], [0, 44], [0, 45], [0, 46], [0, 47], [0, 48], [... | null | null | null | {"clique": [5, 8, 17, 18, 21, 23, 25, 27, 29, 31, 33, 34, 35, 40, 44, 46, 48, 49, 51, 53, 56, 61, 66, 67, 69]} | 1 |
construct-rlve-imp-party-l6-s5 | construct | rlve_imp_party | poi_party_clique_3n | graph_theory | competition | 6 | RLVE-Gym/imp_party | MIT | [
"agentic_trivial"
] | An undirected simple graph has 75 vertices labelled 0..74 and edge list
[[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, ... | {"n": 25, "edges": [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [0, 9], [0, 10], [0, 11], [0, 12], [0, 13], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 19], [0, 20], [0, 21], [0, 22], [0, 23], [0, 24], [0, 25], [0, 26], [0, 27], [0, 28], [0, 29], [0, 30], [0, 31], [0, 32], [0, 33], [0, 34], [0,... | null | null | null | {"clique": [0, 3, 4, 9, 15, 18, 20, 29, 31, 34, 35, 36, 37, 41, 43, 45, 49, 52, 56, 61, 62, 64, 66, 69, 70]} | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.