{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RYWFY57NCVZWTDVZOUEXVJYTC2","short_pith_number":"pith:RYWFY57N","schema_version":"1.0","canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","source":{"kind":"arxiv","id":"1207.2411","version":2},"attestation_state":"computed","paper":{"title":"Complexity Analysis of Accelerated MCMC Methods for Bayesian Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Andrew M. Stuart, Christoph Schwab, Viet Ha Hoang","submitted_at":"2012-07-10T16:48:09Z","abstract_excerpt":"We study Bayesian inversion for a model elliptic PDE with unknown diffusion coefficient. We provide complexity analyses of several Markov Chain-Monte Carlo (MCMC) methods for the efficient numerical evaluation of expectations under the Bayesian posterior distribution, given data $\\delta$. Particular attention is given to bounds on the overall work required to achieve a prescribed error level $\\varepsilon$. Specifically, we first bound the computational complexity of \"plain\" MCMC, based on combining MCMC sampling with linear complexity multilevel solvers for elliptic PDE. Our (new) work versus "},"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":"1207.2411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-07-10T16:48:09Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"e027d99f33ae037017e9cbe5eb1d33516e2b083216f6ed232c8d11d598264751","abstract_canon_sha256":"e09fde48cdbb8ce33e18de8e5cc8ab8ef06e9dcffb67b31014996e3e528d9451"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:52.917168Z","signature_b64":"9qMo4L8yw7weRk7xt5QWj1zzHZ4Ox9PCxEgWdIcXQI2dXlNgBRHcPEfx61KtfjIPVKcT81ezL5h5nkTSKg+5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","last_reissued_at":"2026-05-18T03:26:52.916724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:52.916724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Analysis of Accelerated MCMC Methods for Bayesian Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.NA","authors_text":"Andrew M. Stuart, Christoph Schwab, Viet Ha Hoang","submitted_at":"2012-07-10T16:48:09Z","abstract_excerpt":"We study Bayesian inversion for a model elliptic PDE with unknown diffusion coefficient. We provide complexity analyses of several Markov Chain-Monte Carlo (MCMC) methods for the efficient numerical evaluation of expectations under the Bayesian posterior distribution, given data $\\delta$. Particular attention is given to bounds on the overall work required to achieve a prescribed error level $\\varepsilon$. Specifically, we first bound the computational complexity of \"plain\" MCMC, based on combining MCMC sampling with linear complexity multilevel solvers for elliptic PDE. Our (new) work versus "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2411","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":""},"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":"1207.2411","created_at":"2026-05-18T03:26:52.916791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2411v2","created_at":"2026-05-18T03:26:52.916791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2411","created_at":"2026-05-18T03:26:52.916791+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYWFY57NCVZW","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYWFY57NCVZWTDVZ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYWFY57N","created_at":"2026-05-18T12:27:20.899486+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/RYWFY57NCVZWTDVZOUEXVJYTC2","json":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2.json","graph_json":"https://pith.science/api/pith-number/RYWFY57NCVZWTDVZOUEXVJYTC2/graph.json","events_json":"https://pith.science/api/pith-number/RYWFY57NCVZWTDVZOUEXVJYTC2/events.json","paper":"https://pith.science/paper/RYWFY57N"},"agent_actions":{"view_html":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2","download_json":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2.json","view_paper":"https://pith.science/paper/RYWFY57N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2411&json=true","fetch_graph":"https://pith.science/api/pith-number/RYWFY57NCVZWTDVZOUEXVJYTC2/graph.json","fetch_events":"https://pith.science/api/pith-number/RYWFY57NCVZWTDVZOUEXVJYTC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/action/storage_attestation","attest_author":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/action/author_attestation","sign_citation":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/action/citation_signature","submit_replication":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/action/replication_record"}},"created_at":"2026-05-18T03:26:52.916791+00:00","updated_at":"2026-05-18T03:26:52.916791+00:00"}