{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2ZJ4C2WPAYYU33OGEDW2OAKPMI","short_pith_number":"pith:2ZJ4C2WP","schema_version":"1.0","canonical_sha256":"d653c16acf06314dedc620eda7014f621faeeeeb1500031aba3b08e0907e53f3","source":{"kind":"arxiv","id":"2002.02516","version":5},"attestation_state":"computed","paper":{"title":"Breaking the $O(\\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Aarushi Goel, Elette Boyle, Ran Cohen","submitted_at":"2020-02-06T21:19:32Z","abstract_excerpt":"Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with the best overall communication, the demands of the parties are highly unbalanced: the amortized cost is $\\tilde O(1)$ bits per party, but some parties must send $\\Omega(n)$ bits. In best known balanced protocols, the overall communication is sub-optimal, with each party communicating $\\tilde O(\\sqrt{n})$. In this work, we ask whether asymmetry is inherent 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.02516","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2020-02-06T21:19:32Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7183e79ced9477628067921d3f2a42978355490911d566b76462fe6e5a2b42a0","abstract_canon_sha256":"37d090ea7ea6be7105c59d497b76aebaccf75b50edf42af560d437d784560013"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:09.061645Z","signature_b64":"hibNOIl+9Bpp91VGzPF2N5B1K6w2GOcazhEPpTBXEuFxK8phMI8EaCz4ChtjYk+uDY12Kn70VjC/Fio0YbtHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d653c16acf06314dedc620eda7014f621faeeeeb1500031aba3b08e0907e53f3","last_reissued_at":"2026-07-05T07:03:09.061240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:09.061240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking the $O(\\sqrt n)$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Aarushi Goel, Elette Boyle, Ran Cohen","submitted_at":"2020-02-06T21:19:32Z","abstract_excerpt":"Byzantine agreement (BA), the task of $n$ parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interestingly, in protocols with the best overall communication, the demands of the parties are highly unbalanced: the amortized cost is $\\tilde O(1)$ bits per party, but some parties must send $\\Omega(n)$ bits. In best known balanced protocols, the overall communication is sub-optimal, with each party communicating $\\tilde O(\\sqrt{n})$. In this work, we ask whether asymmetry is inherent fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02516","kind":"arxiv","version":5},"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.02516/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.02516","created_at":"2026-07-05T07:03:09.061290+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.02516v5","created_at":"2026-07-05T07:03:09.061290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02516","created_at":"2026-07-05T07:03:09.061290+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZJ4C2WPAYYU","created_at":"2026-07-05T07:03:09.061290+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZJ4C2WPAYYU33OG","created_at":"2026-07-05T07:03:09.061290+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZJ4C2WP","created_at":"2026-07-05T07:03:09.061290+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/2ZJ4C2WPAYYU33OGEDW2OAKPMI","json":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI.json","graph_json":"https://pith.science/api/pith-number/2ZJ4C2WPAYYU33OGEDW2OAKPMI/graph.json","events_json":"https://pith.science/api/pith-number/2ZJ4C2WPAYYU33OGEDW2OAKPMI/events.json","paper":"https://pith.science/paper/2ZJ4C2WP"},"agent_actions":{"view_html":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI","download_json":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI.json","view_paper":"https://pith.science/paper/2ZJ4C2WP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.02516&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZJ4C2WPAYYU33OGEDW2OAKPMI/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZJ4C2WPAYYU33OGEDW2OAKPMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI/action/storage_attestation","attest_author":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI/action/author_attestation","sign_citation":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI/action/citation_signature","submit_replication":"https://pith.science/pith/2ZJ4C2WPAYYU33OGEDW2OAKPMI/action/replication_record"}},"created_at":"2026-07-05T07:03:09.061290+00:00","updated_at":"2026-07-05T07:03:09.061290+00:00"}