{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FW2M6WFUTI4PFUDXPTDPC52CXS","short_pith_number":"pith:FW2M6WFU","schema_version":"1.0","canonical_sha256":"2db4cf58b49a38f2d0777cc6f17742bc8d254f6801a3d70db4689d1188c50759","source":{"kind":"arxiv","id":"1504.03461","version":2},"attestation_state":"computed","paper":{"title":"On a generalization of the preconditioned Crank-Nicolson Metropolis algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.PR"],"primary_cat":"stat.CO","authors_text":"Bj\\\"orn Sprungk, Daniel Rudolf","submitted_at":"2015-04-14T08:57:31Z","abstract_excerpt":"Metropolis algorithms for approximate sampling of probability measures on infinite dimensional Hilbert spaces are considered and a generalization of the preconditioned Crank-Nicolson (pCN) proposal is introduced. The new proposal is able to incorporate information of the measure of interest. A numerical simulation of a Bayesian inverse problem indicates that a Metropolis algorithm with such a proposal performs independent of the state space dimension and the variance of the observational noise. Moreover, a qualitative convergence result is provided by a comparison argument for spectral gaps. I"},"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":"1504.03461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-14T08:57:31Z","cross_cats_sorted":["math.NA","math.PR"],"title_canon_sha256":"0b577822d76ea70136c4ab6c083bf65256d9cacbd4a5f69889ec9c897b779be4","abstract_canon_sha256":"a2c617c1b2b0e1e8274a6aefd4c62d4630d1e0e577713113aa1d8ad73fe3b6a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.053885Z","signature_b64":"gu16IL80yZHaGIsoiEky+8kk5RnbWigIG9BnWIj3RpRQg3Z9VZzWTAn3Q0j9uhRImEIMhVDXrzBtIuZ724U5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2db4cf58b49a38f2d0777cc6f17742bc8d254f6801a3d70db4689d1188c50759","last_reissued_at":"2026-05-18T00:57:32.053470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.053470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a generalization of the preconditioned Crank-Nicolson Metropolis algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA","math.PR"],"primary_cat":"stat.CO","authors_text":"Bj\\\"orn Sprungk, Daniel Rudolf","submitted_at":"2015-04-14T08:57:31Z","abstract_excerpt":"Metropolis algorithms for approximate sampling of probability measures on infinite dimensional Hilbert spaces are considered and a generalization of the preconditioned Crank-Nicolson (pCN) proposal is introduced. The new proposal is able to incorporate information of the measure of interest. A numerical simulation of a Bayesian inverse problem indicates that a Metropolis algorithm with such a proposal performs independent of the state space dimension and the variance of the observational noise. Moreover, a qualitative convergence result is provided by a comparison argument for spectral gaps. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03461","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":"1504.03461","created_at":"2026-05-18T00:57:32.053525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.03461v2","created_at":"2026-05-18T00:57:32.053525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03461","created_at":"2026-05-18T00:57:32.053525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FW2M6WFUTI4P","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FW2M6WFUTI4PFUDX","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FW2M6WFU","created_at":"2026-05-18T12:29:22.688609+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/FW2M6WFUTI4PFUDXPTDPC52CXS","json":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS.json","graph_json":"https://pith.science/api/pith-number/FW2M6WFUTI4PFUDXPTDPC52CXS/graph.json","events_json":"https://pith.science/api/pith-number/FW2M6WFUTI4PFUDXPTDPC52CXS/events.json","paper":"https://pith.science/paper/FW2M6WFU"},"agent_actions":{"view_html":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS","download_json":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS.json","view_paper":"https://pith.science/paper/FW2M6WFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.03461&json=true","fetch_graph":"https://pith.science/api/pith-number/FW2M6WFUTI4PFUDXPTDPC52CXS/graph.json","fetch_events":"https://pith.science/api/pith-number/FW2M6WFUTI4PFUDXPTDPC52CXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS/action/storage_attestation","attest_author":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS/action/author_attestation","sign_citation":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS/action/citation_signature","submit_replication":"https://pith.science/pith/FW2M6WFUTI4PFUDXPTDPC52CXS/action/replication_record"}},"created_at":"2026-05-18T00:57:32.053525+00:00","updated_at":"2026-05-18T00:57:32.053525+00:00"}