{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:QWTEFQJO3PXMSGKOEZMX2PVZLH","short_pith_number":"pith:QWTEFQJO","schema_version":"1.0","canonical_sha256":"85a642c12edbeec9194e26597d3eb959c767e6063197dc2e6af815902e44addf","source":{"kind":"arxiv","id":"2109.03457","version":4},"attestation_state":"computed","paper":{"title":"Uncertainty Quantification and Experimental Design for Large-Scale Linear Inverse Problems under Gaussian Process Priors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.AP","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"C\\'edric Travelletti, David Ginsbourger, Niklas Linde","submitted_at":"2021-09-08T06:54:32Z","abstract_excerpt":"We consider the use of Gaussian process (GP) priors for solving inverse problems in a Bayesian framework. As is well known, the computational complexity of GPs scales cubically in the number of datapoints. We here show that in the context of inverse problems involving integral operators, one faces additional difficulties that hinder inversion on large grids. Furthermore, in that context, covariance matrices can become too large to be stored. By leveraging results about sequential disintegrations of Gaussian measures, we are able to introduce an implicit representation of posterior covariance m"},"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":"2109.03457","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2021-09-08T06:54:32Z","cross_cats_sorted":["cs.LG","stat.AP","stat.CO","stat.ME"],"title_canon_sha256":"332e456ab22c36d9d2a03c2fd308a330d4830ca52af9a6f8d7735c24520243a3","abstract_canon_sha256":"cba165d6ec213e01644837fb6a8c33bbfe2a3e35ad6001a4bac3f13e20a8e438"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:53:25.182836Z","signature_b64":"lBf+eml2oMDMS42q3GxhwYObu4QARQUti7hxdOujMWa5RUFZjO6fzRuczQADTiHeOthsfmGqZj8XsFQ/8v1fCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85a642c12edbeec9194e26597d3eb959c767e6063197dc2e6af815902e44addf","last_reissued_at":"2026-07-05T04:53:25.182378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:53:25.182378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Quantification and Experimental Design for Large-Scale Linear Inverse Problems under Gaussian Process Priors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.AP","stat.CO","stat.ME"],"primary_cat":"stat.ML","authors_text":"C\\'edric Travelletti, David Ginsbourger, Niklas Linde","submitted_at":"2021-09-08T06:54:32Z","abstract_excerpt":"We consider the use of Gaussian process (GP) priors for solving inverse problems in a Bayesian framework. As is well known, the computational complexity of GPs scales cubically in the number of datapoints. We here show that in the context of inverse problems involving integral operators, one faces additional difficulties that hinder inversion on large grids. Furthermore, in that context, covariance matrices can become too large to be stored. By leveraging results about sequential disintegrations of Gaussian measures, we are able to introduce an implicit representation of posterior covariance m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.03457","kind":"arxiv","version":4},"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/2109.03457/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":"2109.03457","created_at":"2026-07-05T04:53:25.182435+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.03457v4","created_at":"2026-07-05T04:53:25.182435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.03457","created_at":"2026-07-05T04:53:25.182435+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWTEFQJO3PXM","created_at":"2026-07-05T04:53:25.182435+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWTEFQJO3PXMSGKO","created_at":"2026-07-05T04:53:25.182435+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWTEFQJO","created_at":"2026-07-05T04:53:25.182435+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04026","citing_title":"On the Usage of Gaussian Process for Efficient Data Valuation","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH","json":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH.json","graph_json":"https://pith.science/api/pith-number/QWTEFQJO3PXMSGKOEZMX2PVZLH/graph.json","events_json":"https://pith.science/api/pith-number/QWTEFQJO3PXMSGKOEZMX2PVZLH/events.json","paper":"https://pith.science/paper/QWTEFQJO"},"agent_actions":{"view_html":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH","download_json":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH.json","view_paper":"https://pith.science/paper/QWTEFQJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.03457&json=true","fetch_graph":"https://pith.science/api/pith-number/QWTEFQJO3PXMSGKOEZMX2PVZLH/graph.json","fetch_events":"https://pith.science/api/pith-number/QWTEFQJO3PXMSGKOEZMX2PVZLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH/action/storage_attestation","attest_author":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH/action/author_attestation","sign_citation":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH/action/citation_signature","submit_replication":"https://pith.science/pith/QWTEFQJO3PXMSGKOEZMX2PVZLH/action/replication_record"}},"created_at":"2026-07-05T04:53:25.182435+00:00","updated_at":"2026-07-05T04:53:25.182435+00:00"}