{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H6MJMMQI4TUDG35O4SA34GPZXT","short_pith_number":"pith:H6MJMMQI","canonical_record":{"source":{"id":"1408.5823","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-25T16:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"1f8f3d33052054d4df3ba657b1bfcbaeb600507b201a282888369b2685b44250","abstract_canon_sha256":"43ba8e0ee4f9df8208b8e7dfe545e33e0ee38c5d0bef3a6bff5c3a816062499e"},"schema_version":"1.0"},"canonical_sha256":"3f98963208e4e8336faee481be19f9bcc18ace0402cb768d694c7389141f2e82","source":{"kind":"arxiv","id":"1408.5823","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5823","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5823v5","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5823","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"H6MJMMQI4TUD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H6MJMMQI4TUDG35O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H6MJMMQI","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H6MJMMQI4TUDG35O4SA34GPZXT","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5823","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-25T16:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"1f8f3d33052054d4df3ba657b1bfcbaeb600507b201a282888369b2685b44250","abstract_canon_sha256":"43ba8e0ee4f9df8208b8e7dfe545e33e0ee38c5d0bef3a6bff5c3a816062499e"},"schema_version":"1.0"},"canonical_sha256":"3f98963208e4e8336faee481be19f9bcc18ace0402cb768d694c7389141f2e82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:39.944328Z","signature_b64":"wt58IUpjbXvEZdyg92dM353EHfjpzzdwQnDuJoBop/kQInvExmtMdpCp0NrpSToK4WWJcKfShDcWc4kLdZU5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f98963208e4e8336faee481be19f9bcc18ace0402cb768d694c7389141f2e82","last_reissued_at":"2026-05-18T02:30:39.943812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:39.943812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5823","source_version":5,"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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F65cp9LVHbTzcHr0TGhADtoVILLZG8AOveW6QAlDypp/aaVjotXMwFJWTVC3YAflH72rZE7Xk3w7X6MkeMmGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:14:41.578973Z"},"content_sha256":"760bbef29cb845e0fe70b67895460da3b99f347f1e8ad9f321175ec63aef1c96","schema_version":"1.0","event_id":"sha256:760bbef29cb845e0fe70b67895460da3b99f347f1e8ad9f321175ec63aef1c96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H6MJMMQI4TUDG35O4SA34GPZXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Distributed Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Woodruff, Maria-Florina Balcan, Vandana Kanchanapally, Yingyu Liang","submitted_at":"2014-08-25T16:24:43Z","abstract_excerpt":"We study the distributed computing setting in which there are multiple servers, each holding a set of points, who wish to compute functions on the union of their point sets. A key task in this setting is Principal Component Analysis (PCA), in which the servers would like to compute a low dimensional subspace capturing as much of the variance of the union of their point sets as possible. Given a procedure for approximate PCA, one can use it to approximately solve $\\ell_2$-error fitting problems such as $k$-means clustering and subspace clustering. The essential properties of an approximate dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5823","kind":"arxiv","version":5},"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:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygoaah+Zz0ZXkHEzGbQ2LrhYMFFAHpZXlkCjJ+YJ1/hyZ3G+MQCcLYXuzgGm+6wxy3mCTpyO3NPTS+hV8/eBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:14:41.579780Z"},"content_sha256":"670a90b068592aff93274497f6a44e97049bac9f2aed802d56fde77b40d72fd2","schema_version":"1.0","event_id":"sha256:670a90b068592aff93274497f6a44e97049bac9f2aed802d56fde77b40d72fd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6MJMMQI4TUDG35O4SA34GPZXT/bundle.json","state_url":"https://pith.science/pith/H6MJMMQI4TUDG35O4SA34GPZXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6MJMMQI4TUDG35O4SA34GPZXT/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-04T05:14:41Z","links":{"resolver":"https://pith.science/pith/H6MJMMQI4TUDG35O4SA34GPZXT","bundle":"https://pith.science/pith/H6MJMMQI4TUDG35O4SA34GPZXT/bundle.json","state":"https://pith.science/pith/H6MJMMQI4TUDG35O4SA34GPZXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6MJMMQI4TUDG35O4SA34GPZXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H6MJMMQI4TUDG35O4SA34GPZXT","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":"43ba8e0ee4f9df8208b8e7dfe545e33e0ee38c5d0bef3a6bff5c3a816062499e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-25T16:24:43Z","title_canon_sha256":"1f8f3d33052054d4df3ba657b1bfcbaeb600507b201a282888369b2685b44250"},"schema_version":"1.0","source":{"id":"1408.5823","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5823","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5823v5","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5823","created_at":"2026-05-18T02:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"H6MJMMQI4TUD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H6MJMMQI4TUDG35O","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H6MJMMQI","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:670a90b068592aff93274497f6a44e97049bac9f2aed802d56fde77b40d72fd2","target":"graph","created_at":"2026-05-18T02:30:39Z","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 distributed computing setting in which there are multiple servers, each holding a set of points, who wish to compute functions on the union of their point sets. A key task in this setting is Principal Component Analysis (PCA), in which the servers would like to compute a low dimensional subspace capturing as much of the variance of the union of their point sets as possible. Given a procedure for approximate PCA, one can use it to approximately solve $\\ell_2$-error fitting problems such as $k$-means clustering and subspace clustering. The essential properties of an approximate dist","authors_text":"David Woodruff, Maria-Florina Balcan, Vandana Kanchanapally, Yingyu Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-25T16:24:43Z","title":"Improved Distributed Principal Component Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5823","kind":"arxiv","version":5},"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:760bbef29cb845e0fe70b67895460da3b99f347f1e8ad9f321175ec63aef1c96","target":"record","created_at":"2026-05-18T02:30:39Z","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":"43ba8e0ee4f9df8208b8e7dfe545e33e0ee38c5d0bef3a6bff5c3a816062499e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-25T16:24:43Z","title_canon_sha256":"1f8f3d33052054d4df3ba657b1bfcbaeb600507b201a282888369b2685b44250"},"schema_version":"1.0","source":{"id":"1408.5823","kind":"arxiv","version":5}},"canonical_sha256":"3f98963208e4e8336faee481be19f9bcc18ace0402cb768d694c7389141f2e82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f98963208e4e8336faee481be19f9bcc18ace0402cb768d694c7389141f2e82","first_computed_at":"2026-05-18T02:30:39.943812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:39.943812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wt58IUpjbXvEZdyg92dM353EHfjpzzdwQnDuJoBop/kQInvExmtMdpCp0NrpSToK4WWJcKfShDcWc4kLdZU5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:39.944328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5823","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:760bbef29cb845e0fe70b67895460da3b99f347f1e8ad9f321175ec63aef1c96","sha256:670a90b068592aff93274497f6a44e97049bac9f2aed802d56fde77b40d72fd2"],"state_sha256":"c462b78c293e347d71e303896a8f52b5d8c482b3771e5f3921afd4c231aab1d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uT7eO/Cveb+HYmMcMnhmLyb6jnzQ8Geoab5/26aH0vOZzVeOgUwD3Muha45ELB4TWNP5vdaLKZsiyBHhqXlpAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:14:41.582039Z","bundle_sha256":"6c6335a8a75ef221adee1a61be9b682c9a9adc261a1cd7dea1ff5cf828a20873"}}