{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DTFG5KTX6RCNL7FZPD4G5LCFH4","short_pith_number":"pith:DTFG5KTX","canonical_record":{"source":{"id":"1705.09342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T20:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"c560cc4b9bc3dbfd0b8cc7bccef426671ce054e0984a08ecd33bd3553e246e22","abstract_canon_sha256":"58b192ac4047a9fa9b28bf71d49a067fcc2c2564316dd44536b2d717413e9d9d"},"schema_version":"1.0"},"canonical_sha256":"1cca6eaa77f444d5fcb978f86eac453f01ce5e71342bd3bde5b68cd592c0bba0","source":{"kind":"arxiv","id":"1705.09342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09342","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09342v1","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09342","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"DTFG5KTX6RCN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DTFG5KTX6RCNL7FZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DTFG5KTX","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DTFG5KTX6RCNL7FZPD4G5LCFH4","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T20:04:03Z","cross_cats_sorted":[],"title_canon_sha256":"c560cc4b9bc3dbfd0b8cc7bccef426671ce054e0984a08ecd33bd3553e246e22","abstract_canon_sha256":"58b192ac4047a9fa9b28bf71d49a067fcc2c2564316dd44536b2d717413e9d9d"},"schema_version":"1.0"},"canonical_sha256":"1cca6eaa77f444d5fcb978f86eac453f01ce5e71342bd3bde5b68cd592c0bba0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:45.643463Z","signature_b64":"HVfnRztRqm8wlE9FZ65/i2JpUDaBpYEzsDIeTEhj4zKuRBFrOtD7xu3wubHfLJPHwGE8oPUBvxx87z0f9WAlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cca6eaa77f444d5fcb978f86eac453f01ce5e71342bd3bde5b68cd592c0bba0","last_reissued_at":"2026-05-18T00:23:45.642938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:45.642938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09342","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-05-18T00:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPd+ZrPOlLJHwLAqzm/mq0Ku1MCXUrRNKN3U+vuqnyX3iz1o6B7bzQXPaLAK8cv4tgj8cRBT4tVHQPoCoyrBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:36:45.784913Z"},"content_sha256":"7b54f1153edf71c30290f2822aa9d0e3838417ad2e9618935b7b9794c528be5b","schema_version":"1.0","event_id":"sha256:7b54f1153edf71c30290f2822aa9d0e3838417ad2e9618935b7b9794c528be5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DTFG5KTX6RCNL7FZPD4G5LCFH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient generalized Golub-Kahan based methods for dynamic inverse problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Arvind K. Saibaba, Erik Westman, Julianne Chung, Matthew Brown","submitted_at":"2017-05-25T20:04:03Z","abstract_excerpt":"We consider efficient methods for computing solutions to and estimating uncertainties in dynamic inverse problems, where the parameters of interest may change during the measurement procedure. Compared to static inverse problems, incorporating prior information in both space and time in a Bayesian framework can become computationally intensive, in part, due to the large number of unknown parameters. In these problems, explicit computation of the square root and/or inverse of the prior covariance matrix is not possible. In this work, we develop efficient, iterative, matrix-free methods based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09342","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":""},"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-05-18T00:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8u8vGAmus6Rsy1ZjfMlWU8Qj6B8Y3ks8A0ulOajlkqcHdS9jsmn9N3G2iLmfGx4UK8NBu6tIUSJo4VFZLzotDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:36:45.785611Z"},"content_sha256":"ad6a0094a24557799450168c43ed0eafe551b1477fcd7522e7c6e3b5f0f6177a","schema_version":"1.0","event_id":"sha256:ad6a0094a24557799450168c43ed0eafe551b1477fcd7522e7c6e3b5f0f6177a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/bundle.json","state_url":"https://pith.science/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/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-06-05T05:36:45Z","links":{"resolver":"https://pith.science/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4","bundle":"https://pith.science/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/bundle.json","state":"https://pith.science/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTFG5KTX6RCNL7FZPD4G5LCFH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DTFG5KTX6RCNL7FZPD4G5LCFH4","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":"58b192ac4047a9fa9b28bf71d49a067fcc2c2564316dd44536b2d717413e9d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T20:04:03Z","title_canon_sha256":"c560cc4b9bc3dbfd0b8cc7bccef426671ce054e0984a08ecd33bd3553e246e22"},"schema_version":"1.0","source":{"id":"1705.09342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09342","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09342v1","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09342","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"DTFG5KTX6RCN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DTFG5KTX6RCNL7FZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DTFG5KTX","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:ad6a0094a24557799450168c43ed0eafe551b1477fcd7522e7c6e3b5f0f6177a","target":"graph","created_at":"2026-05-18T00:23:45Z","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"},"paper":{"abstract_excerpt":"We consider efficient methods for computing solutions to and estimating uncertainties in dynamic inverse problems, where the parameters of interest may change during the measurement procedure. Compared to static inverse problems, incorporating prior information in both space and time in a Bayesian framework can become computationally intensive, in part, due to the large number of unknown parameters. In these problems, explicit computation of the square root and/or inverse of the prior covariance matrix is not possible. In this work, we develop efficient, iterative, matrix-free methods based on","authors_text":"Arvind K. Saibaba, Erik Westman, Julianne Chung, Matthew Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T20:04:03Z","title":"Efficient generalized Golub-Kahan based methods for dynamic inverse problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09342","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:7b54f1153edf71c30290f2822aa9d0e3838417ad2e9618935b7b9794c528be5b","target":"record","created_at":"2026-05-18T00:23:45Z","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":"58b192ac4047a9fa9b28bf71d49a067fcc2c2564316dd44536b2d717413e9d9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-25T20:04:03Z","title_canon_sha256":"c560cc4b9bc3dbfd0b8cc7bccef426671ce054e0984a08ecd33bd3553e246e22"},"schema_version":"1.0","source":{"id":"1705.09342","kind":"arxiv","version":1}},"canonical_sha256":"1cca6eaa77f444d5fcb978f86eac453f01ce5e71342bd3bde5b68cd592c0bba0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cca6eaa77f444d5fcb978f86eac453f01ce5e71342bd3bde5b68cd592c0bba0","first_computed_at":"2026-05-18T00:23:45.642938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:45.642938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HVfnRztRqm8wlE9FZ65/i2JpUDaBpYEzsDIeTEhj4zKuRBFrOtD7xu3wubHfLJPHwGE8oPUBvxx87z0f9WAlDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:45.643463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b54f1153edf71c30290f2822aa9d0e3838417ad2e9618935b7b9794c528be5b","sha256:ad6a0094a24557799450168c43ed0eafe551b1477fcd7522e7c6e3b5f0f6177a"],"state_sha256":"a52d7f4a06312d4344902e51360d09067312925d6939a9cde73924f67bfbfd1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uG+GbATb17Er1Isz+6ykBbR0bTZDeHz3b0pOakB5dC7B4ZMgGifj3+xkvtlS/PfNpBdTyJrk1g8ZwQY9U3PAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:36:45.788990Z","bundle_sha256":"806e8c905953a10e50f44caa30a2ee2bbafdc8bd964f37d78e739073eae77cea"}}