{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YVKA7DY3FEMPMEMBFOYKDPHAFJ","short_pith_number":"pith:YVKA7DY3","canonical_record":{"source":{"id":"1309.6730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T06:30:59Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"02e7f7082f0e07bbbaecc626b0fa495d14c69c42a80fda0f6f7174ad0cb3225c","abstract_canon_sha256":"89261d4899589f7ce98e91d6a6e0895557b37ea879751c7ec430f4a7c6f60240"},"schema_version":"1.0"},"canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","source":{"kind":"arxiv","id":"1309.6730","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6730","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6730v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6730","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"YVKA7DY3FEMP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YVKA7DY3FEMPMEMB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YVKA7DY3","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YVKA7DY3FEMPMEMBFOYKDPHAFJ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6730","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T06:30:59Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"02e7f7082f0e07bbbaecc626b0fa495d14c69c42a80fda0f6f7174ad0cb3225c","abstract_canon_sha256":"89261d4899589f7ce98e91d6a6e0895557b37ea879751c7ec430f4a7c6f60240"},"schema_version":"1.0"},"canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.241268Z","signature_b64":"88106cHsHOm6Dr6UvAAmjJmyHdhifDAwgxF6ZeGCVEDy1XKxy1CqO7V5xTdhEPuTxf2DBMojbirzaN6NPB5rBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","last_reissued_at":"2026-05-18T01:41:58.240903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.240903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6730","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3bEAUvyH9akLABLUfpNS1bZjheV7Y2ppbKF7JnzykHlycWTAz6XcBe8a7kSxT8uiCa6OR6h449X+voXexEv/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:37:00.461475Z"},"content_sha256":"2c3834398573783782ab708dbe8a3493b497c3dd10266081adf12b68324e98c5","schema_version":"1.0","event_id":"sha256:2c3834398573783782ab708dbe8a3493b497c3dd10266081adf12b68324e98c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YVKA7DY3FEMPMEMBFOYKDPHAFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\mu$-Limit Sets of Cellular Automata from a Computational Complexity Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","nlin.CG"],"primary_cat":"cs.DM","authors_text":"Guillaume Theyssier (LAMA), Laurent Boyer (SAMM), Martin Delacourt (CMM), Mathieu Sablik (LATP), Victor Poupet (LIRMM)","submitted_at":"2013-09-26T06:30:59Z","abstract_excerpt":"This paper concerns $\\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\\mu$-random configuration. More precisely, we investigate the computational complexity of these sets and of related decision problems. Main results: first, $\\mu$-limit sets can have a $\\Sigma\\_3^0$-hard language, second, they can contain only $\\alpha$-complex configurations, third, any non-trivial property concerning them is at least $\\Pi\\_3^0$-hard. We prove complexity upper bounds, study restrictions of these question"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6730","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-18T01:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXV+z229lVcZyjJeGntaX5xf5Xf2f8vYJJC2hWUEYOsHxtCwy+AQjQAO2jydgkIFA69zIO9xfLx57NwFWl2bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:37:00.461827Z"},"content_sha256":"0cc193d97cc78a0d9808370d4be8cc1b76d3c90564529aa7375d3c610d5c8ff0","schema_version":"1.0","event_id":"sha256:0cc193d97cc78a0d9808370d4be8cc1b76d3c90564529aa7375d3c610d5c8ff0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/bundle.json","state_url":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/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:37:00Z","links":{"resolver":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ","bundle":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/bundle.json","state":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YVKA7DY3FEMPMEMBFOYKDPHAFJ","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":"89261d4899589f7ce98e91d6a6e0895557b37ea879751c7ec430f4a7c6f60240","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T06:30:59Z","title_canon_sha256":"02e7f7082f0e07bbbaecc626b0fa495d14c69c42a80fda0f6f7174ad0cb3225c"},"schema_version":"1.0","source":{"id":"1309.6730","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6730","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6730v2","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6730","created_at":"2026-05-18T01:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"YVKA7DY3FEMP","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YVKA7DY3FEMPMEMB","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YVKA7DY3","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:0cc193d97cc78a0d9808370d4be8cc1b76d3c90564529aa7375d3c610d5c8ff0","target":"graph","created_at":"2026-05-18T01:41:58Z","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 concerns $\\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\\mu$-random configuration. More precisely, we investigate the computational complexity of these sets and of related decision problems. Main results: first, $\\mu$-limit sets can have a $\\Sigma\\_3^0$-hard language, second, they can contain only $\\alpha$-complex configurations, third, any non-trivial property concerning them is at least $\\Pi\\_3^0$-hard. We prove complexity upper bounds, study restrictions of these question","authors_text":"Guillaume Theyssier (LAMA), Laurent Boyer (SAMM), Martin Delacourt (CMM), Mathieu Sablik (LATP), Victor Poupet (LIRMM)","cross_cats":["cs.FL","nlin.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T06:30:59Z","title":"$\\mu$-Limit Sets of Cellular Automata from a Computational Complexity Perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6730","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:2c3834398573783782ab708dbe8a3493b497c3dd10266081adf12b68324e98c5","target":"record","created_at":"2026-05-18T01:41:58Z","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":"89261d4899589f7ce98e91d6a6e0895557b37ea879751c7ec430f4a7c6f60240","cross_cats_sorted":["cs.FL","nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T06:30:59Z","title_canon_sha256":"02e7f7082f0e07bbbaecc626b0fa495d14c69c42a80fda0f6f7174ad0cb3225c"},"schema_version":"1.0","source":{"id":"1309.6730","kind":"arxiv","version":2}},"canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","first_computed_at":"2026-05-18T01:41:58.240903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:58.240903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"88106cHsHOm6Dr6UvAAmjJmyHdhifDAwgxF6ZeGCVEDy1XKxy1CqO7V5xTdhEPuTxf2DBMojbirzaN6NPB5rBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:58.241268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6730","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c3834398573783782ab708dbe8a3493b497c3dd10266081adf12b68324e98c5","sha256:0cc193d97cc78a0d9808370d4be8cc1b76d3c90564529aa7375d3c610d5c8ff0"],"state_sha256":"a3adc0ee9c587036601b51379806cfc311c8d063c36b57789052b4f7b8d56bfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w1aG9Ziy4dJjUJbpSEQy1E9+RUrkhrsprOgcvmxhNLqx0P5vdLiOiETxneWimtoY+Fm34abWhvOSeVqeIxmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:37:00.464023Z","bundle_sha256":"2706728017c4b37e3fe6a3bde17268a4c72830adf7eb026bf784e339c75df7d7"}}