{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OQMZGWL7EF3SNLA5A5HHRH64LK","short_pith_number":"pith:OQMZGWL7","schema_version":"1.0","canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","source":{"kind":"arxiv","id":"1405.4896","version":2},"attestation_state":"computed","paper":{"title":"Diffusion Limit For The Random Walk Metropolis Algorithm Out Of stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A.M. Stuart, J. Kuntz, M. Ottobre","submitted_at":"2014-05-19T21:03:50Z","abstract_excerpt":"The Random Walk Metropolis (RWM) algorithm is a Metropolis- Hastings MCMC algorithm designed to sample from a given target distribution \\pi with Lebesgue density on R^N. RWM constructs a Markov chain by randomly proposing a new position (the \"proposal move\"), which is then accepted or rejected according to a rule which makes the chain reversible with respect to \\pi. When the dimension N is large a key question is to determine the optimal scaling with N of the proposal variance: if the proposal variance is too large, the algorithm will reject the proposed moves too often; if it is too small, th"},"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":"1405.4896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-19T21:03:50Z","cross_cats_sorted":[],"title_canon_sha256":"df225cd1783a454efebd17a59de732fb99b88542618e38af495b1bd080f5e3e6","abstract_canon_sha256":"c051932aefd192bd172022b55009bdcb041fd435e63484d81f7403adbb9ec81b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:21.373614Z","signature_b64":"Qrpq6cs5YcIewd7i7DrlLlfIQjy6PXnsCcA8uuncqcESKyDWyv6u4xbaJ+CzA3FAWIEi5MpKsW0zZaAMoCY1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","last_reissued_at":"2026-05-18T01:07:21.373177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:21.373177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diffusion Limit For The Random Walk Metropolis Algorithm Out Of stationarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"A.M. Stuart, J. Kuntz, M. Ottobre","submitted_at":"2014-05-19T21:03:50Z","abstract_excerpt":"The Random Walk Metropolis (RWM) algorithm is a Metropolis- Hastings MCMC algorithm designed to sample from a given target distribution \\pi with Lebesgue density on R^N. RWM constructs a Markov chain by randomly proposing a new position (the \"proposal move\"), which is then accepted or rejected according to a rule which makes the chain reversible with respect to \\pi. When the dimension N is large a key question is to determine the optimal scaling with N of the proposal variance: if the proposal variance is too large, the algorithm will reject the proposed moves too often; if it is too small, th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4896","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":"1405.4896","created_at":"2026-05-18T01:07:21.373237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4896v2","created_at":"2026-05-18T01:07:21.373237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4896","created_at":"2026-05-18T01:07:21.373237+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQMZGWL7EF3S","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQMZGWL7EF3SNLA5","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQMZGWL7","created_at":"2026-05-18T12:28:43.426989+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/OQMZGWL7EF3SNLA5A5HHRH64LK","json":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK.json","graph_json":"https://pith.science/api/pith-number/OQMZGWL7EF3SNLA5A5HHRH64LK/graph.json","events_json":"https://pith.science/api/pith-number/OQMZGWL7EF3SNLA5A5HHRH64LK/events.json","paper":"https://pith.science/paper/OQMZGWL7"},"agent_actions":{"view_html":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK","download_json":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK.json","view_paper":"https://pith.science/paper/OQMZGWL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4896&json=true","fetch_graph":"https://pith.science/api/pith-number/OQMZGWL7EF3SNLA5A5HHRH64LK/graph.json","fetch_events":"https://pith.science/api/pith-number/OQMZGWL7EF3SNLA5A5HHRH64LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/action/storage_attestation","attest_author":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/action/author_attestation","sign_citation":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/action/citation_signature","submit_replication":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/action/replication_record"}},"created_at":"2026-05-18T01:07:21.373237+00:00","updated_at":"2026-05-18T01:07:21.373237+00:00"}