{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C2Z56CVY4RSLYBJSDOETTY5KFZ","short_pith_number":"pith:C2Z56CVY","canonical_record":{"source":{"id":"1503.05214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-17T20:38:15Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"09156b9a5e912bb069fc75dec46b872b603c0a1afbbfdff7c0097fc9a2ba24e1","abstract_canon_sha256":"af70ceecb0a35cdfad04b379604eb36530526e7061a5ab64999c31f26836e244"},"schema_version":"1.0"},"canonical_sha256":"16b3df0ab8e464bc05321b8939e3aa2e6165979d97963457fe274af5bf06d116","source":{"kind":"arxiv","id":"1503.05214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05214","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05214v2","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05214","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"C2Z56CVY4RSL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C2Z56CVY4RSLYBJS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C2Z56CVY","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C2Z56CVY4RSLYBJSDOETTY5KFZ","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-17T20:38:15Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"09156b9a5e912bb069fc75dec46b872b603c0a1afbbfdff7c0097fc9a2ba24e1","abstract_canon_sha256":"af70ceecb0a35cdfad04b379604eb36530526e7061a5ab64999c31f26836e244"},"schema_version":"1.0"},"canonical_sha256":"16b3df0ab8e464bc05321b8939e3aa2e6165979d97963457fe274af5bf06d116","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.706681Z","signature_b64":"bHP2DvPkmdZKp/GMpp3/FbKImCecdyBri63UIuh3Lhmw5A1pO1Lh2539KwKVQhM3RtjBMJO+reo7bwH3pHD6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16b3df0ab8e464bc05321b8939e3aa2e6165979d97963457fe274af5bf06d116","last_reissued_at":"2026-05-18T02:12:10.705875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.705875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05214","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mwr5XCauZFmxjnlflL5mFhf52uOWUCvbCa1rk6ZVuxPKuVG1O9Mnu5qXKtNFmDvtUP4vA2teSvISW29GdRKRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:12.724013Z"},"content_sha256":"4dff1e61a15794b404ea1d864d31bb3099978b95e7528643a5040d3854a3ac9a","schema_version":"1.0","event_id":"sha256:4dff1e61a15794b404ea1d864d31bb3099978b95e7528643a5040d3854a3ac9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C2Z56CVY4RSLYBJSDOETTY5KFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of PCA Algorithms in Distributed Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"cs.DC","authors_text":"Mohamed Hefeeda, Tarek Elgamal","submitted_at":"2015-03-17T20:38:15Z","abstract_excerpt":"Classical machine learning algorithms often face scalability bottlenecks when they are applied to large-scale data. Such algorithms were designed to work with small data that is assumed to fit in the memory of one machine. In this report, we analyze different methods for computing an important machine learing algorithm, namely Principal Component Analysis (PCA), and we comment on its limitations in supporting large datasets. The methods are analyzed and compared across two important metrics: time complexity and communication complexity. We consider the worst-case scenarios for both metrics, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05214","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:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dWHK7M/seiGUN1vWZMx5g9ccftKgy3d7ovUDXRZlZQkg9XWoUArdqouyLG3Csy8k8eWjw9ymJTCiPfEmh7DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:33:12.724367Z"},"content_sha256":"a69b325eebd413900ea0e0bf08a9efc37298393635e93ae54127ba4fe3c5688b","schema_version":"1.0","event_id":"sha256:a69b325eebd413900ea0e0bf08a9efc37298393635e93ae54127ba4fe3c5688b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/bundle.json","state_url":"https://pith.science/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/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-21T20:33:12Z","links":{"resolver":"https://pith.science/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ","bundle":"https://pith.science/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/bundle.json","state":"https://pith.science/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2Z56CVY4RSLYBJSDOETTY5KFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C2Z56CVY4RSLYBJSDOETTY5KFZ","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":"af70ceecb0a35cdfad04b379604eb36530526e7061a5ab64999c31f26836e244","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-17T20:38:15Z","title_canon_sha256":"09156b9a5e912bb069fc75dec46b872b603c0a1afbbfdff7c0097fc9a2ba24e1"},"schema_version":"1.0","source":{"id":"1503.05214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05214","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05214v2","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05214","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"C2Z56CVY4RSL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C2Z56CVY4RSLYBJS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C2Z56CVY","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:a69b325eebd413900ea0e0bf08a9efc37298393635e93ae54127ba4fe3c5688b","target":"graph","created_at":"2026-05-18T02:12:10Z","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":"Classical machine learning algorithms often face scalability bottlenecks when they are applied to large-scale data. Such algorithms were designed to work with small data that is assumed to fit in the memory of one machine. In this report, we analyze different methods for computing an important machine learing algorithm, namely Principal Component Analysis (PCA), and we comment on its limitations in supporting large datasets. The methods are analyzed and compared across two important metrics: time complexity and communication complexity. We consider the worst-case scenarios for both metrics, an","authors_text":"Mohamed Hefeeda, Tarek Elgamal","cross_cats":["cs.LG","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-17T20:38:15Z","title":"Analysis of PCA Algorithms in Distributed Environments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05214","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:4dff1e61a15794b404ea1d864d31bb3099978b95e7528643a5040d3854a3ac9a","target":"record","created_at":"2026-05-18T02:12:10Z","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":"af70ceecb0a35cdfad04b379604eb36530526e7061a5ab64999c31f26836e244","cross_cats_sorted":["cs.LG","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-17T20:38:15Z","title_canon_sha256":"09156b9a5e912bb069fc75dec46b872b603c0a1afbbfdff7c0097fc9a2ba24e1"},"schema_version":"1.0","source":{"id":"1503.05214","kind":"arxiv","version":2}},"canonical_sha256":"16b3df0ab8e464bc05321b8939e3aa2e6165979d97963457fe274af5bf06d116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16b3df0ab8e464bc05321b8939e3aa2e6165979d97963457fe274af5bf06d116","first_computed_at":"2026-05-18T02:12:10.705875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.705875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHP2DvPkmdZKp/GMpp3/FbKImCecdyBri63UIuh3Lhmw5A1pO1Lh2539KwKVQhM3RtjBMJO+reo7bwH3pHD6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.706681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dff1e61a15794b404ea1d864d31bb3099978b95e7528643a5040d3854a3ac9a","sha256:a69b325eebd413900ea0e0bf08a9efc37298393635e93ae54127ba4fe3c5688b"],"state_sha256":"eec8a55e67938059acd0c48165f445e400ba9aa2e72df263038fe1b5c81b022a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aX8dkWxOWrBV1V6EaxkxhTySZKejHRUZpJ0nVmlkDvNBlzA3a8EqhDUCftoVUCcjXHQDu8xEkf/8wUJXtKOCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:33:12.726416Z","bundle_sha256":"86fbca74fe417978a95fe0639f8f18d48ddfd53ce1aeac19418b0e1f0ed8d00f"}}