{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2LQLZG6OV2ALRRC54C3PQ6AUG6","short_pith_number":"pith:2LQLZG6O","schema_version":"1.0","canonical_sha256":"d2e0bc9bceae80b8c45de0b6f8781437b26b0025f91dbc47e9368df53b690ed6","source":{"kind":"arxiv","id":"2404.07353","version":1},"attestation_state":"computed","paper":{"title":"Addressing the Abstraction and Reasoning Corpus via Procedural Example Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Michael Hodel","submitted_at":"2024-04-10T21:16:59Z","abstract_excerpt":"This work presents code to procedurally generate examples for the ARC training tasks. For each of the 400 tasks, an example generator following the transformation logic of the original examples was created. In effect, the assumed underlying distribution of examples for any given task was reverse engineered by implementing a means to sample from it. An attempt was made to cover an as large as reasonable space of possible examples for each task. That is, whenever the original examples of a given task may be limited in their diversity e.g. by having the dimensions of the grids, the set of symbols"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2404.07353","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-04-10T21:16:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7ea4e69a996de7e0539b023639662875f84d835f880f57d1be5a94c8e45530a6","abstract_canon_sha256":"8507b33fb4790ef7e3dfc219219715b799584fa643660e0a2a72adcf411de8ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:51.375365Z","signature_b64":"M2JHEf1+jjFYHRwf5z08tpVXCI2x8piRbn9nV6V+SlewY5WwQSOF/SSy3nC3PJ6UQWxstasuBcjK52w+XxEVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e0bc9bceae80b8c45de0b6f8781437b26b0025f91dbc47e9368df53b690ed6","last_reissued_at":"2026-07-05T08:06:51.374948Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:51.374948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Addressing the Abstraction and Reasoning Corpus via Procedural Example Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Michael Hodel","submitted_at":"2024-04-10T21:16:59Z","abstract_excerpt":"This work presents code to procedurally generate examples for the ARC training tasks. For each of the 400 tasks, an example generator following the transformation logic of the original examples was created. In effect, the assumed underlying distribution of examples for any given task was reverse engineered by implementing a means to sample from it. An attempt was made to cover an as large as reasonable space of possible examples for each task. That is, whenever the original examples of a given task may be limited in their diversity e.g. by having the dimensions of the grids, the set of symbols"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.07353","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.07353/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2404.07353","created_at":"2026-07-05T08:06:51.375004+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.07353v1","created_at":"2026-07-05T08:06:51.375004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.07353","created_at":"2026-07-05T08:06:51.375004+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LQLZG6OV2AL","created_at":"2026-07-05T08:06:51.375004+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LQLZG6OV2ALRRC5","created_at":"2026-07-05T08:06:51.375004+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LQLZG6O","created_at":"2026-07-05T08:06:51.375004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26530","citing_title":"DiARC: Distinguishing Positive and Negative Samples Helps Improving ARC-like Reasoning Ability of Large Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12316","citing_title":"Slots, Transitions, Loops: Learning Composable World Models for ARC","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.15079","citing_title":"Ling and Ring 2.6 Technical Report: Efficient and Instant Agentic Intelligence at Trillion-Parameter Scale","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31543","citing_title":"Modality-Driven Search with Holistic Trace Judging for ARC-AGI-2","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26530","citing_title":"DiARC: Distinguishing Positive and Negative Samples Helps Improving ARC-like Reasoning Ability of Large Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18839","citing_title":"One Step Forward and K Steps Back: Better Reasoning with Denoising Recursion Models","ref_index":164,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6","json":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6.json","graph_json":"https://pith.science/api/pith-number/2LQLZG6OV2ALRRC54C3PQ6AUG6/graph.json","events_json":"https://pith.science/api/pith-number/2LQLZG6OV2ALRRC54C3PQ6AUG6/events.json","paper":"https://pith.science/paper/2LQLZG6O"},"agent_actions":{"view_html":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6","download_json":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6.json","view_paper":"https://pith.science/paper/2LQLZG6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.07353&json=true","fetch_graph":"https://pith.science/api/pith-number/2LQLZG6OV2ALRRC54C3PQ6AUG6/graph.json","fetch_events":"https://pith.science/api/pith-number/2LQLZG6OV2ALRRC54C3PQ6AUG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6/action/storage_attestation","attest_author":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6/action/author_attestation","sign_citation":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6/action/citation_signature","submit_replication":"https://pith.science/pith/2LQLZG6OV2ALRRC54C3PQ6AUG6/action/replication_record"}},"created_at":"2026-07-05T08:06:51.375004+00:00","updated_at":"2026-07-05T08:06:51.375004+00:00"}