{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WIWZ5WG4USEGFQQINZGYKATB5C","short_pith_number":"pith:WIWZ5WG4","schema_version":"1.0","canonical_sha256":"b22d9ed8dca48862c2086e4d850261e8b29b8dbdd2841536c331422186fdbf25","source":{"kind":"arxiv","id":"1903.00870","version":2},"attestation_state":"computed","paper":{"title":"Scalable optimization-based sampling on function space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ME"],"primary_cat":"stat.CO","authors_text":"Johnathan Bardsley, Tiangang Cui, Youssef Marzouk, Zheng Wang","submitted_at":"2019-03-03T09:35:36Z","abstract_excerpt":"Optimization-based samplers such as randomize-then-optimize (RTO) [2] provide an efficient and parallellizable approach to solving large-scale Bayesian inverse problems. These methods solve randomly perturbed optimization problems to draw samples from an approximate posterior distribution. \"Correcting\" these samples, either by Metropolization or importance sampling, enables characterization of the original posterior distribution. This paper focuses on the scalability of RTO to problems with high- or infinite-dimensional parameters. We introduce a new subspace acceleration strategy that makes t"},"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":"1903.00870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-03-03T09:35:36Z","cross_cats_sorted":["cs.NA","math.NA","stat.ME"],"title_canon_sha256":"f67455b79b69eb685c18a65d2c56ebe08e171bdb5b5291b44250cbcc19b592c0","abstract_canon_sha256":"b9136197a82cd937a80866a96785f42cdd06a671eed9020e0183cbf444b2ffd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:03.077684Z","signature_b64":"NyjhhY81wNyZAOr97nmtcbWbO4QpprP20Ukvp/TnlieOnc1nAjBtfC1akbQCgioHR8No1rRslDOvAHE9JX/IBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b22d9ed8dca48862c2086e4d850261e8b29b8dbdd2841536c331422186fdbf25","last_reissued_at":"2026-07-05T00:15:03.077243Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:03.077243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable optimization-based sampling on function space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.ME"],"primary_cat":"stat.CO","authors_text":"Johnathan Bardsley, Tiangang Cui, Youssef Marzouk, Zheng Wang","submitted_at":"2019-03-03T09:35:36Z","abstract_excerpt":"Optimization-based samplers such as randomize-then-optimize (RTO) [2] provide an efficient and parallellizable approach to solving large-scale Bayesian inverse problems. These methods solve randomly perturbed optimization problems to draw samples from an approximate posterior distribution. \"Correcting\" these samples, either by Metropolization or importance sampling, enables characterization of the original posterior distribution. This paper focuses on the scalability of RTO to problems with high- or infinite-dimensional parameters. We introduce a new subspace acceleration strategy that makes t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00870","kind":"arxiv","version":2},"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/1903.00870/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":"1903.00870","created_at":"2026-07-05T00:15:03.077299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00870v2","created_at":"2026-07-05T00:15:03.077299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00870","created_at":"2026-07-05T00:15:03.077299+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIWZ5WG4USEG","created_at":"2026-07-05T00:15:03.077299+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIWZ5WG4USEGFQQI","created_at":"2026-07-05T00:15:03.077299+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIWZ5WG4","created_at":"2026-07-05T00:15:03.077299+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09429","citing_title":"MALA-within-Gibbs samplers for high-dimensional distributions with sparse conditional structure","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C","json":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C.json","graph_json":"https://pith.science/api/pith-number/WIWZ5WG4USEGFQQINZGYKATB5C/graph.json","events_json":"https://pith.science/api/pith-number/WIWZ5WG4USEGFQQINZGYKATB5C/events.json","paper":"https://pith.science/paper/WIWZ5WG4"},"agent_actions":{"view_html":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C","download_json":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C.json","view_paper":"https://pith.science/paper/WIWZ5WG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00870&json=true","fetch_graph":"https://pith.science/api/pith-number/WIWZ5WG4USEGFQQINZGYKATB5C/graph.json","fetch_events":"https://pith.science/api/pith-number/WIWZ5WG4USEGFQQINZGYKATB5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C/action/storage_attestation","attest_author":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C/action/author_attestation","sign_citation":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C/action/citation_signature","submit_replication":"https://pith.science/pith/WIWZ5WG4USEGFQQINZGYKATB5C/action/replication_record"}},"created_at":"2026-07-05T00:15:03.077299+00:00","updated_at":"2026-07-05T00:15:03.077299+00:00"}