{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RYF2KP7R3C2GTCFLUJMUAD3CIJ","short_pith_number":"pith:RYF2KP7R","schema_version":"1.0","canonical_sha256":"8e0ba53ff1d8b46988aba259400f624251b72dbe5f8d95c0c80dcf10387a77e5","source":{"kind":"arxiv","id":"1907.07010","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.07010","created_at":"2026-05-17T23:40:28.361557+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07010v1","created_at":"2026-05-17T23:40:28.361557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07010","created_at":"2026-05-17T23:40:28.361557+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYF2KP7R3C2G","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYF2KP7R3C2GTCFL","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYF2KP7R","created_at":"2026-05-18T12:33:27.125529+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/RYF2KP7R3C2GTCFLUJMUAD3CIJ","json":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ.json","graph_json":"https://pith.science/api/pith-number/RYF2KP7R3C2GTCFLUJMUAD3CIJ/graph.json","events_json":"https://pith.science/api/pith-number/RYF2KP7R3C2GTCFLUJMUAD3CIJ/events.json","paper":"https://pith.science/paper/RYF2KP7R"},"agent_actions":{"view_html":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ","download_json":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ.json","view_paper":"https://pith.science/paper/RYF2KP7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07010&json=true","fetch_graph":"https://pith.science/api/pith-number/RYF2KP7R3C2GTCFLUJMUAD3CIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RYF2KP7R3C2GTCFLUJMUAD3CIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/action/storage_attestation","attest_author":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/action/author_attestation","sign_citation":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/action/citation_signature","submit_replication":"https://pith.science/pith/RYF2KP7R3C2GTCFLUJMUAD3CIJ/action/replication_record"}},"created_at":"2026-05-17T23:40:28.361557+00:00","updated_at":"2026-05-17T23:40:28.361557+00:00"}