{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DAUOXDQPLP45XGHUPRLIT2PDGQ","short_pith_number":"pith:DAUOXDQP","schema_version":"1.0","canonical_sha256":"1828eb8e0f5bf9db98f47c5689e9e334252bacdaba3a5c5fde5048598a980d82","source":{"kind":"arxiv","id":"2002.01387","version":3},"attestation_state":"computed","paper":{"title":"Randomized Numerical Linear Algebra: Foundations & Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Joel Tropp, Per-Gunnar Martinsson","submitted_at":"2020-02-04T16:12:45Z","abstract_excerpt":"This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper treats both the theoretical foundations of the subject and the practical computational issues.\n  Topics covered include norm estimation; matrix approximation by sampling; structured and unstructured random embeddings; linear regression problems; low-rank approximation; subspace iteration and Krylov methods; error estimation and adaptivity; interpolatory and CU"},"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":"2002.01387","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-04T16:12:45Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"214f7177da2147164746cae2f4a0a2d44bf70adb795584764e48ff1807958c5b","abstract_canon_sha256":"04be989b2594ef0844a2fb50e9658d614ca5bea3ed74183cf4bc48f7845917a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:23:04.744176Z","signature_b64":"aogbrtgagu/qx+RdwYjbFomlXOkV6fv7Egg9mLek30zj8QJl4bVEw7TVHQ3j4N7JRUYBMlWq6hfmN0pmaLb+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1828eb8e0f5bf9db98f47c5689e9e334252bacdaba3a5c5fde5048598a980d82","last_reissued_at":"2026-07-05T02:23:04.743759Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:23:04.743759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Numerical Linear Algebra: Foundations & Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Joel Tropp, Per-Gunnar Martinsson","submitted_at":"2020-02-04T16:12:45Z","abstract_excerpt":"This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper treats both the theoretical foundations of the subject and the practical computational issues.\n  Topics covered include norm estimation; matrix approximation by sampling; structured and unstructured random embeddings; linear regression problems; low-rank approximation; subspace iteration and Krylov methods; error estimation and adaptivity; interpolatory and CU"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.01387","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/2002.01387/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":"2002.01387","created_at":"2026-07-05T02:23:04.743813+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.01387v3","created_at":"2026-07-05T02:23:04.743813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.01387","created_at":"2026-07-05T02:23:04.743813+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAUOXDQPLP45","created_at":"2026-07-05T02:23:04.743813+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAUOXDQPLP45XGHU","created_at":"2026-07-05T02:23:04.743813+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAUOXDQP","created_at":"2026-07-05T02:23:04.743813+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26826","citing_title":"High-dimensional reliability-oriented Shapley effect estimation with Normalizing Flows","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20195","citing_title":"Randomized Sketching is Robust to Low-Precision Rounding on GPUs","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ","json":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ.json","graph_json":"https://pith.science/api/pith-number/DAUOXDQPLP45XGHUPRLIT2PDGQ/graph.json","events_json":"https://pith.science/api/pith-number/DAUOXDQPLP45XGHUPRLIT2PDGQ/events.json","paper":"https://pith.science/paper/DAUOXDQP"},"agent_actions":{"view_html":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ","download_json":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ.json","view_paper":"https://pith.science/paper/DAUOXDQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.01387&json=true","fetch_graph":"https://pith.science/api/pith-number/DAUOXDQPLP45XGHUPRLIT2PDGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DAUOXDQPLP45XGHUPRLIT2PDGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ/action/storage_attestation","attest_author":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ/action/author_attestation","sign_citation":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ/action/citation_signature","submit_replication":"https://pith.science/pith/DAUOXDQPLP45XGHUPRLIT2PDGQ/action/replication_record"}},"created_at":"2026-07-05T02:23:04.743813+00:00","updated_at":"2026-07-05T02:23:04.743813+00:00"}