{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:V2PH7PIC752BOZLXT2LJMETM54","short_pith_number":"pith:V2PH7PIC","schema_version":"1.0","canonical_sha256":"ae9e7fbd02ff741765779e9696126cef1bd46186deef2f134d741d282eecf0de","source":{"kind":"arxiv","id":"2306.12418","version":3},"attestation_state":"computed","paper":{"title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Joel A. Tropp, Robert J. Webber","submitted_at":"2023-06-21T17:57:57Z","abstract_excerpt":"This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the procedures via theoretical analyses and numerical studies to highlight how the best choice of algorithm depends on spectral properties of the matrix and the computational resources available.\n  Despite superior performance for many problems, randomized block Krylov iteration has not been widely adopted in computational science. The paper strengthens the case for this"},"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":"2306.12418","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-06-21T17:57:57Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1579953392cdcd93d004f0d1d10a93db73739ff34fa9926fe09ab6b30d8a9e49","abstract_canon_sha256":"e1c11fa11cc36d9562ff3a5eedd5da0286753b9bd052c2730a21ef9c639c9f1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:53:07.917650Z","signature_b64":"z9MAdF5LEbN/kvOPjkcEo8PH7bU7e+zBYafZyrS9cfDD9+xW2w796TQiwJdq7bXBH8UFZayaK6fFcDqubXi/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae9e7fbd02ff741765779e9696126cef1bd46186deef2f134d741d282eecf0de","last_reissued_at":"2026-07-05T06:53:07.917131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:53:07.917131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Joel A. Tropp, Robert J. Webber","submitted_at":"2023-06-21T17:57:57Z","abstract_excerpt":"This survey explores modern approaches for computing low-rank approximations of high-dimensional matrices by means of the randomized SVD, randomized subspace iteration, and randomized block Krylov iteration. The paper compares the procedures via theoretical analyses and numerical studies to highlight how the best choice of algorithm depends on spectral properties of the matrix and the computational resources available.\n  Despite superior performance for many problems, randomized block Krylov iteration has not been widely adopted in computational science. The paper strengthens the case for this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12418","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.12418/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.12418","created_at":"2026-07-05T06:53:07.917196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12418v3","created_at":"2026-07-05T06:53:07.917196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12418","created_at":"2026-07-05T06:53:07.917196+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2PH7PIC752B","created_at":"2026-07-05T06:53:07.917196+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2PH7PIC752BOZLX","created_at":"2026-07-05T06:53:07.917196+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2PH7PIC","created_at":"2026-07-05T06:53:07.917196+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01335","citing_title":"Transpose-free linear algebra","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01412","citing_title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02574","citing_title":"Fast and accurate conditioning for large-scale Gaussian process prediction problems","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30640","citing_title":"CSULoRA: Closest Safe Update Low-Rank Adaptation","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2411.01986","citing_title":"Randomized coupled decompositions","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21254","citing_title":"Random Matrix Spectra from Boltzmann-Weighted Lattice Ensembles","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2509.11932","citing_title":"The Filter Echo: A General Tool for Filter Visualisation","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02659","citing_title":"Low-Rank Compression of Pretrained Models via Randomized Subspace Iteration","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09755","citing_title":"Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02574","citing_title":"Fast and accurate conditioning for large-scale Gaussian process prediction problems","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05043","citing_title":"Finding accurate eigenvalues and eigenvectors of positive semi-definite matrices given a subspace","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54","json":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54.json","graph_json":"https://pith.science/api/pith-number/V2PH7PIC752BOZLXT2LJMETM54/graph.json","events_json":"https://pith.science/api/pith-number/V2PH7PIC752BOZLXT2LJMETM54/events.json","paper":"https://pith.science/paper/V2PH7PIC"},"agent_actions":{"view_html":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54","download_json":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54.json","view_paper":"https://pith.science/paper/V2PH7PIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12418&json=true","fetch_graph":"https://pith.science/api/pith-number/V2PH7PIC752BOZLXT2LJMETM54/graph.json","fetch_events":"https://pith.science/api/pith-number/V2PH7PIC752BOZLXT2LJMETM54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54/action/storage_attestation","attest_author":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54/action/author_attestation","sign_citation":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54/action/citation_signature","submit_replication":"https://pith.science/pith/V2PH7PIC752BOZLXT2LJMETM54/action/replication_record"}},"created_at":"2026-07-05T06:53:07.917196+00:00","updated_at":"2026-07-05T06:53:07.917196+00:00"}