WhySoCodius commited on
Commit
538ccea
·
verified ·
1 Parent(s): 10fb34c

Add In-Context Grid Reasoning dataset (synthetic, CC-BY-4.0)

Browse files
Files changed (6) hide show
  1. LICENSE +396 -0
  2. README.md +132 -0
  3. data/test.jsonl +0 -0
  4. data/train.jsonl +0 -0
  5. generate.py +210 -0
  6. test_generate.py +69 -0
LICENSE ADDED
@@ -0,0 +1,396 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ Attribution 4.0 International
2
+
3
+ =======================================================================
4
+
5
+ Creative Commons Corporation ("Creative Commons") is not a law firm and
6
+ does not provide legal services or legal advice. Distribution of
7
+ Creative Commons public licenses does not create a lawyer-client or
8
+ other relationship. Creative Commons makes its licenses and related
9
+ information available on an "as-is" basis. Creative Commons gives no
10
+ warranties regarding its licenses, any material licensed under their
11
+ terms and conditions, or any related information. Creative Commons
12
+ disclaims all liability for damages resulting from their use to the
13
+ fullest extent possible.
14
+
15
+ Using Creative Commons Public Licenses
16
+
17
+ Creative Commons public licenses provide a standard set of terms and
18
+ conditions that creators and other rights holders may use to share
19
+ original works of authorship and other material subject to copyright
20
+ and certain other rights specified in the public license below. The
21
+ following considerations are for informational purposes only, are not
22
+ exhaustive, and do not form part of our licenses.
23
+
24
+ Considerations for licensors: Our public licenses are
25
+ intended for use by those authorized to give the public
26
+ permission to use material in ways otherwise restricted by
27
+ copyright and certain other rights. Our licenses are
28
+ irrevocable. Licensors should read and understand the terms
29
+ and conditions of the license they choose before applying it.
30
+ Licensors should also secure all rights necessary before
31
+ applying our licenses so that the public can reuse the
32
+ material as expected. Licensors should clearly mark any
33
+ material not subject to the license. This includes other CC-
34
+ licensed material, or material used under an exception or
35
+ limitation to copyright. More considerations for licensors:
36
+ wiki.creativecommons.org/Considerations_for_licensors
37
+
38
+ Considerations for the public: By using one of our public
39
+ licenses, a licensor grants the public permission to use the
40
+ licensed material under specified terms and conditions. If
41
+ the licensor's permission is not necessary for any reason--for
42
+ example, because of any applicable exception or limitation to
43
+ copyright--then that use is not regulated by the license. Our
44
+ licenses grant only permissions under copyright and certain
45
+ other rights that a licensor has authority to grant. Use of
46
+ the licensed material may still be restricted for other
47
+ reasons, including because others have copyright or other
48
+ rights in the material. A licensor may make special requests,
49
+ such as asking that all changes be marked or described.
50
+ Although not required by our licenses, you are encouraged to
51
+ respect those requests where reasonable. More considerations
52
+ for the public:
53
+ wiki.creativecommons.org/Considerations_for_licensees
54
+
55
+ =======================================================================
56
+
57
+ Creative Commons Attribution 4.0 International Public License
58
+
59
+ By exercising the Licensed Rights (defined below), You accept and agree
60
+ to be bound by the terms and conditions of this Creative Commons
61
+ Attribution 4.0 International Public License ("Public License"). To the
62
+ extent this Public License may be interpreted as a contract, You are
63
+ granted the Licensed Rights in consideration of Your acceptance of
64
+ these terms and conditions, and the Licensor grants You such rights in
65
+ consideration of benefits the Licensor receives from making the
66
+ Licensed Material available under these terms and conditions.
67
+
68
+
69
+ Section 1 -- Definitions.
70
+
71
+ a. Adapted Material means material subject to Copyright and Similar
72
+ Rights that is derived from or based upon the Licensed Material
73
+ and in which the Licensed Material is translated, altered,
74
+ arranged, transformed, or otherwise modified in a manner requiring
75
+ permission under the Copyright and Similar Rights held by the
76
+ Licensor. For purposes of this Public License, where the Licensed
77
+ Material is a musical work, performance, or sound recording,
78
+ Adapted Material is always produced where the Licensed Material is
79
+ synched in timed relation with a moving image.
80
+
81
+ b. Adapter's License means the license You apply to Your Copyright
82
+ and Similar Rights in Your contributions to Adapted Material in
83
+ accordance with the terms and conditions of this Public License.
84
+
85
+ c. Copyright and Similar Rights means copyright and/or similar rights
86
+ closely related to copyright including, without limitation,
87
+ performance, broadcast, sound recording, and Sui Generis Database
88
+ Rights, without regard to how the rights are labeled or
89
+ categorized. For purposes of this Public License, the rights
90
+ specified in Section 2(b)(1)-(2) are not Copyright and Similar
91
+ Rights.
92
+
93
+ d. Effective Technological Measures means those measures that, in the
94
+ absence of proper authority, may not be circumvented under laws
95
+ fulfilling obligations under Article 11 of the WIPO Copyright
96
+ Treaty adopted on December 20, 1996, and/or similar international
97
+ agreements.
98
+
99
+ e. Exceptions and Limitations means fair use, fair dealing, and/or
100
+ any other exception or limitation to Copyright and Similar Rights
101
+ that applies to Your use of the Licensed Material.
102
+
103
+ f. Licensed Material means the artistic or literary work, database,
104
+ or other material to which the Licensor applied this Public
105
+ License.
106
+
107
+ g. Licensed Rights means the rights granted to You subject to the
108
+ terms and conditions of this Public License, which are limited to
109
+ all Copyright and Similar Rights that apply to Your use of the
110
+ Licensed Material and that the Licensor has authority to license.
111
+
112
+ h. Licensor means the individual(s) or entity(ies) granting rights
113
+ under this Public License.
114
+
115
+ i. Share means to provide material to the public by any means or
116
+ process that requires permission under the Licensed Rights, such
117
+ as reproduction, public display, public performance, distribution,
118
+ dissemination, communication, or importation, and to make material
119
+ available to the public including in ways that members of the
120
+ public may access the material from a place and at a time
121
+ individually chosen by them.
122
+
123
+ j. Sui Generis Database Rights means rights other than copyright
124
+ resulting from Directive 96/9/EC of the European Parliament and of
125
+ the Council of 11 March 1996 on the legal protection of databases,
126
+ as amended and/or succeeded, as well as other essentially
127
+ equivalent rights anywhere in the world.
128
+
129
+ k. You means the individual or entity exercising the Licensed Rights
130
+ under this Public License. Your has a corresponding meaning.
131
+
132
+
133
+ Section 2 -- Scope.
134
+
135
+ a. License grant.
136
+
137
+ 1. Subject to the terms and conditions of this Public License,
138
+ the Licensor hereby grants You a worldwide, royalty-free,
139
+ non-sublicensable, non-exclusive, irrevocable license to
140
+ exercise the Licensed Rights in the Licensed Material to:
141
+
142
+ a. reproduce and Share the Licensed Material, in whole or
143
+ in part; and
144
+
145
+ b. produce, reproduce, and Share Adapted Material.
146
+
147
+ 2. Exceptions and Limitations. For the avoidance of doubt, where
148
+ Exceptions and Limitations apply to Your use, this Public
149
+ License does not apply, and You do not need to comply with
150
+ its terms and conditions.
151
+
152
+ 3. Term. The term of this Public License is specified in Section
153
+ 6(a).
154
+
155
+ 4. Media and formats; technical modifications allowed. The
156
+ Licensor authorizes You to exercise the Licensed Rights in
157
+ all media and formats whether now known or hereafter created,
158
+ and to make technical modifications necessary to do so. The
159
+ Licensor waives and/or agrees not to assert any right or
160
+ authority to forbid You from making technical modifications
161
+ necessary to exercise the Licensed Rights, including
162
+ technical modifications necessary to circumvent Effective
163
+ Technological Measures. For purposes of this Public License,
164
+ simply making modifications authorized by this Section 2(a)
165
+ (4) never produces Adapted Material.
166
+
167
+ 5. Downstream recipients.
168
+
169
+ a. Offer from the Licensor -- Licensed Material. Every
170
+ recipient of the Licensed Material automatically
171
+ receives an offer from the Licensor to exercise the
172
+ Licensed Rights under the terms and conditions of this
173
+ Public License.
174
+
175
+ b. No downstream restrictions. You may not offer or impose
176
+ any additional or different terms or conditions on, or
177
+ apply any Effective Technological Measures to, the
178
+ Licensed Material if doing so restricts exercise of the
179
+ Licensed Rights by any recipient of the Licensed
180
+ Material.
181
+
182
+ 6. No endorsement. Nothing in this Public License constitutes or
183
+ may be construed as permission to assert or imply that You
184
+ are, or that Your use of the Licensed Material is, connected
185
+ with, or sponsored, endorsed, or granted official status by,
186
+ the Licensor or others designated to receive attribution as
187
+ provided in Section 3(a)(1)(A)(i).
188
+
189
+ b. Other rights.
190
+
191
+ 1. Moral rights, such as the right of integrity, are not
192
+ licensed under this Public License, nor are publicity,
193
+ privacy, and/or other similar personality rights; however, to
194
+ the extent possible, the Licensor waives and/or agrees not to
195
+ assert any such rights held by the Licensor to the limited
196
+ extent necessary to allow You to exercise the Licensed
197
+ Rights, but not otherwise.
198
+
199
+ 2. Patent and trademark rights are not licensed under this
200
+ Public License.
201
+
202
+ 3. To the extent possible, the Licensor waives any right to
203
+ collect royalties from You for the exercise of the Licensed
204
+ Rights, whether directly or through a collecting society
205
+ under any voluntary or waivable statutory or compulsory
206
+ licensing scheme. In all other cases the Licensor expressly
207
+ reserves any right to collect such royalties.
208
+
209
+
210
+ Section 3 -- License Conditions.
211
+
212
+ Your exercise of the Licensed Rights is expressly made subject to the
213
+ following conditions.
214
+
215
+ a. Attribution.
216
+
217
+ 1. If You Share the Licensed Material (including in modified
218
+ form), You must:
219
+
220
+ a. retain the following if it is supplied by the Licensor
221
+ with the Licensed Material:
222
+
223
+ i. identification of the creator(s) of the Licensed
224
+ Material and any others designated to receive
225
+ attribution, in any reasonable manner requested by
226
+ the Licensor (including by pseudonym if
227
+ designated);
228
+
229
+ ii. a copyright notice;
230
+
231
+ iii. a notice that refers to this Public License;
232
+
233
+ iv. a notice that refers to the disclaimer of
234
+ warranties;
235
+
236
+ v. a URI or hyperlink to the Licensed Material to the
237
+ extent reasonably practicable;
238
+
239
+ b. indicate if You modified the Licensed Material and
240
+ retain an indication of any previous modifications; and
241
+
242
+ c. indicate the Licensed Material is licensed under this
243
+ Public License, and include the text of, or the URI or
244
+ hyperlink to, this Public License.
245
+
246
+ 2. You may satisfy the conditions in Section 3(a)(1) in any
247
+ reasonable manner based on the medium, means, and context in
248
+ which You Share the Licensed Material. For example, it may be
249
+ reasonable to satisfy the conditions by providing a URI or
250
+ hyperlink to a resource that includes the required
251
+ information.
252
+
253
+ 3. If requested by the Licensor, You must remove any of the
254
+ information required by Section 3(a)(1)(A) to the extent
255
+ reasonably practicable.
256
+
257
+ 4. If You Share Adapted Material You produce, the Adapter's
258
+ License You apply must not prevent recipients of the Adapted
259
+ Material from complying with this Public License.
260
+
261
+
262
+ Section 4 -- Sui Generis Database Rights.
263
+
264
+ Where the Licensed Rights include Sui Generis Database Rights that
265
+ apply to Your use of the Licensed Material:
266
+
267
+ a. for the avoidance of doubt, Section 2(a)(1) grants You the right
268
+ to extract, reuse, reproduce, and Share all or a substantial
269
+ portion of the contents of the database;
270
+
271
+ b. if You include all or a substantial portion of the database
272
+ contents in a database in which You have Sui Generis Database
273
+ Rights, then the database in which You have Sui Generis Database
274
+ Rights (but not its individual contents) is Adapted Material; and
275
+
276
+ c. You must comply with the conditions in Section 3(a) if You Share
277
+ all or a substantial portion of the contents of the database.
278
+
279
+ For the avoidance of doubt, this Section 4 supplements and does not
280
+ replace Your obligations under this Public License where the Licensed
281
+ Rights include other Copyright and Similar Rights.
282
+
283
+
284
+ Section 5 -- Disclaimer of Warranties and Limitation of Liability.
285
+
286
+ a. UNLESS OTHERWISE SEPARATELY UNDERTAKEN BY THE LICENSOR, TO THE
287
+ EXTENT POSSIBLE, THE LICENSOR OFFERS THE LICENSED MATERIAL AS-IS
288
+ AND AS-AVAILABLE, AND MAKES NO REPRESENTATIONS OR WARRANTIES OF
289
+ ANY KIND CONCERNING THE LICENSED MATERIAL, WHETHER EXPRESS,
290
+ IMPLIED, STATUTORY, OR OTHER. THIS INCLUDES, WITHOUT LIMITATION,
291
+ WARRANTIES OF TITLE, MERCHANTABILITY, FITNESS FOR A PARTICULAR
292
+ PURPOSE, NON-INFRINGEMENT, ABSENCE OF LATENT OR OTHER DEFECTS,
293
+ ACCURACY, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT
294
+ KNOWN OR DISCOVERABLE. WHERE DISCLAIMERS OF WARRANTIES ARE NOT
295
+ ALLOWED IN FULL OR IN PART, THIS DISCLAIMER MAY NOT APPLY TO YOU.
296
+
297
+ b. TO THE EXTENT POSSIBLE, IN NO EVENT WILL THE LICENSOR BE LIABLE
298
+ TO YOU ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION,
299
+ NEGLIGENCE) OR OTHERWISE FOR ANY DIRECT, SPECIAL, INDIRECT,
300
+ INCIDENTAL, CONSEQUENTIAL, PUNITIVE, EXEMPLARY, OR OTHER LOSSES,
301
+ COSTS, EXPENSES, OR DAMAGES ARISING OUT OF THIS PUBLIC LICENSE OR
302
+ USE OF THE LICENSED MATERIAL, EVEN IF THE LICENSOR HAS BEEN
303
+ ADVISED OF THE POSSIBILITY OF SUCH LOSSES, COSTS, EXPENSES, OR
304
+ DAMAGES. WHERE A LIMITATION OF LIABILITY IS NOT ALLOWED IN FULL OR
305
+ IN PART, THIS LIMITATION MAY NOT APPLY TO YOU.
306
+
307
+ c. The disclaimer of warranties and limitation of liability provided
308
+ above shall be interpreted in a manner that, to the extent
309
+ possible, most closely approximates an absolute disclaimer and
310
+ waiver of all liability.
311
+
312
+
313
+ Section 6 -- Term and Termination.
314
+
315
+ a. This Public License applies for the term of the Copyright and
316
+ Similar Rights licensed here. However, if You fail to comply with
317
+ this Public License, then Your rights under this Public License
318
+ terminate automatically.
319
+
320
+ b. Where Your right to use the Licensed Material has terminated under
321
+ Section 6(a), it reinstates:
322
+
323
+ 1. automatically as of the date the violation is cured, provided
324
+ it is cured within 30 days of Your discovery of the
325
+ violation; or
326
+
327
+ 2. upon express reinstatement by the Licensor.
328
+
329
+ For the avoidance of doubt, this Section 6(b) does not affect any
330
+ right the Licensor may have to seek remedies for Your violations
331
+ of this Public License.
332
+
333
+ c. For the avoidance of doubt, the Licensor may also offer the
334
+ Licensed Material under separate terms or conditions or stop
335
+ distributing the Licensed Material at any time; however, doing so
336
+ will not terminate this Public License.
337
+
338
+ d. Sections 1, 5, 6, 7, and 8 survive termination of this Public
339
+ License.
340
+
341
+
342
+ Section 7 -- Other Terms and Conditions.
343
+
344
+ a. The Licensor shall not be bound by any additional or different
345
+ terms or conditions communicated by You unless expressly agreed.
346
+
347
+ b. Any arrangements, understandings, or agreements regarding the
348
+ Licensed Material not stated herein are separate from and
349
+ independent of the terms and conditions of this Public License.
350
+
351
+
352
+ Section 8 -- Interpretation.
353
+
354
+ a. For the avoidance of doubt, this Public License does not, and
355
+ shall not be interpreted to, reduce, limit, restrict, or impose
356
+ conditions on any use of the Licensed Material that could lawfully
357
+ be made without permission under this Public License.
358
+
359
+ b. To the extent possible, if any provision of this Public License is
360
+ deemed unenforceable, it shall be automatically reformed to the
361
+ minimum extent necessary to make it enforceable. If the provision
362
+ cannot be reformed, it shall be severed from this Public License
363
+ without affecting the enforceability of the remaining terms and
364
+ conditions.
365
+
366
+ c. No term or condition of this Public License will be waived and no
367
+ failure to comply consented to unless expressly agreed to by the
368
+ Licensor.
369
+
370
+ d. Nothing in this Public License constitutes or may be interpreted
371
+ as a limitation upon, or waiver of, any privileges and immunities
372
+ that apply to the Licensor or You, including from the legal
373
+ processes of any jurisdiction or authority.
374
+
375
+
376
+ =======================================================================
377
+
378
+ Creative Commons is not a party to its public
379
+ licenses. Notwithstanding, Creative Commons may elect to apply one of
380
+ its public licenses to material it publishes and in those instances
381
+ will be considered the “Licensor.” The text of the Creative Commons
382
+ public licenses is dedicated to the public domain under the CC0 Public
383
+ Domain Dedication. Except for the limited purpose of indicating that
384
+ material is shared under a Creative Commons public license or as
385
+ otherwise permitted by the Creative Commons policies published at
386
+ creativecommons.org/policies, Creative Commons does not authorize the
387
+ use of the trademark "Creative Commons" or any other trademark or logo
388
+ of Creative Commons without its prior written consent including,
389
+ without limitation, in connection with any unauthorized modifications
390
+ to any of its public licenses or any other arrangements,
391
+ understandings, or agreements concerning use of licensed material. For
392
+ the avoidance of doubt, this paragraph does not form part of the
393
+ public licenses.
394
+
395
+ Creative Commons may be contacted at creativecommons.org.
396
+
README.md ADDED
@@ -0,0 +1,132 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ ---
2
+ license: cc-by-4.0
3
+ task_categories:
4
+ - text2text-generation
5
+ - other
6
+ language:
7
+ - en
8
+ tags:
9
+ - in-context-learning
10
+ - reasoning
11
+ - arc-agi
12
+ - synthetic
13
+ - rule-induction
14
+ pretty_name: In-Context Grid Reasoning (ICGR)
15
+ size_categories:
16
+ - 1K<n<10K
17
+ configs:
18
+ - config_name: default
19
+ data_files:
20
+ - split: train
21
+ path: data/train.jsonl
22
+ - split: test
23
+ path: data/test.jsonl
24
+ ---
25
+
26
+ # In-Context Grid Reasoning (ICGR)
27
+
28
+ A small, fully synthetic benchmark for **demonstration-conditioned rule induction**:
29
+ each task shows 2–4 `(input grid → output grid)` support pairs that share one
30
+ hidden transformation, and the model must apply the same transformation to a
31
+ held-out query input.
32
+
33
+ It targets the same behaviour probed by recent in-context / latent-reasoning work
34
+ on ARC-AGI (e.g. *BDH-CQ: In-Context Learning with Recurrent Latent Reasoning*,
35
+ [arXiv:2608.09888](https://arxiv.org/abs/2608.09888)), but is deliberately tiny,
36
+ transparent, and license-clean so it can be used freely for quick probes and
37
+ ablations.
38
+
39
+ ## Why this exists
40
+
41
+ ARC-AGI itself is excellent but small and easy to overfit to via public solvers.
42
+ ICGR is **procedurally generated from a single script** ([`generate.py`](generate.py)),
43
+ so you can:
44
+
45
+ - regenerate it deterministically (`--seed`),
46
+ - scale it up (`--n`),
47
+ - know exactly which rule family each task belongs to (for per-concept scoring),
48
+ - trust its provenance — no scraped text, images, or third-party datasets, so
49
+ there is no upstream copyright. Released under CC-BY-4.0.
50
+
51
+ ## Format
52
+
53
+ One JSON object per line.
54
+
55
+ | field | type | notes |
56
+ |---|---|---|
57
+ | `task_id` | str | e.g. `icgr-00042` |
58
+ | `rule` | str | rule id(s), `+`-joined for compositions |
59
+ | `rule_kind` | str | `atomic` or `composed` |
60
+ | `rule_description` | str | plain-English statement of the transformation |
61
+ | `num_colors` | int | cell alphabet size (4–6) |
62
+ | `grid_h`, `grid_w` | int | query/support grid dimensions before the rule |
63
+ | `num_support` | int | number of demonstration pairs (2–4) |
64
+ | `support` | list | `[{"input": grid, "output": grid}, ...]` |
65
+ | `query_input` | str | grid to transform |
66
+ | `query_output` | str | expected answer |
67
+
68
+ Grids are serialised as rows of space-separated integers, rows joined by `;`.
69
+ Example: `"1 2 0;0 1 2"` is the 2×3 grid `[[1,2,0],[0,1,2]]`.
70
+
71
+ ```python
72
+ from datasets import load_dataset
73
+
74
+ ds = load_dataset("WhySoCodius/in-context-grid-reasoning", split="test")
75
+ ex = ds[0]
76
+ print(ex["rule_description"])
77
+ for pair in ex["support"]:
78
+ print(pair["input"], "->", pair["output"])
79
+ print("Q:", ex["query_input"], "=>", ex["query_output"])
80
+ ```
81
+
82
+ ## Rule families
83
+
84
+ `flip_h`, `flip_v`, `transpose`, `rotate90`, `add_mod` (add constant mod colour
85
+ count), `color_swap`, `shift_rows` (cyclic), `tile_h` (self-concat), `border`
86
+ (paint outer ring), `max_pool2` (2×2 max). ~35% of tasks compose two of the
87
+ size-preserving rules; `rule` records which and in what order.
88
+
89
+ ## Splits
90
+
91
+ | split | tasks |
92
+ |---|---|
93
+ | train | 800 |
94
+ | test | 200 |
95
+
96
+ Split is a random shuffle at a fixed seed; the same rule family appears in both.
97
+ It is a convenience split, not an adversarial generalisation split — if you need
98
+ held-out rules, filter by `rule`.
99
+
100
+ ## Suggested metric
101
+
102
+ Exact string match on `query_output` after normalising whitespace. Report overall
103
+ accuracy plus a breakdown by `rule` and by `rule_kind`.
104
+
105
+ ## Limitations
106
+
107
+ - Rules are simple and enumerable; a symbolic solver can reach 100%. The point is
108
+ to measure whether a *learning* system infers the rule from demonstrations
109
+ alone, not to be unsolvable.
110
+ - Grids are small (3×5 max, 6×6 for pooling) and dense.
111
+ - English rule descriptions are templated.
112
+
113
+ ## Reproduce / extend
114
+
115
+ ```bash
116
+ python generate.py --n 5000 --seed 123
117
+ python test_generate.py # self-check
118
+ ```
119
+
120
+ ## Citation
121
+
122
+ ```bibtex
123
+ @misc{icgr2026,
124
+ title = {In-Context Grid Reasoning (ICGR): a synthetic benchmark for
125
+ demonstration-conditioned rule induction},
126
+ author = {WhySoCodius},
127
+ year = {2026},
128
+ howpublished = {\url{https://huggingface.co/datasets/WhySoCodius/in-context-grid-reasoning}}
129
+ }
130
+ ```
131
+
132
+ License: [CC-BY-4.0](LICENSE). Attribution appreciated; no other restrictions.
data/test.jsonl ADDED
The diff for this file is too large to render. See raw diff
 
data/train.jsonl ADDED
The diff for this file is too large to render. See raw diff
 
generate.py ADDED
@@ -0,0 +1,210 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """
2
+ Procedural generator for the In-Context Grid Reasoning (ICGR) dataset.
3
+
4
+ Every task is a demonstration-conditioned rule-induction problem in the spirit of
5
+ ARC-AGI: a few (input grid -> output grid) support pairs share one hidden
6
+ transformation, and the solver must apply that same transformation to a held-out
7
+ query input.
8
+
9
+ All data here is synthetic and generated by this script alone. No third-party
10
+ text, images, or datasets are used, so the output carries no upstream copyright.
11
+
12
+ Reproduce with: python generate.py
13
+ """
14
+
15
+ import argparse
16
+ import json
17
+ import random
18
+ from pathlib import Path
19
+
20
+ # --- grid helpers -----------------------------------------------------------
21
+
22
+ def new_grid(rng, h, w, ncolors):
23
+ return [[rng.randrange(ncolors) for _ in range(w)] for _ in range(h)]
24
+
25
+
26
+ def dims(g):
27
+ return len(g), len(g[0])
28
+
29
+
30
+ def to_str(g):
31
+ return ";".join(" ".join(str(v) for v in row) for row in g)
32
+
33
+
34
+ # --- transformations ------------------------------------------------------
35
+ # Each is a pure function grid -> grid. Keep them total: any rectangular grid in,
36
+ # rectangular grid out. Params are frozen per task so every support pair and the
37
+ # query share the exact same rule.
38
+
39
+ def t_flip_h(g, p):
40
+ return [list(reversed(row)) for row in g]
41
+
42
+
43
+ def t_flip_v(g, p):
44
+ return [list(row) for row in reversed(g)]
45
+
46
+
47
+ def t_transpose(g, p):
48
+ h, w = dims(g)
49
+ return [[g[r][c] for r in range(h)] for c in range(w)]
50
+
51
+
52
+ def t_rotate90(g, p):
53
+ h, w = dims(g)
54
+ return [[g[h - 1 - r][c] for r in range(h)] for c in range(w)]
55
+
56
+
57
+ def t_add_mod(g, p):
58
+ k, n = p["k"], p["ncolors"]
59
+ return [[(v + k) % n for v in row] for row in g]
60
+
61
+
62
+ def t_color_swap(g, p):
63
+ a, b = p["a"], p["b"]
64
+ return [[b if v == a else a if v == b else v for v in row] for row in g]
65
+
66
+
67
+ def t_shift_rows(g, p):
68
+ s = p["s"]
69
+ return [row[-s:] + row[:-s] for row in g]
70
+
71
+
72
+ def t_tile_h(g, p):
73
+ return [row + row for row in g]
74
+
75
+
76
+ def t_border(g, p):
77
+ c = p["c"]
78
+ h, w = dims(g)
79
+ out = [list(row) for row in g]
80
+ for j in range(w):
81
+ out[0][j] = c
82
+ out[h - 1][j] = c
83
+ for i in range(h):
84
+ out[i][0] = c
85
+ out[i][w - 1] = c
86
+ return out
87
+
88
+
89
+ def t_max_pool2(g, p):
90
+ # non-overlapping 2x2 max; grid dims are always even in this generator
91
+ h, w = dims(g)
92
+ return [[max(g[2 * r][2 * c], g[2 * r + 1][2 * c],
93
+ g[2 * r][2 * c + 1], g[2 * r + 1][2 * c + 1])
94
+ for c in range(w // 2)] for r in range(h // 2)]
95
+
96
+
97
+ TRANSFORMS = {
98
+ "flip_h": (t_flip_h, "Mirror the grid left-to-right."),
99
+ "flip_v": (t_flip_v, "Mirror the grid top-to-bottom."),
100
+ "transpose": (t_transpose, "Swap rows and columns (transpose)."),
101
+ "rotate90": (t_rotate90, "Rotate the grid 90 degrees clockwise."),
102
+ "add_mod": (t_add_mod, "Add a fixed constant to every cell, modulo the colour count."),
103
+ "color_swap": (t_color_swap, "Swap two colours everywhere they appear."),
104
+ "shift_rows": (t_shift_rows, "Cyclically shift every row right by a fixed amount."),
105
+ "tile_h": (t_tile_h, "Concatenate the grid with a copy of itself, side by side."),
106
+ "border": (t_border, "Paint the outer border of the grid a fixed colour."),
107
+ "max_pool2": (t_max_pool2, "Replace each non-overlapping 2x2 block with its maximum value."),
108
+ }
109
+
110
+ SINGLE = list(TRANSFORMS)
111
+ # pairs that compose cleanly without fighting over dimensions
112
+ COMPOSABLE = ["flip_h", "flip_v", "add_mod", "color_swap", "shift_rows", "border"]
113
+
114
+
115
+ def sample_params(rng, ncolors):
116
+ return {
117
+ "ncolors": ncolors,
118
+ "k": rng.randint(1, ncolors - 1),
119
+ "a": rng.randrange(ncolors),
120
+ "b": rng.randrange(ncolors),
121
+ "s": rng.randint(1, 2),
122
+ "c": rng.randrange(ncolors),
123
+ }
124
+
125
+
126
+ def apply_rule(rule, g, p):
127
+ for name in rule:
128
+ g = TRANSFORMS[name][0](g, p)
129
+ return g
130
+
131
+
132
+ def describe(rule):
133
+ return " Then, ".join(TRANSFORMS[n][1] for n in rule)
134
+
135
+
136
+ # --- task assembly --------------------------------------------------------
137
+
138
+ def make_task(rng, task_id):
139
+ ncolors = rng.choice([4, 5, 6])
140
+ compose = rng.random() < 0.35
141
+ if compose:
142
+ rule = rng.sample(COMPOSABLE, 2)
143
+ else:
144
+ rule = [rng.choice(SINGLE)]
145
+
146
+ # max_pool halves dims, so start even and a bit larger for it
147
+ if "max_pool2" in rule:
148
+ h = rng.choice([4, 6])
149
+ w = rng.choice([4, 6])
150
+ else:
151
+ h = rng.randint(3, 5)
152
+ w = rng.randint(3, 5)
153
+
154
+ p = sample_params(rng, ncolors)
155
+ n_support = rng.randint(2, 4)
156
+
157
+ grids = []
158
+ seen = set()
159
+ while len(grids) < n_support + 1:
160
+ g = new_grid(rng, h, w, ncolors)
161
+ key = to_str(g)
162
+ if key in seen:
163
+ continue
164
+ seen.add(key)
165
+ grids.append(g)
166
+
167
+ support = [{"input": to_str(g), "output": to_str(apply_rule(rule, g, p))}
168
+ for g in grids[:-1]]
169
+ q = grids[-1]
170
+
171
+ return {
172
+ "task_id": task_id,
173
+ "rule": "+".join(rule),
174
+ "rule_kind": "composed" if compose else "atomic",
175
+ "rule_description": describe(rule),
176
+ "num_colors": ncolors,
177
+ "grid_h": h,
178
+ "grid_w": w,
179
+ "num_support": n_support,
180
+ "support": support,
181
+ "query_input": to_str(q),
182
+ "query_output": to_str(apply_rule(rule, q, p)),
183
+ }
184
+
185
+
186
+ def main():
187
+ ap = argparse.ArgumentParser()
188
+ ap.add_argument("--n", type=int, default=1000)
189
+ ap.add_argument("--seed", type=int, default=20260903)
190
+ ap.add_argument("--test-frac", type=float, default=0.2)
191
+ ap.add_argument("--out", type=Path, default=Path("data"))
192
+ args = ap.parse_args()
193
+
194
+ rng = random.Random(args.seed)
195
+ tasks = [make_task(rng, f"icgr-{i:05d}") for i in range(args.n)]
196
+ rng.shuffle(tasks)
197
+ n_test = int(args.n * args.test_frac)
198
+ splits = {"test": tasks[:n_test], "train": tasks[n_test:]}
199
+
200
+ args.out.mkdir(parents=True, exist_ok=True)
201
+ for name, rows in splits.items():
202
+ path = args.out / f"{name}.jsonl"
203
+ with path.open("w") as f:
204
+ for r in rows:
205
+ f.write(json.dumps(r) + "\n")
206
+ print(f"{name}: {len(rows)} -> {path}")
207
+
208
+
209
+ if __name__ == "__main__":
210
+ main()
test_generate.py ADDED
@@ -0,0 +1,69 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ """Self-check for generate.py. Run: python test_generate.py"""
2
+ import random
3
+ from generate import (TRANSFORMS, make_task, apply_rule, to_str, new_grid,
4
+ sample_params, t_max_pool2)
5
+
6
+
7
+ def _from_str(s):
8
+ return [[int(v) for v in row.split()] for row in s.split(";")]
9
+
10
+
11
+ def test_transforms_are_total_and_rectangular():
12
+ rng = random.Random(0)
13
+ for name, (fn, _) in TRANSFORMS.items():
14
+ for _ in range(50):
15
+ h = rng.choice([4, 6]) if name == "max_pool2" else rng.randint(3, 5)
16
+ w = rng.choice([4, 6]) if name == "max_pool2" else rng.randint(3, 5)
17
+ g = new_grid(rng, h, w, 6)
18
+ out = fn(g, sample_params(rng, 6))
19
+ assert out and all(len(r) == len(out[0]) for r in out), name
20
+
21
+
22
+ def test_known_values():
23
+ g = [[1, 2], [3, 4]]
24
+ assert TRANSFORMS["flip_h"][0](g, {}) == [[2, 1], [4, 3]]
25
+ assert TRANSFORMS["flip_v"][0](g, {}) == [[3, 4], [1, 2]]
26
+ assert TRANSFORMS["transpose"][0](g, {}) == [[1, 3], [2, 4]]
27
+ assert TRANSFORMS["rotate90"][0](g, {}) == [[3, 1], [4, 2]]
28
+ assert t_max_pool2([[1, 9, 0, 0], [0, 0, 0, 0], [0, 0, 5, 0], [0, 0, 0, 7]], {}) == [[9, 0], [0, 7]]
29
+
30
+
31
+ def test_query_answer_matches_support_rule():
32
+ rng = random.Random(1)
33
+ for i in range(400):
34
+ t = make_task(rng, f"t-{i}")
35
+ rule = t["rule"].split("+")
36
+ # re-derive every support output from the stated rule params is not
37
+ # possible without params, but the rule must at least be self-consistent:
38
+ # applying it to query_input must reproduce query_output.
39
+ got = to_str(apply_rule(rule, _from_str(t["query_input"]),
40
+ _params_for(t)))
41
+ assert got == t["query_output"], t["task_id"]
42
+
43
+
44
+ def _params_for(task):
45
+ # generate.py freezes params inside make_task; reconstruct a compatible set by
46
+ # brute force over the small param space so the check stays independent.
47
+ from itertools import product
48
+ n = task["num_colors"]
49
+ qi = _from_str(task["query_input"])
50
+ rule = task["rule"].split("+")
51
+ for k, a, b, s, c in product(range(1, n), range(n), range(n), (1, 2), range(n)):
52
+ p = {"ncolors": n, "k": k, "a": a, "b": b, "s": s, "c": c}
53
+ if to_str(apply_rule(rule, qi, p)) == task["query_output"]:
54
+ return p
55
+ raise AssertionError(f"no params reproduce {task['task_id']}")
56
+
57
+
58
+ def test_deterministic():
59
+ a = [make_task(random.Random(42), f"x{i}") for i in range(20)]
60
+ b = [make_task(random.Random(42), f"x{i}") for i in range(20)]
61
+ assert a == b
62
+
63
+
64
+ if __name__ == "__main__":
65
+ test_transforms_are_total_and_rectangular()
66
+ test_known_values()
67
+ test_query_answer_matches_support_rule()
68
+ test_deterministic()
69
+ print("all checks passed")