{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AQHCKB3VLEKT6PDS64GWEHKBZF","short_pith_number":"pith:AQHCKB3V","schema_version":"1.0","canonical_sha256":"040e25077559153f3c72f70d621d41c97fc9ff68c2724f57da9b41a4443d41ba","source":{"kind":"arxiv","id":"1707.04246","version":1},"attestation_state":"computed","paper":{"title":"Iterative Updating of Model Error for Bayesian Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.ME","authors_text":"Andrew M. Stuart, Daniela Calvetti, Erkki Somersalo, Matthew M. Dunlop","submitted_at":"2017-07-13T17:54:56Z","abstract_excerpt":"In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when optimization algorithms are used to find a single estimate, or to speed up Markov chain Monte Carlo (MCMC) calculations in the Bayesian framework. The use of an approximate model introduces a discrepancy, or modeling error, that may have a detrimental effect on the solution of the ill-posed inverse problem, or it may severely distort the estimate of the posteri"},"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":"1707.04246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-13T17:54:56Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c15cb0d446e6b7a55f232b1a13348d252eef9405f7f2a4b79a6a456023c27898","abstract_canon_sha256":"bc5e237a26c88dffbd9478232d22915ecfc1eec6ca4a4ff6ed7680af36e0f6bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:35.110641Z","signature_b64":"g4qawFLFMXQ38LhF1KjXq96ZQIiR1WY0kCm/mwUxuzCFaMGg6nc3EoAiR0BKs4ecbVFJDROB73tRIxtUsDDWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"040e25077559153f3c72f70d621d41c97fc9ff68c2724f57da9b41a4443d41ba","last_reissued_at":"2026-05-18T00:23:35.110025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:35.110025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Updating of Model Error for Bayesian Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.ME","authors_text":"Andrew M. Stuart, Daniela Calvetti, Erkki Somersalo, Matthew M. Dunlop","submitted_at":"2017-07-13T17:54:56Z","abstract_excerpt":"In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when optimization algorithms are used to find a single estimate, or to speed up Markov chain Monte Carlo (MCMC) calculations in the Bayesian framework. The use of an approximate model introduces a discrepancy, or modeling error, that may have a detrimental effect on the solution of the ill-posed inverse problem, or it may severely distort the estimate of the posteri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04246","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.04246","created_at":"2026-05-18T00:23:35.110107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04246v1","created_at":"2026-05-18T00:23:35.110107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04246","created_at":"2026-05-18T00:23:35.110107+00:00"},{"alias_kind":"pith_short_12","alias_value":"AQHCKB3VLEKT","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AQHCKB3VLEKT6PDS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AQHCKB3V","created_at":"2026-05-18T12:31:05.417338+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/AQHCKB3VLEKT6PDS64GWEHKBZF","json":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF.json","graph_json":"https://pith.science/api/pith-number/AQHCKB3VLEKT6PDS64GWEHKBZF/graph.json","events_json":"https://pith.science/api/pith-number/AQHCKB3VLEKT6PDS64GWEHKBZF/events.json","paper":"https://pith.science/paper/AQHCKB3V"},"agent_actions":{"view_html":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF","download_json":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF.json","view_paper":"https://pith.science/paper/AQHCKB3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04246&json=true","fetch_graph":"https://pith.science/api/pith-number/AQHCKB3VLEKT6PDS64GWEHKBZF/graph.json","fetch_events":"https://pith.science/api/pith-number/AQHCKB3VLEKT6PDS64GWEHKBZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF/action/storage_attestation","attest_author":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF/action/author_attestation","sign_citation":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF/action/citation_signature","submit_replication":"https://pith.science/pith/AQHCKB3VLEKT6PDS64GWEHKBZF/action/replication_record"}},"created_at":"2026-05-18T00:23:35.110107+00:00","updated_at":"2026-05-18T00:23:35.110107+00:00"}