{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VBBALMV25KHVVMKOV5AJSELQXZ","short_pith_number":"pith:VBBALMV2","schema_version":"1.0","canonical_sha256":"a84205b2baea8f5ab14eaf40991170be62e8b194fbdcbe18701331b2a53374b2","source":{"kind":"arxiv","id":"1504.00169","version":3},"attestation_state":"computed","paper":{"title":"Complete Simulation of Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.GR"],"primary_cat":"cs.FL","authors_text":"Alonso Castillo-Ramirez, Florian Bridoux, Maximilien Gadouleau","submitted_at":"2015-04-01T10:10:05Z","abstract_excerpt":"Consider a finite set $A$ and an integer $n \\geq 1$. This paper studies the concept of complete simulation in the context of semigroups of transformations of $A^n$, also known as finite state-homogeneous automata networks. For $m \\geq n$, a transformation of $A^m$ is \\emph{$n$-complete of size $m$} if it may simulate every transformation of $A^n$ by updating one coordinate (or register) at a time. Using tools from memoryless computation, it is established that there is no $n$-complete transformation of size $n$, but there is such a transformation of size $n+1$. By studying the the time of simu"},"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":"1504.00169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-01T10:10:05Z","cross_cats_sorted":["cs.CC","cs.DM","math.GR"],"title_canon_sha256":"ed2701165234accb69379d8e7b56efbd033d56541bfe8bced61179285ca39b0d","abstract_canon_sha256":"e5c960d5c98f54590c6d79f6eb5d219ef11056dc49d533059de6f003fdb062a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:43.835571Z","signature_b64":"fYkzZb06ZIbFFl1RxCBvyXu+HDtZ9+9V4fbgVNn25ZQzboDCbmuh+GgcfUZsHqErOFMQ5wuqbsDqHFcq0pr4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a84205b2baea8f5ab14eaf40991170be62e8b194fbdcbe18701331b2a53374b2","last_reissued_at":"2026-05-18T00:21:43.834905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:43.834905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Simulation of Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.GR"],"primary_cat":"cs.FL","authors_text":"Alonso Castillo-Ramirez, Florian Bridoux, Maximilien Gadouleau","submitted_at":"2015-04-01T10:10:05Z","abstract_excerpt":"Consider a finite set $A$ and an integer $n \\geq 1$. This paper studies the concept of complete simulation in the context of semigroups of transformations of $A^n$, also known as finite state-homogeneous automata networks. For $m \\geq n$, a transformation of $A^m$ is \\emph{$n$-complete of size $m$} if it may simulate every transformation of $A^n$ by updating one coordinate (or register) at a time. Using tools from memoryless computation, it is established that there is no $n$-complete transformation of size $n$, but there is such a transformation of size $n+1$. By studying the the time of simu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00169","kind":"arxiv","version":3},"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":"1504.00169","created_at":"2026-05-18T00:21:43.835013+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00169v3","created_at":"2026-05-18T00:21:43.835013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00169","created_at":"2026-05-18T00:21:43.835013+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBBALMV25KHV","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBBALMV25KHVVMKO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBBALMV2","created_at":"2026-05-18T12:29:44.643036+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/VBBALMV25KHVVMKOV5AJSELQXZ","json":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ.json","graph_json":"https://pith.science/api/pith-number/VBBALMV25KHVVMKOV5AJSELQXZ/graph.json","events_json":"https://pith.science/api/pith-number/VBBALMV25KHVVMKOV5AJSELQXZ/events.json","paper":"https://pith.science/paper/VBBALMV2"},"agent_actions":{"view_html":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ","download_json":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ.json","view_paper":"https://pith.science/paper/VBBALMV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00169&json=true","fetch_graph":"https://pith.science/api/pith-number/VBBALMV25KHVVMKOV5AJSELQXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VBBALMV25KHVVMKOV5AJSELQXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ/action/storage_attestation","attest_author":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ/action/author_attestation","sign_citation":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ/action/citation_signature","submit_replication":"https://pith.science/pith/VBBALMV25KHVVMKOV5AJSELQXZ/action/replication_record"}},"created_at":"2026-05-18T00:21:43.835013+00:00","updated_at":"2026-05-18T00:21:43.835013+00:00"}