{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RYF2KP7R3C2GTCFLUJMUAD3CIJ","short_pith_number":"pith:RYF2KP7R","canonical_record":{"source":{"id":"1907.07010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-16T13:57:46Z","cross_cats_sorted":["cs.CR","cs.NI"],"title_canon_sha256":"16f03b30b8d0085cbd81ec80ec54c9df5d19e560130cf50d341175c70411663e","abstract_canon_sha256":"20d21493c02e3213a66d96155aef93bb839edfe0d0cad9f15f3fffe3d5baeac0"},"schema_version":"1.0"},"canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","source":{"kind":"arxiv","id":"1907.07010","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07010","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07010v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07010","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RYF2KP7R3C2G","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYF2KP7R3C2GTCFL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYF2KP7R","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RYF2KP7R3C2GTCFLUJMUAD3CIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07010","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-16T13:57:46Z","cross_cats_sorted":["cs.CR","cs.NI"],"title_canon_sha256":"16f03b30b8d0085cbd81ec80ec54c9df5d19e560130cf50d341175c70411663e","abstract_canon_sha256":"20d21493c02e3213a66d96155aef93bb839edfe0d0cad9f15f3fffe3d5baeac0"},"schema_version":"1.0"},"canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:28.362115Z","signature_b64":"oVAAnYzkvFmIidyVDBCfKcL8KaOOetMZEdKYUwz+dD/r9LLjhbmuIf1Zq5Tjja5JJ2b/AMP6H0WtQ3FGjsF5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","last_reissued_at":"2026-05-17T23:40:28.361490Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:28.361490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07010","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-17T23:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZ8xh2KTEzQlnlNuLPJkttJ8Vn2c33A+SADnwbX+ewhNBBzqfLaHMuS+N2BbNPeDrjboBqZONdUIMy6aPjFxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:55:48.783850Z"},"content_sha256":"25f58c058d28e8af5db64b5bbb7b7c2800c7f92708433f9f6ee41e289e2967d1","schema_version":"1.0","event_id":"sha256:25f58c058d28e8af5db64b5bbb7b7c2800c7f92708433f9f6ee41e289e2967d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RYF2KP7R3C2GTCFLUJMUAD3CIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.NI"],"primary_cat":"cs.DC","authors_text":"Bryan Ford","submitted_at":"2019-07-16T13:57:46Z","abstract_excerpt":"Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstraction, which enables upper layers to operate as if on a synchronous network. This approach yields an asynchronous consensus protocol for fail-stop nodes that may be simpler and more robust than Paxos and its leader-based variants, requiring no common coins and achieving consensus in a constant expected number of rounds. The same approach can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07010","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-17T23:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+41RQcBP6hhxI5lhIAKUn430Cxsj4XqEU6qU5Fl56XPtWYTPjFc4q2lV7hRKQCENCcph+a3fbOVLdoWQ4mQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:55:48.784560Z"},"content_sha256":"93c72a6144d565c0fb4f412a8965c953fa7a80c162defff521dfd4e4b7dcafe2","schema_version":"1.0","event_id":"sha256:93c72a6144d565c0fb4f412a8965c953fa7a80c162defff521dfd4e4b7dcafe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/bundle.json","state_url":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/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-29T14:55:48Z","links":{"resolver":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ","bundle":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/bundle.json","state":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RYF2KP7R3C2GTCFLUJMUAD3CIJ","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":"20d21493c02e3213a66d96155aef93bb839edfe0d0cad9f15f3fffe3d5baeac0","cross_cats_sorted":["cs.CR","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-16T13:57:46Z","title_canon_sha256":"16f03b30b8d0085cbd81ec80ec54c9df5d19e560130cf50d341175c70411663e"},"schema_version":"1.0","source":{"id":"1907.07010","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07010","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07010v1","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07010","created_at":"2026-05-17T23:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RYF2KP7R3C2G","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYF2KP7R3C2GTCFL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYF2KP7R","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:93c72a6144d565c0fb4f412a8965c953fa7a80c162defff521dfd4e4b7dcafe2","target":"graph","created_at":"2026-05-17T23:40:28Z","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":"Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstraction, which enables upper layers to operate as if on a synchronous network. This approach yields an asynchronous consensus protocol for fail-stop nodes that may be simpler and more robust than Paxos and its leader-based variants, requiring no common coins and achieving consensus in a constant expected number of rounds. The same approach can be ","authors_text":"Bryan Ford","cross_cats":["cs.CR","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-16T13:57:46Z","title":"Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07010","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:25f58c058d28e8af5db64b5bbb7b7c2800c7f92708433f9f6ee41e289e2967d1","target":"record","created_at":"2026-05-17T23:40:28Z","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":"20d21493c02e3213a66d96155aef93bb839edfe0d0cad9f15f3fffe3d5baeac0","cross_cats_sorted":["cs.CR","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-07-16T13:57:46Z","title_canon_sha256":"16f03b30b8d0085cbd81ec80ec54c9df5d19e560130cf50d341175c70411663e"},"schema_version":"1.0","source":{"id":"1907.07010","kind":"arxiv","version":1}},"canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","first_computed_at":"2026-05-17T23:40:28.361490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:28.361490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oVAAnYzkvFmIidyVDBCfKcL8KaOOetMZEdKYUwz+dD/r9LLjhbmuIf1Zq5Tjja5JJ2b/AMP6H0WtQ3FGjsF5Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:28.362115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07010","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25f58c058d28e8af5db64b5bbb7b7c2800c7f92708433f9f6ee41e289e2967d1","sha256:93c72a6144d565c0fb4f412a8965c953fa7a80c162defff521dfd4e4b7dcafe2"],"state_sha256":"600b0d888fd8fcfb129af0f19288ae28a4de3bcca638c119de759d000e2d5163"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/tCkoeeH3ke/Dcq01JkdkZGU5hdDK9AWDO9t4GpVI6k791Q/Tw2P4svmoj9AGXBhRQjnxHtXSp/F3+O7+NGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:55:48.788377Z","bundle_sha256":"0d4abc0559709c1fbe0ac280484037e09497e9798781c37fc66355ec211efea7"}}