{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TYWBTNQPHHK3RUIKBPBU3YNZQA","short_pith_number":"pith:TYWBTNQP","schema_version":"1.0","canonical_sha256":"9e2c19b60f39d5b8d10a0bc34de1b9802b76e9bff34b11fab23aa67285c05d3d","source":{"kind":"arxiv","id":"2409.05239","version":1},"attestation_state":"computed","paper":{"title":"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":"2024-09-08T22:48:09Z","abstract_excerpt":"In this study, we introduce two new Krylov subspace methods for solving rectangular large-scale linear inverse problems. The first approach is a modification of the Hessenberg iterative algorithm that is based off an LU factorization and is therefore referred to as the least squares LU (LSLU) method. The second approach incorporates Tikhonov regularization in an efficient manner; we call this the Hybrid LSLU method. Both methods are inner-product free, making them advantageous for high performance computing and mixed precision arithmetic. Theoretical findings and numerical results show that Hy"},"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":"2409.05239","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2024-09-08T22:48:09Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"ac71ac2c21b19cd8623eb726c6143463348142de305257c00520bfa176237dbe","abstract_canon_sha256":"fac18858d99b140cff5fe9ce7a3b143ec60bf4462eb9fcdb1232aba7638c37c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:46.370787Z","signature_b64":"9dlXLwUjiwBicuuKgZLVNdqQK0pplKMV7buyhp6NZrjWI44UItnWSPTu2wNKUCyrplGUEyYrPQlPFD/P5xg8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e2c19b60f39d5b8d10a0bc34de1b9802b76e9bff34b11fab23aa67285c05d3d","last_reissued_at":"2026-07-05T09:04:46.370362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:46.370362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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":"2024-09-08T22:48:09Z","abstract_excerpt":"In this study, we introduce two new Krylov subspace methods for solving rectangular large-scale linear inverse problems. The first approach is a modification of the Hessenberg iterative algorithm that is based off an LU factorization and is therefore referred to as the least squares LU (LSLU) method. The second approach incorporates Tikhonov regularization in an efficient manner; we call this the Hybrid LSLU method. Both methods are inner-product free, making them advantageous for high performance computing and mixed precision arithmetic. Theoretical findings and numerical results show that Hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05239","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/2409.05239/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":"2409.05239","created_at":"2026-07-05T09:04:46.370421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05239v1","created_at":"2026-07-05T09:04:46.370421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05239","created_at":"2026-07-05T09:04:46.370421+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYWBTNQPHHK3","created_at":"2026-07-05T09:04:46.370421+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYWBTNQPHHK3RUIK","created_at":"2026-07-05T09:04:46.370421+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYWBTNQP","created_at":"2026-07-05T09:04:46.370421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.02721","citing_title":"Randomized and Inner-product Free Krylov Methods for Large-scale Inverse Problems","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA","json":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA.json","graph_json":"https://pith.science/api/pith-number/TYWBTNQPHHK3RUIKBPBU3YNZQA/graph.json","events_json":"https://pith.science/api/pith-number/TYWBTNQPHHK3RUIKBPBU3YNZQA/events.json","paper":"https://pith.science/paper/TYWBTNQP"},"agent_actions":{"view_html":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA","download_json":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA.json","view_paper":"https://pith.science/paper/TYWBTNQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05239&json=true","fetch_graph":"https://pith.science/api/pith-number/TYWBTNQPHHK3RUIKBPBU3YNZQA/graph.json","fetch_events":"https://pith.science/api/pith-number/TYWBTNQPHHK3RUIKBPBU3YNZQA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA/action/storage_attestation","attest_author":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA/action/author_attestation","sign_citation":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA/action/citation_signature","submit_replication":"https://pith.science/pith/TYWBTNQPHHK3RUIKBPBU3YNZQA/action/replication_record"}},"created_at":"2026-07-05T09:04:46.370421+00:00","updated_at":"2026-07-05T09:04:46.370421+00:00"}