{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YVKA7DY3FEMPMEMBFOYKDPHAFJ","short_pith_number":"pith:YVKA7DY3","schema_version":"1.0","canonical_sha256":"c5540f8f1b2918f611812bb0a1bce02a4a949edbfb1fc0ef36c28cd43e553f05","source":{"kind":"arxiv","id":"1309.6730","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.6730","created_at":"2026-05-18T01:41:58.240957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6730v2","created_at":"2026-05-18T01:41:58.240957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6730","created_at":"2026-05-18T01:41:58.240957+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVKA7DY3FEMP","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVKA7DY3FEMPMEMB","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVKA7DY3","created_at":"2026-05-18T12:28:09.283467+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/YVKA7DY3FEMPMEMBFOYKDPHAFJ","json":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ.json","graph_json":"https://pith.science/api/pith-number/YVKA7DY3FEMPMEMBFOYKDPHAFJ/graph.json","events_json":"https://pith.science/api/pith-number/YVKA7DY3FEMPMEMBFOYKDPHAFJ/events.json","paper":"https://pith.science/paper/YVKA7DY3"},"agent_actions":{"view_html":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ","download_json":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ.json","view_paper":"https://pith.science/paper/YVKA7DY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6730&json=true","fetch_graph":"https://pith.science/api/pith-number/YVKA7DY3FEMPMEMBFOYKDPHAFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YVKA7DY3FEMPMEMBFOYKDPHAFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/action/storage_attestation","attest_author":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/action/author_attestation","sign_citation":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/action/citation_signature","submit_replication":"https://pith.science/pith/YVKA7DY3FEMPMEMBFOYKDPHAFJ/action/replication_record"}},"created_at":"2026-05-18T01:41:58.240957+00:00","updated_at":"2026-05-18T01:41:58.240957+00:00"}