{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZED64J44TOXGFSWRYJUJ5SRVEQ","short_pith_number":"pith:ZED64J44","schema_version":"1.0","canonical_sha256":"c907ee279c9bae62cad1c2689eca35242a26374221e47d2557fbd3333d6ca66e","source":{"kind":"arxiv","id":"2302.11474","version":2},"attestation_state":"computed","paper":{"title":"Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Hengrui Luo, Jack Dongarra, James Demmel, Laura Grigori, Maksim Melnichenko, Michael W. Mahoney, Micha{\\l} Derezi\\'nski, Miles E. Lopes, N. Benjamin Erichson, Osman Asif Malik, Piotr Luszczek, Riley Murray, Tianyu Liang","submitted_at":"2023-02-22T16:21:37Z","abstract_excerpt":"Randomized numerical linear algebra - RandNLA, for short - concerns the use of randomization as a resource to develop improved algorithms for large-scale linear algebra computations.\n  The origins of contemporary RandNLA lay in theoretical computer science, where it blossomed from a simple idea: randomization provides an avenue for computing approximate solutions to linear algebra problems more efficiently than deterministic algorithms. This idea proved fruitful in the development of scalable algorithms for machine learning and statistical data analysis applications. However, RandNLA's true po"},"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":"2302.11474","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2023-02-22T16:21:37Z","cross_cats_sorted":["cs.MS","cs.NA","math.OC"],"title_canon_sha256":"87b2816c51dced417f099080f0ad572f119c67d5055828a01d371a9960ec02a8","abstract_canon_sha256":"3ccb96e0352b76bb451a63b4127811da5711b36d52a9c4483c5bf956939d2c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:00:36.586145Z","signature_b64":"FFQUvGcOLeOKssKcOoR6i+I7bT7jloXhLgej+Zek5mnj/x3DmdPwDkndLaIb9GatxtWCrf4MpPoiBZ6sj9F8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c907ee279c9bae62cad1c2689eca35242a26374221e47d2557fbd3333d6ca66e","last_reissued_at":"2026-07-05T06:00:36.585660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:00:36.585660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Software","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Hengrui Luo, Jack Dongarra, James Demmel, Laura Grigori, Maksim Melnichenko, Michael W. Mahoney, Micha{\\l} Derezi\\'nski, Miles E. Lopes, N. Benjamin Erichson, Osman Asif Malik, Piotr Luszczek, Riley Murray, Tianyu Liang","submitted_at":"2023-02-22T16:21:37Z","abstract_excerpt":"Randomized numerical linear algebra - RandNLA, for short - concerns the use of randomization as a resource to develop improved algorithms for large-scale linear algebra computations.\n  The origins of contemporary RandNLA lay in theoretical computer science, where it blossomed from a simple idea: randomization provides an avenue for computing approximate solutions to linear algebra problems more efficiently than deterministic algorithms. This idea proved fruitful in the development of scalable algorithms for machine learning and statistical data analysis applications. However, RandNLA's true po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.11474","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.11474/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":"2302.11474","created_at":"2026-07-05T06:00:36.585718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.11474v2","created_at":"2026-07-05T06:00:36.585718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.11474","created_at":"2026-07-05T06:00:36.585718+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZED64J44TOXG","created_at":"2026-07-05T06:00:36.585718+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZED64J44TOXGFSWR","created_at":"2026-07-05T06:00:36.585718+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZED64J44","created_at":"2026-07-05T06:00:36.585718+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20195","citing_title":"Randomized Sketching is Robust to Low-Precision Rounding on GPUs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19960","citing_title":"PEPSKit.jl: A Julia package for projected entangled-pair state simulations","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25809","citing_title":"A multilevel sketch-and-solve method for overdetermined least squares problems","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2411.01986","citing_title":"Randomized coupled decompositions","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19096","citing_title":"Sharp analysis of sketched least squares and randomized low-rank approximation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19960","citing_title":"PEPSKit.jl: A Julia package for projected entangled-pair state simulations","ref_index":113,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16744","citing_title":"Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2506.18408","citing_title":"Stabilizing randomized GMRES through flexible GMRES","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2511.09872","citing_title":"Randomized batch-sampling Kaczmarz methods for solving linear systems","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09755","citing_title":"Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ","json":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ.json","graph_json":"https://pith.science/api/pith-number/ZED64J44TOXGFSWRYJUJ5SRVEQ/graph.json","events_json":"https://pith.science/api/pith-number/ZED64J44TOXGFSWRYJUJ5SRVEQ/events.json","paper":"https://pith.science/paper/ZED64J44"},"agent_actions":{"view_html":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ","download_json":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ.json","view_paper":"https://pith.science/paper/ZED64J44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.11474&json=true","fetch_graph":"https://pith.science/api/pith-number/ZED64J44TOXGFSWRYJUJ5SRVEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZED64J44TOXGFSWRYJUJ5SRVEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZED64J44TOXGFSWRYJUJ5SRVEQ/action/replication_record"}},"created_at":"2026-07-05T06:00:36.585718+00:00","updated_at":"2026-07-05T06:00:36.585718+00:00"}