{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7JV3I3YC7T4UI7QTM3WASBWX4T","short_pith_number":"pith:7JV3I3YC","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"},"canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","source":{"kind":"arxiv","id":"1506.07216","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07216","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07216v3","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07216","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JV3I3YC7T4U","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JV3I3YC7T4UI7QT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JV3I3YC","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7JV3I3YC7T4UI7QTM3WASBWX4T","target":"record","payload":{"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"},"canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","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"},"source_kind":"arxiv","source_id":"1506.07216","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-18T01:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EScFBzNmI+LHsQm8+5h28S2O6hIgAnZhXWBpPIHlY6RtukOolryYLtYBobMePeOJcnUGgMeCgstmlIXExWTlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:03.327480Z"},"content_sha256":"6440af99638b059ee0232548b535fa7c541434fd1ce6c1218429e380b5fe479f","schema_version":"1.0","event_id":"sha256:6440af99638b059ee0232548b535fa7c541434fd1ce6c1218429e380b5fe479f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7JV3I3YC7T4UI7QTM3WASBWX4T","target":"graph","payload":{"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"},"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-18T01:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sV8wGysiWbSaaVLjhs/FavSQWDFL1ZDhtUlv8VjYqwbVkUA1nJmE3yK04sz/FEpLohyetH7llUd41QGTQvA3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:24:03.327829Z"},"content_sha256":"3b2f3b612aa0fe4066e7c0ed935182692c97a01b44fc3013e41ee43db651e88c","schema_version":"1.0","event_id":"sha256:3b2f3b612aa0fe4066e7c0ed935182692c97a01b44fc3013e41ee43db651e88c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/bundle.json","state_url":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/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-04T01:24:03Z","links":{"resolver":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T","bundle":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/bundle.json","state":"https://pith.science/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JV3I3YC7T4UI7QTM3WASBWX4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7JV3I3YC7T4UI7QTM3WASBWX4T","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":"4f3501a0adcaf97a47ee5ad979c2abbf7ae5222edeec7f28afcc9cd2b42b4f10","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T01:01:41Z","title_canon_sha256":"cc8f9d00347d1d8df7c187737da1533f904e914a3494cd4be6c9b1d3c735dff3"},"schema_version":"1.0","source":{"id":"1506.07216","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07216","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07216v3","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07216","created_at":"2026-05-18T01:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JV3I3YC7T4U","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JV3I3YC7T4UI7QT","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JV3I3YC","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:3b2f3b612aa0fe4066e7c0ed935182692c97a01b44fc3013e41ee43db651e88c","target":"graph","created_at":"2026-05-18T01:15:15Z","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":"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 ","authors_text":"Ankit Garg, David P. Woodruff, Huy L. Nguyen, Mark Braverman, Tengyu Ma","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T01:01:41Z","title":"Communication Lower Bounds for Statistical Estimation Problems via a Distributed Data Processing Inequality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07216","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:6440af99638b059ee0232548b535fa7c541434fd1ce6c1218429e380b5fe479f","target":"record","created_at":"2026-05-18T01:15:15Z","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":"4f3501a0adcaf97a47ee5ad979c2abbf7ae5222edeec7f28afcc9cd2b42b4f10","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-24T01:01:41Z","title_canon_sha256":"cc8f9d00347d1d8df7c187737da1533f904e914a3494cd4be6c9b1d3c735dff3"},"schema_version":"1.0","source":{"id":"1506.07216","kind":"arxiv","version":3}},"canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa6bb46f02fcf9447e1366ec0906d7e4cd1ab2026fbe6da27873860666e4dc67","first_computed_at":"2026-05-18T01:15:15.176215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:15.176215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sY9Dr17x5y1gl686CJSm9FxuLG7HDeyRI+69XHdNA4PC+HRv4JqwlfL/Vqb0Tfi5y0gvRs0oLaFFEMo0+2E+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:15.176782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07216","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6440af99638b059ee0232548b535fa7c541434fd1ce6c1218429e380b5fe479f","sha256:3b2f3b612aa0fe4066e7c0ed935182692c97a01b44fc3013e41ee43db651e88c"],"state_sha256":"b1924a3a1e5290fbf6d373e4a0c26ac27dc173008d8f164dadaf087a6785ebbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t97D3vhGiaPkEvwPD1cj3/J202tVevpTSUf2lQB6N3Xbo1wbOu4c5ST29ylxfIogX7E8IQvboWg8OCM9dJtVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:24:03.329824Z","bundle_sha256":"facb5aaec21e63823e0119daf9a601a27a197d6e0eb68d2993fb10b0fb80fabe"}}