{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:6CAGCL4QRAEO45HYFCPTNTJ6KW","short_pith_number":"pith:6CAGCL4Q","canonical_record":{"source":{"id":"0912.1777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-12-09T15:53:24Z","cross_cats_sorted":[],"title_canon_sha256":"ba76c235ff4f90505be8b268391c682e41a778cca97d937bd4a1fc5f8a4a2a4f","abstract_canon_sha256":"8d2726a81191fc936ceade55f32ad3472c28b596e9d38645664deac3cb5ca5c7"},"schema_version":"1.0"},"canonical_sha256":"f080612f908808ee74f8289f36cd3e55bfe75e757f74e2ff9f1c49e3cdd25e4b","source":{"kind":"arxiv","id":"0912.1777","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.1777","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0912.1777v4","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1777","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"6CAGCL4QRAEO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6CAGCL4QRAEO45HY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6CAGCL4Q","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:6CAGCL4QRAEO45HYFCPTNTJ6KW","target":"record","payload":{"canonical_record":{"source":{"id":"0912.1777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-12-09T15:53:24Z","cross_cats_sorted":[],"title_canon_sha256":"ba76c235ff4f90505be8b268391c682e41a778cca97d937bd4a1fc5f8a4a2a4f","abstract_canon_sha256":"8d2726a81191fc936ceade55f32ad3472c28b596e9d38645664deac3cb5ca5c7"},"schema_version":"1.0"},"canonical_sha256":"f080612f908808ee74f8289f36cd3e55bfe75e757f74e2ff9f1c49e3cdd25e4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:54.602699Z","signature_b64":"2fiY3AimP5R8HnrxYhEjBXbRCVhIQ2HpYvIv1AWf/x/eWPgrPWkomHHsa0QBgKhV+JMNY6rWW0Yk/aLHzwhwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f080612f908808ee74f8289f36cd3e55bfe75e757f74e2ff9f1c49e3cdd25e4b","last_reissued_at":"2026-05-18T04:40:54.602292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:54.602292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.1777","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tq4tM/7IOqDI+sIAJyQYrXYI3IqYJgPFDzYcUydUZcCbT4QBvEy9lRzkafPIjsMOJ+urU/xT9L+hXcFWyMd5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:14:14.508172Z"},"content_sha256":"9cb28bdc6051ca61294b800c3e7524001dbb292b60ec53886d95c402e7af165c","schema_version":"1.0","event_id":"sha256:9cb28bdc6051ca61294b800c3e7524001dbb292b60ec53886d95c402e7af165c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:6CAGCL4QRAEO45HYFCPTNTJ6KW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Complexity and Intrinsic Universality in Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Goles Chacc, Guillaume Theyssier (LAMA), Ivan Rapaport (DIM), Pierre-Etienne Meunier (LAMA)","submitted_at":"2009-12-09T15:53:24Z","abstract_excerpt":"The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce necessary conditions for a cellular automaton to be \"universal\", according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. This notion of simulation relies on simple operations of space-time rescaling and it is intrinsic to the model of cellular automata. Intrinsinc universality, the derive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1777","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WzjcxPd3N820spif6MLBOLuLcISieB4D5AaDbi23kJlmQ8Itf1fSg1LdyCiNE42y5BaDGQCvvVUwkZLhdhXGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:14:14.508544Z"},"content_sha256":"17236b0b9792bae5331ae69a85f06ccfd092930d0ac4f0ba4bc214f3dd90187c","schema_version":"1.0","event_id":"sha256:17236b0b9792bae5331ae69a85f06ccfd092930d0ac4f0ba4bc214f3dd90187c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/bundle.json","state_url":"https://pith.science/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-30T19:14:14Z","links":{"resolver":"https://pith.science/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW","bundle":"https://pith.science/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/bundle.json","state":"https://pith.science/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CAGCL4QRAEO45HYFCPTNTJ6KW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:6CAGCL4QRAEO45HYFCPTNTJ6KW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d2726a81191fc936ceade55f32ad3472c28b596e9d38645664deac3cb5ca5c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-12-09T15:53:24Z","title_canon_sha256":"ba76c235ff4f90505be8b268391c682e41a778cca97d937bd4a1fc5f8a4a2a4f"},"schema_version":"1.0","source":{"id":"0912.1777","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.1777","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"arxiv_version","alias_value":"0912.1777v4","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1777","created_at":"2026-05-18T04:40:54Z"},{"alias_kind":"pith_short_12","alias_value":"6CAGCL4QRAEO","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"6CAGCL4QRAEO45HY","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"6CAGCL4Q","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:17236b0b9792bae5331ae69a85f06ccfd092930d0ac4f0ba4bc214f3dd90187c","target":"graph","created_at":"2026-05-18T04:40:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce necessary conditions for a cellular automaton to be \"universal\", according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. This notion of simulation relies on simple operations of space-time rescaling and it is intrinsic to the model of cellular automata. Intrinsinc universality, the derive","authors_text":"Eric Goles Chacc, Guillaume Theyssier (LAMA), Ivan Rapaport (DIM), Pierre-Etienne Meunier (LAMA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-12-09T15:53:24Z","title":"Communication Complexity and Intrinsic Universality in Cellular Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1777","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cb28bdc6051ca61294b800c3e7524001dbb292b60ec53886d95c402e7af165c","target":"record","created_at":"2026-05-18T04:40:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d2726a81191fc936ceade55f32ad3472c28b596e9d38645664deac3cb5ca5c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2009-12-09T15:53:24Z","title_canon_sha256":"ba76c235ff4f90505be8b268391c682e41a778cca97d937bd4a1fc5f8a4a2a4f"},"schema_version":"1.0","source":{"id":"0912.1777","kind":"arxiv","version":4}},"canonical_sha256":"f080612f908808ee74f8289f36cd3e55bfe75e757f74e2ff9f1c49e3cdd25e4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f080612f908808ee74f8289f36cd3e55bfe75e757f74e2ff9f1c49e3cdd25e4b","first_computed_at":"2026-05-18T04:40:54.602292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:54.602292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2fiY3AimP5R8HnrxYhEjBXbRCVhIQ2HpYvIv1AWf/x/eWPgrPWkomHHsa0QBgKhV+JMNY6rWW0Yk/aLHzwhwDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:54.602699Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.1777","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cb28bdc6051ca61294b800c3e7524001dbb292b60ec53886d95c402e7af165c","sha256:17236b0b9792bae5331ae69a85f06ccfd092930d0ac4f0ba4bc214f3dd90187c"],"state_sha256":"2d3ef9111c941dd4e4377b6996cd4f936ee85e7e7e628192f644f211421e67a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"puWv6sOPLgd799oR2iibP2c8dyHA5csQvMvmpgJ6qTO/PpPAfPQZd+eIAPWAbW9vNUJ+PCilYJ3xmv2REaJDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:14:14.510707Z","bundle_sha256":"2ee9913b42fa18c58fbd4c2aec65465da1b5b535553196219b0a3ef72935c1d6"}}