{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WZHQRF5TEXWZKVVFKLDWNDIK4Z","short_pith_number":"pith:WZHQRF5T","canonical_record":{"source":{"id":"1611.00429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-02T00:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"6fe80dffbdf1ba656f9945d01ead5ba287df55ca5f0469cf912e4b6722ccfa68","abstract_canon_sha256":"12bbba583bca6df5a697093a3c80d29d96dc49a8e57b3f3b8b070f9e266ccfab"},"schema_version":"1.0"},"canonical_sha256":"b64f0897b325ed9556a552c7668d0ae65d94f4c61f1ad5cfa5c5bf96a3546f8c","source":{"kind":"arxiv","id":"1611.00429","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00429","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00429v3","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00429","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"WZHQRF5TEXWZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WZHQRF5TEXWZKVVF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WZHQRF5T","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WZHQRF5TEXWZKVVFKLDWNDIK4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-02T00:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"6fe80dffbdf1ba656f9945d01ead5ba287df55ca5f0469cf912e4b6722ccfa68","abstract_canon_sha256":"12bbba583bca6df5a697093a3c80d29d96dc49a8e57b3f3b8b070f9e266ccfab"},"schema_version":"1.0"},"canonical_sha256":"b64f0897b325ed9556a552c7668d0ae65d94f4c61f1ad5cfa5c5bf96a3546f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.461529Z","signature_b64":"aDOAwoRSebfwHKcOLwSGQLsEpiQxeH9UKeGbPe+BWRGwt9wGPYCa8/y8Huh3/GBBXX21C1+2DHElbkbm04Z2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b64f0897b325ed9556a552c7668d0ae65d94f4c61f1ad5cfa5c5bf96a3546f8c","last_reissued_at":"2026-05-18T00:34:31.461091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.461091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00429","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrxq/H+pFvk50CNFeHqOAY5rM12VrpATRsYVy9XbDxDnL3hfqR34TCrcEYGijUhhTK1rMdNLcbl/dipqcrlKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:11:38.002357Z"},"content_sha256":"2eb949bb70703eca1ebff8d528beb4dd512741b87556588654d897d09cf3e3ee","schema_version":"1.0","event_id":"sha256:2eb949bb70703eca1ebff8d528beb4dd512741b87556588654d897d09cf3e3ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WZHQRF5TEXWZKVVFKLDWNDIK4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Mean Estimation with Limited Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ananda Theertha Suresh, Felix X. Yu, H. Brendan McMahan, Sanjiv Kumar","submitted_at":"2016-11-02T00:16:18Z","abstract_excerpt":"Motivated by the need for distributed learning and optimization algorithms with low communication cost, we study communication efficient algorithms for distributed mean estimation. Unlike previous works, we make no probabilistic assumptions on the data. We first show that for $d$ dimensional data with $n$ clients, a naive stochastic binary rounding approach yields a mean squared error (MSE) of $\\Theta(d/n)$ and uses a constant number of bits per dimension per client. We then extend this naive algorithm in two ways: we show that applying a structured random rotation before quantization reduces "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00429","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBoTokFFzCPVEuajLC1h3jN02fkO5FcCnNDrGfW5ZlYDy4GUYPUSXIGIdUCWFaNVtC87wtTO6zutOqnItId5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:11:38.002717Z"},"content_sha256":"c49afb959c6a90e06729cae2ca0744470499951b680822c6a88e2b48c26275d9","schema_version":"1.0","event_id":"sha256:c49afb959c6a90e06729cae2ca0744470499951b680822c6a88e2b48c26275d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/bundle.json","state_url":"https://pith.science/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T23:11:38Z","links":{"resolver":"https://pith.science/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z","bundle":"https://pith.science/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/bundle.json","state":"https://pith.science/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZHQRF5TEXWZKVVFKLDWNDIK4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WZHQRF5TEXWZKVVFKLDWNDIK4Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"12bbba583bca6df5a697093a3c80d29d96dc49a8e57b3f3b8b070f9e266ccfab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-02T00:16:18Z","title_canon_sha256":"6fe80dffbdf1ba656f9945d01ead5ba287df55ca5f0469cf912e4b6722ccfa68"},"schema_version":"1.0","source":{"id":"1611.00429","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00429","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00429v3","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00429","created_at":"2026-05-18T00:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"WZHQRF5TEXWZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WZHQRF5TEXWZKVVF","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WZHQRF5T","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:c49afb959c6a90e06729cae2ca0744470499951b680822c6a88e2b48c26275d9","target":"graph","created_at":"2026-05-18T00:34:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Motivated by the need for distributed learning and optimization algorithms with low communication cost, we study communication efficient algorithms for distributed mean estimation. Unlike previous works, we make no probabilistic assumptions on the data. We first show that for $d$ dimensional data with $n$ clients, a naive stochastic binary rounding approach yields a mean squared error (MSE) of $\\Theta(d/n)$ and uses a constant number of bits per dimension per client. We then extend this naive algorithm in two ways: we show that applying a structured random rotation before quantization reduces ","authors_text":"Ananda Theertha Suresh, Felix X. Yu, H. Brendan McMahan, Sanjiv Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-02T00:16:18Z","title":"Distributed Mean Estimation with Limited Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00429","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2eb949bb70703eca1ebff8d528beb4dd512741b87556588654d897d09cf3e3ee","target":"record","created_at":"2026-05-18T00:34:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"12bbba583bca6df5a697093a3c80d29d96dc49a8e57b3f3b8b070f9e266ccfab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-02T00:16:18Z","title_canon_sha256":"6fe80dffbdf1ba656f9945d01ead5ba287df55ca5f0469cf912e4b6722ccfa68"},"schema_version":"1.0","source":{"id":"1611.00429","kind":"arxiv","version":3}},"canonical_sha256":"b64f0897b325ed9556a552c7668d0ae65d94f4c61f1ad5cfa5c5bf96a3546f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b64f0897b325ed9556a552c7668d0ae65d94f4c61f1ad5cfa5c5bf96a3546f8c","first_computed_at":"2026-05-18T00:34:31.461091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:31.461091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDOAwoRSebfwHKcOLwSGQLsEpiQxeH9UKeGbPe+BWRGwt9wGPYCa8/y8Huh3/GBBXX21C1+2DHElbkbm04Z2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:31.461529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00429","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2eb949bb70703eca1ebff8d528beb4dd512741b87556588654d897d09cf3e3ee","sha256:c49afb959c6a90e06729cae2ca0744470499951b680822c6a88e2b48c26275d9"],"state_sha256":"e4ffdb2f7ef72356e758f6ca15a7cf6d705ef4afc109f5d3d6b7d15625528844"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMiRfTbTLdz2upoX4nqEXa3VHfugF+btWt2VxCfa5s0+0MZpldgNqE14G3HkmUJTQwBRoWMAy0O2H6B8UHhvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:11:38.004671Z","bundle_sha256":"10216dec08bc14cfeceaecfa156267bf930e80963dd44286a16d1f4bd40c331b"}}