{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6DET52AQHYAG2BXM3IEGDIU2VI","short_pith_number":"pith:6DET52AQ","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"},"canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","source":{"kind":"arxiv","id":"1507.06165","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06165","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06165v3","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06165","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"6DET52AQHYAG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6DET52AQHYAG2BXM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6DET52AQ","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6DET52AQHYAG2BXM3IEGDIU2VI","target":"record","payload":{"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"},"canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","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"},"source_kind":"arxiv","source_id":"1507.06165","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74U7kbE2T8J5WVQwlOn/QF9tqsnfEiSB0Hisp+tEVcQHsC9b/qRLXROXzkvmHF1N93wVkVEXtSAEBhvQ+llpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:40.069757Z"},"content_sha256":"8052f105e6b11ffbeb83c330383a2c81f44c7c1b3fa083be06df1ac98fff9d25","schema_version":"1.0","event_id":"sha256:8052f105e6b11ffbeb83c330383a2c81f44c7c1b3fa083be06df1ac98fff9d25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6DET52AQHYAG2BXM3IEGDIU2VI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ld/bHFPHNsYa6vLftxJak+kU3B/Xe33eThzlKOvJxAuUmAv3s1mgaWOJxOgDNkWIJBePkW10VYtqQQHQJRq6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:40.070361Z"},"content_sha256":"0697d2dc63bfea4c2b4a67a7d1153e34c051a90b6ac52c683653946924ccde8e","schema_version":"1.0","event_id":"sha256:0697d2dc63bfea4c2b4a67a7d1153e34c051a90b6ac52c683653946924ccde8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/bundle.json","state_url":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6DET52AQHYAG2BXM3IEGDIU2VI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T18:22:40Z","links":{"resolver":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI","bundle":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/bundle.json","state":"https://pith.science/pith/6DET52AQHYAG2BXM3IEGDIU2VI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6DET52AQHYAG2BXM3IEGDIU2VI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6DET52AQHYAG2BXM3IEGDIU2VI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"06de5715a2893ec062b020bf52a6fabed9f5b559f3ac2988ad477aa2c7cf9805","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-07-22T12:56:55Z","title_canon_sha256":"2787536b88fef00980e5a228a031af793cff75af65b09a73becb3d75a49898b5"},"schema_version":"1.0","source":{"id":"1507.06165","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06165","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06165v3","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06165","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"6DET52AQHYAG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6DET52AQHYAG2BXM","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6DET52AQ","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:0697d2dc63bfea4c2b4a67a7d1153e34c051a90b6ac52c683653946924ccde8e","target":"graph","created_at":"2026-05-18T01:25:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$).","authors_text":"Cheng Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-07-22T12:56:55Z","title":"Asynchronous Byzantine Agreement with Optimal Resilience and Linear Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06165","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8052f105e6b11ffbeb83c330383a2c81f44c7c1b3fa083be06df1ac98fff9d25","target":"record","created_at":"2026-05-18T01:25:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"06de5715a2893ec062b020bf52a6fabed9f5b559f3ac2988ad477aa2c7cf9805","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2015-07-22T12:56:55Z","title_canon_sha256":"2787536b88fef00980e5a228a031af793cff75af65b09a73becb3d75a49898b5"},"schema_version":"1.0","source":{"id":"1507.06165","kind":"arxiv","version":3}},"canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0c93ee8103e006d06ecda0861a29aaa0e1b42fbc8f37c4f6e2f0114d4be857a","first_computed_at":"2026-05-18T01:25:56.480574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.480574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9anPQzDrqr/VGN45ur56lB1tK5GqlMLUJd1VwU/hhPPuaC5oV7bDJ/bbx8cwsXiGTcdog41F+211eiF9R9NpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.481215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06165","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8052f105e6b11ffbeb83c330383a2c81f44c7c1b3fa083be06df1ac98fff9d25","sha256:0697d2dc63bfea4c2b4a67a7d1153e34c051a90b6ac52c683653946924ccde8e"],"state_sha256":"546288af68b0c78cb2d42d26a0759d1325a7fa704fa995c892aeecc6167250ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38LjGAeQR2vu8jynFQfOAPFybaflCIryrslL0NifxSAcC329V7uvivOGrsw0fCLqE7jEzkOE848QS8O4igB2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:22:40.074478Z","bundle_sha256":"4f53d7b1bc37b2620322d14f31f7e272dbdac27f809ad7b5bc39ef569de03294"}}