{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CVUNLHQT3DAMPTSHPE2IIVO5OP","short_pith_number":"pith:CVUNLHQT","canonical_record":{"source":{"id":"1408.5963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-26T01:15:54Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1d4e9625e2541c4f537b57b3cf029c6c3f25135876121740693d06384e006b90","abstract_canon_sha256":"bd5206f85f18a3d279d9fa1a65e98dda729df6611f75c9c79a256ad1fceeeee6"},"schema_version":"1.0"},"canonical_sha256":"1568d59e13d8c0c7ce4779348455dd73ecdba38246baa64989e59741f23ac928","source":{"kind":"arxiv","id":"1408.5963","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5963","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5963v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5963","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"CVUNLHQT3DAM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVUNLHQT3DAMPTSH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVUNLHQT","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CVUNLHQT3DAMPTSHPE2IIVO5OP","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-26T01:15:54Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1d4e9625e2541c4f537b57b3cf029c6c3f25135876121740693d06384e006b90","abstract_canon_sha256":"bd5206f85f18a3d279d9fa1a65e98dda729df6611f75c9c79a256ad1fceeeee6"},"schema_version":"1.0"},"canonical_sha256":"1568d59e13d8c0c7ce4779348455dd73ecdba38246baa64989e59741f23ac928","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.639086Z","signature_b64":"wj2gWdf3CFwM+MTTMANTes/5b1JE/bTLZ/Av/qrtbTdIQuI6nEMHM27ADPMTk1VGcuyihed9J77E6dBJ9OTtCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1568d59e13d8c0c7ce4779348455dd73ecdba38246baa64989e59741f23ac928","last_reissued_at":"2026-05-18T02:44:15.638564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.638564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5963","source_version":1,"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-18T02:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUGGk8jYlrkDhNdYC9sGuTePpXFyiryTE/nEdFvKxzgRkZawuHQyWxPgUcNbQg04ihgOjAjm0DATvYlmZa1BDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:33:54.837498Z"},"content_sha256":"d7a66d3416bc801dba44d49df1a242f86b4d90ccd459f77ba25667fe807dc3b9","schema_version":"1.0","event_id":"sha256:d7a66d3416bc801dba44d49df1a242f86b4d90ccd459f77ba25667fe807dc3b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CVUNLHQT3DAMPTSHPE2IIVO5OP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Infinite Networks, Halting and Local Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Antti Kuusisto","submitted_at":"2014-08-26T01:15:54Z","abstract_excerpt":"The immediate past has witnessed an increased amount of interest in local algorithms, i.e., constant time distributed algorithms. In a recent survey of the topic (Suomela, ACM Computing Surveys, 2013), it is argued that local algorithms provide a natural framework that could be used in order to theoretically control infinite networks in finite time. We study a comprehensive collection of distributed computing models and prove that if infinite networks are included in the class of structures investigated, then every universally halting distributed algorithm is in fact a local algorithm. To cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5963","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"},"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-18T02:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjqVl6tLSnXzpN+H2/JW5hDgkpWEP6VQt3Jq19lFSF7h3HZevZZ2ACBsNJb2CWUG4rt4d7IEtVXoYDi1Dp2fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:33:54.838168Z"},"content_sha256":"e175642a3ba3adee90a7c7d96927683192a9d203ac7babe874760e82fdacb38e","schema_version":"1.0","event_id":"sha256:e175642a3ba3adee90a7c7d96927683192a9d203ac7babe874760e82fdacb38e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/bundle.json","state_url":"https://pith.science/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/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-05-26T00:33:54Z","links":{"resolver":"https://pith.science/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP","bundle":"https://pith.science/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/bundle.json","state":"https://pith.science/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVUNLHQT3DAMPTSHPE2IIVO5OP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CVUNLHQT3DAMPTSHPE2IIVO5OP","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":"bd5206f85f18a3d279d9fa1a65e98dda729df6611f75c9c79a256ad1fceeeee6","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-26T01:15:54Z","title_canon_sha256":"1d4e9625e2541c4f537b57b3cf029c6c3f25135876121740693d06384e006b90"},"schema_version":"1.0","source":{"id":"1408.5963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5963","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5963v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5963","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"CVUNLHQT3DAM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CVUNLHQT3DAMPTSH","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CVUNLHQT","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:e175642a3ba3adee90a7c7d96927683192a9d203ac7babe874760e82fdacb38e","target":"graph","created_at":"2026-05-18T02:44:15Z","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":"The immediate past has witnessed an increased amount of interest in local algorithms, i.e., constant time distributed algorithms. In a recent survey of the topic (Suomela, ACM Computing Surveys, 2013), it is argued that local algorithms provide a natural framework that could be used in order to theoretically control infinite networks in finite time. We study a comprehensive collection of distributed computing models and prove that if infinite networks are included in the class of structures investigated, then every universally halting distributed algorithm is in fact a local algorithm. To cont","authors_text":"Antti Kuusisto","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-26T01:15:54Z","title":"Infinite Networks, Halting and Local Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5963","kind":"arxiv","version":1},"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:d7a66d3416bc801dba44d49df1a242f86b4d90ccd459f77ba25667fe807dc3b9","target":"record","created_at":"2026-05-18T02:44:15Z","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":"bd5206f85f18a3d279d9fa1a65e98dda729df6611f75c9c79a256ad1fceeeee6","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-26T01:15:54Z","title_canon_sha256":"1d4e9625e2541c4f537b57b3cf029c6c3f25135876121740693d06384e006b90"},"schema_version":"1.0","source":{"id":"1408.5963","kind":"arxiv","version":1}},"canonical_sha256":"1568d59e13d8c0c7ce4779348455dd73ecdba38246baa64989e59741f23ac928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1568d59e13d8c0c7ce4779348455dd73ecdba38246baa64989e59741f23ac928","first_computed_at":"2026-05-18T02:44:15.638564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.638564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wj2gWdf3CFwM+MTTMANTes/5b1JE/bTLZ/Av/qrtbTdIQuI6nEMHM27ADPMTk1VGcuyihed9J77E6dBJ9OTtCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.639086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7a66d3416bc801dba44d49df1a242f86b4d90ccd459f77ba25667fe807dc3b9","sha256:e175642a3ba3adee90a7c7d96927683192a9d203ac7babe874760e82fdacb38e"],"state_sha256":"07e4942ffe66abe2a578a241017689d8b5c34f70e1d00f60f0ccc8a78e17e5c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziI5pD7Zf6+5ygf95Lhy8GPtb2r48PDMbiW8dhft9IrUB0TugAhC450LA/sfqcJZ3ZZwbW3TO2Hq5YYKruvJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:33:54.841921Z","bundle_sha256":"666dbf79dbeca66538b793ed519680a9d3a9993ec874591a1976e218179a5157"}}