{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PNVMPMKZUL74RDMJJ6FZNEOCRW","short_pith_number":"pith:PNVMPMKZ","canonical_record":{"source":{"id":"1507.02166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T14:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"f1d82cc41f7064deb1a2023ecfae329ce0a5813fe616c0a846a7103661f32e4e","abstract_canon_sha256":"a40240148601b94cd5d08c35720696713d5ba0664e2c2ae96b5bb5245a94417e"},"schema_version":"1.0"},"canonical_sha256":"7b6ac7b159a2ffc88d894f8b9691c28da47ab3a6d705ae72026259f623d9acf0","source":{"kind":"arxiv","id":"1507.02166","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02166","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02166v3","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02166","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"PNVMPMKZUL74","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNVMPMKZUL74RDMJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNVMPMKZ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PNVMPMKZUL74RDMJJ6FZNEOCRW","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02166","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T14:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"f1d82cc41f7064deb1a2023ecfae329ce0a5813fe616c0a846a7103661f32e4e","abstract_canon_sha256":"a40240148601b94cd5d08c35720696713d5ba0664e2c2ae96b5bb5245a94417e"},"schema_version":"1.0"},"canonical_sha256":"7b6ac7b159a2ffc88d894f8b9691c28da47ab3a6d705ae72026259f623d9acf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:46.747823Z","signature_b64":"0/0g9Jt8GFII2BwKDWL5GCUNAr4ZFAecf81VtUkYuzz04kvHH/RiFbQjzaGFTdvvWN8Xvmpv/GPINU2j/b+iDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b6ac7b159a2ffc88d894f8b9691c28da47ab3a6d705ae72026259f623d9acf0","last_reissued_at":"2026-05-18T00:56:46.747337Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:46.747337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02166","source_version":3,"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:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3yz1rX+7sjHYwM7JSKWiAYzUXFp5/EOphvol3C/3lHe8bZKd4LDWGeSE01r6XGf80txEOK9rnGfvLWhBOGpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:31:49.744141Z"},"content_sha256":"3fa03279e0ac5fd9cfc5a9f51a541aa2017dd00a727dcfb7308f3a76612d9cc3","schema_version":"1.0","event_id":"sha256:3fa03279e0ac5fd9cfc5a9f51a541aa2017dd00a727dcfb7308f3a76612d9cc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PNVMPMKZUL74RDMJJ6FZNEOCRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Langevin based algorithm for MCMC in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Alain Durmus, Gareth O. Roberts, Gilles Vilmart, Konstantinos C. Zygalakis","submitted_at":"2015-07-08T14:21:37Z","abstract_excerpt":"We introduce new Gaussian proposals to improve the efficiency of the standard Hastings-Metropolis algorithm in Markov chain Monte Carlo (MCMC) methods, used for the sampling from a target distribution in large dimension $d$. The improved complexity is $\\mathcal{O}(d^{1/5})$ compared to the complexity $\\mathcal{O}(d^{1/3})$ of the standard approach. We prove an asymptotic diffusion limit theorem and show that the relative efficiency of the algorithm can be characterised by its overall acceptance rate (with asymptotical value 0.704), independently of the target distribution. Numerical experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02166","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"},"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:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qkv8AMITmJtLq/f6uflbTzyjwtWm8zKhok2PiohEZoyDiis2k/y/ShCNenlB1UL5BQROMre3wzU07UJ3XI6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:31:49.744816Z"},"content_sha256":"43e28429081c36c5e808be5d2efec51f61f31d4abcb263c18d6ac5762ab0bddf","schema_version":"1.0","event_id":"sha256:43e28429081c36c5e808be5d2efec51f61f31d4abcb263c18d6ac5762ab0bddf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/bundle.json","state_url":"https://pith.science/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/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-05-27T17:31:49Z","links":{"resolver":"https://pith.science/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW","bundle":"https://pith.science/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/bundle.json","state":"https://pith.science/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNVMPMKZUL74RDMJJ6FZNEOCRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PNVMPMKZUL74RDMJJ6FZNEOCRW","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":"a40240148601b94cd5d08c35720696713d5ba0664e2c2ae96b5bb5245a94417e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T14:21:37Z","title_canon_sha256":"f1d82cc41f7064deb1a2023ecfae329ce0a5813fe616c0a846a7103661f32e4e"},"schema_version":"1.0","source":{"id":"1507.02166","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02166","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02166v3","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02166","created_at":"2026-05-18T00:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"PNVMPMKZUL74","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNVMPMKZUL74RDMJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNVMPMKZ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:43e28429081c36c5e808be5d2efec51f61f31d4abcb263c18d6ac5762ab0bddf","target":"graph","created_at":"2026-05-18T00:56:46Z","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 introduce new Gaussian proposals to improve the efficiency of the standard Hastings-Metropolis algorithm in Markov chain Monte Carlo (MCMC) methods, used for the sampling from a target distribution in large dimension $d$. The improved complexity is $\\mathcal{O}(d^{1/5})$ compared to the complexity $\\mathcal{O}(d^{1/3})$ of the standard approach. We prove an asymptotic diffusion limit theorem and show that the relative efficiency of the algorithm can be characterised by its overall acceptance rate (with asymptotical value 0.704), independently of the target distribution. Numerical experiment","authors_text":"Alain Durmus, Gareth O. Roberts, Gilles Vilmart, Konstantinos C. Zygalakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T14:21:37Z","title":"Fast Langevin based algorithm for MCMC in high dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02166","kind":"arxiv","version":3},"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:3fa03279e0ac5fd9cfc5a9f51a541aa2017dd00a727dcfb7308f3a76612d9cc3","target":"record","created_at":"2026-05-18T00:56:46Z","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":"a40240148601b94cd5d08c35720696713d5ba0664e2c2ae96b5bb5245a94417e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-08T14:21:37Z","title_canon_sha256":"f1d82cc41f7064deb1a2023ecfae329ce0a5813fe616c0a846a7103661f32e4e"},"schema_version":"1.0","source":{"id":"1507.02166","kind":"arxiv","version":3}},"canonical_sha256":"7b6ac7b159a2ffc88d894f8b9691c28da47ab3a6d705ae72026259f623d9acf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b6ac7b159a2ffc88d894f8b9691c28da47ab3a6d705ae72026259f623d9acf0","first_computed_at":"2026-05-18T00:56:46.747337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:46.747337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/0g9Jt8GFII2BwKDWL5GCUNAr4ZFAecf81VtUkYuzz04kvHH/RiFbQjzaGFTdvvWN8Xvmpv/GPINU2j/b+iDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:46.747823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02166","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fa03279e0ac5fd9cfc5a9f51a541aa2017dd00a727dcfb7308f3a76612d9cc3","sha256:43e28429081c36c5e808be5d2efec51f61f31d4abcb263c18d6ac5762ab0bddf"],"state_sha256":"b9e8409033119bdac435080ca1453b344c22f37d8f49370d16b2db58c7953f89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8Jd46N6b7JbZUm+cucBrrt5C63CFmFCURGFwlBJBChAkTd8WXy5jeH+j4etPlkhEOOYf7QWRoQYytdCz0/IAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:31:49.748201Z","bundle_sha256":"ac319177b1dbf95458967e3d8c18538f01d29950b3580387138040f549960870"}}