{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7JV3I3YC7T4UI7QTM3WASBWX4T","short_pith_number":"pith:7JV3I3YC","schema_version":"1.0","canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","source":{"kind":"arxiv","id":"1506.07216","version":3},"attestation_state":"computed","paper":{"title":"Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankit Garg, David P. Woodruff, Huy L. Nguyen, Mark Braverman, Tengyu Ma","submitted_at":"2015-06-24T01:01:41Z","abstract_excerpt":"We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions. In the distributed sparse Gaussian mean estimation problem, each of the $m$ machines receives $n$ data points from a $d$-dimensional Gaussian distribution with unknown mean $\\theta$ which is promised to be $k$-sparse. The machines communicate by message passing and aim to estimate the mean $\\theta$. We provide a tight (up to logarithmic factors) tradeoff between the estimation error and the number of bits communicated between the machines. This directly "},"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.07216","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T01:01:41Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"cc8f9d00347d1d8df7c187737da1533f904e914a3494cd4be6c9b1d3c735dff3","abstract_canon_sha256":"4f3501a0adcaf97a47ee5ad979c2abbf7ae5222edeec7f28afcc9cd2b42b4f10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:15.176782Z","signature_b64":"sY9Dr17x5y1gl686CJSm9FxuLG7HDeyRI+69XHdNA4PC+HRv4JqwlfL/Vqb0Tfi5y0gvRs0oLaFFEMo0+2E+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","last_reissued_at":"2026-05-18T01:15:15.176215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:15.176215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankit Garg, David P. Woodruff, Huy L. Nguyen, Mark Braverman, Tengyu Ma","submitted_at":"2015-06-24T01:01:41Z","abstract_excerpt":"We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions. In the distributed sparse Gaussian mean estimation problem, each of the $m$ machines receives $n$ data points from a $d$-dimensional Gaussian distribution with unknown mean $\\theta$ which is promised to be $k$-sparse. The machines communicate by message passing and aim to estimate the mean $\\theta$. We provide a tight (up to logarithmic factors) tradeoff between the estimation error and the number of bits communicated between the machines. This directly "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07216","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.07216","created_at":"2026-05-18T01:15:15.176306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07216v3","created_at":"2026-05-18T01:15:15.176306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07216","created_at":"2026-05-18T01:15:15.176306+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JV3I3YC7T4U","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JV3I3YC7T4UI7QT","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JV3I3YC","created_at":"2026-05-18T12:29:10.953037+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/7JV3I3YC7T4UI7QTM3WASBWX4T","json":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T.json","graph_json":"https://pith.science/api/pith-number/7JV3I3YC7T4UI7QTM3WASBWX4T/graph.json","events_json":"https://pith.science/api/pith-number/7JV3I3YC7T4UI7QTM3WASBWX4T/events.json","paper":"https://pith.science/paper/7JV3I3YC"},"agent_actions":{"view_html":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T","download_json":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T.json","view_paper":"https://pith.science/paper/7JV3I3YC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07216&json=true","fetch_graph":"https://pith.science/api/pith-number/7JV3I3YC7T4UI7QTM3WASBWX4T/graph.json","fetch_events":"https://pith.science/api/pith-number/7JV3I3YC7T4UI7QTM3WASBWX4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/action/storage_attestation","attest_author":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/action/author_attestation","sign_citation":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/action/citation_signature","submit_replication":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/action/replication_record"}},"created_at":"2026-05-18T01:15:15.176306+00:00","updated_at":"2026-05-18T01:15:15.176306+00:00"}