{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KAE7L5CIMDSNT76TH5R2RHSUGA","short_pith_number":"pith:KAE7L5CI","canonical_record":{"source":{"id":"1702.08169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T07:45:58Z","cross_cats_sorted":[],"title_canon_sha256":"f4e45c578f03776b76f550253fb1d1a1ed79f295a53876dd41e7382fb3cf3fb5","abstract_canon_sha256":"a5f9129b061064605bbb9becb0ca68fd5a048d824ba901b254482bf9b0130403"},"schema_version":"1.0"},"canonical_sha256":"5009f5f44860e4d9ffd33f63a89e54302752b8139e7c41a9940f3f6c7544445b","source":{"kind":"arxiv","id":"1702.08169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08169","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08169v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08169","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"KAE7L5CIMDSN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KAE7L5CIMDSNT76T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KAE7L5CI","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KAE7L5CIMDSNT76TH5R2RHSUGA","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T07:45:58Z","cross_cats_sorted":[],"title_canon_sha256":"f4e45c578f03776b76f550253fb1d1a1ed79f295a53876dd41e7382fb3cf3fb5","abstract_canon_sha256":"a5f9129b061064605bbb9becb0ca68fd5a048d824ba901b254482bf9b0130403"},"schema_version":"1.0"},"canonical_sha256":"5009f5f44860e4d9ffd33f63a89e54302752b8139e7c41a9940f3f6c7544445b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:55.753243Z","signature_b64":"ZgtxQROs6hWWk+PYr9ExsUC9qqvAO15GQN95CfUpn+HzainR+9cv+03E59CZNmIeZzWraa+UL8FEzBu0tyfKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5009f5f44860e4d9ffd33f63a89e54302752b8139e7c41a9940f3f6c7544445b","last_reissued_at":"2026-05-18T00:49:55.752576Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:55.752576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08169","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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ulV4b07vRFEvlIP2YR1S10CoU93EDA9ub6prJPxh+5EUBF/iduzVdXeZxbQiEVVVwBUOTKS4qxTsaBmqKeQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:28.947520Z"},"content_sha256":"9597b33a354ca2b1cee3cb44d321239d2c458b137072b27ab347eded43e71685","schema_version":"1.0","event_id":"sha256:9597b33a354ca2b1cee3cb44d321239d2c458b137072b27ab347eded43e71685"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KAE7L5CIMDSNT76TH5R2RHSUGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Garber, Nathan Srebro, Ohad Shamir","submitted_at":"2017-02-27T07:45:58Z","abstract_excerpt":"We study the fundamental problem of Principal Component Analysis in a statistical distributed setting in which each machine out of $m$ stores a sample of $n$ points sampled i.i.d. from a single unknown distribution. We study algorithms for estimating the leading principal component of the population covariance matrix that are both communication-efficient and achieve estimation error of the order of the centralized ERM solution that uses all $mn$ samples. On the negative side, we show that in contrast to results obtained for distributed estimation under convexity assumptions, for the PCA object"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08169","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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BBAHK31q7kDyY3FLkM4y4rrZAF8mPTICXizp+tIRMr3uU9gAQdGudthNOtWMRCx5kt2UgwXFfN6yrGxpImgLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:53:28.948136Z"},"content_sha256":"f5d966f333ff6292d4bc658a41c03d273347632abfecbb8c962fbd00c2306445","schema_version":"1.0","event_id":"sha256:f5d966f333ff6292d4bc658a41c03d273347632abfecbb8c962fbd00c2306445"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/bundle.json","state_url":"https://pith.science/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/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-27T16:53:28Z","links":{"resolver":"https://pith.science/pith/KAE7L5CIMDSNT76TH5R2RHSUGA","bundle":"https://pith.science/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/bundle.json","state":"https://pith.science/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAE7L5CIMDSNT76TH5R2RHSUGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KAE7L5CIMDSNT76TH5R2RHSUGA","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":"a5f9129b061064605bbb9becb0ca68fd5a048d824ba901b254482bf9b0130403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T07:45:58Z","title_canon_sha256":"f4e45c578f03776b76f550253fb1d1a1ed79f295a53876dd41e7382fb3cf3fb5"},"schema_version":"1.0","source":{"id":"1702.08169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08169","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08169v1","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08169","created_at":"2026-05-18T00:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"KAE7L5CIMDSN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KAE7L5CIMDSNT76T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KAE7L5CI","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:f5d966f333ff6292d4bc658a41c03d273347632abfecbb8c962fbd00c2306445","target":"graph","created_at":"2026-05-18T00:49:55Z","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 fundamental problem of Principal Component Analysis in a statistical distributed setting in which each machine out of $m$ stores a sample of $n$ points sampled i.i.d. from a single unknown distribution. We study algorithms for estimating the leading principal component of the population covariance matrix that are both communication-efficient and achieve estimation error of the order of the centralized ERM solution that uses all $mn$ samples. On the negative side, we show that in contrast to results obtained for distributed estimation under convexity assumptions, for the PCA object","authors_text":"Dan Garber, Nathan Srebro, Ohad Shamir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T07:45:58Z","title":"Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08169","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:9597b33a354ca2b1cee3cb44d321239d2c458b137072b27ab347eded43e71685","target":"record","created_at":"2026-05-18T00:49:55Z","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":"a5f9129b061064605bbb9becb0ca68fd5a048d824ba901b254482bf9b0130403","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-27T07:45:58Z","title_canon_sha256":"f4e45c578f03776b76f550253fb1d1a1ed79f295a53876dd41e7382fb3cf3fb5"},"schema_version":"1.0","source":{"id":"1702.08169","kind":"arxiv","version":1}},"canonical_sha256":"5009f5f44860e4d9ffd33f63a89e54302752b8139e7c41a9940f3f6c7544445b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5009f5f44860e4d9ffd33f63a89e54302752b8139e7c41a9940f3f6c7544445b","first_computed_at":"2026-05-18T00:49:55.752576Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:55.752576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZgtxQROs6hWWk+PYr9ExsUC9qqvAO15GQN95CfUpn+HzainR+9cv+03E59CZNmIeZzWraa+UL8FEzBu0tyfKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:55.753243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9597b33a354ca2b1cee3cb44d321239d2c458b137072b27ab347eded43e71685","sha256:f5d966f333ff6292d4bc658a41c03d273347632abfecbb8c962fbd00c2306445"],"state_sha256":"8b3f9513f76d2c6d06242ae8be166d24ccf1e4a2c32b28c68b1684b6187cfb5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU+ZskAiM2wmHMyol+PpFwCH34ysVbM3siNI5svKdSZhfDWl2NnsD75vu774fEkP3Co+DLgd2f4/HwBZgFyTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:53:28.951698Z","bundle_sha256":"80e9807092c8ac47fae4cdca98c91459fb371b7c3d1c059132b5b29db989f002"}}