{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OQMZGWL7EF3SNLA5A5HHRH64LK","short_pith_number":"pith:OQMZGWL7","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"},"canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","source":{"kind":"arxiv","id":"1405.4896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4896","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4896v2","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4896","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"OQMZGWL7EF3S","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQMZGWL7EF3SNLA5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQMZGWL7","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OQMZGWL7EF3SNLA5A5HHRH64LK","target":"record","payload":{"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"},"canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","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"},"source_kind":"arxiv","source_id":"1405.4896","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-18T01:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2L+TcH2csbc8Meg1cxSeEexAUghuZyxzosNuFnpHGb7b/yXY8EYjpy5NmK+/lSDZNPKHtL60KeOh1cEhm3TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:51.207269Z"},"content_sha256":"2bd609d79a65004267a531886329795d76dab6d1304453785c3a7b24b00b2cb5","schema_version":"1.0","event_id":"sha256:2bd609d79a65004267a531886329795d76dab6d1304453785c3a7b24b00b2cb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OQMZGWL7EF3SNLA5A5HHRH64LK","target":"graph","payload":{"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"},"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-18T01:07:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7r64qrUuUpbzgYK1a7L6ivzj13V7hC+kYVWLp/wNhyNAKHydKoQ6x699tnVSNlhf21Ben0FJLigXCF+HJE6KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:25:51.207643Z"},"content_sha256":"d24a23164d0433e05543c273ff43fc8c287cf03035f4144b03de7ace95ec8e9c","schema_version":"1.0","event_id":"sha256:d24a23164d0433e05543c273ff43fc8c287cf03035f4144b03de7ace95ec8e9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/bundle.json","state_url":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/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-03T02:25:51Z","links":{"resolver":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK","bundle":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/bundle.json","state":"https://pith.science/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OQMZGWL7EF3SNLA5A5HHRH64LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OQMZGWL7EF3SNLA5A5HHRH64LK","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":"c051932aefd192bd172022b55009bdcb041fd435e63484d81f7403adbb9ec81b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-19T21:03:50Z","title_canon_sha256":"df225cd1783a454efebd17a59de732fb99b88542618e38af495b1bd080f5e3e6"},"schema_version":"1.0","source":{"id":"1405.4896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4896","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4896v2","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4896","created_at":"2026-05-18T01:07:21Z"},{"alias_kind":"pith_short_12","alias_value":"OQMZGWL7EF3S","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OQMZGWL7EF3SNLA5","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OQMZGWL7","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:d24a23164d0433e05543c273ff43fc8c287cf03035f4144b03de7ace95ec8e9c","target":"graph","created_at":"2026-05-18T01:07:21Z","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 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","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":"2014-05-19T21:03:50Z","title":"Diffusion Limit For The Random Walk Metropolis Algorithm Out Of stationarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4896","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:2bd609d79a65004267a531886329795d76dab6d1304453785c3a7b24b00b2cb5","target":"record","created_at":"2026-05-18T01:07:21Z","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":"c051932aefd192bd172022b55009bdcb041fd435e63484d81f7403adbb9ec81b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-05-19T21:03:50Z","title_canon_sha256":"df225cd1783a454efebd17a59de732fb99b88542618e38af495b1bd080f5e3e6"},"schema_version":"1.0","source":{"id":"1405.4896","kind":"arxiv","version":2}},"canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"741993597f217726ac1d074e789fdc5ab1120b83c5358683bf4a1c496126aa87","first_computed_at":"2026-05-18T01:07:21.373177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:21.373177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qrpq6cs5YcIewd7i7DrlLlfIQjy6PXnsCcA8uuncqcESKyDWyv6u4xbaJ+CzA3FAWIEi5MpKsW0zZaAMoCY1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:21.373614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2bd609d79a65004267a531886329795d76dab6d1304453785c3a7b24b00b2cb5","sha256:d24a23164d0433e05543c273ff43fc8c287cf03035f4144b03de7ace95ec8e9c"],"state_sha256":"fd634c3a6987abae86984af945450705231488d87926ef4243719537fe028324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YObX+j50HlUHbei3QoLeAbfISZzYr0bP3a88XWl/wWQxbTJ8ZIV1WlBmpXiPcRcgLw0VEY+4KUtJ4QrIbNvoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:25:51.209553Z","bundle_sha256":"203e18cc2cdad53fc16f99934d3f3e0ab0f45dce9009e975f6a6d05cc7774c73"}}