{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QLP73ZCEYXCSUBMY7XGWQ4ZEWG","short_pith_number":"pith:QLP73ZCE","schema_version":"1.0","canonical_sha256":"82dffde444c5c52a0598fdcd687324b1b4d0013c62e798d7cd05eb354e920d82","source":{"kind":"arxiv","id":"2003.13155","version":4},"attestation_state":"computed","paper":{"title":"Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-case Latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang","submitted_at":"2020-03-29T22:53:34Z","abstract_excerpt":"This paper investigates the problem \\textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach agreement when all non-faulty parties have the same input (or in BB/SMR when the sender/leader is non-faulty). Previous result implies a lower bound showing that any Byzantine agreement or broadcast protocol tolerating more than $n/3$ faults must have a good-case latency of at least $\\Delta$, where $\\Delta$ is the assumed maximum message delay bound. Our first re"},"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":"2003.13155","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-03-29T22:53:34Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"53cc44e755e20f8b1bac43f6c24a05a69a334ce090a8b22919e1bbdd707e952f","abstract_canon_sha256":"8d9807b089c3727975fcb4f5551199e92c24ccff8d4e664903d744306fd3ae3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:44.419792Z","signature_b64":"pvMgj+lB6aGbQrWzh32h8jhEZDEVqSVxSLBaBdO8wPBRpJLudGxhjMNa12Citvpjb/GwmJA0xNidM5R1ZqAnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82dffde444c5c52a0598fdcd687324b1b4d0013c62e798d7cd05eb354e920d82","last_reissued_at":"2026-07-05T02:00:44.419379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:44.419379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Agreement, Broadcast and State Machine Replication with Near-optimal Good-case Latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang","submitted_at":"2020-03-29T22:53:34Z","abstract_excerpt":"This paper investigates the problem \\textit{good-case latency} of Byzantine agreement, broadcast and state machine replication in the synchronous authenticated setting. The good-case latency measure captures the time it takes to reach agreement when all non-faulty parties have the same input (or in BB/SMR when the sender/leader is non-faulty). Previous result implies a lower bound showing that any Byzantine agreement or broadcast protocol tolerating more than $n/3$ faults must have a good-case latency of at least $\\Delta$, where $\\Delta$ is the assumed maximum message delay bound. Our first re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13155","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.13155/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.13155","created_at":"2026-07-05T02:00:44.419435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.13155v4","created_at":"2026-07-05T02:00:44.419435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13155","created_at":"2026-07-05T02:00:44.419435+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLP73ZCEYXCS","created_at":"2026-07-05T02:00:44.419435+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLP73ZCEYXCSUBMY","created_at":"2026-07-05T02:00:44.419435+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLP73ZCE","created_at":"2026-07-05T02:00:44.419435+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/QLP73ZCEYXCSUBMY7XGWQ4ZEWG","json":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG.json","graph_json":"https://pith.science/api/pith-number/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/graph.json","events_json":"https://pith.science/api/pith-number/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/events.json","paper":"https://pith.science/paper/QLP73ZCE"},"agent_actions":{"view_html":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG","download_json":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG.json","view_paper":"https://pith.science/paper/QLP73ZCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.13155&json=true","fetch_graph":"https://pith.science/api/pith-number/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/graph.json","fetch_events":"https://pith.science/api/pith-number/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/action/storage_attestation","attest_author":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/action/author_attestation","sign_citation":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/action/citation_signature","submit_replication":"https://pith.science/pith/QLP73ZCEYXCSUBMY7XGWQ4ZEWG/action/replication_record"}},"created_at":"2026-07-05T02:00:44.419435+00:00","updated_at":"2026-07-05T02:00:44.419435+00:00"}