{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CQRMJKLYKUHTETQXNTNXQIXTVG","short_pith_number":"pith:CQRMJKLY","schema_version":"1.0","canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","source":{"kind":"arxiv","id":"1109.5981","version":2},"attestation_state":"computed","paper":{"title":"LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA"],"primary_cat":"cs.DS","authors_text":"Michael A. Saunders, Michael W. Mahoney, Xiangrui Meng","submitted_at":"2011-09-27T18:06:44Z","abstract_excerpt":"We describe a parallel iterative least squares solver named \\texttt{LSRN} that is based on random normal projection. \\texttt{LSRN} computes the min-length solution to $\\min_{x \\in \\mathbb{R}^n} \\|A x - b\\|_2$, where $A \\in \\mathbb{R}^{m \\times n}$ with $m \\gg n$ or $m \\ll n$, and where $A$ may be rank-deficient. Tikhonov regularization may also be included. Since $A$ is only involved in matrix-matrix and matrix-vector multiplications, it can be a dense or sparse matrix or a linear operator, and \\texttt{LSRN} automatically speeds up when $A$ is sparse or a fast linear operator. The precondition"},"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":"1109.5981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T18:06:44Z","cross_cats_sorted":["cs.MS","cs.NA"],"title_canon_sha256":"156f33aeb849eef86c44bec60fe3eab071d01eb8e5ae6760c41c340d9f52da00","abstract_canon_sha256":"6eba2ffc2524d386119bb28cd8b910c4628b17fe5d5d316a16b4a7c26b15c5d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:01.775758Z","signature_b64":"jqx9W+OH5X2o9+/FwAU3/Mu8aKYns3MZx+2hBN/yG6Ah0Fboc5UW0zIqnLP+HNcJMZRaX5kSttoi8g0/Y5GJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1422c4a978550f324e176cdb7822f3a98fe602df9515188a4adcaa2bf08477ec","last_reissued_at":"2026-05-18T04:02:01.774810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:01.774810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.NA"],"primary_cat":"cs.DS","authors_text":"Michael A. Saunders, Michael W. Mahoney, Xiangrui Meng","submitted_at":"2011-09-27T18:06:44Z","abstract_excerpt":"We describe a parallel iterative least squares solver named \\texttt{LSRN} that is based on random normal projection. \\texttt{LSRN} computes the min-length solution to $\\min_{x \\in \\mathbb{R}^n} \\|A x - b\\|_2$, where $A \\in \\mathbb{R}^{m \\times n}$ with $m \\gg n$ or $m \\ll n$, and where $A$ may be rank-deficient. Tikhonov regularization may also be included. Since $A$ is only involved in matrix-matrix and matrix-vector multiplications, it can be a dense or sparse matrix or a linear operator, and \\texttt{LSRN} automatically speeds up when $A$ is sparse or a fast linear operator. The precondition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5981","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":"1109.5981","created_at":"2026-05-18T04:02:01.774991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5981v2","created_at":"2026-05-18T04:02:01.774991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5981","created_at":"2026-05-18T04:02:01.774991+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQRMJKLYKUHT","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQRMJKLYKUHTETQX","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQRMJKLY","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.18004","citing_title":"RL4RLA: Teaching ML to Discover Randomized Linear Algebra Algorithms Through Curriculum Design and Graph-Based Search","ref_index":75,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG","json":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG.json","graph_json":"https://pith.science/api/pith-number/CQRMJKLYKUHTETQXNTNXQIXTVG/graph.json","events_json":"https://pith.science/api/pith-number/CQRMJKLYKUHTETQXNTNXQIXTVG/events.json","paper":"https://pith.science/paper/CQRMJKLY"},"agent_actions":{"view_html":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG","download_json":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG.json","view_paper":"https://pith.science/paper/CQRMJKLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5981&json=true","fetch_graph":"https://pith.science/api/pith-number/CQRMJKLYKUHTETQXNTNXQIXTVG/graph.json","fetch_events":"https://pith.science/api/pith-number/CQRMJKLYKUHTETQXNTNXQIXTVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/action/storage_attestation","attest_author":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/action/author_attestation","sign_citation":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/action/citation_signature","submit_replication":"https://pith.science/pith/CQRMJKLYKUHTETQXNTNXQIXTVG/action/replication_record"}},"created_at":"2026-05-18T04:02:01.774991+00:00","updated_at":"2026-05-18T04:02:01.774991+00:00"}