{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EQ2NCSV2UE5BEWW7ZQUJTADU7F","short_pith_number":"pith:EQ2NCSV2","canonical_record":{"source":{"id":"1405.1665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-07T16:44:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dbf9c6d3913c6f29d0074691c3dd49b3f68e11010750f5d085410c49f9312a69","abstract_canon_sha256":"459123f9dd2b219f86ee3903ce2e93c24cb6c04f517a1cdadc6aa4f7c2709784"},"schema_version":"1.0"},"canonical_sha256":"2434d14abaa13a125adfcc28998074f953b786df151261abe68a653cde18e0b2","source":{"kind":"arxiv","id":"1405.1665","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1665","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1665v2","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1665","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"EQ2NCSV2UE5B","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ2NCSV2UE5BEWW7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ2NCSV2","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EQ2NCSV2UE5BEWW7ZQUJTADU7F","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-07T16:44:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"dbf9c6d3913c6f29d0074691c3dd49b3f68e11010750f5d085410c49f9312a69","abstract_canon_sha256":"459123f9dd2b219f86ee3903ce2e93c24cb6c04f517a1cdadc6aa4f7c2709784"},"schema_version":"1.0"},"canonical_sha256":"2434d14abaa13a125adfcc28998074f953b786df151261abe68a653cde18e0b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:09.956689Z","signature_b64":"cS5Vlmo6Td+7tx8yFi1TBflEyhPjGedSRc8fyk3xjx+yG+xVKOE0azSTQWDExZ13T1Lb8Eln5gPkCeebb/B9BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2434d14abaa13a125adfcc28998074f953b786df151261abe68a653cde18e0b2","last_reissued_at":"2026-05-18T02:38:09.956109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:09.956109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1665","source_version":2,"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-18T02:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PONp6TZYunI2wMeCsUnGQLpzlCkYs70kmLl5OlE2nZRo564uZiAwAhmx3vGoRlIr1xBrTnBgMUPO1s73AKN/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:55:00.252023Z"},"content_sha256":"fdfab7b45c360846dfba740a8f8341fe9ab82d4f7ddb4b17e32b3eeb1a5a5a11","schema_version":"1.0","event_id":"sha256:fdfab7b45c360846dfba740a8f8341fe9ab82d4f7ddb4b17e32b3eeb1a5a5a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EQ2NCSV2UE5BEWW7ZQUJTADU7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Communication Cost of Distributed Statistical Estimation and Dimensionality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Ankit Garg, Huy L. Nguyen, Tengyu Ma","submitted_at":"2014-05-07T16:44:21Z","abstract_excerpt":"We explore the connection between dimensionality and communication cost in distributed learning problems. Specifically we study the problem of estimating the mean $\\vec{\\theta}$ of an unknown $d$ dimensional gaussian distribution in the distributed setting. In this problem, the samples from the unknown distribution are distributed among $m$ different machines. The goal is to estimate the mean $\\vec{\\theta}$ at the optimal minimax rate while communicating as few bits as possible. We show that in this setting, the communication cost scales linearly in the number of dimensions i.e. one needs to d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1665","kind":"arxiv","version":2},"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-18T02:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veyhbBVPIta8aYpTYoV0v+YLd7T6je903LciFqDrqakI9Fo8/Hkcqrtq9K6nS5GkLitvxfDPkn9uNJEMMObICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:55:00.252381Z"},"content_sha256":"57a38376fbf76008ed550930264e14c2cc1aa15ef172e3b561e674b1a0735f8e","schema_version":"1.0","event_id":"sha256:57a38376fbf76008ed550930264e14c2cc1aa15ef172e3b561e674b1a0735f8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/bundle.json","state_url":"https://pith.science/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/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-04T06:55:00Z","links":{"resolver":"https://pith.science/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F","bundle":"https://pith.science/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/bundle.json","state":"https://pith.science/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQ2NCSV2UE5BEWW7ZQUJTADU7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EQ2NCSV2UE5BEWW7ZQUJTADU7F","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":"459123f9dd2b219f86ee3903ce2e93c24cb6c04f517a1cdadc6aa4f7c2709784","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-07T16:44:21Z","title_canon_sha256":"dbf9c6d3913c6f29d0074691c3dd49b3f68e11010750f5d085410c49f9312a69"},"schema_version":"1.0","source":{"id":"1405.1665","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1665","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1665v2","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1665","created_at":"2026-05-18T02:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"EQ2NCSV2UE5B","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EQ2NCSV2UE5BEWW7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EQ2NCSV2","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:57a38376fbf76008ed550930264e14c2cc1aa15ef172e3b561e674b1a0735f8e","target":"graph","created_at":"2026-05-18T02:38:09Z","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 explore the connection between dimensionality and communication cost in distributed learning problems. Specifically we study the problem of estimating the mean $\\vec{\\theta}$ of an unknown $d$ dimensional gaussian distribution in the distributed setting. In this problem, the samples from the unknown distribution are distributed among $m$ different machines. The goal is to estimate the mean $\\vec{\\theta}$ at the optimal minimax rate while communicating as few bits as possible. We show that in this setting, the communication cost scales linearly in the number of dimensions i.e. one needs to d","authors_text":"Ankit Garg, Huy L. Nguyen, Tengyu Ma","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-07T16:44:21Z","title":"On Communication Cost of Distributed Statistical Estimation and Dimensionality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1665","kind":"arxiv","version":2},"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:fdfab7b45c360846dfba740a8f8341fe9ab82d4f7ddb4b17e32b3eeb1a5a5a11","target":"record","created_at":"2026-05-18T02:38:09Z","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":"459123f9dd2b219f86ee3903ce2e93c24cb6c04f517a1cdadc6aa4f7c2709784","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-07T16:44:21Z","title_canon_sha256":"dbf9c6d3913c6f29d0074691c3dd49b3f68e11010750f5d085410c49f9312a69"},"schema_version":"1.0","source":{"id":"1405.1665","kind":"arxiv","version":2}},"canonical_sha256":"2434d14abaa13a125adfcc28998074f953b786df151261abe68a653cde18e0b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2434d14abaa13a125adfcc28998074f953b786df151261abe68a653cde18e0b2","first_computed_at":"2026-05-18T02:38:09.956109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:09.956109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cS5Vlmo6Td+7tx8yFi1TBflEyhPjGedSRc8fyk3xjx+yG+xVKOE0azSTQWDExZ13T1Lb8Eln5gPkCeebb/B9BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:09.956689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1665","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdfab7b45c360846dfba740a8f8341fe9ab82d4f7ddb4b17e32b3eeb1a5a5a11","sha256:57a38376fbf76008ed550930264e14c2cc1aa15ef172e3b561e674b1a0735f8e"],"state_sha256":"ca716ad5f80e31644a3e5152aeba19d6e9375dfcf9351ef00295444a57b603b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rqk8BaNoO52Zg9YE91iUEuq3X/EvXjjWtR1wmVmG/0hJrdgSJT3EdkdAj0+ixXAK6o3H6CcZCr1XzFNnmrIoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:55:00.254365Z","bundle_sha256":"21e83f2462bc2d1d9c7a1adde57346c75b2b7aae72cf9bfc8926a4b83a07ff31"}}