task_id large_string | task_name large_string | rule large_string | rule_source large_string | train_demonstrations_json large_string | test_input_json large_string | test_output_json large_string | stable_instances_50_json large_string | human_corruptions_json large_string | generator_py large_string | verifier_py large_string |
|---|---|---|---|---|---|---|---|---|---|---|
t1 | corner_to_center | The grid is square with an even side n. Up to four coloured components sit in the corners, each inside a corner window of side n/2 − 2. Every component slides inward until the group packs against the middle. The top-left and top-right components move down together by the amount that brings their lowest occupied row ont... | human_reviewed | [{"input":[[0,0,3,0,0,0,0,2,0,0],[0,3,0,0,0,0,0,0,2,0],[3,0,0,0,0,0,0,0,0,2],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[6,0,0,0,0,0,0,0,0,1],[0,6,0,0,0,0,0,0,1,0],[0,0,6,0,0,0,0,1,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,3,2,0,0,0,0],[0,0,0,3,0,0... | [[1,0,0,0,0,0,0,0,0,0,0,2],[0,1,0,1,0,0,0,0,0,0,2,0],[0,0,1,0,0,0,0,0,0,2,0,0],[0,1,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,8,0,0,0,0,0,0,0,0,4,0],[0,0,8,0,0,0,0,0,0,4,0,0],[0,8,0,8,0,0,0,0,4,0,0,0],[8,0,0,0,0,0,0,0,0,0,0,0]] | [[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,0,0,2,0,0],[0,0,0,1,0,1,0,0,2,0,0,0],[0,0,0,0,1,0,0,2,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,0,0],[0,0,0,8,0,0,0,0,4,0,0,0],[0,0,0,0,8,0,0,4,0,0,0,0],[0,0,0,8,0,8,4,0,0,0,0,0],[0,0,8,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,9,0,0,0,0,0,0,0,0,0,0,0,0],[9,0,0,0,0,0,0,0,0,0,0,0,0,0],[9,9,0,0,0,0,0,0,0,5,0,0,5,0],[9,9,9,9,0,0,0,0,0,5,5,5,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,8,0],... | [{"input":[[0,0,6,6,6,6,6,0,0,0],[2,2,2,0,0,0,0,8,8,8],[2,0,0,9,3,3,3,0,0,6],[2,0,0,0,9,0,7,0,0,6],[0,0,0,0,0,9,0,7,0,6],[8,8,0,0,0,0,0,0,7,6],[6,6,6,0,9,7,3,0,0,7],[0,8,0,9,0,7,3,0,0,0],[0,8,9,0,0,7,3,2,2,2],[0,9,0,0,0,7,8,8,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,0,0,0],[0,0,5,0,0,0,0,5,0,0],[0,0,5,0,0,0... | """Corner-components to center-components generator for Test2/t1.
The rule matches ``Test2/t1.json``:
- up to four components, one per corner window
- each corner component is translated to the corresponding center window
"""
from __future__ import annotations
import random
from typing import Dict, List, Sequence, T... | """Verifier for the Test2/t1 corner-to-center rule."""
from __future__ import annotations
from typing import Dict, List, Tuple
Grid = List[List[int]]
def _empty(size: int) -> Grid:
return [[0 for _ in range(size)] for _ in range(size)]
def _corner_span(size: int) -> int:
return size // 2 - 2
def _origi... |
t2 | color_shift | Find the 8-connected objects of non-black cells; their leftmost cells all sit in different columns. Order the objects by that leftmost cell (by column). Rotate the colours one step along that order with wrap-around: each object takes the colour of the object before it, and the first takes the colour of the last. Shapes... | human_reviewed | [{"input":[[0,0,0,0,0,0,0,0,0,0],[0,0,1,0,0,0,0,8,8,8],[0,1,0,0,0,0,0,0,0,8],[0,0,1,0,0,0,0,0,0,8],[0,1,0,0,0,0,0,0,0,8],[0,0,1,0,0,0,0,8,8,8],[0,0,0,0,5,5,0,0,0,0],[0,0,0,0,5,5,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,0,0,0,0,0,0,0,0],[0,0,8,0,0,0,0,5,5,5],[0,8,0,0,0,0,0,0,0,5],[0,0,8,0,0,0... | [[0,0,9,0,0,0,0,0,0,0],[0,9,9,0,0,0,5,0,0,0],[9,9,9,0,8,0,0,5,0,0],[0,0,0,8,0,4,0,0,5,0],[0,0,8,0,0,4,0,0,0,5],[0,8,0,4,4,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]] | [[0,0,5,0,0,0,0,0,0,0],[0,5,5,0,0,0,4,0,0,0],[5,5,5,0,9,0,0,4,0,0],[0,0,0,9,0,8,0,0,4,0],[0,0,9,0,0,8,0,0,0,4],[0,9,0,8,8,8,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]] | {"train":[{"input":[[0,0,0,6,6,6,6,0,0,0,0,0,0,0],[0,0,0,6,0,0,0,6,0,0,0,0,0,5],[0,0,0,0,0,0,0,0,0,0,0,0,5,0],[0,0,0,0,0,0,0,0,0,0,4,0,0,0],[0,0,0,0,0,0,0,0,0,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,8,0,0,0,9,0,0,0,0,0,0,0,0],[0,8,0,0,9,0,0,0,0,0,0,0,0,0],[0,0,8,0,9,0,0,0,0,0,0,0,0,0],... | [{"input":[[0,0,9,0,0,0,0,0,0,0],[0,9,9,0,0,0,5,0,0,0],[9,9,9,0,8,0,0,5,0,0],[0,0,0,8,0,4,0,0,5,0],[0,0,8,0,0,4,0,0,0,5],[0,8,0,4,4,4,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0]],"output":[[0,0,5,0,0,0,0,0,0,0],[0,5,5,0,0,0,8,0,0,0],[5,5,5,0,9,0,0,8,0,0],[0,0,0,9,0,4... | """Generator for Test2/t2: cyclic color shift by leftmost-object order.
Rule:
- detect 8-connected non-zero objects
- sort objects by the position of their leftmost cell (col, then row)
- shift object colors to the right with wrap-around
"""
from __future__ import annotations
import random
from typing import Dict, L... | """Verifier for Test2/t2 color-shift-by-leftmost-object rule."""
from __future__ import annotations
from typing import List, Sequence, Tuple
Grid = List[List[int]]
Cell = Tuple[int, int]
def _neighbors8(r: int, c: int) -> list[Cell]:
out: list[Cell] = []
for dr in (-1, 0, 1):
for dc in (-1, 0, 1):
... |
t3 | wrapped_rectangle | A rectangular box is placed so that it runs off one edge of the grid and continues on the opposite edge, offset along that edge; the two halves may carry different outline colours. Reassemble the box across the wrap and output only its interior — the cells inside the outline, with the outline itself removed. | human_annotated | [{"input":[[2,0,5,5,7,7],[2,2,2,3,7,4],[1,2,2,7,7,4],[1,2,3,0,7,0],[2,2,4,4,7,7],[2,2,4,4,0,0]],"output":[[4,1],[4,1],[0,2]]},{"input":[[0,0,8,0,3,0,3,0,0],[8,8,8,0,5,0,0,4,4],[0,6,8,6,5,6,4,0,5],[1,0,8,0,5,4,4,2,0],[0,1,8,3,0,5,0,0,2],[8,8,8,3,0,0,0,9,9],[0,0,3,2,2,2,2,9,0],[0,3,0,2,2,2,2,9,0],[3,3,0,2,2,2,2,9,5],[0,0... | [[5,5,0,0,0,0,0,0,0,7,7],[0,5,5,5,2,2,0,0,0,7,7],[0,0,5,5,0,2,2,0,1,7,3],[0,0,5,5,2,0,2,1,0,7,0],[0,0,0,0,0,0,1,0,0,7,7],[4,4,4,0,0,1,2,5,0,0,0],[0,0,4,0,1,0,2,0,5,0,0],[3,0,4,1,0,0,2,0,0,5,0],[0,3,4,0,0,0,2,2,2,0,5],[4,4,4,0,0,0,0,0,0,0,0]] | [[7,0,0],[3,3,0],[0,0,3]] | {"train":[{"input":[[9,5,8,9,4,5,9,0,0,0,0,0,0,0],[9,9,9,9,9,9,9,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,1,1,0,0,0],[3,0,3,3,0,0,0,0,0,1,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0,0,0,0],[0,0,3,0,3,0,0,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0,0,0,0],[8,0,8,0,0,0,0,0,0,0,8,0,0,0],[8,8,8,0,0,0,3,3,3,0,8,8,8,8],[0,0,8,8,8,0,0,5,5,5,5,5,5,5],... | [{"input":[[2,5,8,2,4,5,2,0,0,0,0,0,0,0],[2,2,2,2,2,2,2,0,0,1,1,1,0,0],[0,0,0,0,0,0,0,0,0,1,1,0,0,0],[3,0,3,3,0,0,0,0,0,1,0,0,0,0],[0,3,3,3,0,0,0,0,0,0,0,0,0,0],[0,0,3,0,3,0,0,0,0,0,0,0,0,0],[0,0,3,0,0,0,0,0,0,0,0,0,0,0],[8,0,8,0,0,0,0,0,0,0,8,0,0,0],[8,8,8,0,0,0,3,3,3,0,8,8,8,8],[0,0,8,8,8,0,0,5,5,5,5,5,5,5],[0,0,0,0,... | """Generator for Test2/t3: extract wrapped rectangle interior."""
from __future__ import annotations
import random
from typing import List
Grid = List[List[int]]
def _empty(h: int, w: int) -> Grid:
return [[0 for _ in range(w)] for _ in range(h)]
def _random_content(rng: random.Random, h: int, w: int, frame_... | """Verifier for Test2/t3 wrapped-rectangle task."""
from __future__ import annotations
from typing import List
Grid = List[List[int]]
def verify_t3(inp: Grid) -> Grid:
if not inp or not inp[0]:
raise ValueError("input grid must be non-empty")
h = len(inp)
w = len(inp[0])
if any(len(row) != ... |
t4 | scaled_rectangles | "A small framed key sits in one corner of the grid holding a 3x3 pattern. Divide the whole grid into(...TRUNCATED) | human_annotated | "[{\"input\":[[0,0,0,0,0,0,0,2,2,2,2,2],[0,0,0,0,0,0,0,2,3,0,0,2],[0,0,0,0,0,0,0,2,0,1,0,2],[0,0,0,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,6,6,6,6],[0,0,0,0,0,0,0,0,6,0,0,6],[0,0,0,0,0,0,0,0,6,0,2,6],[0,0,0,0,0,0,0,0,6,6(...TRUNCATED) | "{\"train\":[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0](...TRUNCATED) | "[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0(...TRUNCATED) | "\"\"\"Generator for Test2/t4 scaled-rectangle task.\"\"\"\n\nfrom __future__ import annotations\n\n(...TRUNCATED) | "\"\"\"Verifier for Test2/t4 scaled-rectangle task.\"\"\"\n\nfrom __future__ import annotations\n\nf(...TRUNCATED) |
t5 | cyan_flow | "Orange cells are fixed walls. Cyan behaves like a liquid inside whatever region the walls leave ope(...TRUNCATED) | human_annotated | "[{\"input\":[[8,8,8,0,0,0,0,0,0,0],[8,8,8,0,0,0,0,0,0,0],[8,8,8,8,0,0,0,0,0,0],[7,7,7,7,7,7,0,7,7,7(...TRUNCATED) | "[[8,8,0,0,8,8,0,0,0,0],[8,8,0,0,8,8,0,0,0,0],[8,8,0,0,0,0,0,0,0,0],[8,8,0,0,0,0,0,8,8,8],[8,8,0,0,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[0,0,0,8,8(...TRUNCATED) | "{\"train\":[{\"input\":[[8,8,8,8,8,8,8,8,8,8,8],[8,8,8,8,8,8,8,8,8,8,8],[0,0,0,0,0,8,0,0,0,0,0],[7,(...TRUNCATED) | "[{\"input\":[[8,0,8,8,8,8,8,8,8,0,0],[8,8,0,0,8,8,8,8,8,8,8],[0,0,0,0,0,0,8,0,0,8,0],[8,8,0,0,8,0,8(...TRUNCATED) | "\"\"\"Generator for Test2/t5 cyan-flow task.\"\"\"\n\nfrom __future__ import annotations\n\nimport (...TRUNCATED) | "\"\"\"Verifier for Test2/t5 cyan-flow task.\"\"\"\n\nfrom __future__ import annotations\n\nfrom typ(...TRUNCATED) |
t6 | partition_rank | "A grey rectangle encloses an area split into separate compartments, where each compartment has a si(...TRUNCATED) | human_annotated | "[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,0,0,0,6,0,0,0,0,5,0],[0,5,0,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,0,0,5,0,0,5,0,0,5,0],[0,5,0,0,0,5,0,0,5,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0,0,0],[0,5,5,5,5,5,5,5,5,5,5,0],[0,5,2,2,5,4,4,5,3,3,5,0],[0,5,2,2,2,5,4,4,5,3(...TRUNCATED) | "{\"train\":[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,3,0],[0,0,0,0,0,0,0,0,0,0,0,0,0],[0,0,5,5,5,5,5,5,5,(...TRUNCATED) | "[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,5,5,5,5,5,5,5,5,0],[0,0,0,5,0,0,0,0,4,0,5,3],[0,0,0,5(...TRUNCATED) | "\"\"\"Generator for Test2/t6 partition-distance ranking task.\"\"\"\n\nfrom __future__ import annot(...TRUNCATED) | "\"\"\"Verifier for Test2/t6 partition-distance ranking task.\"\"\"\n\nfrom __future__ import annota(...TRUNCATED) |
t7 | diagonal_wrap | "A single cyan cell and one or more solid single-coloured objects sit on a black background. Trace t(...TRUNCATED) | human_annotated | "[{\"input\":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,2,2,2,0],[0,0,0,0,0,2,2,2,0],[0,0,0,0,0,0,2,2,0],[0,7,7(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,0,9,0],[0,6,0,0,0,0,0,0,9,0],[0,6,0,0,0,0,0,9,9,0],[0,0,0,0,0(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,0,9,0],[0,6,0,0,0,0,0,0,9,0],[0,6,0,0,0,0,0,9,9,0],[0,0,0,0,0(...TRUNCATED) | "{\"train\":[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,8,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,(...TRUNCATED) | "[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0],[0,4,4,0,0,0,0,0,0,0,0],[0,4,0,0,0,0,0,0,0,0,0],[0,4,0,0,0,8,0(...TRUNCATED) | "\"\"\"Generator for Test2/t7 diagonal-connect-and-wrap task.\"\"\"\n\nfrom __future__ import annota(...TRUNCATED) | "\"\"\"Verifier for Test2/t7 diagonal-connect-and-wrap task.\"\"\"\n\nfrom __future__ import annotat(...TRUNCATED) |
t8 | enclosed_red_gravity | "There is a large body of blue cells in the grid (\"water\"). In this body, there are red cells (\"f(...TRUNCATED) | human_annotated | "[{\"input\":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[2,1,1,1,5,1,5,1,1],[1,1,1,5,1,1,5,1,2],[1,1,5(...TRUNCATED) | "[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[1,5,2,1,1,1,1,2,5,1],[2,5,1,2,1,2,1,5,1,1],[1,5,1,1,1(...TRUNCATED) | [[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,0,0,0,0,0],[0,2,0,2,0,0],[2,2,2,2,2,2]] | "{\"train\":[{\"input\":[[0,0,0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0,0,0],[1,1,1,1,5,2,2,1,1,1,5,(...TRUNCATED) | "[{\"input\":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[1,1,5,2,1,1,5,1,1],[1,5,2,2,1,5,1,1,1],[1,5,1(...TRUNCATED) | "\"\"\"Generator for Test2/t8 enclosed-body red gravity task.\"\"\"\n\nfrom __future__ import annota(...TRUNCATED) | "\"\"\"Verifier for Test2/t8 enclosed-body red gravity task.\"\"\"\n\nfrom __future__ import annotat(...TRUNCATED) |
t9 | rectangle_assembly | "Several coloured pieces lie scattered on the grid. Exactly one subset of them fits together, by tra(...TRUNCATED) | human_annotated | "[{\"input\":[[0,0,1,0,0,0,0,4,0],[0,0,1,0,0,0,0,0,4],[1,1,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[0,0,0(...TRUNCATED) | [[0,0,0,0,0,8],[0,1,1,0,0,8],[0,1,0,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,0],[2,0,0,0,5,5]] | [[1,1,8],[1,2,8],[1,5,5]] | "{\"train\":[{\"input\":[[6,6,6,6,6,6,0,0,0,0,0,0,0,0],[6,6,6,6,6,6,0,0,0,0,0,0,0,0],[0,6,6,6,0,0,0,(...TRUNCATED) | "[{\"input\":[[0,0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0,0],[2,2,2,2,0,0,0,0,0,0],[0,2,2,0,0,0,0,0,0,0(...TRUNCATED) | "\"\"\"Generator for Test2/t9 unique rectangle assembly task.\"\"\"\n\nfrom __future__ import annota(...TRUNCATED) | "\"\"\"Verifier for Test2/t9 unique rectangle assembly task.\"\"\"\n\nfrom __future__ import annotat(...TRUNCATED) |
t10 | rot180_partner | "Every cell has a 180-degree partner: the cell at the opposite position through the grid's centre. F(...TRUNCATED) | human_reviewed | "[{\"input\":[[0,1,8,6,1,0,0,0,0],[0,0,0,0,6,0,0,0,4],[0,0,0,0,0,0,0,0,4],[0,0,0,0,0,0,0,0,4],[0,0,0(...TRUNCATED) | "[[0,0,0,0,0,4,0,0,0,9],[0,0,0,0,4,0,4,0,0,0],[0,0,0,0,0,0,0,0,5,5],[2,2,2,0,0,0,0,0,0,5],[0,0,2,0,0(...TRUNCATED) | "[[6,6,0,0,0,4,0,3,3,9],[6,0,0,0,4,0,4,0,3,0],[0,0,0,0,0,0,0,0,5,5],[2,2,2,0,0,0,0,8,8,5],[0,0,2,0,0(...TRUNCATED) | "{\"train\":[{\"input\":[[0,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,0],[3,3,0,0,0,0,0,0,0],[3,3,0,0,0,9,9,(...TRUNCATED) | "[{\"input\":[[0,0,4,4,4,4,1,1,1,1,0,0],[0,0,4,4,4,0,1,1,1,0,0,0],[0,0,0,4,0,0,0,0,0,0,0,0],[0,0,0,0(...TRUNCATED) | "\"\"\"Generator for Test2/t10: 180° partner fill (center-symmetric sparse overlay).\n\nRule:\n- Fo(...TRUNCATED) | "\"\"\"Verifier for Test2/t10: 180° partner fill.\"\"\"\n\nfrom __future__ import annotations\n\nfr(...TRUNCATED) |
P-ARC
P-ARC is a held-out set of 50 hand-crafted ARC-style tasks, introduced with PotARCin: Multi-Dimensional Evaluation of Skill Acquisition in Abstract Reasoning Tasks (NeurIPS 2026, Evaluations and Datasets Track). Every task comes with a generator and a verifier program, 50 fixed generated examples, three human-made corruptions (erroneous attempts from the feasibility check or errors designed by the task's creator), and a natural-language statement of its rule.
- Venue: NeurIPS 2026, Evaluations and Datasets Track
- Paper: arXiv:2609.27288
- Authors: Claas Beger, Ryan Yi, Melanie Mitchell
- Contact: claasbeger@santafe.edu
Summary
Standard ARC evaluation only checks whether a model produces the correct output grid. PotARCin instead tests whether a model has acquired a task's underlying rule, across five dimensions: Definition, Classification, Constrained Generation, Editing and Inversion. P-ARC provides tasks outside the public ARC-AGI-1 distribution for this purpose. In the paper, models reach 1–8% accuracy when a task counts as solved only if all five dimensions are correct. We qualitatively estimate P-ARC to lie between ARC-AGI-1 and ARC-AGI-2 in difficulty.
Grouped by their main operation, the tasks cover physics and dynamics (9 tasks), rigid geometric transforms (8), connection and pathfinding (7), symmetry, completion and repair (8), object composition (5), constraint satisfaction and logic (6), and colour or attribute mapping (5); two tasks have no clean category.
Files
| File | Contents |
|---|---|
p_arc_dataset.parquet / p_arc_dataset.csv |
One row per task (t1–t50) with all columns below. The viewer and load_dataset use the Parquet file. |
tasks/<task_id>.json |
Each task's train and test pairs in the standard ARC JSON format. |
SCHEMA.json |
Column descriptions in machine-readable form. |
P-ARC.croissant.json |
Croissant metadata including the responsible-AI fields. |
Columns
| Column | Description |
|---|---|
task_id |
t1 … t50 |
task_name |
Short descriptive name, e.g. corner_to_center |
rule |
Natural-language statement of the task's intended rule, reviewed by the authors |
rule_source |
human_reviewed (redrafted from the task's transform and reviewed, 39 tasks), human_annotated (written from scratch, 10) or draft (the original hand-written rule, kept after review, 1) |
train_demonstrations_json |
JSON list of training pairs {input, output} |
test_input_json / test_output_json |
JSON grids of the held-out test pair |
stable_instances_50_json |
JSON object {"train": [...]} with 50 fixed generator-produced pairs |
human_corruptions_json |
JSON list of 3 {input, output} pairs with incorrect outputs, made by people: erroneous attempts from the feasibility check or errors designed by the task's creator |
generator_py |
Python source of the task's generator |
verifier_py |
Python source of the task's verifier, which maps an input grid to its correct output |
Grids are lists of rows of integers 0–9, following the ARC colour convention.
Loading
import json
from datasets import load_dataset
tasks = load_dataset("ClaasBeger/P-ARC", split="test")
task = tasks[0]
train = json.loads(task["train_demonstrations_json"])
corruptions = json.loads(task["human_corruptions_json"])
print(task["task_id"], task["rule"])
To read the CSV with Python's csv module, raise its field size limit first, since some cells are large: csv.field_size_limit(sys.maxsize).
How the data was made
- Tasks. The authors designed each task. A candidate was shown to team members other than its author (at least one, most often two or three) and kept only if at least one of them produced the correct output. This is a feasibility check during design, not a formal human study; solve rates and times were not recorded.
- Generators and verifiers. For every task, a team member other than its author inspected at least 50 generator-produced examples and confirmed that they follow the intended rule. All train and test pairs and all 50 stable examples agree with the task's verifier.
- Corruptions. Each task has three pairs with incorrect outputs. Some are erroneous attempts collected during the feasibility check; others were designed by the task's creator.
- Rules. All 50 rules were reviewed by the authors in September 2026.
Changes
- October 2026: moved from
PotARCin/P-ARC; corrected thet1stable examples (21 of 50 previously disagreed with the verifier) and thet12verifier (no longer looks up its own examples); addedtask_name,rule,rule_sourceandhuman_corruptions_json, the per-task ARC JSON files, and Croissant metadata; licensed under MIT.
Citation
@inproceedings{beger2026potarcin,
title = {PotARCin: Multi-Dimensional Evaluation of Skill Acquisition in Abstract Reasoning Tasks},
author = {Beger, Claas and Yi, Ryan and Mitchell, Melanie},
booktitle = {Advances in Neural Information Processing Systems},
year = {2026},
eprint = {2609.27288},
archivePrefix = {arXiv}
}
- Downloads last month
- 79