{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TYZ7T4QWXICPWIIOWOR7BK2WBM","short_pith_number":"pith:TYZ7T4QW","canonical_record":{"source":{"id":"1009.5621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-28T16:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"9f44fdce2a2844dc11d196a09079dfc5509d89e55b9b0898ebf97febe3c9f1a0","abstract_canon_sha256":"54367aa7d753fc2fcb51258f5a43ceca0f7080c6c5e190176c8ea79cb1af5be9"},"schema_version":"1.0"},"canonical_sha256":"9e33f9f216ba04fb210eb3a3f0ab560b372ef6dece538c261f83ac94c80867b2","source":{"kind":"arxiv","id":"1009.5621","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5621","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5621v2","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5621","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"TYZ7T4QWXICP","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TYZ7T4QWXICPWIIO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TYZ7T4QW","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TYZ7T4QWXICPWIIOWOR7BK2WBM","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-28T16:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"9f44fdce2a2844dc11d196a09079dfc5509d89e55b9b0898ebf97febe3c9f1a0","abstract_canon_sha256":"54367aa7d753fc2fcb51258f5a43ceca0f7080c6c5e190176c8ea79cb1af5be9"},"schema_version":"1.0"},"canonical_sha256":"9e33f9f216ba04fb210eb3a3f0ab560b372ef6dece538c261f83ac94c80867b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:27.282887Z","signature_b64":"wZ42rRj6GGyPbv7D/DAPTV/tqzvB90p2WnrzIUhm6VNrvuYDwi7jh7arTYcYyrwxPQ/997L295HYjizhiciBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e33f9f216ba04fb210eb3a3f0ab560b372ef6dece538c261f83ac94c80867b2","last_reissued_at":"2026-05-18T04:34:27.282396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:27.282396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5621","source_version":2,"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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P1rnbWXY09esD7YKb6mX4la1p1s8X3u4hOjDLvJtXewD3X56sC42yXNZgskA5hJs1/PTF4FIO1Xl8QagGVkSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:40:48.359045Z"},"content_sha256":"74dbfaaf72570128c42950d923664c25b719075731415175ee1ea93fd8d8d2e1","schema_version":"1.0","event_id":"sha256:74dbfaaf72570128c42950d923664c25b719075731415175ee1ea93fd8d8d2e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TYZ7T4QWXICPWIIOWOR7BK2WBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clandestine Simulations in Cellular Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Guillaume Theyssier (LAMA), Pierre-Etienne Meunier (LAMA), Pierre Guillon","submitted_at":"2010-09-28T16:13:17Z","abstract_excerpt":"This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity of attractors and factor subshifts. On the one hand, the factor simulation preserves the complexity of limits sets or column factors (the simulator CA must have a higher complexity than the simulated CA). On the other hand, we show that any CA is the sub-automaton of some CA with a simple limit set (NL-recognizable) and the sub-automaton of some CA with a si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5621","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":""},"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:34:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oE3AGVAEgD4hz2eHFQWzyDWDo1LA4dycPq94zmwdvNKqk8A72NlPal+HLuFMEEes/cCXim5NDFIli3i9zTsUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:40:48.359393Z"},"content_sha256":"521ea11b4539ae4c07db3581f4a85349c46bf8d781a915ba648e989c27f53f39","schema_version":"1.0","event_id":"sha256:521ea11b4539ae4c07db3581f4a85349c46bf8d781a915ba648e989c27f53f39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/bundle.json","state_url":"https://pith.science/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/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-30T23:40:48Z","links":{"resolver":"https://pith.science/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM","bundle":"https://pith.science/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/bundle.json","state":"https://pith.science/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYZ7T4QWXICPWIIOWOR7BK2WBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TYZ7T4QWXICPWIIOWOR7BK2WBM","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":"54367aa7d753fc2fcb51258f5a43ceca0f7080c6c5e190176c8ea79cb1af5be9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-28T16:13:17Z","title_canon_sha256":"9f44fdce2a2844dc11d196a09079dfc5509d89e55b9b0898ebf97febe3c9f1a0"},"schema_version":"1.0","source":{"id":"1009.5621","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5621","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5621v2","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5621","created_at":"2026-05-18T04:34:27Z"},{"alias_kind":"pith_short_12","alias_value":"TYZ7T4QWXICP","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"TYZ7T4QWXICPWIIO","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"TYZ7T4QW","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:521ea11b4539ae4c07db3581f4a85349c46bf8d781a915ba648e989c27f53f39","target":"graph","created_at":"2026-05-18T04:34:27Z","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":"This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity of attractors and factor subshifts. On the one hand, the factor simulation preserves the complexity of limits sets or column factors (the simulator CA must have a higher complexity than the simulated CA). On the other hand, we show that any CA is the sub-automaton of some CA with a simple limit set (NL-recognizable) and the sub-automaton of some CA with a si","authors_text":"Guillaume Theyssier (LAMA), Pierre-Etienne Meunier (LAMA), Pierre Guillon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-28T16:13:17Z","title":"Clandestine Simulations in Cellular Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5621","kind":"arxiv","version":2},"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:74dbfaaf72570128c42950d923664c25b719075731415175ee1ea93fd8d8d2e1","target":"record","created_at":"2026-05-18T04:34:27Z","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":"54367aa7d753fc2fcb51258f5a43ceca0f7080c6c5e190176c8ea79cb1af5be9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-09-28T16:13:17Z","title_canon_sha256":"9f44fdce2a2844dc11d196a09079dfc5509d89e55b9b0898ebf97febe3c9f1a0"},"schema_version":"1.0","source":{"id":"1009.5621","kind":"arxiv","version":2}},"canonical_sha256":"9e33f9f216ba04fb210eb3a3f0ab560b372ef6dece538c261f83ac94c80867b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e33f9f216ba04fb210eb3a3f0ab560b372ef6dece538c261f83ac94c80867b2","first_computed_at":"2026-05-18T04:34:27.282396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:27.282396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZ42rRj6GGyPbv7D/DAPTV/tqzvB90p2WnrzIUhm6VNrvuYDwi7jh7arTYcYyrwxPQ/997L295HYjizhiciBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:27.282887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5621","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74dbfaaf72570128c42950d923664c25b719075731415175ee1ea93fd8d8d2e1","sha256:521ea11b4539ae4c07db3581f4a85349c46bf8d781a915ba648e989c27f53f39"],"state_sha256":"807940e637a2e0a354b57fc40b298faf6a88fc1496734e48f0dbcb35b5bdc6b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yWhhpxJhC8HSpkIJuZhnCc0JyCMDUJhRph4kd6sJvVk3Rlc3Lq4Zf2peEJWK818RcCyZ2FpDOL2sVtwIpbdjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:40:48.361254Z","bundle_sha256":"ce63f235f23c5a776e350e0916f5234ee3b052167b76c4270d50eacaafaf6299"}}