{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QLOPH2RJST55DPN3POL7Y7NWGL","short_pith_number":"pith:QLOPH2RJ","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"},"canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","source":{"kind":"arxiv","id":"2502.02721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02721","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02721v1","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02721","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"QLOPH2RJST55","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"QLOPH2RJST55DPN3","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"QLOPH2RJ","created_at":"2026-07-05T10:09:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QLOPH2RJST55DPN3POL7Y7NWGL","target":"record","payload":{"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"},"canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","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"},"source_kind":"arxiv","source_id":"2502.02721","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcLDfVnEiu8YlP3YVoDQPG6peTrDIvfHZwfs7G2aMqv9LEkKEr9nQhZQ96bhonImdGvxci4JxZ4BNAIRAmPxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:11:58.972264Z"},"content_sha256":"9a79b7df016ec874f692db0601a1829a92aa7a21803e80a0647a8ce75a7b1b39","schema_version":"1.0","event_id":"sha256:9a79b7df016ec874f692db0601a1829a92aa7a21803e80a0647a8ce75a7b1b39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QLOPH2RJST55DPN3POL7Y7NWGL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:09:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C98lHrAiqr1vXhCqF1IBm0c7n2tm5TQPbKTpUtq/eHh1OFVwa5/kG9hfBiVhbDhmxQNBHOz/u/qywNn2fbsIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:11:58.972622Z"},"content_sha256":"3a6f956974cef8b7020462539720d9fb2c14a7b25b62e0cb0f5aef7d8a2ff02b","schema_version":"1.0","event_id":"sha256:3a6f956974cef8b7020462539720d9fb2c14a7b25b62e0cb0f5aef7d8a2ff02b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/bundle.json","state_url":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLOPH2RJST55DPN3POL7Y7NWGL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-14T06:11:58Z","links":{"resolver":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL","bundle":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/bundle.json","state":"https://pith.science/pith/QLOPH2RJST55DPN3POL7Y7NWGL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLOPH2RJST55DPN3POL7Y7NWGL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QLOPH2RJST55DPN3POL7Y7NWGL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"20571e9bca3245261f3cf862b04ac2d470374419e940c64e97e82ff716a61a08","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-02-04T21:14:28Z","title_canon_sha256":"1c6e69605749b9c3b00f8f75fb11154519e2889f96e03f5ec0842b4d05c9528c"},"schema_version":"1.0","source":{"id":"2502.02721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02721","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02721v1","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02721","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_12","alias_value":"QLOPH2RJST55","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_16","alias_value":"QLOPH2RJST55DPN3","created_at":"2026-07-05T10:09:53Z"},{"alias_kind":"pith_short_8","alias_value":"QLOPH2RJ","created_at":"2026-07-05T10:09:53Z"}],"graph_snapshots":[{"event_id":"sha256:3a6f956974cef8b7020462539720d9fb2c14a7b25b62e0cb0f5aef7d8a2ff02b","target":"graph","created_at":"2026-07-05T10:09:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.02721/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ariana N. Brown, James G. Nagy, Julianne Chung, Malena Sabat\\'e Landman","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-02-04T21:14:28Z","title":"Randomized and Inner-product Free Krylov Methods for Large-scale Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02721","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9a79b7df016ec874f692db0601a1829a92aa7a21803e80a0647a8ce75a7b1b39","target":"record","created_at":"2026-07-05T10:09:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"20571e9bca3245261f3cf862b04ac2d470374419e940c64e97e82ff716a61a08","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2025-02-04T21:14:28Z","title_canon_sha256":"1c6e69605749b9c3b00f8f75fb11154519e2889f96e03f5ec0842b4d05c9528c"},"schema_version":"1.0","source":{"id":"2502.02721","kind":"arxiv","version":1}},"canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82dcf3ea2994fbd1bdbb7b97fc7db632d79d8077bf448e92bc47d2e853db9ef1","first_computed_at":"2026-07-05T10:09:53.896434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:09:53.896434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Znchc/LdkF9cZrmL2d8iKlZuCW5gJaNQsP81kmpsBgxedyo8vhyRp9fqkjWPziyCu+Eh87r8SDG31ZroBbbuBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:09:53.896812Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a79b7df016ec874f692db0601a1829a92aa7a21803e80a0647a8ce75a7b1b39","sha256:3a6f956974cef8b7020462539720d9fb2c14a7b25b62e0cb0f5aef7d8a2ff02b"],"state_sha256":"dbd343f2c5b29e4c328d22bd0ebafa1cecad34cf3c4a7503b884e24892b0f672"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE03e6zyMRhho3/0wEFUynkeRNM+vOSd3cyJdb0eYaIzDulDJo72wRK/8P4n3uRKuOMtytSxu4FwId5WfnIvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:11:58.975256Z","bundle_sha256":"3291d7e49da9c667f7b831e14e31bacce570cbd5534a0217e20f6c8a98f02156"}}