{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7IJUXCPWAJ4WSTDTENG3PZFLM6","short_pith_number":"pith:7IJUXCPW","schema_version":"1.0","canonical_sha256":"fa134b89f60279694c73234db7e4ab67aba423c41ec54094f0c48fb97fbe09aa","source":{"kind":"arxiv","id":"2002.08958","version":3},"attestation_state":"computed","paper":{"title":"Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Egor Shulgin, Mher Safaryan, Peter Richt\\'arik","submitted_at":"2020-02-20T17:20:51Z","abstract_excerpt":"In order to mitigate the high communication cost in distributed and federated learning, various vector compression schemes, such as quantization, sparsification and dithering, have become very popular. In designing a compression method, one aims to communicate as few bits as possible, which minimizes the cost per communication round, while at the same time attempting to impart as little distortion (variance) to the communicated messages as possible, which minimizes the adverse effect of the compression on the overall number of communication rounds. However, intuitively, these two goals are fun"},"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.08958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-20T17:20:51Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT","math.OC","stat.ML"],"title_canon_sha256":"992faec914e41953c52520ec7e6e3e981783af850556b3733d87f28ba6b509ec","abstract_canon_sha256":"4803a169e22d75e3f8606bc120e82dd92a127581e3835712d3504ab80ec92c28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:43.386816Z","signature_b64":"MHOKr7roQ7yvTk11cyreJgwl2cceuNwuH5FN0Dguw8nT9pE6FGAVM2sK7z2sOpNF4FLrrUAzBqDdBzfoyCnODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa134b89f60279694c73234db7e4ab67aba423c41ec54094f0c48fb97fbe09aa","last_reissued_at":"2026-07-05T02:36:43.386306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:43.386306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Principle for Communication Compression in Distributed and Federated Learning and the Search for an Optimal Compressor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Egor Shulgin, Mher Safaryan, Peter Richt\\'arik","submitted_at":"2020-02-20T17:20:51Z","abstract_excerpt":"In order to mitigate the high communication cost in distributed and federated learning, various vector compression schemes, such as quantization, sparsification and dithering, have become very popular. In designing a compression method, one aims to communicate as few bits as possible, which minimizes the cost per communication round, while at the same time attempting to impart as little distortion (variance) to the communicated messages as possible, which minimizes the adverse effect of the compression on the overall number of communication rounds. However, intuitively, these two goals are fun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.08958","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.08958/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.08958","created_at":"2026-07-05T02:36:43.386392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.08958v3","created_at":"2026-07-05T02:36:43.386392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.08958","created_at":"2026-07-05T02:36:43.386392+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IJUXCPWAJ4W","created_at":"2026-07-05T02:36:43.386392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IJUXCPWAJ4WSTDT","created_at":"2026-07-05T02:36:43.386392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IJUXCPW","created_at":"2026-07-05T02:36:43.386392+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/7IJUXCPWAJ4WSTDTENG3PZFLM6","json":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6.json","graph_json":"https://pith.science/api/pith-number/7IJUXCPWAJ4WSTDTENG3PZFLM6/graph.json","events_json":"https://pith.science/api/pith-number/7IJUXCPWAJ4WSTDTENG3PZFLM6/events.json","paper":"https://pith.science/paper/7IJUXCPW"},"agent_actions":{"view_html":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6","download_json":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6.json","view_paper":"https://pith.science/paper/7IJUXCPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.08958&json=true","fetch_graph":"https://pith.science/api/pith-number/7IJUXCPWAJ4WSTDTENG3PZFLM6/graph.json","fetch_events":"https://pith.science/api/pith-number/7IJUXCPWAJ4WSTDTENG3PZFLM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6/action/storage_attestation","attest_author":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6/action/author_attestation","sign_citation":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6/action/citation_signature","submit_replication":"https://pith.science/pith/7IJUXCPWAJ4WSTDTENG3PZFLM6/action/replication_record"}},"created_at":"2026-07-05T02:36:43.386392+00:00","updated_at":"2026-07-05T02:36:43.386392+00:00"}