{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QLOPH2RJST55DPN3POL7Y7NWGL","short_pith_number":"pith:QLOPH2RJ","schema_version":"1.0","canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","source":{"kind":"arxiv","id":"2502.02721","version":1},"attestation_state":"computed","paper":{"title":"Randomized and Inner-product Free Krylov Methods for Large-scale Inverse Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ariana N. Brown, James G. Nagy, Julianne Chung, Malena Sabat\\'e Landman","submitted_at":"2025-02-04T21:14:28Z","abstract_excerpt":"Iterative Krylov projection methods have become widely used for solving large-scale linear inverse problems. However, methods based on orthogonality include the computation of inner-products, which become costly when the number of iterations is high; are a bottleneck for parallelization; and can cause the algorithms to break down in low precision due to information loss in the projections. Recent works on inner-product free Krylov iterative algorithms alleviate these concerns, but they are quasi-minimal residual rather than minimal residual methods. This is a potential concern for inverse prob"},"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":"2502.02721","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-02-04T21:14:28Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"1c6e69605749b9c3b00f8f75fb11154519e2889f96e03f5ec0842b4d05c9528c","abstract_canon_sha256":"20571e9bca3245261f3cf862b04ac2d470374419e940c64e97e82ff716a61a08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:53.896812Z","signature_b64":"Znchc/LdkF9cZrmL2d8iKlZuCW5gJaNQsP81kmpsBgxedyo8vhyRp9fqkjWPziyCu+Eh87r8SDG31ZroBbbuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","last_reissued_at":"2026-07-05T10:09:53.896434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:53.896434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized and Inner-product Free Krylov Methods for Large-scale Inverse Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Ariana N. Brown, James G. Nagy, Julianne Chung, Malena Sabat\\'e Landman","submitted_at":"2025-02-04T21:14:28Z","abstract_excerpt":"Iterative Krylov projection methods have become widely used for solving large-scale linear inverse problems. However, methods based on orthogonality include the computation of inner-products, which become costly when the number of iterations is high; are a bottleneck for parallelization; and can cause the algorithms to break down in low precision due to information loss in the projections. Recent works on inner-product free Krylov iterative algorithms alleviate these concerns, but they are quasi-minimal residual rather than minimal residual methods. This is a potential concern for inverse prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02721","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/2502.02721/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":"2502.02721","created_at":"2026-07-05T10:09:53.896487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02721v1","created_at":"2026-07-05T10:09:53.896487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02721","created_at":"2026-07-05T10:09:53.896487+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLOPH2RJST55","created_at":"2026-07-05T10:09:53.896487+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLOPH2RJST55DPN3","created_at":"2026-07-05T10:09:53.896487+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLOPH2RJ","created_at":"2026-07-05T10:09:53.896487+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/QLOPH2RJST55DPN3POL7Y7NWGL","json":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL.json","graph_json":"https://pith.science/api/pith-number/QLOPH2RJST55DPN3POL7Y7NWGL/graph.json","events_json":"https://pith.science/api/pith-number/QLOPH2RJST55DPN3POL7Y7NWGL/events.json","paper":"https://pith.science/paper/QLOPH2RJ"},"agent_actions":{"view_html":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL","download_json":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL.json","view_paper":"https://pith.science/paper/QLOPH2RJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02721&json=true","fetch_graph":"https://pith.science/api/pith-number/QLOPH2RJST55DPN3POL7Y7NWGL/graph.json","fetch_events":"https://pith.science/api/pith-number/QLOPH2RJST55DPN3POL7Y7NWGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/action/storage_attestation","attest_author":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/action/author_attestation","sign_citation":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/action/citation_signature","submit_replication":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/action/replication_record"}},"created_at":"2026-07-05T10:09:53.896487+00:00","updated_at":"2026-07-05T10:09:53.896487+00:00"}