Dataset Viewer
Auto-converted to Parquet Duplicate
task_id
stringlengths
24
95
title
stringlengths
21
156
concept_summary
stringlengths
35
662
intended_rule
stringlengths
101
1.15k
commit_set_id
stringclasses
90 values
batch
stringclasses
123 values
commit_date
stringdate
2026-07-31 00:00:00
2026-10-28 00:00:00
era
stringclasses
2 values
pipeline_generation
stringclasses
7 values
source_pipeline
stringclasses
45 values
search_mode
stringclasses
4 values
project_stage
stringclasses
1 value
bank_status
stringclasses
3 values
quality_grade
stringclasses
3 values
editorial_mode
stringclasses
2 values
train
listlengths
1
10
test
listlengths
1
3
n_train
int32
1
10
n_test
int32
1
3
generation_model
stringclasses
4 values
generation_effort
stringclasses
3 values
models
listlengths
4
21
n_model_calls
int32
5
46
primary_arm
stringclasses
43 values
experiment_arm
stringclasses
5 values
family
stringclasses
5 values
modifiers
listlengths
0
4
property_slots
listlengths
0
4
skill_line
stringclasses
11 values
content_line
stringclasses
13 values
structure_line
stringclasses
6 values
size_rung
stringclasses
4 values
size_arm
stringclasses
2 values
route
stringclasses
17 values
route_overlay
stringclasses
6 values
draw_pose
bool
2 classes
draw_canvas
stringclasses
3 values
draw_edge
stringclasses
2 values
draw_roles
stringclasses
2 values
draw_colour_roles
stringclasses
2 values
draw_teach
stringclasses
2 values
draw_gate
stringclasses
2 values
draw_depart
stringclasses
2 values
draw_fence
stringclasses
18 values
idea_kernel_json
stringlengths
705
2.67k
⌀
idea_central_relation
stringlengths
35
662
selector_stage
stringclasses
8 values
selector_eligibility
stringclasses
3 values
selector_reason
stringlengths
36
698
selector_useful_contribution
stringlengths
42
263
⌀
central_rule
stringlengths
106
1.15k
invariants
listlengths
6
26
⌀
rival_rules
listlengths
2
10
blind_rule
stringlengths
66
1.58k
⌀
blind_alternatives_json
stringlengths
273
1.69k
⌀
blind_serious_alternative
bool
2 classes
blind_unsupported_guessing
bool
2 classes
blind_confidence
stringclasses
3 values
blind_matched_answer
bool
2 classes
blind_primary_result
stringclasses
2 values
has_blind_checks
bool
2 classes
judge_decision
stringclasses
3 values
judge_failure_kind
stringclasses
4 values
judge_reason
stringlengths
73
823
⌀
judge_intended_rule_supported
bool
2 classes
judge_comparable_rival
bool
2 classes
evidence_resolution
stringclasses
7 values
repair_count
int32
0
3
⌀
repair_instructions
listlengths
1
3
⌀
overruled_credible_rival
bool
2 classes
credible_rival_cleared_by
stringclasses
3 values
n_credible_rivals
int32
0
3
⌀
teacher_model
stringclasses
1 value
teacher_draws
int32
0
20
teacher_correct
int32
0
18
teacher_solve_rate
float64
0
1
⌀
teacher_pass_at_2
float64
0
1
⌀
eval_near_twin
stringclasses
4 values
admitted_via_right_twice
bool
2 classes
owner_override
bool
2 classes
owner_override_kind
stringclasses
2 values
source_portfolio_status
stringclasses
3 values
owner_editorial_override
bool
2 classes
excluded_from_training
bool
2 classes
excluded_from_training_reason
stringclasses
4 values
palette_remap
stringclasses
531 values
call_record_ids
listlengths
5
46
v1-continuation-b001__concept-led-3
Symbolic function composition
Ordered two-row cards encode finite functions through aligned label pairs; matching intermediate identities composes the cards into a final mapping.
Split the input at zero columns into ordered 2×4 cards. Each aligned top/bottom pair defines a finite function. For each label in the first card's top row, apply the successive card mappings from left to right. Output the original first top row with the final images beneath it in the same order.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-001
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 3, 1, 4, 2, 0, 2, 4, 3, 1, 0, 4, 3, 2, 1 ], [ 1, 2, 4, 3, 0, 2, 1, 3, 4, 0, 4, ...
[ { "input": [ [ 6, 2, 8, 4, 0, 4, 8, 2, 6, 0, 4, 6, 8, 2, 0, 2, 4, 8, 6, 0, 4, 2, 6, 8 ], [ 8, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
9
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Each two-row card encodes a bijection through aligned label pairs; compose the cards by matching intermediate label identities, then output one card mapping the first row to the final images.
lean_batch_selector
select
Identity-based joins through a visibly ordered chain constitute a distinct symbolic operation. Shuffled intermediate labels can make every card necessary while preserving a compact, verifiable output.
null
Split the input at zero columns into ordered 2×4 cards. In each card, every aligned top/bottom pair defines f(top)=bottom. Read the cards left to right. For each label in the first card’s top row, repeatedly find its identity in the next card’s top row and replace it with the aligned bottom label. Output the first card...
null
[ { "rule": "Transfer information through unchanged column indices and use the last bottom row.", "evidence_that_defeats_it": "Every inter-card boundary is a derangement. In training pair 1 the last bottom row is [4,2,1,3], whereas the required composite bottom is [4,1,3,2].", "fits_every_training_pair": ...
Split both rows at zeros into aligned four-cell blocks. Each block pair defines a substitution mapping from the upper block's values to the corresponding lower block's values. Starting with the first upper block, apply every substitution sequentially from left to right. Output the initial block above the final transfor...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
3
0.75
1
none
false
false
null
null
false
false
null
null
[ "call-21b152c82a8be802b68a", "call-386ff09d0eacd951149d", "call-62c0ec6c4be8aba091ea", "call-7d67d59cdaba7432c8d7", "call-9570e5b8a8af4e8e11bd", "call-9eb4d8a4517c2b034624", "call-9ffeea646dc257399f49", "call-a4e7ae2f04e845800472", "call-da3d780080215e184a95" ]
v1-continuation-b002__composition-led-2
Serpentine cyclic loom
Warp and weft source sequences feed a blank loom while a cyclic heddle belt selects the visible thread along a continuous serpentine traversal whose phase persists across rows.
The top edge supplies warp colors and the left edge supplies weft colors. Read a cyclic binary belt from its marker. Traverse loom crossings in alternating row directions without resetting belt phase; at each crossing, use the warp or weft source selected by the current belt state.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-002
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
composition_led
null
core_quality
null
null
[ { "input": [ [ 0, 0, 1, 3, 6, 8, 3, 0, 0, 0, 0 ], [ 0, 2, 5, 5, 5, 5, 5, 5, 0, 0, 0 ], [ 4, ...
[ { "input": [ [ 0, 0, 1, 3, 6, 8, 3, 6, 3, 8, 0, 0 ], [ 0, 2, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0 ], ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
A blank loom is fed by a warp-color sequence on one edge and a weft-color sequence on another. A cyclic heddle belt specifies which thread is upper at successive crossings, while a shuttle marker fixes the start and makes traversal reverse on alternating rows. Fill each crossing with its upper thread's color.
lean_batch_selector
select
Every crossing depends jointly on two indexed thread streams, a cyclic binary controller, an explicit phase cue, and continuous serpentine traversal. The resulting mechanism is coherent and portfolio-distinct.
null
The top edge supplies warp color P[c] for each physical column and the left edge supplies weft color Q[r] for each physical row. In the cyclic belt, color 1 refers to the warp source and color 2 to the weft source, matching source tags beside those edges. Read the first belt state immediately to the right of the yellow...
null
[ { "rule": "Belt state 1 selects weft and state 2 selects warp.", "evidence_that_defeats_it": "In Pair 1 the first belt state is 1 and the top-left result is warp color 3 rather than weft color 7; the following state 2 produces 7 rather than warp color 6. The blue and red source tags reinforce the same mappi...
The 5s bound a rectangle. Color 1 labels the top column-source sequence, and color 2 labels the left row-source sequence. Traverse the interior rows in top-to-bottom order, starting each row from the side marked by a 4. Read the separate cyclic control word of 1s and 2s beginning immediately to the right of its 4 marke...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
0
0
0
none
false
false
null
null
false
false
null
null
[ "call-04f8f5d79c4ea1dd72fd", "call-463a2ed2f09f01f479a5", "call-6f375d2db13b263429c2", "call-72ad265b758058322401", "call-85448f0b227b547ea12f", "call-8d9d7ea05b5a2786f792", "call-9d7c46215c960a527170", "call-d9c948c497a123f28834" ]
v1-continuation-b003__concept-led-1
Keyed nested-scope resolution
Nested enclosures act as scopes in which keyed declarations bind values; each query resolves to the nearest enclosing declaration for its key, with inner bindings shadowing outer ones.
Each isolated horizontal domino is a key and payload belonging to its smallest enclosing frame. A query socket searches its own scope and then successive enclosing scopes, copying the first declaration with the same key. Descendant, sibling, and differently keyed declarations are ignored.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-003
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8 ], [ 8, ...
[ { "input": [ [ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Nested enclosures are scopes. Each declaration binds a key motif to a value color; a query socket receives the nearest enclosing binding for its key, falling outward when absent, so inner declarations shadow outer ones.
lean_batch_selector
select
Key-selective lookup, skipped ancestors, and shadowing make this the materially stronger scope sibling. It warrants development despite proximity to earlier nesting and legend mechanisms.
null
Each isolated horizontal domino is [key, payload] and belongs to the smallest color-8 rectangular frame enclosing it. Keys are colors 1, 2, and 3. A color-5 payload is a query socket; any payload from {4,6,7,9} declares that value for the key in the record's scope. Resolve a query by checking its own scope and then suc...
null
[ { "rule": "Each key has one fixed output color.", "evidence_that_defeats_it": "Pair 3 produces both 7 and 6 for K1 at different depths, while Pair 1 produces 4 for K1.", "fits_every_training_pair": null, "predicts_a_different_test_output": null, "comparably_simple": null }, { "rule": "Co...
Each adjacent nonzero pair is a key-value record inside a hierarchy of 8-bordered compartments. A value of 5 is an unknown placeholder. Replace it with the non-5 value associated with the same key in the current compartment; if none exists there, inherit the nearest enclosing compartment's association, continuing outwa...
[{"rule": "Use a same-compartment non-5 association when available, but otherwise inherit the outermost enclosing compartment that defines the key rather than the nearest one.", "fits_all_training_examples": true, "comparably_simple": true, "well_supported": false, "reason": "The training data never places a gray recor...
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
2
0.5
0.8333
none
false
false
null
null
false
false
null
null
[ "call-36d0c66cb013ccb04196", "call-39c57c118811858a4b83", "call-55c85f71d1d32dbce301", "call-5d27479a6fb80fc3eacf", "call-a9abea54d60dbcd06d2a", "call-b80d8531c7c4a8eaaba4", "call-d3566f2737fd17f1daff", "call-da36833a818c33acaa19" ]
v1-continuation-b003__concept-led-2
DAG transitive reduction
A matrix gives complete strict reachability in an acyclic dependency system; remove every relation possessing an intermediate witness to recover the immediate dependency graph.
Interpret the interior as the complete strict reachability relation of a DAG. Retain a marked relation x→y exactly when no third module z satisfies both x→z and z→y; erase it otherwise. Preserve the headers.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-003
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 5, 6, 2, 3, 1 ], [ 3, 0, 0, 0, 0 ], [ 1, 4, 4, 4, 0 ], [ 6, 0, 0, 0, 0 ], [ ...
[ { "input": [ [ 5, 6, 2, 9, 8, 3, 7, 1 ], [ 8, 0, 0, 0, 0, 0, 0, 0 ], [ 3, 4, 0, 4, 4, 0, 4, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 2 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
10
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Each probe names one disabled module and lists every module lost in the resulting cascade, thereby encoding transitive reachability in an acyclic dependency system. Output only immediate dependencies by removing each observed cause-effect pair that has an intermediate witness.
lean_batch_selector
select
The distinction between observed downstream loss and immediate dependency is genuinely new, and third-module evidence is functionally indispensable. Its main challenge is devising a compact, learnable visual grammar.
null
Interpret the interior as the complete strict reachability relation R of a DAG: a yellow cell in row x and column y means disabling module x subsequently loses module y; the disabled module itself is not listed. Copy the headers unchanged. Retain a yellow cell x→y exactly when no third module z satisfies R(x,z) and R(z...
null
[ { "rule": "Keep the first, last, nearest, or a fixed number of yellow cells in each row.", "evidence_that_defeats_it": "In Training 2, P retains columns Q and R while erasing marked U, T, and S positions on both sides of them; R retains U and S while erasing the intervening T position. Independent permutati...
Treat each 4 at the intersection of row label A and column label B as a directed edge A→B. Preserve the labeled headers and take the transitive reduction of this directed acyclic graph: delete an edge whenever its endpoints are already connected by another directed path of length at least two.
[{"rule": "Delete a 4 exactly when its directed edge is the shortcut side of a directed triangle in the original graph—that is, when A→C and C→B both exist for some C. This local length-two formulation fits the training examples and is comparably simple, but it gives the same test output because every transitively redu...
false
false
high
true
null
false
clear
null
The intended transitive-reduction rule is consistently demonstrated by both training pairs and uniquely yields the authored test output. The dissenting solver's proposed convergence-suppression rules do not actually fit Training 2: module 6 has two immediate predecessors (2 and 3) and multiple total ancestors, yet its ...
true
false
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
4
1
1
none
false
false
null
null
false
false
null
null
[ "call-36d0c66cb013ccb04196", "call-39c57c118811858a4b83", "call-3df5c0fdfa0118db0432", "call-5d27479a6fb80fc3eacf", "call-8658054330de4cbae837", "call-973210f7377289de670f", "call-b80d8531c7c4a8eaaba4", "call-c5a5f1978971972adf92", "call-d866dac12885d48d44e3", "call-efedfd79c03e1cb99511" ]
v1-continuation-b003__open-1
Communicating vessels
Connected chambers conserve their liquid-cell count and refill globally from the lowest available height upward, producing a common surface across each communicating system.
Identify chambers connected through fixed pipes and apertures. For each connected system, conserve the number of liquid cells, empty its interiors conceptually, and refill complete global row strata from bottom to top until the conserved volume is used. Preserve walls, pipes, exterior, and isolated systems.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-003
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
open
null
core_quality
null
null
[ { "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, ...
[ { "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, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Closed chambers joined by low apertures act as communicating vessels. Within each connected system, conserve the liquid-cell count and refill available interior cells by global height from bottom upward, yielding a common surface level; walls and isolated systems remain fixed.
lean_batch_selector
select
[redacted: ARC-AGI-2 evaluation reference] Retain as a wildcard only if chamber topology and common-level reasoning dominate over generic falling or spilling.
null
Use 0 for exterior/empty air, 8 for one-cell-thick chamber walls, 4 for fixed pipes and aperture markers, and 1 for liquid. A chamber interior is the rectangular region enclosed by an 8-ring, allowing a 4-cell to replace an 8-cell where a pipe enters. Each orthogonally connected 4-component links every chamber whose bo...
null
[ { "rule": "Liquid merely falls to the bottom within each original chamber, preserving each chamber's count.", "evidence_that_defeats_it": "In pair 1, A changes from 18 to 10 liquid cells while B changes from 4 to 12. In pair 2, dry F gains 12 cells while D and E lose cells.", "fits_every_training_pair":...
Treat each azure-bordered shape as a vessel and each connected magenta path as a pipe. Within every pipe-connected group of vessels, conserve the total number of blue cells and redistribute them from the bottoms upward until all vessels have the same absolute horizontal liquid surface; leave vessel borders, pipes, and ...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
4
1
1
none
false
false
null
null
false
false
null
null
[ "call-36d0c66cb013ccb04196", "call-39c57c118811858a4b83", "call-4ff207d5a3db482f4bc3", "call-a3a0a0d232a698af0f1a", "call-b80d8531c7c4a8eaaba4", "call-dec0e5c26ad7058c0fb4", "call-ecd59fcafad2e2cea27c", "call-f2eb9ba375530f643973" ]
v1-continuation-b005__concept-led-1
Inferred state chronology
Unordered equal-sized state panels form a unique one-cell-change chain; an external marker orients the chronology and the output records successive post-change values.
Connect two state panels exactly when they differ at one corresponding cell; the resulting graph is a simple path. Orient it from the endpoint touched by the external marker. For every transition, append the value in the changed cell of the destination panel.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-005
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 4, 6, 3, 0, 0, 1, 6, 3, 0 ], [ 5, 4, 5, 0, 0, 5, 4, 2, 9 ], [ 3, 1, 6, 0, 0, ...
[ { "input": [ [ 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0, 0, 0 ], [ 1, 4, 6, 0, 0, 1, 4, 6, 0, 0, 1, 4, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
9
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Several equal-sized state panels are unordered observations. Panels differing in exactly one cell form a unique chain; an external marker fixes its direction. Output the successive post-change values.
lean_batch_selector
select
The kernel derives time from relationships among complete states, then extracts transition values. Unique-chain checks, an endpoint cue, and nonmonotone overwrites can make it both deep and fair.
null
Extract the equal 3×3 state panels, ignoring background 0 and the external singleton marker 9. Connect two panels exactly when they differ at one corresponding cell; the resulting graph is a simple path. Orient that path from the endpoint touched by marker 9. For every directed transition, append the value in the chang...
null
[ { "rule": "Process panels in row-major or nearest-neighbor spatial order.", "evidence_that_defeats_it": "Pair 1 places panels as S2,S0,S3,S1; its row-major neighbors do not form the one-change chain and cannot produce [4,5,3]. The other placements use different permutations.", "fits_every_training_pair"...
Partition the grid into 3x3 tiles, ignoring zero separators and the external 9 marker. Connect two tiles when they differ in exactly one cell; the tiles form a unique chain. Start at the chain endpoint adjacent to the 9 and traverse away from it. For each transition, output the value in the destination tile at the sing...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
6
1
0.1667
0.3333
none
false
false
null
null
false
false
null
null
[ "call-69b325a7ffcea247db7a", "call-786e26f1afeef47e5ca8", "call-7e5f591c4550a2afa170", "call-92252b27d41a85f10f36", "call-c4f2fafe32eb91edfd23", "call-de4f880277fb8bbb8c6b", "call-df330a4efdbd7f439ae1", "call-e1029854d57480977973", "call-e86123f7046c4fd66ed5" ]
v1-continuation-b005__open-1
Cube-net path rolling
An oriented colored cube net fixes a cube's initial pose beside a simple path; rolling the folded cube along the path colors each step by the face contacting the grid.
Fold the asymmetric six-face net, place its marked face downward at the launch cell, and orient the marked edge toward the first path cell. Roll the cube one quarter-turn along each successive path edge and recolor that path cell with the color of the face now touching the grid.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-005
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
open
null
core_quality
null
null
[ { "input": [ [ 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, ...
[ { "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, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
A colored cube net has a marked base face whose orientation fixes a cube's starting pose beside a nonbranching track. Conceptually fold and roll the cube along the track, filling each successive track cell with the color of the face touching the grid after that move.
lean_batch_selector
select
Planar net interpretation, anchored three-dimensional orientation, and path-dependent rolling form a rare causal composition. The ambiguity risks are substantial but controllable with explicit pose cues and validated nets.
null
The input contains two separated objects on color-0 background. One is an asymmetric cube net made from six differently colored 3-by-3 face blocks; a single color-9 cell centered outside one exposed face edge marks both the initial bottom face and a directed edge of that face. The other is a one-cell-wide, color-5 simp...
null
[ { "rule": "Write the initial bottom color before moving, or write the top face after each move.", "evidence_that_defeats_it": "In Pair 1 the initial bottom is A=1, the initial top is F=7, and the top after the first east roll is E=6, but the first path cell is C=3, the new ground-contact face.", "fits_e...
Treat the six monochrome 3x3 squares as a cube net. The 9 touching one square identifies the initially upward face and its orientation: fold the cube so the face across the marked edge becomes upward on the first roll from the separate 9 onto the first 5. Roll the cube along the unique 4-connected chain of 5s, replacin...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
[ "No repair required." ]
null
null
null
DeepSeek V4.1 Flash 1017
4
0
0
0
none
false
false
null
null
false
false
null
null
[ "call-69b325a7ffcea247db7a", "call-786e26f1afeef47e5ca8", "call-7e5f591c4550a2afa170", "call-d72b7b20809d5e79cee2", "call-dd3e0d6b5a947c7c99a0", "call-f321749bfad838a44a1e", "call-fb22645d26d282b03c26", "call-fd548968c3516b9ec932" ]
v1-continuation-b006__concept-led-4
Anchored graph correspondence
Two visually different but isomorphic graphs share anchored correspondences; a marked source vertex maps to the target vertex with the same anchored relational role.
Interpret the two diagrams as unweighted graphs. Find the unique incidence-preserving bijection respecting the colored anchors, ignoring screen position and edge geometry. Recolor the target image of the marked source vertex.
initial-good-task-set-20260731
lean-authoring-v1-continuation-20260729-batch-006
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "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, ...
[ { "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, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Two surface-different but isomorphic relational structures share a few anchored correspondences; a marked source element maps to the target element occupying the same anchored relational role.
lean_batch_selector
select
Relations, sparse anchor correspondences, and the query each have a necessary role. It is the stronger graph-equivalence representative, although uniqueness and discoverability require unusually careful construction.
null
Interpret the left and right diagrams as unweighted graphs. Colored singleton cells are vertices, and isolated gray tracks connecting two vertices are edges; screen position, edge-pixel length, bends, generic panel color, and the red query color are not graph labels. Find the unique incidence-preserving bijection that ...
null
[ { "rule": "Apply a rigid transform or transfer normalized coordinates between panels.", "evidence_that_defeats_it": "Training pair 1 uses independently routed embeddings and places the correct target outside every rotation/reflection coordinate prediction; pair 2 changes from a closed band to nested jagged ...
Treat the two colored line drawings as isomorphic abstract graphs: colors 3 and 4 are fixed correspondence anchors, 1 marks ordinary nodes in the left graph, and 7 marks their counterparts in the right graph. Find the right-hand node corresponding to the left-hand color-2 node, recolor that 7 to 2, and preserve every o...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
6
3
0.5
0.8
none
false
false
null
null
false
false
null
null
[ "call-22461a1c64faa985159b", "call-3e23c7796565ef989516", "call-6ce6a50bc905e93f29aa", "call-8458eda7752eb7f368e5", "call-b9c39801a644e072b04d", "call-d9deed840904058389ab", "call-ea6b0daace3a77729178", "call-fdf3f57a3b5b20823166" ]
v1-qualification__composition-led-4
Overlapping inventory assignment
Overlapping outlined regions each specify the exact multiset of colors among their enclosed sockets; shared sockets couple the inventories into one unique simultaneous assignment.
Each neutral outline and attached rack define one constraint: the rack is the exact unordered multiset required across all isolated sockets strictly inside that outline. A prefilled socket consumes one matching rack entry, and a socket enclosed by multiple outlines is the same variable in every constraint. Recolor only...
initial-good-task-set-20260731
lean-authoring-v1-real-20260728
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
composition_led
null
core_quality
null
null
[ { "input": [ [ 0, 0, 0, 5, 5, 5, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ], [ 0, 0, ...
[ { "input": [ [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Overlapping outlined regions each carry an inventory strip giving the exact multiset required among their enclosed sockets. Prefilled sockets consume entries from every region containing them; color the blank sockets with the unique assignment satisfying all inventories simultaneously.
lean_batch_selector
select
Shared sockets acting in several multiset equations create genuine cross-region propagation. The idea merits development if instances remain small, legible, and uniquely deductive.
null
Each neutral outline and its attached rack define one constraint. The rack is an unordered exact multiset of the colors required across all isolated sockets strictly inside that outline. A prefilled socket consumes one matching rack entry, and a socket enclosed by multiple outlines is the same variable in every corresp...
null
[ { "rule": "An inventory strip is a set of permitted colors rather than an exact multiset.", "evidence_that_defeats_it": "Pair 1 uses residual inventories {red, red, blue} and {green, green, blue}; its output realizes both duplicate counts exactly, while a set interpretation supplies no unique values for the...
Each large rectangle outlined in 5 is a constraint region. Its nearby small 5-framed key supplies the multiset (including multiplicities) of non-5 colors that must appear at the colored or 8-valued cells strictly inside that rectangle. Preserve given colors and replace the 8s so every overlapping rectangle has exactly ...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
6
3
0.5
0.8
none
false
false
null
null
false
false
null
null
[ "call-16857aa8cb3191daa1a5", "call-2844c1c8d3be358f4e3e", "call-4458cec113c3b47b413f", "call-47721922f2897988c1d3", "call-553dc2612f9c0acd68ab", "call-793da1a7ee792abad9e6", "call-8605c81c9064a6e3bfca", "call-9663d43eeced558ad31a" ]
v1-qualification__concept-led-1
Shuffled partition join
Two unordered banks independently classify the same color identities into row groups and column groups; each target cell receives the unique identity at the corresponding set intersection.
Locate the gray R×C target array with horizontal signatures labeling its rows and vertical signatures labeling its columns. Match each shuffled horizontal compartment to a row by its repeated signature and each shuffled vertical compartment to a column likewise. Treat compartment contents as unordered sets. Replace tar...
initial-good-task-set-20260731
lean-authoring-v1-real-20260728
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
[ { "input": [ [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Two unordered banks independently classify the same color identities: one assigns each identity to a row group and the other to a column group. Fill each cell of a blank array with the unique identity shared by its row and column groups.
lean_batch_selector
select
Intersecting two independent partitions is compact, unusual, and exceptionally functional: neither bank is sufficient, while their shared identities determine every output cell.
null
Locate the gray R×C target array with horizontal signatures labeling its rows and vertical signatures labeling its columns. Match each shuffled horizontal compartment to a row by its repeated signature and each shuffled vertical compartment to a column likewise. Treat compartment contents as unordered sets. Replace tar...
null
[ { "rule": "Copy or sort each row compartment into the corresponding target row.", "evidence_that_defeats_it": "In pair 1, H4:[7,4,2] produces [2,7,4] and H2:[3,6,1] produces [6,1,3]; neither source order nor palette order works.", "fits_every_training_pair": null, "predicts_a_different_test_output":...
Each three-gray-cell pattern within a six-position span is a label. Match every column of the all-5 target rectangle, using its label above, to the vertically framed color list with the identical label. Match every target row, using its label on the left, to the horizontally framed color list with the identical label. ...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
6
1
0.1667
0.3333
none
false
false
null
null
false
false
null
null
[ "call-3575c9aa0c62be3c69fe", "call-4458cec113c3b47b413f", "call-52af8d89d21d98c30e26", "call-793da1a7ee792abad9e6", "call-7d72876bda64e548cc25", "call-8c3fe940ce7ed209f7c1", "call-9663d43eeced558ad31a", "call-bfa9aa85771fbcc7e376" ]
v1-qualification__concept-led-4
Flow-conservation meter restoration
A directed channel network encodes quantities as meter-bar lengths and conserves their sums through every split and merge; coupled junction equations determine erased meters.
Read the gray channel network top to bottom. Cyan cells are junctions, and every edge contains one yellow meter anchor whose value is the contiguous magenta run extending rightward. An anchor with no run is erased. At every junction, the sum arriving from above equals the sum departing below. Solve the connected system...
initial-good-task-set-20260731
lean-authoring-v1-real-20260728
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
concept_led
null
core_quality
null
null
[ { "input": [ [ 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 ...
[ { "input": [ [ 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, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Metered channels form a descending network in which every junction conserves quantity: the sum of token-bar lengths entering equals the sum leaving. Solve the coupled junction equations and restore erased meter bars.
lean_batch_selector
select
A conserved scalar propagated through linked splits and merges is both novel and deeply compositional. Its main challenge is establishing an exceptionally clear visual grammar.
null
Read the gray channel network in its fixed top-to-bottom direction, reinforced by green source caps and maroon sink caps. Cyan cells are the only junctions. Every edge between two junctions or endpoints contains one yellow meter anchor on a vertical channel segment. Its value is the number of contiguous magenta cells e...
null
[ { "rule": "Gray channel length, bend count, or distance between junctions is the quantity.", "evidence_that_defeats_it": "Pair 1 deliberately makes the missing branch's connector span disagree with its required value 5; Pair 2 permutes connector spans independently of the restored values 8, 5, 7, and 3.", ...
Treat each gray structure as a downward flow network. A 4 followed by n rightward 6 cells labels that vertical segment with value n. At every horizontal connector marked by 8, the sum of values entering from above equals the sum leaving below. Solve the missing values and append that many 6 cells to each bare 4, leavin...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
0
0
0
none
false
false
null
null
false
false
null
null
[ "call-2a265b4615574a0ce8b4", "call-4458cec113c3b47b413f", "call-52af8d89d21d98c30e26", "call-75dd6328526b5fed84d8", "call-793da1a7ee792abad9e6", "call-9663d43eeced558ad31a", "call-e0644230ff03fb48956a", "call-f62761c778bc86bd94ed" ]
v1-qualification__open-4
Coupled parity erasure recovery
A tiled binary matrix carries cellwise odd-parity checks for every row and column; whole erased data tiles are recovered by jointly propagating the linked constraints.
Each example is a gray-guttered array of R by C binary data tiles augmented by one right check tile per data row and one bottom check tile per data column; the bottom-right block is a gray null block. For every internal tile coordinate p, the right check is the XOR of the data tiles in its row and the bottom check is t...
initial-good-task-set-20260731
lean-authoring-v1-real-20260728
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v1.0.1
open
null
core_quality
null
null
[ { "input": [ [ 0, 0, 5, 0, 0, 5, 0, 1, 5, 0, 1 ], [ 0, 1, 5, 1, 1, 5, 1, 1, 5, 0, 1 ], [ 5, ...
[ { "input": [ [ 2, 2, 2, 5, 2, 2, 2, 5, 0, 0, 0, 5, 0, 1, 1, 5, 0, 0, 1 ], [ 2, 2, 2, 5, 2, 2, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "role": ...
9
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
A matrix contains small binary-pattern tiles; each right and bottom check tile is the cellwise odd-parity combination of its row or column. Recover several erased data tiles by jointly solving the linked row and column checks, then restore the matrix.
lean_batch_selector
select
Bitwise parity checks on two axes create a genuinely new invariant and meaningful coupled recovery. Careful examples can distinguish parity from overlay, union, and majority.
null
Each example is a gray-guttered array of R by C binary data tiles augmented by one right check tile per data row and one bottom check tile per data column; the bottom-right block is a gray null block. For every internal tile coordinate p, right_check[r][p] is the XOR of data[r,1][p] through data[r,C][p], and bottom_che...
null
[ { "rule": "The check tile is the cellwise OR or visual union of the data tiles.", "evidence_that_defeats_it": "Pair 1 includes coordinates with exactly two source ones where XOR gives 0 but OR gives 1.", "fits_every_training_pair": null, "predicts_a_different_test_output": null, "comparably_simp...
Split the grid into binary mini-grids separated by 5s. In each macro-row, the rightmost mini-grid is the cellwise XOR of all preceding mini-grids; in each macro-column, the bottom mini-grid is the cellwise XOR of all preceding mini-grids. The bottom-right checksum is omitted. Replace every all-2 mini-grid with the uniq...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
3
0
0
0
none
false
false
null
null
false
false
null
null
[ "call-18c0bc0ba055fb12ccbe", "call-4458cec113c3b47b413f", "call-52923b64e1ea03c322cb", "call-793da1a7ee792abad9e6", "call-8f34e5ab6673f3b5c7e0", "call-95cb49f36aa648339dbd", "call-9663d43eeced558ad31a", "call-c79999da5d7a122e9a92", "call-cec7ec53251c77bbb5ac" ]
v3-pilot__composition-led-3
Geodesic beacon localization
Colored unary readings specify exact shortest-path distances from corresponding beacons through a walled maze; their unique joint intersection identifies one target corridor cell.
A solid separator divides unary readout bars from a framed maze. For each beacon color, the matching bar length is the required orthogonal shortest-path distance. Recolor the unique blank traversable cell satisfying all three exact distances, preserving every other cell.
initial-good-task-set-20260731
lean-authoring-v3-pilot-20260730
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v3.0.0
composition_led
null
core_quality
null
null
[ { "input": [ [ 5, 2, 2, 2, 5, 5, 5 ], [ 5, 1, 5, 5, 5, 5, 5 ], [ 5, 3, 3, 5, 5, 5, 5 ], [ 5, ...
[ { "input": [ [ 5, 1, 1, 1, 1, 5, 5, 5, 5 ], [ 5, 2, 2, 2, 2, 5, 5, 5, 5 ], [ 5, 3, 3, 5, 5, ...
2
1
null
null
[ { "role": "blind_solver", "stage": "lean_v3_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_v3_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "r...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Beacons occupy corridors of a walled maze, each carrying a unary echo tally. Add a target at the unique blank corridor cell whose shortest traversable-path distance from every beacon equals that beacon's tally.
lean_v3_batch_selector
select
Intersecting several geodesic-distance constraints produces a clear global localization insight. Every beacon can be made necessary, and uniqueness is straightforward to validate computationally during authoring.
null
A solid gray row separates a unary readout header from a gray-framed maze. In the maze, black cells and the three singleton colored beacon cells are traversable orthogonally; gray cells are walls. For each beacon color, the length of its same-colored header bar is the required number of edge moves from that beacon. Rec...
null
[ { "rule": "Use Manhattan distance and ignore internal walls.", "evidence_that_defeats_it": "In training pair 2, green-to-target Manhattan distance is 2 but the required shortest corridor distance is 6. The test independently repeats the distinction with red-to-target distances 2 versus 4.", "fits_every_...
Each colored bar in the upper key gives the required 4-neighbor shortest-path distance from the matching colored cell (1, 2, or 3) to a missing color-4 cell in the lower maze. Color-5 cells are impassable walls. Place 4 in the unique zero cell satisfying all three distances.
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
5
3
0.6
0.9
none
false
false
null
null
false
false
null
null
[ "call-02246361c6d99625e87d", "call-0a2b12d8253a83a18b35", "call-12c720f9868ae4a774d8", "call-5cb6ec33573fc31eac32", "call-705fd458f9142bf09193", "call-78db9d21c383efd7e985", "call-82ec414a3f036bad3978", "call-cd3d415a2d5083eceec5" ]
v3-pilot__composition-led-4
Modular clock synchronization
Two oriented cyclic tracks expose residues of one hidden elapsed count; combine their congruences and project the resulting phase onto a differently sized empty target track.
Treat each rectangular border as an oriented cyclic list whose origin and successor fix index zero and direction. The observed beads give one common phase modulo the two witness perimeters. Solve the compatible congruences and add a bead at that phase modulo the target perimeter, changing nothing else.
initial-good-task-set-20260731
lean-authoring-v3-pilot-20260730
2026-07-31
pre-v1
lean
arcgen-lean-authoring-v3.0.0
composition_led
null
core_quality
null
null
[ { "input": [ [ 5, 5, 4, 0, 0, 5, 5, 5, 5 ], [ 5, 0, 3, 0, 0, 3, 0, 0, 2 ], [ 5, 5, 2, 0, 0, ...
[ { "input": [ [ 5, 5, 5, 5, 5, 5, 0, 0, 0, 0, 0 ], [ 5, 0, 0, 0, 0, 5, 0, 5, 4, 3, 5 ], [ 5, ...
3
1
null
null
[ { "role": "blind_solver", "stage": "lean_v3_blind_solver", "model": "gpt-5.6-sol", "reasoning_effort": "xhigh", "n_calls": 1 }, { "role": "editorial_board", "stage": "lean_v3_editorial_board", "model": "gpt-5.6-sol", "reasoning_effort": "max", "n_calls": 2 }, { "r...
8
null
null
null
[]
[]
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
null
Closed tracks of different lengths act as synchronized clocks. From each track's origin notch, an observed bead marks the same hidden elapsed count modulo that track's length; combine those phases and place the bead on a flagged empty target track.
lean_v3_batch_selector
select
It is a close thematic sibling of prior cyclic-track work, but reconciling multiple observed residues to determine an unseen target phase is a materially different click. Its upside justifies wildcard development if kept small.
null
Treat every hollow rectangular border as a cyclic list of perimeter cells. On a witnessed loop, the yellow origin cell is index 0 and its adjacent green successor establishes the positive traversal direction; the red bead lies at residue r modulo the perimeter length L. The magenta origin cell both flags the beadless t...
null
[ { "rule": "Copy the period-10 bead directly, or always use its opposite lift on the period-20 target.", "evidence_that_defeats_it": "Pairs 1 and 2 keep the period-10 bead fixed at index 6 but require target indices 6 and 16 respectively.", "fits_every_training_pair": null, "predicts_a_different_test...
Treat each gray rectangular border as a cyclic ring whose modulus is its perimeter. On each completed ring, the adjacent 4→3 pair establishes the travel direction; count from 3 to 2 while continuing in that direction to obtain a residue. Find the common integer satisfying the residues from the two completed rings (Chin...
null
false
false
high
true
null
false
one_answer_supported
null
the blind probe found no comparably simple, well-supported different-output rule
null
null
null
null
null
null
null
null
DeepSeek V4.1 Flash 1017
4
0
0
0
none
false
false
null
null
false
false
null
null
[ "call-02246361c6d99625e87d", "call-0a2b12d8253a83a18b35", "call-29ed5d28a4d2e1294c6c", "call-5cb6ec33573fc31eac32", "call-78db9d21c383efd7e985", "call-d0ab27c62a65945a63e4", "call-d97a3c2f2de7a8d4c177", "call-f383478cd38dba40bcee" ]
End of preview. Expand in Data Studio

ARC Task Bank

17,470 verified tasks in the ARC-AGI format, written by an LLM task generator, each with the full record of how it was designed and checked. The bank accompanies our ARC Prize paper (citation below).

Tasks 17,470, committed between 2026-07-31 and 2026-10-28
Pipeline versions final pipeline ("v1", from 2026-10-01): 14,796 tasks; earlier versions: 2,674
Design records 98,770 unique model calls (97,047 with their parsed response) and 17,470 task lifecycle records
Teacher difficulty DeepSeek V4.1 Flash 1017 solve rate for 17,468 tasks (median 4 draws)
Duplicates no exact or recoloured duplicates
from datasets import load_dataset

tasks = load_dataset("<org>/<repo>", "tasks", split="train")          # one row per task (~50 MB)
records = load_dataset("<org>/<repo>", "records", split="train")      # every model call + lifecycle (~420 MB)

# only the lifecycle records, or only the model calls
life = load_dataset("<org>/<repo>", data_files="data/records/lifecycle-*.parquet", split="train")
calls = load_dataset("<org>/<repo>", data_files="data/records/calls-*.parquet", split="train")

arc/arc_tasks.zip holds the same tasks as plain ARC JSON files (<task_id>.json, {"train": [{"input", "output"}], "test": [{"input", "output"}]}).

Contents

What the bank is

Each task is a set of training input/output grid pairs and one or more test pairs, in the format of ARC-AGI (grids up to 30×30, colours 0–9). Every task here passed the generator's checks and was then committed to the bank by an explicit owner decision. The tasks were made to be new relative to the growing bank and plausibly admissible as ARC-AGI-2-style evaluation tasks: one coherent rule, inferable from the training pairs, with a single best-supported test answer.

Beside the grids, every task carries its design record: the idea it came from, why the selector kept it, the planner's rule with the rival rules it had to defeat, the blind solver's reading, the judge's decision, any repairs, and every model call's parsed response.

How the tasks were made

The final pipeline (v1) runs these stages for each task. All stages are model calls except where noted.

  1. Arms. Each idea call starts from an arm, a property of the task or of what solving it demands (for example "marks that direct" or "a small world with laws"). An arm never fixes a rule; the model invents the rule inside it. Property slots, content/skill/structure lines, size rungs and small draws are layered on top (see Design space).
  2. Ideas, checked against the nearest bank tasks. The idea model explores, sketches, then looks up the nearest committed bank tasks and replaces sketches that are already covered (a look-up-and-replace loop), before committing a kept idea (idea_kernel_json).
  3. Selector. A selector sees a window of kept ideas with their nearest bank references and rules each one eligible or not, with a reason and the useful contribution over the bank (selector_* fields).
  4. Planner with rival rules. The planner writes a frozen plan: the central rule, invariants, the exact training and test layout, and the strongest simple rival rules, each with the evidence in the pairs that defeats it (central_rule, invariants, rival_rules).
  5. Model-written grids. A realizer model writes every grid from the frozen plan. No code builds the grids.
  6. Independent re-derivation. A second call gets the plan's rule but not its answers, re-derives the test outputs, and code compares them exactly with the realizer's answers. Only the test answers are code-checked; training outputs are checked by a model call and, indirectly, by the blind solve.
  7. Blind solve. A new call of the solver model, given only the grids, infers the rule and predicts the test output, listing plausible alternative readings and flags (blind_* fields).
  8. Judge. When the blind solve fails or flags a serious different-output alternative, a judge model decides whether the intended rule is clearly best supported, and may ask for a repair (judge_* fields).
  9. Repair. A bounded repair call edits the task; the repaired task is checked again (repair_count, repair_instructions).
  10. Bank. Verified tasks are committed only by an explicit owner decision, in commit sets (commit_set_id).

A deterministic palette step (code) may permute colours after planning so that backgrounds and roles vary across the bank (palette_remap). The planner's and realizer's own call records keep the colours those models wrote; the lifecycle record and the tasks grids use the final colours. Plans also refer to colours by role placeholders such as @ink_a or @background.

Earlier pipeline versions differ: they used shard and global selectors instead of the look-up loop, some used two-model editorial boards instead of the judge, and the earliest have no selector record at all (see Eras).

Models, as recorded per call (records.model, tasks.models): in the final pipeline gpt-6.1-sol (via the Codex CLI) plans, builds, re-derives and does every primary blind solve; gpt-6-astra runs the judge, ambiguity repairs and some second blind solves. Earlier versions also used gpt-6-sol, gpt-5.6-sol and gpt-5.6-terra.

Eras and pipeline versions

era is v1 for tasks committed on or after 2026-10-01 (the final pipeline) and pre-v1 before. pipeline_generation is a coarser label derived from source_pipeline:

pipeline_generation Commit dates Tasks Notes
lean 07-31 – 08-05 25 first lean authoring pipeline; batch selector; editorial boards
v4 08-04 – 09-05 307 v4.x experiments (supported departure, episode-joint, functional scale, …); boards
e-series 08-14 – 08-31 733 E11–E22 experiments and the E18 production factory; shard/global selectors; boards
astra 09-06 – 09-15 764 Astra programme: arm-bank selector, broad arms, boardless verification from 09-11
astra-routine 09-14 – 09-19 672 routine production runs r10–r21
r23 09-30 173 two-planner batch on gpt-6.1-sol; committed same-idea siblings
v1 10-01 – 10-28 14,796 final pipeline: look-up idea loop, property arms, judge + repair

1,512 early tasks (before the production blind-check records) have no blind_performance record (has_blind_checks = false); their blind results are still in blind_rule and the lifecycle record.

Design space: arms and draws

A task carries one primary arm; in the T-type b17 batches also a family; up to three property slots; at most one content line, one skill line and one structure line; usually a size rung; and a few per-idea draws. These are recorded as they were drawn; a recorded property is an instruction the idea model received, not a verified property of the task.

Primary arms (primary_arm; 1,239 early tasks have none):

Arm Fixes Arm Fixes
GEO spatial geometry: where things are, face, reach, align WORLD a small world with consistent laws; answer = state reached
INTERACT two or three processes act at once SEE seeing how a picture is organised
JUDG contextual judgement: which cue or role matters here DIRECT marks act through their form (where, which way, how far)
SEM a meaning learned from how the examples use it LEVELS organisation within parts and among parts
OPEN no direction BOARD part of each input is a reference board
RHYTHM the true rule of a repetition J joint inference over all the pairs
PER what counts as a unit ABS a relationship the pictures determine but never draw
EXEMPLAR a worked instance inside each input SIGNAL structure under systematic interference
FORM a small logic puzzle taught by the grid DISC the obvious reading is wrong or incomplete
TEMPLATE copies of a template placed by the picture RESTORE restore what is missing or covered
GEN build the answer from given material H_COMPOSE sustained linked work
CONTRAST a controlled comparison separates the rule from a rival H_REASON demanding dependent reasoning
VIEWS two compatible readings at once T a derived consequence ("logical leap")
ACC accessible: direct route, real insight D1 exactly one demonstration
INVERSE reason backwards to what produced the input SPREAD 6–9 pairs, each showing part of the rule
STAGES the pairs form a chain of states EXEC accessible rule, substantial execution
ACROSS one relation across different kinds of picture AIM a condition on the result picks the answer
H_DISC hard discovery, easy application

Retired pre-v1 arms: C (open, bank-conditioned), I1 (independent exploration), COMPACT, EXP (functionally expansive), MANY, XFER (supported transfer), REF_STYLE (general character of ARC evaluation tasks, described in prose only; the card held no evaluation task or ID), RICH.

Families (family, b17 T-type batches): SIM (simulation), LEGEND (key in each input), ENCL (enclosure), FIT (fitting), SYMSEQ (structure completion).

Property slots (property_slots): CONSTRUCT, DIGEST, EXTENT, SCENE (output); PACKED, BUSY (scene); VACANCY (evidence); KEY, CHAINED, MINIMAL, DISTRIBUTED, INSTRUCT (episode); IGNORE (relevance); COLOURFUL, PAYLOAD, MONO (colour); EASIER, LIGHT (demand); MEASURE (content); JOINED (structure); DERIVED (test); ONE (one demonstration pair).

Content lines (content_line): MARKS, PROCESS, TRACE, RELATION, SETTLE, INGRID, QUIET, DEPART, PRECISE, FORCED, COINCIDE, REFRAME. CONTROL marks the matched-control arm of a line screen (no line). Skill lines (skill_line): RECURSE, GRAPH, AUTOMATON, RANK, MATCH, EMIT, QUANTITY, GROWTH, SYMMETRY, CUED, NOISY. Structure lines (structure_line): SHAPE, RELEVANCE, RECOMBINE, ELIMINATE, PARSE, VARY.

Size rungs (size_rung): R1 (test answer about 150–300 cells), R2 (300–700, test larger than training), R3 (450–750, many dependent decisions), R4 (about 30×30). size_arm is large/small in the weakness runs.

Draws: draw_pose (instances turned, mirrored or resized across examples), draw_canvas (square / margin / both), draw_edge and draw_roles (drawn or control: things cut by the border; a colour with different roles in different grids), draw_colour_roles (vary or v1 colour instruction), draw_teach (plain teaching), draw_gate (the retired right-twice gate arm, see flags), draw_depart (first test meets an unseen situation), draw_fence (the weakness-line fence), route / route_overlay (planner route and scale overlay such as XFER, MANY, COMPACT).

Files

Path What Size
data/tasks/tasks-00000.parquet tasks config: one row per task 50 MB
data/records/calls-00000.parquet records config, record_type = model_call 223 MB
data/records/lifecycle-00000.parquet records config, record_type = lifecycle 193 MB
arc/arc_tasks.zip 17,470 ARC JSON files 11 MB
prompts/templates/ prompt templates of the final pipeline (326 files) 1.5 MB
prompts/manifest.json template list with SHA-256

Parquet files use zstd compression. Grids are list<list<int8>>.

Field reference: tasks

Identity and provenance

Field Type Meaning
task_id string bank task ID (also the ARC file name)
title, concept_summary string one-line title and concept, as recorded at commit
intended_rule string the task's rule as recorded at commit, in final colours
commit_set_id string owner commit set the task entered the bank with
batch string generation run (batch) ID
commit_date string YYYY-MM-DD of the commit set
era string v1 (from 2026-10-01) or pre-v1
pipeline_generation, source_pipeline, search_mode string pipeline version labels
project_stage string stage_3 for the production stage (from r23), else null
bank_status string boardless_verified (no editorial grade), core_quality or reserve_quality (board era)
quality_grade, editorial_mode string unassigned / bypass for boardless tasks

Grids: train, test (list of {input, output}), n_train, n_test.

Models

Field Meaning
generation_model, generation_effort idea model and reasoning effort, as recorded
models list of {role, stage, model, reasoning_effort, n_calls} over every recorded call of the task
n_model_calls, call_record_ids number of linked call records and their record_ids in records

Roles: idea, selector, planner, realizer, technical_verifier (independent re-derivation), blind_solver, judge, repair, audit (pre-v1 mechanism audits), editorial_board and research_review (pre-v1; content withheld).

Design: primary_arm, experiment_arm (pre-v1 experimental arm label such as single, treatment, control), family, modifiers (all idea modifiers as recorded), property_slots, skill_line, content_line, structure_line, size_rung, size_arm, route, route_overlay, draw_* (see above).

Idea and selector

Field Meaning
idea_kernel_json the kept idea (kernel) as JSON: central relation, recipe, what is new, risks
idea_central_relation its central relation
selector_stage which selector call assessed it
selector_eligibility the selector's verdict on the idea (plausible, select, …)
selector_reason the selector's reason
selector_useful_contribution the selector's statement of what the idea adds over the bank (v1 and Astra)

Planner

Field Meaning
central_rule the planner's central rule (role placeholders such as @ink_a)
invariants the plan's invariants
rival_rules list of {rule, evidence_that_defeats_it, fits_every_training_pair, predicts_a_different_test_output, comparably_simple}

Blind solve (the last recorded blind response)

Field Meaning
blind_rule the rule the blind solver inferred
blind_alternatives_json its strongest plausible alternatives (JSON, predicted grids removed)
blind_serious_alternative it reported a serious alternative with a different test output
blind_unsupported_guessing it reported that the test needs unsupported guessing
blind_confidence its stated confidence
blind_matched_answer its prediction matched the intended answer
blind_primary_result matched / mismatched for the production primary blind solve
has_blind_checks the task has a production blind-check record

Judge and repair

Field Meaning
judge_decision last recorded adjudication: clear, repairable (a repair followed and was re-verified), or one_answer_supported (lean era)
judge_failure_kind the judge's diagnosis of the blind failure (execution, discovery, …)
judge_reason its reason
judge_intended_rule_supported, judge_comparable_rival its two key findings
evidence_resolution how the answer evidence was cleared: ordinary_primary_clear, adjudicated_clear, rule_preserving_repair_reverified_clear, right_twice_clear, …
repair_count, repair_instructions number of repairs and the instructions given
overruled_credible_rival the final blind solve recorded a credible rival (different test output, fits every training pair, well supported, comparably simple) that the pipeline overruled; null without blind checks
credible_rival_cleared_by, n_credible_rivals adjudication, right_twice or blind_match_no_adjudication; count

Teacher difficulty: teacher_model, teacher_draws, teacher_correct, teacher_solve_rate, teacher_pass_at_2 (see Teacher difficulty).

Provenance flags: eval_near_twin, admitted_via_right_twice, owner_override, owner_override_kind, source_portfolio_status, owner_editorial_override, excluded_from_training, excluded_from_training_reason (see Provenance flags).

Other: palette_remap (one-line summary of the colours the palette step permuted, e.g. colours remapped 0->7, 7->0).

Field reference: records

One schema for both record types.

Field Meaning
record_id call-… (hash of stage, call ID and response) or lifecycle-<task_id>
record_type model_call or lifecycle
task_ids, n_tasks bank tasks whose dossier holds this record. Selector and idea calls cover a window of ideas, so one call can serve several tasks; it is stored once
stage, role pipeline stage (e.g. astra_concrete_plan_v3) and role
model, reasoning_effort, provider as recorded in the call's request
call_id, parent_ids call ID and the candidate/kernel IDs it was made for
prompt_template_version, prompt_template_hash, prompt_hash template identity (match prompts/manifest.json for v1 templates)
withheld_reason set when the response is not shipped (see below)
redactions JSON counts of redactions applied to this record, or null
json the parsed model response (model calls) or the lifecycle record, as a JSON string

Lifecycle record (json of a lifecycle row): {task_id, registry_entry, review, authoring_extra, dropped_fields}.

  • review is the task's full candidate record: kernel, editorial brief, selection note, stage history, plan, realization, final task, deterministic and technical diagnostics, technical results, blind results, answer evidence, adjudication, difficulty versions, weakness-line checks, terminal artifact, and a palette_treatment_summary.
  • registry_entry holds bank-registry fields not already in review; authoring_extra holds authoring-file fields that differ from review.
  • Repeated large sub-objects are stored once; later copies are {"$same_as": "<JSON path of the first copy>"}.

Model-call responses are the models' structured outputs (JSON). Prompts, raw responses, transport logs, stderr, timing and schema snapshots are not included.

Teacher difficulty

DeepSeek V4.1 Flash 1017 (an open model) solved the bank tasks during trace generation, with the standard prompt and maximum reasoning effort. Each draw is one answered attempt at one test input, on the original task or on a geometric variant (rotation, reflection, transpose). Cut, empty or malformed calls are excluded.

Field Meaning
teacher_draws answered draws (0 for 2 tasks never drawn)
teacher_correct correct draws
teacher_solve_rate mean over test inputs of the per-input share of correct draws
teacher_pass_at_2 unbiased pass@2 (two attempts per test input), mean over test inputs; null if any test input has fewer than 2 draws

Across the bank the mean solve rate is 0.55 and the mean pass@2 is 0.66; 24% of tasks were never solved and 33% always. For comparison, with the same prompt and settings the model scores 98.1% pass@2 on the 1,000 ARC-AGI-2 training tasks.

Caveats.

  • Draw counts vary (1–20; median 4). Some sampling rounds drew adaptively, giving more draws to tasks the model had failed, so draw count is not independent of difficulty, and rates from few draws are noisy.
  • Variants are pooled with originals; a geometric variant can be easier or harder than the original.
  • One open model at one setting is a narrow difficulty signal; it measures difficulty for that model, not for people.
  • The trace-generation rounds were not designed as a benchmark; matched fixed-design numbers are in the paper.

Provenance flags

Flag Values Meaning
eval_near_twin twin (2), near (37), none (7,870), unchecked (9,561) Result of our check of every public ARC-AGI-2 evaluation task against the 7,909 bank tasks committed by mid-October (7,916 registry tasks including 7 later quarantined). twin: one program solves both tasks. near: the same core mechanism with one more clause or a changed setting. Tasks committed later were not checked, so the 39 flagged tasks are a lower bound.
admitted_via_right_twice 128 true Admitted between 10-16 and 10-19 through the retired "right twice" gate: two correct blind solves cleared a flagged rival without review.
owner_override, owner_override_kind 314 true (crowding 244, same_procedure 70) Pre-v1 tasks committed by owner override although the portfolio review held them as crowded or as a same-procedure duplicate.
source_portfolio_status include_now, hold_crowded, same_procedure_duplicate The original pre-v1 portfolio placement. 15 tasks of the 09-15 backlog commit carry a held placement without an override flag (their saved grades were reused at commit).
owner_editorial_override 3 true Editorial rejections committed by explicit owner approval (09-10).
excluded_from_training, excluded_from_training_reason 9 true Excluded from our training sets after a later ambiguity review. The exclusion list has 13 IDs; the other 4 were held at commit and are not in the bank.
overruled_credible_rival 416 true See the judge fields above.

What was removed or redacted

ARC-AGI-2 evaluation content. No evaluation task ID, no evaluation grid and no text shared with our evaluation-task annotations appears in this release. Where it entered the records, we removed it:

Where What we did Count
Selector calls up to 10-14 Their reference lists included public evaluation tasks (real:<id> with rule texts). Each comparison with an evaluation reference keeps only its relationship label (distinct, useful_relative, …); its ID becomes real:[eval-redacted] and its text is replaced. In every selector response that saw evaluation references (1,238 of 2,205 selector calls), sentences that mention real or evaluation references are replaced. The same applies to selector assessments, editorial briefs, selection notes and sibling lists inside lifecycle records of tasks committed before 10-15. 899 references and 1,720 sentences in call records; 613 and 809 more in lifecycle records and selector_* fields (partly the same text)
Editorial-board calls (pre-v1) The boards were shown six public evaluation tasks with their test answers as anchors. All 644 board responses are withheld (metadata kept, json null), and the boards' verdict texts are dropped from lifecycle records. 644 calls
Research-review calls (pre-v1, difficulty_judgment_research_*, broad_research_*, lane_research_*) Withheld in full. 1,067 calls
Lifecycle calibration_task_ids (earliest tasks) Dropped: they listed the evaluation tasks used as idea-prompt calibration examples. 25 tasks
Any string, anywhere Strings holding an evaluation ID, and sentences sharing 8 or more consecutive words with our evaluation-task annotations or with the selector's own descriptions of evaluation tasks, are replaced. Shared 8-word phrases that are generic layout language (two or fewer content words, or also produced by models with no evaluation exposure, such as "upper left, upper right, lower left and lower right") are not counted. 5 strings

Redacted text reads [redacted: ARC-AGI-2 evaluation reference]. Each record's redactions field counts what was changed in it. A final scanner checked every shipped file (every string, parsed JSON payload, file name and grid) for evaluation IDs, 8-word annotation overlaps and evaluation grids, with zero hits.

Not included. Prompts as sent (filled prompts), raw responses, transport logs, stderr, timing, schema snapshots, the dossiers' *.private.json scaffolding, and duplicate copies of shared calls. The full palette_treatment block (which repeats the plan, realization and task in both colourings) is replaced by a summary. The 438 verified but uncommitted tasks of the last run are not included.

Normalised. Local paths, run directories, account names and the host name were replaced with neutral values (a run path becomes its batch ID; account names become main). Run and batch IDs are kept, with account names inside them normalised the same way.

Disclosures

  1. Evaluation content in generation prompts.
    • Idea prompts: from the first runs (07-28) until r23 (09-30), they carried descriptions of four public evaluation tasks per call as calibration examples.
    • Selector: until v1-b16 (10-14), it saw rule texts of public evaluation tasks as comparison references, so about 7,900 bank tasks were selected with them in context.
    • Planner: for about 440 of the 5,400 stage-3 tasks committed by 10-14, the selector's note on an evaluation comparison went verbatim to the planner. No evaluation ID reached a planner prompt.
    • From 07-28 to about 09-10, editorial boards scored generated tasks against six public evaluation tasks shown in full, test answers included. This affects about 1,300–1,450 early tasks, depending on how a shared board review is mapped to tasks.
    • In all, about 8,160 bank tasks (47%) had some evaluation content in at least one generation-stage prompt. No evaluation content has been in generation prompts since 10-15.
  2. Near-copies of evaluation tasks. Judged against the 7,916 bank tasks of mid-October, 30 of the 120 public evaluation tasks have a twin (2) or a near-twin (28) in the bank; the 39 bank tasks involved are flagged in eval_near_twin. The later tasks were not checked, so this is a lower bound. Our tracing found no idea prompt that described the evaluation task its bank task resembles; the selector compared many of these ideas with the matching evaluation task after they were written and admitted them as useful relatives. We read them as convergent reinventions of common ARC ideas that the novelty guard let through, not copies. Pretraining familiarity with the public evaluation set cannot be ruled out.
  3. Same-model checking. In the final pipeline gpt-6.1-sol plans, builds, re-derives and does every blind solve; only the judge and ambiguity repairs run on gpt-6-astra. The blind solve is a fresh call of the same model, so it partly measures self-consistency.
  4. Other admissions.
    • 128 tasks came in through the retired "right twice" gate with an unreviewed flagged rival (admitted_via_right_twice). After a later ambiguity review we excluded 8 of them, and one other task, from our training sets (excluded_from_training, 9 bank tasks; the exclusion list's 4 other IDs were held at commit and are not in the bank).
    • 314 pre-v1 tasks were committed by owner override despite crowding or same-procedure flags (owner_override).
    • r23 committed same-idea siblings.
    • 568 tasks were kept on the judge's word after a failed blind solve.
    • Only test answers are code-checked; training outputs are checked by a model call and, indirectly, by the blind solve.
    • No human panel reviewed the tasks. Quality judgements in the paper come from model raters.

Intended uses

  • Training and evaluating ARC-style reasoning systems (supervised fine-tuning, reinforcement learning, curriculum design), and studying difficulty with the teacher columns.
  • Studying LLM task generation: how ideas, rival rules, blind solves and repairs relate to the final task.
  • When you report a score on the public ARC-AGI-2 evaluation set for a system trained on this bank, report it split by eval_near_twin: with and without the 39 flagged bank tasks in training, or on the evaluation tasks with and without a flagged twin. Because 9,561 later tasks were not checked, treat even the split as an upper bound on cleanliness.
  • Not intended as an evaluation set for ARC-AGI-2 claims, and not a substitute for human-verified tasks.

Limitations: rules and judgements were written and checked by models; a small share of tasks may still admit a second reasonable answer (overruled_credible_rival marks 416 known cases). Recorded arms and lines are instructions to the idea model, not verified properties of the task.

Licence

This dataset is dedicated to the public domain under Creative Commons CC0 1.0 Universal (CC0 1.0, https://creativecommons.org/publicdomain/zero/1.0/). To the extent possible under law, Hazem Lashen has waived all copyright and related rights in it. You may copy, modify and distribute it for any purpose, including commercially, without asking permission or giving credit. A citation is welcome but not required. See LICENSE.

Model outputs. The tasks, plans, rules, judgements and other records were generated by third-party models, mainly OpenAI's gpt-6.1-sol and gpt-6-astra through the Codex CLI, with embeddings for the bank look-up via OpenRouter; the difficulty columns come from DeepSeek V4.1 Flash solves. The CC0 dedication covers our rights in the dataset. The model providers' terms may also apply to model-generated content, for example terms on using outputs to develop competing models. Check those terms for your use.

Code

The generator code, with the training code, is released under the MIT No Attribution licence (MIT-0) at https://github.com/hl3372/arc-agi-experience.

Citation

@misc{lashen2026arctaskbank,
  title  = {ARC Task Bank: LLM-generated ARC-AGI tasks with their design records},
  author = {Lashen, Hazem},
  year   = {2026},
  url    = {https://huggingface.co/datasets/hl3372/arc-agi-task-bank},
  note   = {Accompanies an ARC Prize 2026 paper; the paper citation will be added here}
}
Downloads last month
209