{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5FUJWLEA6HGYNTLB6UGR5AFHRW","short_pith_number":"pith:5FUJWLEA","schema_version":"1.0","canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","source":{"kind":"arxiv","id":"1811.01332","version":1},"attestation_state":"computed","paper":{"title":"Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham","submitted_at":"2018-11-04T07:44:50Z","abstract_excerpt":"We provide a new protocol for Validated Asynchronous Byzantine Agreement. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting. Our protocol can withstand the optimal number $f<n/3$ of Byzantine failures and reaches agreement in the asymptotically optimal expected $O(1)$ running time. Honest parties in our protocol send only an expected $O(n^2)$ messages where each message contains a value and a constant number of signatures. Hence our total expected communicat"},"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":"1811.01332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-04T07:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"f6aba7a270aaccd4e6194231738efd1cd1d34940472e489517f918d250a2ee83","abstract_canon_sha256":"51907eae3cc3db6283d4a9d8ce7bdd1caa8dc71a541fc68064c64d2ee8d275ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.609786Z","signature_b64":"y3de/AuMDAkVRzUP21DfLI9txkZcdKOfiWqRGFGppO3PGh9UabWoBhXcWD7dpxE8NRd6cDF6UtAWEo+lksljBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9689b2c80f1cd86cd61f50d1e80a78da7c6097e522e2c332febbe16174254ed","last_reissued_at":"2026-05-18T00:01:34.609243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.609243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham","submitted_at":"2018-11-04T07:44:50Z","abstract_excerpt":"We provide a new protocol for Validated Asynchronous Byzantine Agreement. Validated (multi-valued) Asynchronous Byzantine Agreement is a key building block in constructing Atomic Broadcast and fault-tolerant state machine replication in the asynchronous setting. Our protocol can withstand the optimal number $f<n/3$ of Byzantine failures and reaches agreement in the asymptotically optimal expected $O(1)$ running time. Honest parties in our protocol send only an expected $O(n^2)$ messages where each message contains a value and a constant number of signatures. Hence our total expected communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01332","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":"1811.01332","created_at":"2026-05-18T00:01:34.609329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01332v1","created_at":"2026-05-18T00:01:34.609329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01332","created_at":"2026-05-18T00:01:34.609329+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FUJWLEA6HGY","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FUJWLEA6HGYNTLB","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FUJWLEA","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.07010","citing_title":"Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW","json":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW.json","graph_json":"https://pith.science/api/pith-number/5FUJWLEA6HGYNTLB6UGR5AFHRW/graph.json","events_json":"https://pith.science/api/pith-number/5FUJWLEA6HGYNTLB6UGR5AFHRW/events.json","paper":"https://pith.science/paper/5FUJWLEA"},"agent_actions":{"view_html":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW","download_json":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW.json","view_paper":"https://pith.science/paper/5FUJWLEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01332&json=true","fetch_graph":"https://pith.science/api/pith-number/5FUJWLEA6HGYNTLB6UGR5AFHRW/graph.json","fetch_events":"https://pith.science/api/pith-number/5FUJWLEA6HGYNTLB6UGR5AFHRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/action/storage_attestation","attest_author":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/action/author_attestation","sign_citation":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/action/citation_signature","submit_replication":"https://pith.science/pith/5FUJWLEA6HGYNTLB6UGR5AFHRW/action/replication_record"}},"created_at":"2026-05-18T00:01:34.609329+00:00","updated_at":"2026-05-18T00:01:34.609329+00:00"}