{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZLN7ZWZWCSHDJHU2SIS6OLLQF3","short_pith_number":"pith:ZLN7ZWZW","schema_version":"1.0","canonical_sha256":"cadbfcdb36148e349e9a9225e72d702eddfd0f48285fa1c0c3b9dd433fa6e51c","source":{"kind":"arxiv","id":"2309.01466","version":1},"attestation_state":"computed","paper":{"title":"Communication Lower Bounds for Cryptographic Broadcast Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Chen-Da Liu-Zhang, Elette Boyle, Erica Blum, Ran Cohen","submitted_at":"2023-09-04T09:24:39Z","abstract_excerpt":"Broadcast protocols enable a set of $n$ parties to agree on the input of a designated sender, even facing attacks by malicious parties. In the honest-majority setting, randomization and cryptography were harnessed to achieve low-communication broadcast with sub-quadratic total communication and balanced sub-linear cost per party. However, comparatively little is known in the dishonest-majority setting. Here, the most communication-efficient constructions are based on Dolev and Strong (SICOMP '83), and sub-quadratic broadcast has not been achieved. On the other hand, the only nontrivial $\\omega"},"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":"2309.01466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-04T09:24:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7d57e1b8a5d1fa1896c1247a2448a954f3693fca3a86bafdbc33c6f4ccf81b45","abstract_canon_sha256":"5ca4a010f2bb42f3aa849f052ccb79e749beed75659c2415d70c1a66dc239068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:38.530379Z","signature_b64":"AFR/Ktw3OTJsvaqvs+ZW2oxFFKdh7xaeS5MM6JTbRarRaWFqql+2vouqQicTN23LjCNCcap0dKwwFOIRBkKUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cadbfcdb36148e349e9a9225e72d702eddfd0f48285fa1c0c3b9dd433fa6e51c","last_reissued_at":"2026-07-05T06:47:38.529915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:38.529915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Lower Bounds for Cryptographic Broadcast Protocols","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Chen-Da Liu-Zhang, Elette Boyle, Erica Blum, Ran Cohen","submitted_at":"2023-09-04T09:24:39Z","abstract_excerpt":"Broadcast protocols enable a set of $n$ parties to agree on the input of a designated sender, even facing attacks by malicious parties. In the honest-majority setting, randomization and cryptography were harnessed to achieve low-communication broadcast with sub-quadratic total communication and balanced sub-linear cost per party. However, comparatively little is known in the dishonest-majority setting. Here, the most communication-efficient constructions are based on Dolev and Strong (SICOMP '83), and sub-quadratic broadcast has not been achieved. On the other hand, the only nontrivial $\\omega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.01466","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2309.01466/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":"2309.01466","created_at":"2026-07-05T06:47:38.529963+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.01466v1","created_at":"2026-07-05T06:47:38.529963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.01466","created_at":"2026-07-05T06:47:38.529963+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLN7ZWZWCSHD","created_at":"2026-07-05T06:47:38.529963+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLN7ZWZWCSHDJHU2","created_at":"2026-07-05T06:47:38.529963+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLN7ZWZW","created_at":"2026-07-05T06:47:38.529963+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/ZLN7ZWZWCSHDJHU2SIS6OLLQF3","json":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3.json","graph_json":"https://pith.science/api/pith-number/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/graph.json","events_json":"https://pith.science/api/pith-number/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/events.json","paper":"https://pith.science/paper/ZLN7ZWZW"},"agent_actions":{"view_html":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3","download_json":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3.json","view_paper":"https://pith.science/paper/ZLN7ZWZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.01466&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/action/storage_attestation","attest_author":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/action/author_attestation","sign_citation":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/action/citation_signature","submit_replication":"https://pith.science/pith/ZLN7ZWZWCSHDJHU2SIS6OLLQF3/action/replication_record"}},"created_at":"2026-07-05T06:47:38.529963+00:00","updated_at":"2026-07-05T06:47:38.529963+00:00"}