{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OX5IGVDMTOF7KM6AUSE635V5SA","short_pith_number":"pith:OX5IGVDM","canonical_record":{"source":{"id":"1411.0712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-03T21:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"49428b4b7ef52d4528b9cbec767ade08d42cfb83fd2fa3a16368ae10fc6d10d4","abstract_canon_sha256":"ad4869394d987bee39e6e5e30a0fed003fb8c5133cf3b0b45795b356b84daee7"},"schema_version":"1.0"},"canonical_sha256":"75fa83546c9b8bf533c0a489edf6bd9021da5d3095b7b3689404ab755a001289","source":{"kind":"arxiv","id":"1411.0712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0712","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0712v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0712","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"OX5IGVDMTOF7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX5IGVDMTOF7KM6A","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX5IGVDM","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OX5IGVDMTOF7KM6AUSE635V5SA","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-03T21:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"49428b4b7ef52d4528b9cbec767ade08d42cfb83fd2fa3a16368ae10fc6d10d4","abstract_canon_sha256":"ad4869394d987bee39e6e5e30a0fed003fb8c5133cf3b0b45795b356b84daee7"},"schema_version":"1.0"},"canonical_sha256":"75fa83546c9b8bf533c0a489edf6bd9021da5d3095b7b3689404ab755a001289","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.393202Z","signature_b64":"Rt76RQMr1WEwMtzluYzxiAE9B/mUMGcasW7K+9NEUyyFUynv9Ikix4/Lp2OkSCkK3XhNsTRkQ9/iBmFISXMxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75fa83546c9b8bf533c0a489edf6bd9021da5d3095b7b3689404ab755a001289","last_reissued_at":"2026-05-18T02:38:38.392814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.392814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0712","source_version":1,"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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCq3c17sQuY4vtTqk3hYdInd9Kh6r/aSNrce9j1W6z3nztPxB+mnCWhKZjA5zbsl2zc8q6q3T+382ka9pE1PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:31.810240Z"},"content_sha256":"7a66302064ee4da42755b5f0f34ab0b0ee723a7f91dbd99af83848f89f7ecde0","schema_version":"1.0","event_id":"sha256:7a66302064ee4da42755b5f0f34ab0b0ee723a7f91dbd99af83848f89f7ecde0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OX5IGVDMTOF7KM6AUSE635V5SA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Bounds for MCMC via Diffusion Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Gareth O. Roberts, Jeffrey S. Rosenthal","submitted_at":"2014-11-03T21:42:29Z","abstract_excerpt":"We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assumptions, the Random-Walk Metropolis (RWM) algorithm in $d$ dimensions takes $O(d)$ iterations to converge to stationarity, while the Metropolis-Adjusted Langevin Algorithm (MALA) takes $O(d^{1/3})$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0712","kind":"arxiv","version":1},"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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsReA/1xbI/dQx/XEprLvXU5NnV1hW7TWJCK1v+izfaJtuUX/bR34cZlZcMAX0/LafWG97wUJsQvgy4xzeCgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:24:31.810585Z"},"content_sha256":"e77d81fd2c1405afeef90a890173408fd1f0395aebaf83da682f655926d72502","schema_version":"1.0","event_id":"sha256:e77d81fd2c1405afeef90a890173408fd1f0395aebaf83da682f655926d72502"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OX5IGVDMTOF7KM6AUSE635V5SA/bundle.json","state_url":"https://pith.science/pith/OX5IGVDMTOF7KM6AUSE635V5SA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OX5IGVDMTOF7KM6AUSE635V5SA/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-23T16:24:31Z","links":{"resolver":"https://pith.science/pith/OX5IGVDMTOF7KM6AUSE635V5SA","bundle":"https://pith.science/pith/OX5IGVDMTOF7KM6AUSE635V5SA/bundle.json","state":"https://pith.science/pith/OX5IGVDMTOF7KM6AUSE635V5SA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OX5IGVDMTOF7KM6AUSE635V5SA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OX5IGVDMTOF7KM6AUSE635V5SA","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":"ad4869394d987bee39e6e5e30a0fed003fb8c5133cf3b0b45795b356b84daee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-03T21:42:29Z","title_canon_sha256":"49428b4b7ef52d4528b9cbec767ade08d42cfb83fd2fa3a16368ae10fc6d10d4"},"schema_version":"1.0","source":{"id":"1411.0712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0712","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0712v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0712","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"OX5IGVDMTOF7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OX5IGVDMTOF7KM6A","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OX5IGVDM","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:e77d81fd2c1405afeef90a890173408fd1f0395aebaf83da682f655926d72502","target":"graph","created_at":"2026-05-18T02:38:38Z","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":"We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a corresponding complexity bound (in an appropriate metric). We then combine this result with previously-known MCMC diffusion limit results to prove that under appropriate assumptions, the Random-Walk Metropolis (RWM) algorithm in $d$ dimensions takes $O(d)$ iterations to converge to stationarity, while the Metropolis-Adjusted Langevin Algorithm (MALA) takes $O(d^{1/3})$ ","authors_text":"Gareth O. Roberts, Jeffrey S. Rosenthal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-03T21:42:29Z","title":"Complexity Bounds for MCMC via Diffusion Limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0712","kind":"arxiv","version":1},"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:7a66302064ee4da42755b5f0f34ab0b0ee723a7f91dbd99af83848f89f7ecde0","target":"record","created_at":"2026-05-18T02:38:38Z","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":"ad4869394d987bee39e6e5e30a0fed003fb8c5133cf3b0b45795b356b84daee7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-11-03T21:42:29Z","title_canon_sha256":"49428b4b7ef52d4528b9cbec767ade08d42cfb83fd2fa3a16368ae10fc6d10d4"},"schema_version":"1.0","source":{"id":"1411.0712","kind":"arxiv","version":1}},"canonical_sha256":"75fa83546c9b8bf533c0a489edf6bd9021da5d3095b7b3689404ab755a001289","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75fa83546c9b8bf533c0a489edf6bd9021da5d3095b7b3689404ab755a001289","first_computed_at":"2026-05-18T02:38:38.392814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.392814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rt76RQMr1WEwMtzluYzxiAE9B/mUMGcasW7K+9NEUyyFUynv9Ikix4/Lp2OkSCkK3XhNsTRkQ9/iBmFISXMxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.393202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a66302064ee4da42755b5f0f34ab0b0ee723a7f91dbd99af83848f89f7ecde0","sha256:e77d81fd2c1405afeef90a890173408fd1f0395aebaf83da682f655926d72502"],"state_sha256":"4bebc08f103cb80f90577c5ae6406ce55f04c10288f6bc3a7a962aa86fe67056"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nOHfORSqXumn7NcGe2I6qBSXRneLhHEpoKCLOWJ9UDcjBTZxl0bcvrcn6qsRopMRrvBVUcY1FCGp5lqq4nb8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:24:31.812463Z","bundle_sha256":"81a9e96d4a26dfb1d7f29ae6f2086ce857d782bdd924f2e3ac409faf8135b698"}}