{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SQ64US6XJQUVVZXT2YKQPLEYVT","short_pith_number":"pith:SQ64US6X","canonical_record":{"source":{"id":"1803.06919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2018-03-14T13:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"e3ca0dabf211d4d59e271ad827723259775c7196a903025a0b2abd900466327f","abstract_canon_sha256":"99015951580497f90e0c0f06f9edd63d69758356f44425aad2bd16383cf9d76d"},"schema_version":"1.0"},"canonical_sha256":"943dca4bd74c295ae6f3d61507ac98acee36014b82707d960181a4d80c005a8d","source":{"kind":"arxiv","id":"1803.06919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06919","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06919v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06919","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"SQ64US6XJQUV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SQ64US6XJQUVVZXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SQ64US6X","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SQ64US6XJQUVVZXT2YKQPLEYVT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2018-03-14T13:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"e3ca0dabf211d4d59e271ad827723259775c7196a903025a0b2abd900466327f","abstract_canon_sha256":"99015951580497f90e0c0f06f9edd63d69758356f44425aad2bd16383cf9d76d"},"schema_version":"1.0"},"canonical_sha256":"943dca4bd74c295ae6f3d61507ac98acee36014b82707d960181a4d80c005a8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:40.872495Z","signature_b64":"JvhYHCcmAvnGLemZm+BqwEBSQ6nxNSltTxexI+RBSqdETpcAWV8Jx5ND8RoffvTt61irIaENnz9NjrrtROXRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"943dca4bd74c295ae6f3d61507ac98acee36014b82707d960181a4d80c005a8d","last_reissued_at":"2026-05-18T00:20:40.871845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:40.871845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06919","source_version":1,"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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnkRwbAqj/Sjdrq+7SpyUCOOaiw1xFzMd+Z18gqLFPRb8TeVDQ2nDmPQT5hoU0PFI+DcGigKSceM5zT3emTdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:41:51.667983Z"},"content_sha256":"edb64b6a250c5a815365458c476fadd9dcac9b127d9326eca91c8a3212770169","schema_version":"1.0","event_id":"sha256:edb64b6a250c5a815365458c476fadd9dcac9b127d9326eca91c8a3212770169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SQ64US6XJQUVVZXT2YKQPLEYVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Definition and Identification of Information Storage and Processing Capabilities as Possible Markers for Turing-universality in Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CG","authors_text":"Yanbo Zhang","submitted_at":"2018-03-14T13:00:32Z","abstract_excerpt":"To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to process information. We define local collections of cells as particles of cellular automata and consider information contained by particles. By using this method, information channels and channels' intersections can be shown. By observing these two features, potential universal cellular automata are classified into a certain class, and all elementary cellul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06919","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"},"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-18T00:20:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rGY3Nd50w6bbPdlUULyj5PMzJZWXmR7rn46Qf4tSF/453SrtQJ3+4hAqA12VqG2cVBmacEzsGrQcNmey1WeVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T12:41:51.668342Z"},"content_sha256":"03827e61e3e5b99255a445885ae3238f0ea7f0db48ab079886444d9e4e65f1c2","schema_version":"1.0","event_id":"sha256:03827e61e3e5b99255a445885ae3238f0ea7f0db48ab079886444d9e4e65f1c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/bundle.json","state_url":"https://pith.science/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/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-07-02T12:41:51Z","links":{"resolver":"https://pith.science/pith/SQ64US6XJQUVVZXT2YKQPLEYVT","bundle":"https://pith.science/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/bundle.json","state":"https://pith.science/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQ64US6XJQUVVZXT2YKQPLEYVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SQ64US6XJQUVVZXT2YKQPLEYVT","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":"99015951580497f90e0c0f06f9edd63d69758356f44425aad2bd16383cf9d76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2018-03-14T13:00:32Z","title_canon_sha256":"e3ca0dabf211d4d59e271ad827723259775c7196a903025a0b2abd900466327f"},"schema_version":"1.0","source":{"id":"1803.06919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06919","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06919v1","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06919","created_at":"2026-05-18T00:20:40Z"},{"alias_kind":"pith_short_12","alias_value":"SQ64US6XJQUV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SQ64US6XJQUVVZXT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SQ64US6X","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:03827e61e3e5b99255a445885ae3238f0ea7f0db48ab079886444d9e4e65f1c2","target":"graph","created_at":"2026-05-18T00:20:40Z","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":"To identify potential universal cellular automata, a method is developed to measure information processing capacity of elementary cellular automata. We consider two features of cellular automata: Ability to store information, and ability to process information. We define local collections of cells as particles of cellular automata and consider information contained by particles. By using this method, information channels and channels' intersections can be shown. By observing these two features, potential universal cellular automata are classified into a certain class, and all elementary cellul","authors_text":"Yanbo Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2018-03-14T13:00:32Z","title":"Definition and Identification of Information Storage and Processing Capabilities as Possible Markers for Turing-universality in Cellular Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06919","kind":"arxiv","version":1},"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:edb64b6a250c5a815365458c476fadd9dcac9b127d9326eca91c8a3212770169","target":"record","created_at":"2026-05-18T00:20:40Z","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":"99015951580497f90e0c0f06f9edd63d69758356f44425aad2bd16383cf9d76d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CG","submitted_at":"2018-03-14T13:00:32Z","title_canon_sha256":"e3ca0dabf211d4d59e271ad827723259775c7196a903025a0b2abd900466327f"},"schema_version":"1.0","source":{"id":"1803.06919","kind":"arxiv","version":1}},"canonical_sha256":"943dca4bd74c295ae6f3d61507ac98acee36014b82707d960181a4d80c005a8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"943dca4bd74c295ae6f3d61507ac98acee36014b82707d960181a4d80c005a8d","first_computed_at":"2026-05-18T00:20:40.871845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:40.871845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JvhYHCcmAvnGLemZm+BqwEBSQ6nxNSltTxexI+RBSqdETpcAWV8Jx5ND8RoffvTt61irIaENnz9NjrrtROXRDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:40.872495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edb64b6a250c5a815365458c476fadd9dcac9b127d9326eca91c8a3212770169","sha256:03827e61e3e5b99255a445885ae3238f0ea7f0db48ab079886444d9e4e65f1c2"],"state_sha256":"33836c58ec8a60cb68f1ca1e4d5d884222f4ca53d68bf7148fec6d79749a5e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BULC0lHMESxp3ScCQvlVsGx239JU0X4ky3yqJvekKNXdyc0nTc8K7laUJ0nt0nshKVJvyy4BtVikz6YJyvBIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T12:41:51.670195Z","bundle_sha256":"e7b63fc919ebca4f4559c7409d6684253ae25f5a513b7d053573a1ff6d22c515"}}