{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JRZRMR4VU6IZ543AXDZRWN7Z27","short_pith_number":"pith:JRZRMR4V","schema_version":"1.0","canonical_sha256":"4c73164795a7919ef360b8f31b37f9d7e301867fdb1bc2034fadd60f79101a78","source":{"kind":"arxiv","id":"2605.22281","version":1},"attestation_state":"computed","paper":{"title":"Randomized Flexible LSQR and LSMR with applications to inverse problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alberto Bucci, Leonardo Robol, Silvia Gazzola","submitted_at":"2026-05-21T10:27:19Z","abstract_excerpt":"LSQR and LSMR are iterative methods, based on the Golub-Kahan bidiagonalization algorithm, widely used for large-scale linear least squares problems. FLSQR and FLSMR are flexible variants of LSQR and LSMR, respectively, based on a flexible Golub-Kahan (Arnoldi-like) factorization algorithm, which naturally allow modifications of the solution approximation subspace and/or handling inexact matrix-vector multiplications with the (transpose of the) coefficient matrix, thereby enabling to enforce prior information into the computed solution. The goal of this paper is to introduce sFLSQR and sFLSMR,"},"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":"2605.22281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NA","submitted_at":"2026-05-21T10:27:19Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"6822ef33d3ca8c6534eda2857f1d2ee2c41c487474908ef95e6b2f2dee0e4b6b","abstract_canon_sha256":"145cc03212a60c374c173d0ed528962f41a7df5eb9f2c201ad28a3d7572ee05b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:35.945138Z","signature_b64":"D7QUTkPSCke6GvdA0T1U9x6XcdHtQE6/tAUZmmq+RtTE3AuMZg6+sD5HDASrpCaJwkcPzPw1+YoYwncGSU0ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c73164795a7919ef360b8f31b37f9d7e301867fdb1bc2034fadd60f79101a78","last_reissued_at":"2026-05-22T01:04:35.944323Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:35.944323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Flexible LSQR and LSMR with applications to inverse problems","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Alberto Bucci, Leonardo Robol, Silvia Gazzola","submitted_at":"2026-05-21T10:27:19Z","abstract_excerpt":"LSQR and LSMR are iterative methods, based on the Golub-Kahan bidiagonalization algorithm, widely used for large-scale linear least squares problems. FLSQR and FLSMR are flexible variants of LSQR and LSMR, respectively, based on a flexible Golub-Kahan (Arnoldi-like) factorization algorithm, which naturally allow modifications of the solution approximation subspace and/or handling inexact matrix-vector multiplications with the (transpose of the) coefficient matrix, thereby enabling to enforce prior information into the computed solution. The goal of this paper is to introduce sFLSQR and sFLSMR,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22281","kind":"arxiv","version":1},"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/2605.22281/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":"2605.22281","created_at":"2026-05-22T01:04:35.944469+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22281v1","created_at":"2026-05-22T01:04:35.944469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22281","created_at":"2026-05-22T01:04:35.944469+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRZRMR4VU6IZ","created_at":"2026-05-22T01:04:35.944469+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRZRMR4VU6IZ543A","created_at":"2026-05-22T01:04:35.944469+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRZRMR4V","created_at":"2026-05-22T01:04:35.944469+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27","json":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27.json","graph_json":"https://pith.science/api/pith-number/JRZRMR4VU6IZ543AXDZRWN7Z27/graph.json","events_json":"https://pith.science/api/pith-number/JRZRMR4VU6IZ543AXDZRWN7Z27/events.json","paper":"https://pith.science/paper/JRZRMR4V"},"agent_actions":{"view_html":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27","download_json":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27.json","view_paper":"https://pith.science/paper/JRZRMR4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22281&json=true","fetch_graph":"https://pith.science/api/pith-number/JRZRMR4VU6IZ543AXDZRWN7Z27/graph.json","fetch_events":"https://pith.science/api/pith-number/JRZRMR4VU6IZ543AXDZRWN7Z27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27/action/storage_attestation","attest_author":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27/action/author_attestation","sign_citation":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27/action/citation_signature","submit_replication":"https://pith.science/pith/JRZRMR4VU6IZ543AXDZRWN7Z27/action/replication_record"}},"created_at":"2026-05-22T01:04:35.944469+00:00","updated_at":"2026-05-22T01:04:35.944469+00:00"}