{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EMIC4QCD2QOM5PVE6MC22IDYGP","short_pith_number":"pith:EMIC4QCD","schema_version":"1.0","canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","source":{"kind":"arxiv","id":"1608.08379","version":2},"attestation_state":"computed","paper":{"title":"Non-stationary phase of the MALA algorithm","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":"2016-08-30T09:22:59Z","abstract_excerpt":"The Metropolis-Adjusted Langevin Algorithm (MALA) is a Markov Chain Monte Carlo method which creates a Markov chain reversible with respect to a given target distribution, pi^N, with Lebesgue density on R^N; it can hence be used to approximately sample the target distribution. When the dimension N is large a key question is to determine the computational cost of the algorithm as a function of N. One approach to this question, which we adopt here, is to derive diffusion limits for the algorithm. The family of target measures that we consider in this paper are, in general, in non-product form an"},"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":"1608.08379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-30T09:22:59Z","cross_cats_sorted":[],"title_canon_sha256":"9a2daf635ed78a59c82f91be77707c9e4aa62d875068f61ce80bcdf4848dbd10","abstract_canon_sha256":"ca0877a63d1270609d127d937c1eb0b0b750d3c20a560f369f7eb9e29285c96f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:51.560911Z","signature_b64":"TD9thfU2Zx1baGB/uNm0rGwi8/fQTzuK9KcvPePyOIk1+c09LMvP9wngkNpHGEEEEti9z8nUPFeP3Fen+DoWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","last_reissued_at":"2026-05-18T00:36:51.560179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:51.560179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-stationary phase of the MALA algorithm","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":"2016-08-30T09:22:59Z","abstract_excerpt":"The Metropolis-Adjusted Langevin Algorithm (MALA) is a Markov Chain Monte Carlo method which creates a Markov chain reversible with respect to a given target distribution, pi^N, with Lebesgue density on R^N; it can hence be used to approximately sample the target distribution. When the dimension N is large a key question is to determine the computational cost of the algorithm as a function of N. One approach to this question, which we adopt here, is to derive diffusion limits for the algorithm. The family of target measures that we consider in this paper are, in general, in non-product form an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08379","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":"1608.08379","created_at":"2026-05-18T00:36:51.560264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08379v2","created_at":"2026-05-18T00:36:51.560264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08379","created_at":"2026-05-18T00:36:51.560264+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMIC4QCD2QOM","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMIC4QCD2QOM5PVE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMIC4QCD","created_at":"2026-05-18T12:30:12.583610+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/EMIC4QCD2QOM5PVE6MC22IDYGP","json":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP.json","graph_json":"https://pith.science/api/pith-number/EMIC4QCD2QOM5PVE6MC22IDYGP/graph.json","events_json":"https://pith.science/api/pith-number/EMIC4QCD2QOM5PVE6MC22IDYGP/events.json","paper":"https://pith.science/paper/EMIC4QCD"},"agent_actions":{"view_html":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP","download_json":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP.json","view_paper":"https://pith.science/paper/EMIC4QCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08379&json=true","fetch_graph":"https://pith.science/api/pith-number/EMIC4QCD2QOM5PVE6MC22IDYGP/graph.json","fetch_events":"https://pith.science/api/pith-number/EMIC4QCD2QOM5PVE6MC22IDYGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/action/storage_attestation","attest_author":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/action/author_attestation","sign_citation":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/action/citation_signature","submit_replication":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/action/replication_record"}},"created_at":"2026-05-18T00:36:51.560264+00:00","updated_at":"2026-05-18T00:36:51.560264+00:00"}