{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QTSUEVBQNNL5BQ3MOYIU4CTOSC","short_pith_number":"pith:QTSUEVBQ","canonical_record":{"source":{"id":"1007.5510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-07-30T18:24:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a23d6a38a2440809a3920ae2cee1a2374adc84e097d96c154acdf284f97a3f67","abstract_canon_sha256":"d1a88c92ac72abf0092cda0a0a430f5801c84fccefcddc2b27c10caf4bbcc96e"},"schema_version":"1.0"},"canonical_sha256":"84e54254306b57d0c36c76114e0a6e90802841800e9870f6e9c40e835fa8c2d5","source":{"kind":"arxiv","id":"1007.5510","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5510","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5510v2","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5510","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"QTSUEVBQNNL5","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QTSUEVBQNNL5BQ3M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QTSUEVBQ","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QTSUEVBQNNL5BQ3MOYIU4CTOSC","target":"record","payload":{"canonical_record":{"source":{"id":"1007.5510","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-07-30T18:24:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a23d6a38a2440809a3920ae2cee1a2374adc84e097d96c154acdf284f97a3f67","abstract_canon_sha256":"d1a88c92ac72abf0092cda0a0a430f5801c84fccefcddc2b27c10caf4bbcc96e"},"schema_version":"1.0"},"canonical_sha256":"84e54254306b57d0c36c76114e0a6e90802841800e9870f6e9c40e835fa8c2d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:47.691680Z","signature_b64":"JEAb/MFKZphXtLgJRU2UO06gPo6CtmCVZj5LNCsf82H8Q59aowpxOQr1eaQpRayeTq1hEGzr3SCuusqpE6qFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84e54254306b57d0c36c76114e0a6e90802841800e9870f6e9c40e835fa8c2d5","last_reissued_at":"2026-05-18T04:05:47.691137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:47.691137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.5510","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-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mT1EVaHdF14XQ+5AYT4ObnFIKyzWUS7dBdWL399FqXr6m8pgrI1ugiFvLzjKksEefrSrbGyVfMLyjvDifvU1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:20.859969Z"},"content_sha256":"757b7f9db182a9a1d05883656db5ca20861dcd5d02207203522445f8d7ddd23d","schema_version":"1.0","event_id":"sha256:757b7f9db182a9a1d05883656db5ca20861dcd5d02207203522445f8d7ddd23d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QTSUEVBQNNL5BQ3MOYIU4CTOSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algorithm for the principal component analysis of large data sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"stat.CO","authors_text":"Mark Tygert, Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnisky","submitted_at":"2010-07-30T18:24:23Z","abstract_excerpt":"Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy --- even on parallel processors --- unlike the classical (deterministic) alternatives. We adapt one of these randomized methods for use with data sets that are too large to be stored in random-access memory (RAM). (The traditional terminology is that our procedure works efficiently \"out-of-core.\") We illustrate the performance of the algorithm via several numerical examples. For example, we report on the PCA of a data set stored on disk that is so large that l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5510","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-18T04:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z10DkEQTBHXomOobOj+E8vGMHpDWlYhzkjGjIfym9kCeSg07qFHTiBTN0Iw+e3EpCloc2X9L0rzQKnDOyydOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:30:20.860310Z"},"content_sha256":"68cd023300b0f20580ed804a4302564941ad74961bb2f31463f9a403f6b5f25c","schema_version":"1.0","event_id":"sha256:68cd023300b0f20580ed804a4302564941ad74961bb2f31463f9a403f6b5f25c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/bundle.json","state_url":"https://pith.science/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/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-03T06:30:20Z","links":{"resolver":"https://pith.science/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC","bundle":"https://pith.science/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/bundle.json","state":"https://pith.science/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTSUEVBQNNL5BQ3MOYIU4CTOSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QTSUEVBQNNL5BQ3MOYIU4CTOSC","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":"d1a88c92ac72abf0092cda0a0a430f5801c84fccefcddc2b27c10caf4bbcc96e","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-07-30T18:24:23Z","title_canon_sha256":"a23d6a38a2440809a3920ae2cee1a2374adc84e097d96c154acdf284f97a3f67"},"schema_version":"1.0","source":{"id":"1007.5510","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.5510","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"1007.5510v2","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.5510","created_at":"2026-05-18T04:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"QTSUEVBQNNL5","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QTSUEVBQNNL5BQ3M","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QTSUEVBQ","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:68cd023300b0f20580ed804a4302564941ad74961bb2f31463f9a403f6b5f25c","target":"graph","created_at":"2026-05-18T04:05:47Z","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":"Recently popularized randomized methods for principal component analysis (PCA) efficiently and reliably produce nearly optimal accuracy --- even on parallel processors --- unlike the classical (deterministic) alternatives. We adapt one of these randomized methods for use with data sets that are too large to be stored in random-access memory (RAM). (The traditional terminology is that our procedure works efficiently \"out-of-core.\") We illustrate the performance of the algorithm via several numerical examples. For example, we report on the PCA of a data set stored on disk that is so large that l","authors_text":"Mark Tygert, Nathan Halko, Per-Gunnar Martinsson, Yoel Shkolnisky","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-07-30T18:24:23Z","title":"An algorithm for the principal component analysis of large data sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.5510","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:757b7f9db182a9a1d05883656db5ca20861dcd5d02207203522445f8d7ddd23d","target":"record","created_at":"2026-05-18T04:05:47Z","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":"d1a88c92ac72abf0092cda0a0a430f5801c84fccefcddc2b27c10caf4bbcc96e","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-07-30T18:24:23Z","title_canon_sha256":"a23d6a38a2440809a3920ae2cee1a2374adc84e097d96c154acdf284f97a3f67"},"schema_version":"1.0","source":{"id":"1007.5510","kind":"arxiv","version":2}},"canonical_sha256":"84e54254306b57d0c36c76114e0a6e90802841800e9870f6e9c40e835fa8c2d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84e54254306b57d0c36c76114e0a6e90802841800e9870f6e9c40e835fa8c2d5","first_computed_at":"2026-05-18T04:05:47.691137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:47.691137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JEAb/MFKZphXtLgJRU2UO06gPo6CtmCVZj5LNCsf82H8Q59aowpxOQr1eaQpRayeTq1hEGzr3SCuusqpE6qFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:47.691680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.5510","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:757b7f9db182a9a1d05883656db5ca20861dcd5d02207203522445f8d7ddd23d","sha256:68cd023300b0f20580ed804a4302564941ad74961bb2f31463f9a403f6b5f25c"],"state_sha256":"f0387484bc1b9c6bcd361817f220fb961eac86b72d77ca168e5a288c41e0ec60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OirdzEFe/VCiWek7vCLfosdfeIqPs1gmEjhX2vSC9nrmECF6CtM0qOhKffYnFA1NIL+WIq4vXVW8hMwl1lgtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:30:20.862293Z","bundle_sha256":"50608339fa334cc948e9aa6f9e19e5c12fcfc500717ff680b23ec54e4cc493df"}}