{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CK6EUHRJ6MA2GAFV6UXYNWAIF2","short_pith_number":"pith:CK6EUHRJ","schema_version":"1.0","canonical_sha256":"12bc4a1e29f301a300b5f52f86d8082e80af398f23e20158267898d02d9df737","source":{"kind":"arxiv","id":"1412.3510","version":1},"attestation_state":"computed","paper":{"title":"An implementation of a randomized algorithm for principal component analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"stat.CO","authors_text":"Arthur Szlam, Mark Tygert, Yuval Kluger","submitted_at":"2014-12-11T00:52:41Z","abstract_excerpt":"Recent years have witnessed intense development of randomized methods for low-rank approximation. These methods target principal component analysis (PCA) and the calculation of truncated singular value decompositions (SVD). The present paper presents an essentially black-box, fool-proof implementation for Mathworks' MATLAB, a popular software platform for numerical computation. As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical techniques (such as Lanczos iterations) in basically all respects: accuracy, computationa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.3510","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-11T00:52:41Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"a065f50513c250562844a1df62900c02b63dc8529300988518515ca9e8fb775e","abstract_canon_sha256":"e811d2185c5114392e40def5a49dfc8fa1e2fc27c938328fbf5b55cc1be317ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.629115Z","signature_b64":"1D5O3j12j+YXQK6e/9ycQbC5XQXELWkJ2z4lW2oJhxRBYlsFMXJ8kzGdAQHnqwAzLWTV5v+1dBGjex0EzuK6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12bc4a1e29f301a300b5f52f86d8082e80af398f23e20158267898d02d9df737","last_reissued_at":"2026-05-18T00:53:45.628718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.628718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An implementation of a randomized algorithm for principal component analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"stat.CO","authors_text":"Arthur Szlam, Mark Tygert, Yuval Kluger","submitted_at":"2014-12-11T00:52:41Z","abstract_excerpt":"Recent years have witnessed intense development of randomized methods for low-rank approximation. These methods target principal component analysis (PCA) and the calculation of truncated singular value decompositions (SVD). The present paper presents an essentially black-box, fool-proof implementation for Mathworks' MATLAB, a popular software platform for numerical computation. As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical techniques (such as Lanczos iterations) in basically all respects: accuracy, computationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3510","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.3510","created_at":"2026-05-18T00:53:45.628793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3510v1","created_at":"2026-05-18T00:53:45.628793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3510","created_at":"2026-05-18T00:53:45.628793+00:00"},{"alias_kind":"pith_short_12","alias_value":"CK6EUHRJ6MA2","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CK6EUHRJ6MA2GAFV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CK6EUHRJ","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2","json":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2.json","graph_json":"https://pith.science/api/pith-number/CK6EUHRJ6MA2GAFV6UXYNWAIF2/graph.json","events_json":"https://pith.science/api/pith-number/CK6EUHRJ6MA2GAFV6UXYNWAIF2/events.json","paper":"https://pith.science/paper/CK6EUHRJ"},"agent_actions":{"view_html":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2","download_json":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2.json","view_paper":"https://pith.science/paper/CK6EUHRJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3510&json=true","fetch_graph":"https://pith.science/api/pith-number/CK6EUHRJ6MA2GAFV6UXYNWAIF2/graph.json","fetch_events":"https://pith.science/api/pith-number/CK6EUHRJ6MA2GAFV6UXYNWAIF2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2/action/storage_attestation","attest_author":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2/action/author_attestation","sign_citation":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2/action/citation_signature","submit_replication":"https://pith.science/pith/CK6EUHRJ6MA2GAFV6UXYNWAIF2/action/replication_record"}},"created_at":"2026-05-18T00:53:45.628793+00:00","updated_at":"2026-05-18T00:53:45.628793+00:00"}