{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RYWFY57NCVZWTDVZOUEXVJYTC2","short_pith_number":"pith:RYWFY57N","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"},"canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","source":{"kind":"arxiv","id":"1207.2411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2411","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2411v2","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2411","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"RYWFY57NCVZW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RYWFY57NCVZWTDVZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RYWFY57N","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RYWFY57NCVZWTDVZOUEXVJYTC2","target":"record","payload":{"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"},"canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","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"},"source_kind":"arxiv","source_id":"1207.2411","source_version":2,"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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh1U091QmIfAhK1Ei1tiCJbbJrbM3SFwHqgmyZtwYaRLDVseMSFldZb7uHF3gWDa8O+l2uAqlt/di1xlVYrXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:32.833743Z"},"content_sha256":"0c4a295f98eabd6d06f70a0adf5714bee9f7b8698ed34c8481368b70fed5a78f","schema_version":"1.0","event_id":"sha256:0c4a295f98eabd6d06f70a0adf5714bee9f7b8698ed34c8481368b70fed5a78f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RYWFY57NCVZWTDVZOUEXVJYTC2","target":"graph","payload":{"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"},"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-18T03:26:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0bECtd3erTFLxotcyMg1CUYwrQzjnjHmWmgVD8V0pJONUrdZ/7aT8Msph4CWN5ocmpUd4n3s6gj7GiOgVRwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:32.834467Z"},"content_sha256":"8d9a93e48c155f98d2d2cc3f055754b60884dcd08355288611660b5eb42b0836","schema_version":"1.0","event_id":"sha256:8d9a93e48c155f98d2d2cc3f055754b60884dcd08355288611660b5eb42b0836"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/bundle.json","state_url":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/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-11T05:16:32Z","links":{"resolver":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2","bundle":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/bundle.json","state":"https://pith.science/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYWFY57NCVZWTDVZOUEXVJYTC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RYWFY57NCVZWTDVZOUEXVJYTC2","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":"e09fde48cdbb8ce33e18de8e5cc8ab8ef06e9dcffb67b31014996e3e528d9451","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-07-10T16:48:09Z","title_canon_sha256":"e027d99f33ae037017e9cbe5eb1d33516e2b083216f6ed232c8d11d598264751"},"schema_version":"1.0","source":{"id":"1207.2411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2411","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2411v2","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2411","created_at":"2026-05-18T03:26:52Z"},{"alias_kind":"pith_short_12","alias_value":"RYWFY57NCVZW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RYWFY57NCVZWTDVZ","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RYWFY57N","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:8d9a93e48c155f98d2d2cc3f055754b60884dcd08355288611660b5eb42b0836","target":"graph","created_at":"2026-05-18T03:26:52Z","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 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 ","authors_text":"Andrew M. Stuart, Christoph Schwab, Viet Ha Hoang","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-07-10T16:48:09Z","title":"Complexity Analysis of Accelerated MCMC Methods for Bayesian Inversion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2411","kind":"arxiv","version":2},"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:0c4a295f98eabd6d06f70a0adf5714bee9f7b8698ed34c8481368b70fed5a78f","target":"record","created_at":"2026-05-18T03:26:52Z","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":"e09fde48cdbb8ce33e18de8e5cc8ab8ef06e9dcffb67b31014996e3e528d9451","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-07-10T16:48:09Z","title_canon_sha256":"e027d99f33ae037017e9cbe5eb1d33516e2b083216f6ed232c8d11d598264751"},"schema_version":"1.0","source":{"id":"1207.2411","kind":"arxiv","version":2}},"canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2c5c77ed1573698eb975097aa71316ac0603b5b6d5fa31ef83910257a55517","first_computed_at":"2026-05-18T03:26:52.916724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:52.916724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9qMo4L8yw7weRk7xt5QWj1zzHZ4Ox9PCxEgWdIcXQI2dXlNgBRHcPEfx61KtfjIPVKcT81ezL5h5nkTSKg+5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:52.917168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c4a295f98eabd6d06f70a0adf5714bee9f7b8698ed34c8481368b70fed5a78f","sha256:8d9a93e48c155f98d2d2cc3f055754b60884dcd08355288611660b5eb42b0836"],"state_sha256":"b79a687bf84df074b79eccd4b7366de630bb765d344c11335df3b6a07b3f5fd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tL3yaaNqsd7wNhjClY3hAzl5z46XkA0L2ICMaW76aNulXD3C4ir5IT1oiFbUVRugtI3lBt1n6MxKdaOaNYgvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:16:32.838117Z","bundle_sha256":"f80701a7ba5f57739ab661526a6884e3ef706ff01b52d8b5f001eeaaf73b5307"}}