{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EMIC4QCD2QOM5PVE6MC22IDYGP","short_pith_number":"pith:EMIC4QCD","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"},"canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","source":{"kind":"arxiv","id":"1608.08379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08379","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08379v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08379","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"EMIC4QCD2QOM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMIC4QCD2QOM5PVE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMIC4QCD","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EMIC4QCD2QOM5PVE6MC22IDYGP","target":"record","payload":{"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"},"canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","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"},"source_kind":"arxiv","source_id":"1608.08379","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3JIu7dl8cesjwW8IVFWDJ6iJ29nXVw2qDGUi/ih+ngBrsNcX7b6Sa0yuZqxONZsuhleCJGkhXjx5LcRz/mKXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:16.802823Z"},"content_sha256":"a87a78f49eb64216d13df7ab48e09535448c451e8bc0ef92a000c6bcce337c3f","schema_version":"1.0","event_id":"sha256:a87a78f49eb64216d13df7ab48e09535448c451e8bc0ef92a000c6bcce337c3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EMIC4QCD2QOM5PVE6MC22IDYGP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4rpKjP1eY72sTnOSKz7g/SjAi9AxkL3gJUnIU/x/6FcsiDDvHjVxMFL8mmxyWLEpViV2GELxhi4y1kSU16aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:47:16.803199Z"},"content_sha256":"7cabd051e42ad3668ee263a5e47ab9bc9c4da56c29955e626e5f822a0cc5a08e","schema_version":"1.0","event_id":"sha256:7cabd051e42ad3668ee263a5e47ab9bc9c4da56c29955e626e5f822a0cc5a08e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/bundle.json","state_url":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T20:47:16Z","links":{"resolver":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP","bundle":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/bundle.json","state":"https://pith.science/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMIC4QCD2QOM5PVE6MC22IDYGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EMIC4QCD2QOM5PVE6MC22IDYGP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ca0877a63d1270609d127d937c1eb0b0b750d3c20a560f369f7eb9e29285c96f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-30T09:22:59Z","title_canon_sha256":"9a2daf635ed78a59c82f91be77707c9e4aa62d875068f61ce80bcdf4848dbd10"},"schema_version":"1.0","source":{"id":"1608.08379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08379","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08379v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08379","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"EMIC4QCD2QOM","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMIC4QCD2QOM5PVE","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMIC4QCD","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:7cabd051e42ad3668ee263a5e47ab9bc9c4da56c29955e626e5f822a0cc5a08e","target":"graph","created_at":"2026-05-18T00:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"A.M. Stuart, J. Kuntz, M. Ottobre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-30T09:22:59Z","title":"Non-stationary phase of the MALA algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08379","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a87a78f49eb64216d13df7ab48e09535448c451e8bc0ef92a000c6bcce337c3f","target":"record","created_at":"2026-05-18T00:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ca0877a63d1270609d127d937c1eb0b0b750d3c20a560f369f7eb9e29285c96f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-30T09:22:59Z","title_canon_sha256":"9a2daf635ed78a59c82f91be77707c9e4aa62d875068f61ce80bcdf4848dbd10"},"schema_version":"1.0","source":{"id":"1608.08379","kind":"arxiv","version":2}},"canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23102e4043d41ccebea4f305ad207833c90aaed960b842d3d0f857450c58ed85","first_computed_at":"2026-05-18T00:36:51.560179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:51.560179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TD9thfU2Zx1baGB/uNm0rGwi8/fQTzuK9KcvPePyOIk1+c09LMvP9wngkNpHGEEEEti9z8nUPFeP3Fen+DoWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:51.560911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a87a78f49eb64216d13df7ab48e09535448c451e8bc0ef92a000c6bcce337c3f","sha256:7cabd051e42ad3668ee263a5e47ab9bc9c4da56c29955e626e5f822a0cc5a08e"],"state_sha256":"8e1b417191eebafa6948ed6755499ac674a448d6e1195b02403e928755e9dbd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DHh5w/Q0RI4WdjKTVOcYkiY4ClwdpDqX8QC3DXhMG2cHYyin3UQq1SF+9BtVBkq+lYjoAU8NjxYZVCMwvoWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:47:16.805446Z","bundle_sha256":"4aa5b092a960e9cf7529c69e6c87942350d40a7162707c7838bc28dbfb5b4b3f"}}