{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FFSKMYMNGTFPJ7FOHUMFA7S2BV","short_pith_number":"pith:FFSKMYMN","canonical_record":{"source":{"id":"1209.4129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-19T01:27:40Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"3d3a06ab3cb29facf48fa293a7836f66c117573ef7b153348708fd3972a04927","abstract_canon_sha256":"7be0cedc752b428d9f0aecff5edb8c4f48f2e3a77507e3e2c0443bd1f3069d47"},"schema_version":"1.0"},"canonical_sha256":"2964a6618d34caf4fcae3d18507e5a0d661d8cbe42e35c6469512d8efec030bf","source":{"kind":"arxiv","id":"1209.4129","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4129","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4129v3","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4129","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"FFSKMYMNGTFP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FFSKMYMNGTFPJ7FO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FFSKMYMN","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FFSKMYMNGTFPJ7FOHUMFA7S2BV","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-19T01:27:40Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"3d3a06ab3cb29facf48fa293a7836f66c117573ef7b153348708fd3972a04927","abstract_canon_sha256":"7be0cedc752b428d9f0aecff5edb8c4f48f2e3a77507e3e2c0443bd1f3069d47"},"schema_version":"1.0"},"canonical_sha256":"2964a6618d34caf4fcae3d18507e5a0d661d8cbe42e35c6469512d8efec030bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:44.737575Z","signature_b64":"4wP5wsEBXssWW/UbCXdCJbRqCgIPZsXCPik5lDsCpmTwSjppQeaGNZ/ca7XGe8s1FHSlWTfpAce7xk7py1ZmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2964a6618d34caf4fcae3d18507e5a0d661d8cbe42e35c6469512d8efec030bf","last_reissued_at":"2026-05-18T03:10:44.737085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:44.737085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4129","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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/JuFC/eraMCNhe5HuswSYnOJ3dc/T+qwfc/heJ92TBZeS8guZcR9AMck5stIB8rfwXXU1lMD6//GX6LnXDQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:09.340003Z"},"content_sha256":"906b567bb8873588540d02515432b2a645d88dd54b68baeadd7b9bd79eeac7b3","schema_version":"1.0","event_id":"sha256:906b567bb8873588540d02515432b2a645d88dd54b68baeadd7b9bd79eeac7b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FFSKMYMNGTFPJ7FOHUMFA7S2BV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comunication-Efficient Algorithms for Statistical Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"John C. Duchi, Martin Wainwright, Yuchen Zhang","submitted_at":"2012-09-19T01:27:40Z","abstract_excerpt":"We analyze two communication-efficient algorithms for distributed statistical optimization on large-scale data sets. The first algorithm is a standard averaging method that distributes the $N$ data samples evenly to $\\nummac$ machines, performs separate minimization on each subset, and then averages the estimates. We provide a sharp analysis of this average mixture algorithm, showing that under a reasonable set of conditions, the combined parameter achieves mean-squared error that decays as $\\order(N^{-1}+(N/m)^{-2})$. Whenever $m \\le \\sqrt{N}$, this guarantee matches the best possible rate ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4129","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-18T03:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbbdYbaTtlcyqOPb9Ok6i1j5eXSXoHqSI5b0jez7T2WnxYMu8tqCHGBZLnJtjfw0DLCM+YDxV1sy4PaH9KU1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:09.340390Z"},"content_sha256":"4605b5213c4230c66f10769b6b8c3b9a57a59fa98bc4b68a61cb22ffef5236ab","schema_version":"1.0","event_id":"sha256:4605b5213c4230c66f10769b6b8c3b9a57a59fa98bc4b68a61cb22ffef5236ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/bundle.json","state_url":"https://pith.science/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/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-03T18:41:09Z","links":{"resolver":"https://pith.science/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV","bundle":"https://pith.science/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/bundle.json","state":"https://pith.science/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFSKMYMNGTFPJ7FOHUMFA7S2BV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FFSKMYMNGTFPJ7FOHUMFA7S2BV","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":"7be0cedc752b428d9f0aecff5edb8c4f48f2e3a77507e3e2c0443bd1f3069d47","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-19T01:27:40Z","title_canon_sha256":"3d3a06ab3cb29facf48fa293a7836f66c117573ef7b153348708fd3972a04927"},"schema_version":"1.0","source":{"id":"1209.4129","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4129","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4129v3","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4129","created_at":"2026-05-18T03:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"FFSKMYMNGTFP","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FFSKMYMNGTFPJ7FO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FFSKMYMN","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:4605b5213c4230c66f10769b6b8c3b9a57a59fa98bc4b68a61cb22ffef5236ab","target":"graph","created_at":"2026-05-18T03:10:44Z","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 analyze two communication-efficient algorithms for distributed statistical optimization on large-scale data sets. The first algorithm is a standard averaging method that distributes the $N$ data samples evenly to $\\nummac$ machines, performs separate minimization on each subset, and then averages the estimates. We provide a sharp analysis of this average mixture algorithm, showing that under a reasonable set of conditions, the combined parameter achieves mean-squared error that decays as $\\order(N^{-1}+(N/m)^{-2})$. Whenever $m \\le \\sqrt{N}$, this guarantee matches the best possible rate ac","authors_text":"John C. Duchi, Martin Wainwright, Yuchen Zhang","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-19T01:27:40Z","title":"Comunication-Efficient Algorithms for Statistical Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4129","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:906b567bb8873588540d02515432b2a645d88dd54b68baeadd7b9bd79eeac7b3","target":"record","created_at":"2026-05-18T03:10:44Z","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":"7be0cedc752b428d9f0aecff5edb8c4f48f2e3a77507e3e2c0443bd1f3069d47","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-09-19T01:27:40Z","title_canon_sha256":"3d3a06ab3cb29facf48fa293a7836f66c117573ef7b153348708fd3972a04927"},"schema_version":"1.0","source":{"id":"1209.4129","kind":"arxiv","version":3}},"canonical_sha256":"2964a6618d34caf4fcae3d18507e5a0d661d8cbe42e35c6469512d8efec030bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2964a6618d34caf4fcae3d18507e5a0d661d8cbe42e35c6469512d8efec030bf","first_computed_at":"2026-05-18T03:10:44.737085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:44.737085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4wP5wsEBXssWW/UbCXdCJbRqCgIPZsXCPik5lDsCpmTwSjppQeaGNZ/ca7XGe8s1FHSlWTfpAce7xk7py1ZmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:44.737575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4129","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:906b567bb8873588540d02515432b2a645d88dd54b68baeadd7b9bd79eeac7b3","sha256:4605b5213c4230c66f10769b6b8c3b9a57a59fa98bc4b68a61cb22ffef5236ab"],"state_sha256":"f6a4db0aa30a120b5f949dc1cbcd456622002830f09b34fd36337aecb3980567"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2v6HxT0Syv8jKze6VMXVE8ko+ukoIEkJYT2BHlxFa7HCDHZ4359dIB3EcGTVwNJTSNM5J6CCSbvTOnObyFgDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:41:09.342751Z","bundle_sha256":"3f63f1545be55d5bd6632a233adc003ca503c609c7451b3879b0089a73d823bd"}}