{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GVV3GOOHUDZMQI6PBLACRK3WPU","short_pith_number":"pith:GVV3GOOH","schema_version":"1.0","canonical_sha256":"356bb339c7a0f2c823cf0ac028ab767d2d547e0a964de8a338b5ba96218641fc","source":{"kind":"arxiv","id":"1506.00290","version":3},"attestation_state":"computed","paper":{"title":"Compressing Communication in Distributed Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ilan Komargodski, Yael Tauman Kalai","submitted_at":"2015-05-31T21:00:39Z","abstract_excerpt":"We show how to compress communication in selection protocols, where the goal is to agree on a sequence of random bits using only a broadcast channel. More specifically, we present a generic method for converting any selection protocol, into another selection protocol where each message is ``short'' while preserving the same number of rounds, the same output distribution, and the same resilience to error. Assuming that the output of the protocol lies in some universe of size $M$, in our resulting protocol each message consists of only $\\mathsf{polylog}(M,n,d)$ many bits, where $n$ is the number"},"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":"1506.00290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-31T21:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"f882df1dde1e5c7c7a709e65adc79b844929e02e65c97dcf559c9d76a1288285","abstract_canon_sha256":"602d31cd51a66517958dc6e891891098f688bfeebcd0223362caa5bdd3c7052d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:14.982943Z","signature_b64":"12MKDqGGJ+B1nF2FP7vdemBCwATJoC0ZPXgimTiQR5tnclUZlANrGuKL0fNF2WUtG/6EJthaLsPcrBmovh8CBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"356bb339c7a0f2c823cf0ac028ab767d2d547e0a964de8a338b5ba96218641fc","last_reissued_at":"2026-05-18T00:16:14.982342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:14.982342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing Communication in Distributed Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ilan Komargodski, Yael Tauman Kalai","submitted_at":"2015-05-31T21:00:39Z","abstract_excerpt":"We show how to compress communication in selection protocols, where the goal is to agree on a sequence of random bits using only a broadcast channel. More specifically, we present a generic method for converting any selection protocol, into another selection protocol where each message is ``short'' while preserving the same number of rounds, the same output distribution, and the same resilience to error. Assuming that the output of the protocol lies in some universe of size $M$, in our resulting protocol each message consists of only $\\mathsf{polylog}(M,n,d)$ many bits, where $n$ is the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00290","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":"1506.00290","created_at":"2026-05-18T00:16:14.982420+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00290v3","created_at":"2026-05-18T00:16:14.982420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00290","created_at":"2026-05-18T00:16:14.982420+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVV3GOOHUDZM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVV3GOOHUDZMQI6P","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVV3GOOH","created_at":"2026-05-18T12:29:22.688609+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/GVV3GOOHUDZMQI6PBLACRK3WPU","json":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU.json","graph_json":"https://pith.science/api/pith-number/GVV3GOOHUDZMQI6PBLACRK3WPU/graph.json","events_json":"https://pith.science/api/pith-number/GVV3GOOHUDZMQI6PBLACRK3WPU/events.json","paper":"https://pith.science/paper/GVV3GOOH"},"agent_actions":{"view_html":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU","download_json":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU.json","view_paper":"https://pith.science/paper/GVV3GOOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00290&json=true","fetch_graph":"https://pith.science/api/pith-number/GVV3GOOHUDZMQI6PBLACRK3WPU/graph.json","fetch_events":"https://pith.science/api/pith-number/GVV3GOOHUDZMQI6PBLACRK3WPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU/action/storage_attestation","attest_author":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU/action/author_attestation","sign_citation":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU/action/citation_signature","submit_replication":"https://pith.science/pith/GVV3GOOHUDZMQI6PBLACRK3WPU/action/replication_record"}},"created_at":"2026-05-18T00:16:14.982420+00:00","updated_at":"2026-05-18T00:16:14.982420+00:00"}