{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DMZKJ5H2ZOQRNT3ZKYMHZHJWIL","short_pith_number":"pith:DMZKJ5H2","canonical_record":{"source":{"id":"1611.07555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T22:18:36Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"12f56c8ad921e3adce81522179a5d9292259e72b664a2b26c3498f1988c31de8","abstract_canon_sha256":"1750fc2f36db851c64f14e264f761820697ed07e223fd2ba6e204241e73bae85"},"schema_version":"1.0"},"canonical_sha256":"1b32a4f4facba116cf7956187c9d3642e113c5de36991f01b9bed50598cd307e","source":{"kind":"arxiv","id":"1611.07555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07555","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07555v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07555","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"DMZKJ5H2ZOQR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMZKJ5H2ZOQRNT3Z","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMZKJ5H2","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DMZKJ5H2ZOQRNT3ZKYMHZHJWIL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T22:18:36Z","cross_cats_sorted":["math.NA","stat.ML"],"title_canon_sha256":"12f56c8ad921e3adce81522179a5d9292259e72b664a2b26c3498f1988c31de8","abstract_canon_sha256":"1750fc2f36db851c64f14e264f761820697ed07e223fd2ba6e204241e73bae85"},"schema_version":"1.0"},"canonical_sha256":"1b32a4f4facba116cf7956187c9d3642e113c5de36991f01b9bed50598cd307e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:00.505440Z","signature_b64":"nRGIWyzZnevN1I8WMUMpGJ0uiP9HlmSAdhNZSJWb0s4DUli1YohFiv4L+PcOI37gHZkGAngf6DeQQlq6VJ4sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b32a4f4facba116cf7956187c9d3642e113c5de36991f01b9bed50598cd307e","last_reissued_at":"2026-05-18T00:57:00.504694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:00.504694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07555","source_version":1,"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:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e37+AopKEPU2NQqjdjnigBNJFUYbWXnmrb+VSOpiz8CSsVBghztuL7cL2A0BSSARKuOJRmXorTJ3XKnxXfp3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:53:47.161832Z"},"content_sha256":"3083333103c39d2d3a7d37a16e70757cdcee3175231d48724760d0fcd9c3ff31","schema_version":"1.0","event_id":"sha256:3083333103c39d2d3a7d37a16e70757cdcee3175231d48724760d0fcd9c3ff31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DMZKJ5H2ZOQRNT3ZKYMHZHJWIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized Distributed Mean Estimation: Accuracy vs Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","stat.ML"],"primary_cat":"cs.DC","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","submitted_at":"2016-11-22T22:18:36Z","abstract_excerpt":"We consider the problem of estimating the arithmetic average of a finite collection of real vectors stored in a distributed fashion across several compute nodes subject to a communication budget constraint. Our analysis does not rely on any statistical assumptions about the source of the vectors. This problem arises as a subproblem in many applications, including reduce-all operations within algorithms for distributed and federated optimization and learning. We propose a flexible family of randomized algorithms exploring the trade-off between expected communication cost and estimation error. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07555","kind":"arxiv","version":1},"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:57:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTgXQu5sAABuS+jKRi9bHtp6sGGYjjOkxj73Jxxt3GxPZWt0cQ546lvMilTETCi3YLQk15OXOkXzUWapzLHtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:53:47.162502Z"},"content_sha256":"9159469a6f048bcee5fa69a6ecf3a12e933344ce4f19336c121302677a8eaead","schema_version":"1.0","event_id":"sha256:9159469a6f048bcee5fa69a6ecf3a12e933344ce4f19336c121302677a8eaead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/bundle.json","state_url":"https://pith.science/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/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-05-24T04:53:47Z","links":{"resolver":"https://pith.science/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL","bundle":"https://pith.science/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/bundle.json","state":"https://pith.science/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMZKJ5H2ZOQRNT3ZKYMHZHJWIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DMZKJ5H2ZOQRNT3ZKYMHZHJWIL","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":"1750fc2f36db851c64f14e264f761820697ed07e223fd2ba6e204241e73bae85","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T22:18:36Z","title_canon_sha256":"12f56c8ad921e3adce81522179a5d9292259e72b664a2b26c3498f1988c31de8"},"schema_version":"1.0","source":{"id":"1611.07555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07555","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07555v1","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07555","created_at":"2026-05-18T00:57:00Z"},{"alias_kind":"pith_short_12","alias_value":"DMZKJ5H2ZOQR","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DMZKJ5H2ZOQRNT3Z","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DMZKJ5H2","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:9159469a6f048bcee5fa69a6ecf3a12e933344ce4f19336c121302677a8eaead","target":"graph","created_at":"2026-05-18T00:57:00Z","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 consider the problem of estimating the arithmetic average of a finite collection of real vectors stored in a distributed fashion across several compute nodes subject to a communication budget constraint. Our analysis does not rely on any statistical assumptions about the source of the vectors. This problem arises as a subproblem in many applications, including reduce-all operations within algorithms for distributed and federated optimization and learning. We propose a flexible family of randomized algorithms exploring the trade-off between expected communication cost and estimation error. O","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","cross_cats":["math.NA","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T22:18:36Z","title":"Randomized Distributed Mean Estimation: Accuracy vs Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07555","kind":"arxiv","version":1},"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:3083333103c39d2d3a7d37a16e70757cdcee3175231d48724760d0fcd9c3ff31","target":"record","created_at":"2026-05-18T00:57:00Z","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":"1750fc2f36db851c64f14e264f761820697ed07e223fd2ba6e204241e73bae85","cross_cats_sorted":["math.NA","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T22:18:36Z","title_canon_sha256":"12f56c8ad921e3adce81522179a5d9292259e72b664a2b26c3498f1988c31de8"},"schema_version":"1.0","source":{"id":"1611.07555","kind":"arxiv","version":1}},"canonical_sha256":"1b32a4f4facba116cf7956187c9d3642e113c5de36991f01b9bed50598cd307e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b32a4f4facba116cf7956187c9d3642e113c5de36991f01b9bed50598cd307e","first_computed_at":"2026-05-18T00:57:00.504694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:00.504694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nRGIWyzZnevN1I8WMUMpGJ0uiP9HlmSAdhNZSJWb0s4DUli1YohFiv4L+PcOI37gHZkGAngf6DeQQlq6VJ4sAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:00.505440Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3083333103c39d2d3a7d37a16e70757cdcee3175231d48724760d0fcd9c3ff31","sha256:9159469a6f048bcee5fa69a6ecf3a12e933344ce4f19336c121302677a8eaead"],"state_sha256":"a539561ab319050b9e6fe3397f4af052784d68019362215c5440d9c464abe408"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vg3KrUBlETr1JhNs+Vf3ML2MYQjtIfUI9RljRB7RB6DLuxdt64M3qJTJJmytwcWTF1NurUijkvG1vlm4roEnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:53:47.166407Z","bundle_sha256":"b1af8ffb75f84a9b34692f52fd4ea6671ecb2b1cf99d1ef78e29495878424807"}}