{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EZRH2VKS4UBDPKNDVW27OGDQVC","short_pith_number":"pith:EZRH2VKS","schema_version":"1.0","canonical_sha256":"26627d5552e50237a9a3adb5f71870a8b0dee520926bc061d74bf18b7c50d7df","source":{"kind":"arxiv","id":"1702.03068","version":3},"attestation_state":"computed","paper":{"title":"DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Michel Raynal, Mikel Larrea, Tyler Crain, Vincent Gramoli","submitted_at":"2017-02-10T05:21:43Z","abstract_excerpt":"This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when its coordinator is faulty, hence the name weak coordinator. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow.\n  The resulting algorithm assumes partial synchrony, is resilience optimal, time optimal and does"},"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":"1702.03068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-10T05:21:43Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"8bb76231ad937fd27228293523069498205ee74d5235b0afb28b28f4be721df0","abstract_canon_sha256":"755f7a4528522bbe2e49550bf09c31b5b1dff74ff301d0a992f28543517005f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.208494Z","signature_b64":"OhoTfqQ1+ZuAG9SvyQfdMaCDGbNMSz0V29BvU9fv4nxaenL472T9AkvN8oMHtb4yBbNVwUVdoSqbwqS9AI7zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26627d5552e50237a9a3adb5f71870a8b0dee520926bc061d74bf18b7c50d7df","last_reissued_at":"2026-05-18T00:09:53.207745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.207745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Michel Raynal, Mikel Larrea, Tyler Crain, Vincent Gramoli","submitted_at":"2017-02-10T05:21:43Z","abstract_excerpt":"This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when its coordinator is faulty, hence the name weak coordinator. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow.\n  The resulting algorithm assumes partial synchrony, is resilience optimal, time optimal and does"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03068","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":"1702.03068","created_at":"2026-05-18T00:09:53.207886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03068v3","created_at":"2026-05-18T00:09:53.207886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03068","created_at":"2026-05-18T00:09:53.207886+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZRH2VKS4UBD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZRH2VKS4UBDPKND","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZRH2VKS","created_at":"2026-05-18T12:31:12.930513+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/EZRH2VKS4UBDPKNDVW27OGDQVC","json":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC.json","graph_json":"https://pith.science/api/pith-number/EZRH2VKS4UBDPKNDVW27OGDQVC/graph.json","events_json":"https://pith.science/api/pith-number/EZRH2VKS4UBDPKNDVW27OGDQVC/events.json","paper":"https://pith.science/paper/EZRH2VKS"},"agent_actions":{"view_html":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC","download_json":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC.json","view_paper":"https://pith.science/paper/EZRH2VKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03068&json=true","fetch_graph":"https://pith.science/api/pith-number/EZRH2VKS4UBDPKNDVW27OGDQVC/graph.json","fetch_events":"https://pith.science/api/pith-number/EZRH2VKS4UBDPKNDVW27OGDQVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC/action/storage_attestation","attest_author":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC/action/author_attestation","sign_citation":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC/action/citation_signature","submit_replication":"https://pith.science/pith/EZRH2VKS4UBDPKNDVW27OGDQVC/action/replication_record"}},"created_at":"2026-05-18T00:09:53.207886+00:00","updated_at":"2026-05-18T00:09:53.207886+00:00"}