{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:R5AD6CFO3NWRIHXOEVGBIJSUHP","short_pith_number":"pith:R5AD6CFO","schema_version":"1.0","canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","source":{"kind":"arxiv","id":"0909.4061","version":2},"attestation_state":"computed","paper":{"title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Joel A. Tropp, Nathan Halko, Per-Gunnar Martinsson","submitted_at":"2009-09-22T18:35:27Z","abstract_excerpt":"Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets.\n  This paper presents a modular framework for constructing randomized algorithms that compute partia"},"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":"0909.4061","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-09-22T18:35:27Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"254a38aee7c5a5a80dbddc80fa23f54538e4ef6c2cc400d9270e514cf8ee60b3","abstract_canon_sha256":"3faaaf15e6c883c5396f9fb0c7ad88c909ac5ccf04341ec6d4bef41417aa357b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.020758Z","signature_b64":"MFHUxuox7AYAYWWu6tB582lzA5VaUmYnPQJ1Am2UObdZMIXKwo+OMljRSAy8dec82SuSjjGL1AGQKnTLgloSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f403f08aedb6d141eee254c1426543bf8f2b6c8fe2cf6640e321d82884f2945","last_reissued_at":"2026-05-18T02:53:16.020144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.020144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NA","authors_text":"Joel A. Tropp, Nathan Halko, Per-Gunnar Martinsson","submitted_at":"2009-09-22T18:35:27Z","abstract_excerpt":"Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets.\n  This paper presents a modular framework for constructing randomized algorithms that compute partia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.4061","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0909.4061","created_at":"2026-05-18T02:53:16.020217+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.4061v2","created_at":"2026-05-18T02:53:16.020217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.4061","created_at":"2026-05-18T02:53:16.020217+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5AD6CFO3NWR","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5AD6CFO3NWRIHXO","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5AD6CFO","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.05416","citing_title":"Reduced-Order Surrogates for Forced Flexible Mesh Coastal-Ocean Models","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP","json":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP.json","graph_json":"https://pith.science/api/pith-number/R5AD6CFO3NWRIHXOEVGBIJSUHP/graph.json","events_json":"https://pith.science/api/pith-number/R5AD6CFO3NWRIHXOEVGBIJSUHP/events.json","paper":"https://pith.science/paper/R5AD6CFO"},"agent_actions":{"view_html":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP","download_json":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP.json","view_paper":"https://pith.science/paper/R5AD6CFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.4061&json=true","fetch_graph":"https://pith.science/api/pith-number/R5AD6CFO3NWRIHXOEVGBIJSUHP/graph.json","fetch_events":"https://pith.science/api/pith-number/R5AD6CFO3NWRIHXOEVGBIJSUHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/action/storage_attestation","attest_author":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/action/author_attestation","sign_citation":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/action/citation_signature","submit_replication":"https://pith.science/pith/R5AD6CFO3NWRIHXOEVGBIJSUHP/action/replication_record"}},"created_at":"2026-05-18T02:53:16.020217+00:00","updated_at":"2026-05-18T02:53:16.020217+00:00"}