{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SJIPTUPPDPWBIJ3JW2WSKJLMTC","short_pith_number":"pith:SJIPTUPP","schema_version":"1.0","canonical_sha256":"9250f9d1ef1bec142769b6ad25256c98a61929925fc5e1b3b090d8a9b2ee46b7","source":{"kind":"arxiv","id":"1711.04563","version":1},"attestation_state":"computed","paper":{"title":"Computing Aggregate Properties of Preimages for 2D Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Randall D. Beer","submitted_at":"2017-11-13T13:12:50Z","abstract_excerpt":"Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm --- incremental aggregation --- that can compute aggregate properties of the set of precursors exponentially faster than na{\\\"i}ve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order"},"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":"1711.04563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2017-11-13T13:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"579d35ebe4b70d636d1ae9cc42051d9012ceeaa7b64d9e9b8f8f356be2d8fbc3","abstract_canon_sha256":"5dad9d9ccd9fafa5d4c12a2f95349977fcd2bab784fe17f68a15e9e034cb12e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:12.838257Z","signature_b64":"94c0/rOpqU6f04MU1uFDP/rm3mO4mtRivjMqpywaYKNdUHeQlUKW8ZWPy1uTOjOo+ENxWCpiIHv8aseELiSiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9250f9d1ef1bec142769b6ad25256c98a61929925fc5e1b3b090d8a9b2ee46b7","last_reissued_at":"2026-05-18T00:29:12.837590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:12.837590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Aggregate Properties of Preimages for 2D Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Randall D. Beer","submitted_at":"2017-11-13T13:12:50Z","abstract_excerpt":"Computing properties of the set of precursors of a given configuration is a common problem underlying many important questions about cellular automata. Unfortunately, such computations quickly become intractable in dimension greater than one. This paper presents an algorithm --- incremental aggregation --- that can compute aggregate properties of the set of precursors exponentially faster than na{\\\"i}ve approaches. The incremental aggregation algorithm is demonstrated on two problems from the two-dimensional binary Game of Life cellular automaton: precursor count distributions and higher-order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04563","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":""},"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":"1711.04563","created_at":"2026-05-18T00:29:12.837693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.04563v1","created_at":"2026-05-18T00:29:12.837693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04563","created_at":"2026-05-18T00:29:12.837693+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJIPTUPPDPWB","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJIPTUPPDPWBIJ3J","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJIPTUPP","created_at":"2026-05-18T12:31:43.269735+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/SJIPTUPPDPWBIJ3JW2WSKJLMTC","json":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC.json","graph_json":"https://pith.science/api/pith-number/SJIPTUPPDPWBIJ3JW2WSKJLMTC/graph.json","events_json":"https://pith.science/api/pith-number/SJIPTUPPDPWBIJ3JW2WSKJLMTC/events.json","paper":"https://pith.science/paper/SJIPTUPP"},"agent_actions":{"view_html":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC","download_json":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC.json","view_paper":"https://pith.science/paper/SJIPTUPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.04563&json=true","fetch_graph":"https://pith.science/api/pith-number/SJIPTUPPDPWBIJ3JW2WSKJLMTC/graph.json","fetch_events":"https://pith.science/api/pith-number/SJIPTUPPDPWBIJ3JW2WSKJLMTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC/action/storage_attestation","attest_author":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC/action/author_attestation","sign_citation":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC/action/citation_signature","submit_replication":"https://pith.science/pith/SJIPTUPPDPWBIJ3JW2WSKJLMTC/action/replication_record"}},"created_at":"2026-05-18T00:29:12.837693+00:00","updated_at":"2026-05-18T00:29:12.837693+00:00"}