{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:ZMKBNVIXWJKL7QFLEK5CHWXTNZ","short_pith_number":"pith:ZMKBNVIX","schema_version":"1.0","canonical_sha256":"cb1416d517b254bfc0ab22ba23daf36e5599ba7401500f15616f1b81ee1cad81","source":{"kind":"arxiv","id":"cs/0512077","version":7},"attestation_state":"computed","paper":{"title":"Flat Holonomies on Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Gene Itkis, Leonid A. Levin","submitted_at":"2005-12-20T11:35:10Z","abstract_excerpt":"We consider asynchronous networks of identical finite (independent of network's size or topology) automata. Our automata drive any network from any initial configuration of states, to a coherent one in which it can carry efficiently any computations implementable on synchronous properly initialized networks of the same size.\n  A useful data structure on such networks is a partial orientation of its edges. It needs to be flat, i.e. have null holonomy (no excess of up or down edges in any cycle). It also needs to be centered, i.e. have a unique node with no down edges.\n  There are (interdependen"},"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":"cs/0512077","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2005-12-20T11:35:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4b766af5399a3b476590d3dedcfaa17a84f5e5f96dcda0876bd0cb351ed7d7cf","abstract_canon_sha256":"cd549a8a3bef894477550ffb2d99dfe46d26a068e1b8fab894321f67d0977e4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:16.817890Z","signature_b64":"VosRoQc2O/zZa6rTR/djU9IGHem6QRiyxVGzv1o/6sebCUQoLa8ETRc5DFATnjCGieMkDOalM2OZgV3X7UY0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb1416d517b254bfc0ab22ba23daf36e5599ba7401500f15616f1b81ee1cad81","last_reissued_at":"2026-05-18T04:05:16.817282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:16.817282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flat Holonomies on Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DC","authors_text":"Gene Itkis, Leonid A. Levin","submitted_at":"2005-12-20T11:35:10Z","abstract_excerpt":"We consider asynchronous networks of identical finite (independent of network's size or topology) automata. Our automata drive any network from any initial configuration of states, to a coherent one in which it can carry efficiently any computations implementable on synchronous properly initialized networks of the same size.\n  A useful data structure on such networks is a partial orientation of its edges. It needs to be flat, i.e. have null holonomy (no excess of up or down edges in any cycle). It also needs to be centered, i.e. have a unique node with no down edges.\n  There are (interdependen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512077","kind":"arxiv","version":7},"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":"cs/0512077","created_at":"2026-05-18T04:05:16.817378+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512077v7","created_at":"2026-05-18T04:05:16.817378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512077","created_at":"2026-05-18T04:05:16.817378+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMKBNVIXWJKL","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMKBNVIXWJKL7QFL","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMKBNVIX","created_at":"2026-05-18T12:25:53.939244+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/ZMKBNVIXWJKL7QFLEK5CHWXTNZ","json":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ.json","graph_json":"https://pith.science/api/pith-number/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/graph.json","events_json":"https://pith.science/api/pith-number/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/events.json","paper":"https://pith.science/paper/ZMKBNVIX"},"agent_actions":{"view_html":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ","download_json":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ.json","view_paper":"https://pith.science/paper/ZMKBNVIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512077&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZMKBNVIXWJKL7QFLEK5CHWXTNZ/action/replication_record"}},"created_at":"2026-05-18T04:05:16.817378+00:00","updated_at":"2026-05-18T04:05:16.817378+00:00"}