{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:H7Z443IUV5QUNTT6NCEYTNFN6F","short_pith_number":"pith:H7Z443IU","schema_version":"1.0","canonical_sha256":"3ff3ce6d14af6146ce7e688989b4adf14df9dabaa9c850d67a680af4c326b1f8","source":{"kind":"arxiv","id":"1012.1333","version":1},"attestation_state":"computed","paper":{"title":"Construction of $\\mu$-Limit Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","nlin.CG"],"primary_cat":"cs.DM","authors_text":"Laurent Boyer (LAMA), Martin Delacourt (LIF), Mathieu Sablik (LATP)","submitted_at":"2010-12-03T09:53:40Z","abstract_excerpt":"The $\\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as $\\mu$-limit set where $\\mu$ is the uniform Bernoulli measure."},"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":"1012.1333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-12-03T09:53:40Z","cross_cats_sorted":["cs.FL","nlin.CG"],"title_canon_sha256":"d7a133c44ff18c6eb6546431b7ee2b63870713488a1d50e3f16b5419a687a69f","abstract_canon_sha256":"4b56a5add97bb479d63ddd846c18d7e7f2d2652a8f90c91d5626ddeb726e66e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:01.171872Z","signature_b64":"IoHCpqkFjjMiIgHjbumj8/kl+6pKW0LpOcijblW5yUJD4Nerfz1AetCYiI40RY428DZHglLLL99SqmkUBFuzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff3ce6d14af6146ce7e688989b4adf14df9dabaa9c850d67a680af4c326b1f8","last_reissued_at":"2026-05-18T04:34:01.171474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:01.171474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of $\\mu$-Limit Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","nlin.CG"],"primary_cat":"cs.DM","authors_text":"Laurent Boyer (LAMA), Martin Delacourt (LIF), Mathieu Sablik (LATP)","submitted_at":"2010-12-03T09:53:40Z","abstract_excerpt":"The $\\mu$-limit set of a cellular automaton is a subshift whose forbidden patterns are exactly those, whose probabilities tend to zero as time tends to in- finity. In this article, for a given subshift in a large class of subshifts, we propose the construction of a cellular automaton which realizes this subshift as $\\mu$-limit set where $\\mu$ is the uniform Bernoulli measure."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1333","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1333","created_at":"2026-05-18T04:34:01.171528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1333v1","created_at":"2026-05-18T04:34:01.171528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1333","created_at":"2026-05-18T04:34:01.171528+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7Z443IUV5QU","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7Z443IUV5QUNTT6","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7Z443IU","created_at":"2026-05-18T12:26:07.630475+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/H7Z443IUV5QUNTT6NCEYTNFN6F","json":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F.json","graph_json":"https://pith.science/api/pith-number/H7Z443IUV5QUNTT6NCEYTNFN6F/graph.json","events_json":"https://pith.science/api/pith-number/H7Z443IUV5QUNTT6NCEYTNFN6F/events.json","paper":"https://pith.science/paper/H7Z443IU"},"agent_actions":{"view_html":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F","download_json":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F.json","view_paper":"https://pith.science/paper/H7Z443IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1333&json=true","fetch_graph":"https://pith.science/api/pith-number/H7Z443IUV5QUNTT6NCEYTNFN6F/graph.json","fetch_events":"https://pith.science/api/pith-number/H7Z443IUV5QUNTT6NCEYTNFN6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F/action/storage_attestation","attest_author":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F/action/author_attestation","sign_citation":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F/action/citation_signature","submit_replication":"https://pith.science/pith/H7Z443IUV5QUNTT6NCEYTNFN6F/action/replication_record"}},"created_at":"2026-05-18T04:34:01.171528+00:00","updated_at":"2026-05-18T04:34:01.171528+00:00"}