{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EEXPC3ZQGBMGEXLLHNEWGOT5EM","short_pith_number":"pith:EEXPC3ZQ","schema_version":"1.0","canonical_sha256":"212ef16f303058625d6b3b49633a7d23094b07bb27303258f5d285a9b5902875","source":{"kind":"arxiv","id":"2505.13058","version":2},"attestation_state":"computed","paper":{"title":"A Path to Universal Neural Cellular Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.NE"],"primary_cat":"cs.LG","authors_text":"Antoine Cully, Dan F. M. Goodman, Gabriel B\\'ena, Maxence Faldor","submitted_at":"2025-05-19T12:46:01Z","abstract_excerpt":"Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements have extended cellular automata into continuous domains, raising the question of whether these systems retain the capacity for universal computation. In parallel, neural cellular automata have emerged as a powerful paradigm where rules are learned via gradient descent rather than manually designed. This work explores the potential of neural cellular automata t"},"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":"2505.13058","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-19T12:46:01Z","cross_cats_sorted":["cs.ET","cs.NE"],"title_canon_sha256":"53087fa40a3ceaebcc2e2c53a0683b65a1bd0a5d9746f71c0e7cbefd166ed8f5","abstract_canon_sha256":"43330eb780db907e90bf43acc496ac1dafb88a795393cf5b427531e534de343c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:32.892076Z","signature_b64":"uq2FyUVVSUN6I26+vzzyOD4pc30RbowOht43Q03tSVzEyScTwo5YgRepVk0QXweonXGPTPI9ahl23HFIqeTGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212ef16f303058625d6b3b49633a7d23094b07bb27303258f5d285a9b5902875","last_reissued_at":"2026-07-05T11:06:32.891656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:32.891656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Path to Universal Neural Cellular Automata","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.NE"],"primary_cat":"cs.LG","authors_text":"Antoine Cully, Dan F. M. Goodman, Gabriel B\\'ena, Maxence Faldor","submitted_at":"2025-05-19T12:46:01Z","abstract_excerpt":"Cellular automata have long been celebrated for their ability to generate complex behaviors from simple, local rules, with well-known discrete models like Conway's Game of Life proven capable of universal computation. Recent advancements have extended cellular automata into continuous domains, raising the question of whether these systems retain the capacity for universal computation. In parallel, neural cellular automata have emerged as a powerful paradigm where rules are learned via gradient descent rather than manually designed. This work explores the potential of neural cellular automata t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13058","kind":"arxiv","version":2},"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/2505.13058/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":"2505.13058","created_at":"2026-07-05T11:06:32.891714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13058v2","created_at":"2026-07-05T11:06:32.891714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13058","created_at":"2026-07-05T11:06:32.891714+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEXPC3ZQGBMG","created_at":"2026-07-05T11:06:32.891714+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEXPC3ZQGBMGEXLL","created_at":"2026-07-05T11:06:32.891714+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEXPC3ZQ","created_at":"2026-07-05T11:06:32.891714+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM","json":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM.json","graph_json":"https://pith.science/api/pith-number/EEXPC3ZQGBMGEXLLHNEWGOT5EM/graph.json","events_json":"https://pith.science/api/pith-number/EEXPC3ZQGBMGEXLLHNEWGOT5EM/events.json","paper":"https://pith.science/paper/EEXPC3ZQ"},"agent_actions":{"view_html":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM","download_json":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM.json","view_paper":"https://pith.science/paper/EEXPC3ZQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13058&json=true","fetch_graph":"https://pith.science/api/pith-number/EEXPC3ZQGBMGEXLLHNEWGOT5EM/graph.json","fetch_events":"https://pith.science/api/pith-number/EEXPC3ZQGBMGEXLLHNEWGOT5EM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM/action/storage_attestation","attest_author":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM/action/author_attestation","sign_citation":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM/action/citation_signature","submit_replication":"https://pith.science/pith/EEXPC3ZQGBMGEXLLHNEWGOT5EM/action/replication_record"}},"created_at":"2026-07-05T11:06:32.891714+00:00","updated_at":"2026-07-05T11:06:32.891714+00:00"}