{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:T7I6UKXNMCCECZIZ7KA3IEXZTU","short_pith_number":"pith:T7I6UKXN","schema_version":"1.0","canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","source":{"kind":"arxiv","id":"2202.09123","version":2},"attestation_state":"computed","paper":{"title":"Make Every Word Count: Adaptive BA with Fewer Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Idit Keidar, Shir Cohen","submitted_at":"2022-02-18T11:03:36Z","abstract_excerpt":"Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\\leq f\\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in t"},"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":"2202.09123","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-02-18T11:03:36Z","cross_cats_sorted":[],"title_canon_sha256":"c0f9006a4babd60fc44ceab63637ce7bba3cecd848d0906dbd681440863b4d64","abstract_canon_sha256":"bb2da4b639f32758182c1d10b035d3a9114941e1a6e25994d8a3f8485e3fb80c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:14.721517Z","signature_b64":"EsP2ZJInNodbD5BdKI/A+X0K1Xs39L9NUo/EU3mAI34HYE5PLcVzvhreai9reMgt9Po/CCKyWC/gIgoaLM5aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fd1ea2aed6084416519fa81b412f99d3ae28f5177bb232df5b276d1a06756c1","last_reissued_at":"2026-07-05T07:32:14.721039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:14.721039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Make Every Word Count: Adaptive BA with Fewer Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Idit Keidar, Shir Cohen","submitted_at":"2022-02-18T11:03:36Z","abstract_excerpt":"Byzantine Agreement is a key component in many distributed systems. While Dolev and Reischuk have proven a long time ago that quadratic communication complexity is necessary for worst-case runs, the question of what can be done in practically common runs with fewer failures remained open. In this paper we present the first Byzantine Broadcast algorithm with $O(n(f+1))$ communication complexity, where $0\\leq f\\leq t$ is the actual number of process failures in a run. And for BA with strong unanimity, we present the first optimal-resilience algorithm that has linear communication complexity in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09123","kind":"arxiv","version":2},"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/2202.09123/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":"2202.09123","created_at":"2026-07-05T07:32:14.721093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.09123v2","created_at":"2026-07-05T07:32:14.721093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09123","created_at":"2026-07-05T07:32:14.721093+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7I6UKXNMCCE","created_at":"2026-07-05T07:32:14.721093+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7I6UKXNMCCECZIZ","created_at":"2026-07-05T07:32:14.721093+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7I6UKXN","created_at":"2026-07-05T07:32:14.721093+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/T7I6UKXNMCCECZIZ7KA3IEXZTU","json":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU.json","graph_json":"https://pith.science/api/pith-number/T7I6UKXNMCCECZIZ7KA3IEXZTU/graph.json","events_json":"https://pith.science/api/pith-number/T7I6UKXNMCCECZIZ7KA3IEXZTU/events.json","paper":"https://pith.science/paper/T7I6UKXN"},"agent_actions":{"view_html":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU","download_json":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU.json","view_paper":"https://pith.science/paper/T7I6UKXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.09123&json=true","fetch_graph":"https://pith.science/api/pith-number/T7I6UKXNMCCECZIZ7KA3IEXZTU/graph.json","fetch_events":"https://pith.science/api/pith-number/T7I6UKXNMCCECZIZ7KA3IEXZTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/action/storage_attestation","attest_author":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/action/author_attestation","sign_citation":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/action/citation_signature","submit_replication":"https://pith.science/pith/T7I6UKXNMCCECZIZ7KA3IEXZTU/action/replication_record"}},"created_at":"2026-07-05T07:32:14.721093+00:00","updated_at":"2026-07-05T07:32:14.721093+00:00"}