{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6DET52AQHYAG2BXM3IEGDIU2VI","short_pith_number":"pith:6DET52AQ","schema_version":"1.0","canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","source":{"kind":"arxiv","id":"1507.06165","version":3},"attestation_state":"computed","paper":{"title":"Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cheng Wang","submitted_at":"2015-07-22T12:56:55Z","abstract_excerpt":"Given a system with $n > 3t + 1$ processes, where $t$ is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in $O(t)$ expected running time. This improves the $O(n^2)$ expected running time of Abraham, Dolev, and Halpern [PODC 2008]. Furthermore, if $n = (3 + \\varepsilon) t$ for any $\\varepsilon > 0$, our protocol can reach agreement in $O (1 / \\varepsilon)$ expected running time. This improves the result of Feldman and Micali [STOC 1988] (with constant expected running time when $n > 4 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":"1507.06165","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-07-22T12:56:55Z","cross_cats_sorted":[],"title_canon_sha256":"2787536b88fef00980e5a228a031af793cff75af65b09a73becb3d75a49898b5","abstract_canon_sha256":"06de5715a2893ec062b020bf52a6fabed9f5b559f3ac2988ad477aa2c7cf9805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.481215Z","signature_b64":"9anPQzDrqr/VGN45ur56lB1tK5GqlMLUJd1VwU/hhPPuaC5oV7bDJ/bbx8cwsXiGTcdog41F+211eiF9R9NpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","last_reissued_at":"2026-05-18T01:25:56.480574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.480574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Cheng Wang","submitted_at":"2015-07-22T12:56:55Z","abstract_excerpt":"Given a system with $n > 3t + 1$ processes, where $t$ is the tolerated number of faulty ones, we present a fast asynchronous Byzantine agreement protocol that can reach agreement in $O(t)$ expected running time. This improves the $O(n^2)$ expected running time of Abraham, Dolev, and Halpern [PODC 2008]. Furthermore, if $n = (3 + \\varepsilon) t$ for any $\\varepsilon > 0$, our protocol can reach agreement in $O (1 / \\varepsilon)$ expected running time. This improves the result of Feldman and Micali [STOC 1988] (with constant expected running time when $n > 4 t$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06165","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":"1507.06165","created_at":"2026-05-18T01:25:56.480662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06165v3","created_at":"2026-05-18T01:25:56.480662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06165","created_at":"2026-05-18T01:25:56.480662+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DET52AQHYAG","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DET52AQHYAG2BXM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DET52AQ","created_at":"2026-05-18T12:29:07.941421+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/6DET52AQHYAG2BXM3IEGDIU2VI","json":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI.json","graph_json":"https://pith.science/api/pith-number/6DET52AQHYAG2BXM3IEGDIU2VI/graph.json","events_json":"https://pith.science/api/pith-number/6DET52AQHYAG2BXM3IEGDIU2VI/events.json","paper":"https://pith.science/paper/6DET52AQ"},"agent_actions":{"view_html":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI","download_json":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI.json","view_paper":"https://pith.science/paper/6DET52AQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06165&json=true","fetch_graph":"https://pith.science/api/pith-number/6DET52AQHYAG2BXM3IEGDIU2VI/graph.json","fetch_events":"https://pith.science/api/pith-number/6DET52AQHYAG2BXM3IEGDIU2VI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/action/storage_attestation","attest_author":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/action/author_attestation","sign_citation":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/action/citation_signature","submit_replication":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/action/replication_record"}},"created_at":"2026-05-18T01:25:56.480662+00:00","updated_at":"2026-05-18T01:25:56.480662+00:00"}