{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PADSMFH3JR2L2W2ZFDBDDQ22UE","short_pith_number":"pith:PADSMFH3","schema_version":"1.0","canonical_sha256":"78072614fb4c74bd5b5928c231c35aa1134f7515830fe63926b9b6c18fea8a64","source":{"kind":"arxiv","id":"2002.06545","version":3},"attestation_state":"computed","paper":{"title":"Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP","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":"2020-02-16T09:23:03Z","abstract_excerpt":"King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience (first in the synchronous model and then with eventual-synchrony). Yet the question of asynchronous sub-quadratic Byzantine Agreement remained open. To the best of our knowledge, we are the first to answer this question in the affirmative. A key component of our solution is a shared coin algorithm based on a VRF. A second essential ingredient is VRF-based committee sampling, which we fo"},"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":"2002.06545","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-02-16T09:23:03Z","cross_cats_sorted":[],"title_canon_sha256":"501aeb2c91c30bc72cd707b4c0886e1d3c4746aa92a4e7b72310f4a34ec52b0a","abstract_canon_sha256":"2eab51d22fcfe5fb6b050399995a0c7f27a8bf4759c1b588dd0849be5a266599"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:57.221977Z","signature_b64":"7Bd5yS1j/KuJTP0lQITeXmXbu/bdza1WePmrFoH+nmPWpH/FKHuqaph+b+FkuWhG/oZm4yMFeERlKhfe98ejBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78072614fb4c74bd5b5928c231c35aa1134f7515830fe63926b9b6c18fea8a64","last_reissued_at":"2026-07-05T01:23:57.221587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:57.221587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP","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":"2020-02-16T09:23:03Z","abstract_excerpt":"King and Saia were the first to break the quadratic word complexity bound for Byzantine Agreement in synchronous systems against an adaptive adversary, and Algorand broke this bound with near-optimal resilience (first in the synchronous model and then with eventual-synchrony). Yet the question of asynchronous sub-quadratic Byzantine Agreement remained open. To the best of our knowledge, we are the first to answer this question in the affirmative. A key component of our solution is a shared coin algorithm based on a VRF. A second essential ingredient is VRF-based committee sampling, which we fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.06545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.06545/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":"2002.06545","created_at":"2026-07-05T01:23:57.221636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.06545v3","created_at":"2026-07-05T01:23:57.221636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.06545","created_at":"2026-07-05T01:23:57.221636+00:00"},{"alias_kind":"pith_short_12","alias_value":"PADSMFH3JR2L","created_at":"2026-07-05T01:23:57.221636+00:00"},{"alias_kind":"pith_short_16","alias_value":"PADSMFH3JR2L2W2Z","created_at":"2026-07-05T01:23:57.221636+00:00"},{"alias_kind":"pith_short_8","alias_value":"PADSMFH3","created_at":"2026-07-05T01:23:57.221636+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/PADSMFH3JR2L2W2ZFDBDDQ22UE","json":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE.json","graph_json":"https://pith.science/api/pith-number/PADSMFH3JR2L2W2ZFDBDDQ22UE/graph.json","events_json":"https://pith.science/api/pith-number/PADSMFH3JR2L2W2ZFDBDDQ22UE/events.json","paper":"https://pith.science/paper/PADSMFH3"},"agent_actions":{"view_html":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE","download_json":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE.json","view_paper":"https://pith.science/paper/PADSMFH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.06545&json=true","fetch_graph":"https://pith.science/api/pith-number/PADSMFH3JR2L2W2ZFDBDDQ22UE/graph.json","fetch_events":"https://pith.science/api/pith-number/PADSMFH3JR2L2W2ZFDBDDQ22UE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE/action/storage_attestation","attest_author":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE/action/author_attestation","sign_citation":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE/action/citation_signature","submit_replication":"https://pith.science/pith/PADSMFH3JR2L2W2ZFDBDDQ22UE/action/replication_record"}},"created_at":"2026-07-05T01:23:57.221636+00:00","updated_at":"2026-07-05T01:23:57.221636+00:00"}