{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O4O353ASGNUK7P47VAGXI6UGG6","short_pith_number":"pith:O4O353AS","schema_version":"1.0","canonical_sha256":"771dbeec123368afbf9fa80d747a8637b3bc385e41bb2200ab3a6fb268d84b4d","source":{"kind":"arxiv","id":"1606.06351","version":2},"attestation_state":"computed","paper":{"title":"Geometric MCMC for Infinite-Dimensional Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Alexandros Beskos, Andrew M. Stuart, Mark Girolami, Patrick E. Farrell, Shiwei Lan","submitted_at":"2016-06-20T22:30:14Z","abstract_excerpt":"Bayesian inverse problems often involve sampling posterior distributions on infinite-dimensional function spaces. Traditional Markov chain Monte Carlo (MCMC) algorithms are characterized by deteriorating mixing times upon mesh-refinement, when the finite-dimensional approximations become more accurate. Such methods are typically forced to reduce step-sizes as the discretization gets finer, and thus are expensive as a function of dimension. Recently, a new class of MCMC methods with mesh-independent convergence times has emerged. However, few of them take into account the geometry of the poster"},"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":"1606.06351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-20T22:30:14Z","cross_cats_sorted":[],"title_canon_sha256":"5381c8d9e2983e230f3fc145441506dc3af41c1775fac448819a9ddc2bdd5c3f","abstract_canon_sha256":"4e5c91642f599a099ccd507f66d46d0adec6ab63b20dd5971c3bb76f29219f2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:24.524340Z","signature_b64":"LjnZFUX2lRx9Cb8uW89j/zmGFFPvcJSK81SQHRyB0afvivC8t/Vgm9/VTAwWCMIOjzDlGVCil7xfiQz9WCAdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"771dbeec123368afbf9fa80d747a8637b3bc385e41bb2200ab3a6fb268d84b4d","last_reissued_at":"2026-05-18T00:49:24.523641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:24.523641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric MCMC for Infinite-Dimensional Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Alexandros Beskos, Andrew M. Stuart, Mark Girolami, Patrick E. Farrell, Shiwei Lan","submitted_at":"2016-06-20T22:30:14Z","abstract_excerpt":"Bayesian inverse problems often involve sampling posterior distributions on infinite-dimensional function spaces. Traditional Markov chain Monte Carlo (MCMC) algorithms are characterized by deteriorating mixing times upon mesh-refinement, when the finite-dimensional approximations become more accurate. Such methods are typically forced to reduce step-sizes as the discretization gets finer, and thus are expensive as a function of dimension. Recently, a new class of MCMC methods with mesh-independent convergence times has emerged. However, few of them take into account the geometry of the poster"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06351","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":"1606.06351","created_at":"2026-05-18T00:49:24.523748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06351v2","created_at":"2026-05-18T00:49:24.523748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06351","created_at":"2026-05-18T00:49:24.523748+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4O353ASGNUK","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4O353ASGNUK7P47","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4O353AS","created_at":"2026-05-18T12:30:36.002864+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/O4O353ASGNUK7P47VAGXI6UGG6","json":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6.json","graph_json":"https://pith.science/api/pith-number/O4O353ASGNUK7P47VAGXI6UGG6/graph.json","events_json":"https://pith.science/api/pith-number/O4O353ASGNUK7P47VAGXI6UGG6/events.json","paper":"https://pith.science/paper/O4O353AS"},"agent_actions":{"view_html":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6","download_json":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6.json","view_paper":"https://pith.science/paper/O4O353AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06351&json=true","fetch_graph":"https://pith.science/api/pith-number/O4O353ASGNUK7P47VAGXI6UGG6/graph.json","fetch_events":"https://pith.science/api/pith-number/O4O353ASGNUK7P47VAGXI6UGG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6/action/storage_attestation","attest_author":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6/action/author_attestation","sign_citation":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6/action/citation_signature","submit_replication":"https://pith.science/pith/O4O353ASGNUK7P47VAGXI6UGG6/action/replication_record"}},"created_at":"2026-05-18T00:49:24.523748+00:00","updated_at":"2026-05-18T00:49:24.523748+00:00"}