{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GZIWNNKABQNARS5UQYDMW5VTRE","short_pith_number":"pith:GZIWNNKA","schema_version":"1.0","canonical_sha256":"365166b5400c1a08cbb48606cb76b3893581eba7e213e6247921768e685ae94f","source":{"kind":"arxiv","id":"1212.5517","version":3},"attestation_state":"computed","paper":{"title":"Optimal scaling for the transient phase of Metropolis Hastings algorithms: The longtime behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Benjamin Jourdain, B{\\l}a\\.zej Miasojedow, Tony Leli\\`evre","submitted_at":"2012-12-21T16:42:13Z","abstract_excerpt":"We consider the Random Walk Metropolis algorithm on $\\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. It is well known (see Roberts et al. (Ann. Appl. Probab. 7 (1997) 110-120)) that, in the limit $n\\to\\infty$, starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension $n$, a diffusive limit is obtained for each component of the Markov chain. In Jourdain et al. (Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-f"},"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":"1212.5517","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-12-21T16:42:13Z","cross_cats_sorted":[],"title_canon_sha256":"2c2bcb1e370ce4440be3cfd143630839feec831f6f21745252783436ca68e56d","abstract_canon_sha256":"bcf8df32d9af122774d8a7370648b6a5142e29df2d992090d80af9db506c72f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:46.020023Z","signature_b64":"h4fsmeBc+1Zp3h03NnaYpLjV+Cgf39ywVxPQWGiFsISwLMvE8A09OtNgTh966HDJHW10DUivEo2nGQII1L9OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"365166b5400c1a08cbb48606cb76b3893581eba7e213e6247921768e685ae94f","last_reissued_at":"2026-05-18T02:39:46.019560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:46.019560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal scaling for the transient phase of Metropolis Hastings algorithms: The longtime behavior","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Benjamin Jourdain, B{\\l}a\\.zej Miasojedow, Tony Leli\\`evre","submitted_at":"2012-12-21T16:42:13Z","abstract_excerpt":"We consider the Random Walk Metropolis algorithm on $\\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. It is well known (see Roberts et al. (Ann. Appl. Probab. 7 (1997) 110-120)) that, in the limit $n\\to\\infty$, starting at equilibrium and for an appropriate scaling of the variance and of the timescale as a function of the dimension $n$, a diffusive limit is obtained for each component of the Markov chain. In Jourdain et al. (Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5517","kind":"arxiv","version":3},"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":"1212.5517","created_at":"2026-05-18T02:39:46.019633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5517v3","created_at":"2026-05-18T02:39:46.019633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5517","created_at":"2026-05-18T02:39:46.019633+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZIWNNKABQNA","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZIWNNKABQNARS5U","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZIWNNKA","created_at":"2026-05-18T12:27:06.952714+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/GZIWNNKABQNARS5UQYDMW5VTRE","json":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE.json","graph_json":"https://pith.science/api/pith-number/GZIWNNKABQNARS5UQYDMW5VTRE/graph.json","events_json":"https://pith.science/api/pith-number/GZIWNNKABQNARS5UQYDMW5VTRE/events.json","paper":"https://pith.science/paper/GZIWNNKA"},"agent_actions":{"view_html":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE","download_json":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE.json","view_paper":"https://pith.science/paper/GZIWNNKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5517&json=true","fetch_graph":"https://pith.science/api/pith-number/GZIWNNKABQNARS5UQYDMW5VTRE/graph.json","fetch_events":"https://pith.science/api/pith-number/GZIWNNKABQNARS5UQYDMW5VTRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE/action/storage_attestation","attest_author":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE/action/author_attestation","sign_citation":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE/action/citation_signature","submit_replication":"https://pith.science/pith/GZIWNNKABQNARS5UQYDMW5VTRE/action/replication_record"}},"created_at":"2026-05-18T02:39:46.019633+00:00","updated_at":"2026-05-18T02:39:46.019633+00:00"}