{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4PESKAV4CDQADHN4XJY7JCKN3G","short_pith_number":"pith:4PESKAV4","canonical_record":{"source":{"id":"1808.03230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T16:46:51Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"abc8ee692dd2477e66be9111d1f19f4ca91c440f466f3d9288bc89ac949ccbcc","abstract_canon_sha256":"ceab85f9dbc87bdbab4a6e514cdd01ad5dca9d7e61e99c7b194f490e086d4561"},"schema_version":"1.0"},"canonical_sha256":"e3c92502bc10e0019dbcba71f4894dd9ae061dcd52bd4fd7f4ce9367b7663390","source":{"kind":"arxiv","id":"1808.03230","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03230","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03230v2","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03230","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"pith_short_12","alias_value":"4PESKAV4CDQA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PESKAV4CDQADHN4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PESKAV4","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4PESKAV4CDQADHN4XJY7JCKN3G","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T16:46:51Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"abc8ee692dd2477e66be9111d1f19f4ca91c440f466f3d9288bc89ac949ccbcc","abstract_canon_sha256":"ceab85f9dbc87bdbab4a6e514cdd01ad5dca9d7e61e99c7b194f490e086d4561"},"schema_version":"1.0"},"canonical_sha256":"e3c92502bc10e0019dbcba71f4894dd9ae061dcd52bd4fd7f4ce9367b7663390","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:37.104731Z","signature_b64":"+m1mexf08C/RE44Kj9nUxfbn8+9shXQgOAlI/K44OMff9eWcvKuDghQyD51dTMk7aMv9PrONKUj5rWfLTTxrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3c92502bc10e0019dbcba71f4894dd9ae061dcd52bd4fd7f4ce9367b7663390","last_reissued_at":"2026-05-18T00:06:37.104202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:37.104202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03230","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:06:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3KaG/pshDPoWmsRD7X0kJ3XxHZcwrFzAOOLPRcGDsi68buMR9v3rSPE+4k9CgsHZRD39X31ccKwhCTDWYvpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:09:50.633937Z"},"content_sha256":"c067ea3c17d20fc0f20b0e7ac467482778edbdf86692b983867aefb3023870a2","schema_version":"1.0","event_id":"sha256:c067ea3c17d20fc0f20b0e7ac467482778edbdf86692b983867aefb3023870a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4PESKAV4CDQADHN4XJY7JCKN3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ME","stat.ML"],"primary_cat":"math.PR","authors_text":"Aaron Smith, Natesh S. Pillai, Oren Mangoubi","submitted_at":"2018-08-09T16:46:51Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) is a very popular and generic collection of Markov chain Monte Carlo (MCMC) algorithms. One explanation for the popularity of HMC algorithms is their excellent performance as the dimension $d$ of the target becomes large: under conditions that are satisfied for many common statistical models, optimally-tuned HMC algorithms have a running time that scales like $d^{0.25}$. In stark contrast, the running time of the usual Random-Walk Metropolis (RWM) algorithm, optimally tuned, scales like $d$. This superior scaling of the HMC algorithm with dimension is attributed t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03230","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:06:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZE6jomToll/49/ICNeBl0cnf6k/Odk86VoT3DVaIFzcE0ZaPfTAIwHNOACYJGTcrfdOdbdjDn5d9T45IwXECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T14:09:50.634774Z"},"content_sha256":"894f9f37b68b0bf28b8a36acc55fbbe76c568998dbb910f31013db5cf14ace5b","schema_version":"1.0","event_id":"sha256:894f9f37b68b0bf28b8a36acc55fbbe76c568998dbb910f31013db5cf14ace5b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4PESKAV4CDQADHN4XJY7JCKN3G/bundle.json","state_url":"https://pith.science/pith/4PESKAV4CDQADHN4XJY7JCKN3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4PESKAV4CDQADHN4XJY7JCKN3G/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-20T14:09:50Z","links":{"resolver":"https://pith.science/pith/4PESKAV4CDQADHN4XJY7JCKN3G","bundle":"https://pith.science/pith/4PESKAV4CDQADHN4XJY7JCKN3G/bundle.json","state":"https://pith.science/pith/4PESKAV4CDQADHN4XJY7JCKN3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4PESKAV4CDQADHN4XJY7JCKN3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4PESKAV4CDQADHN4XJY7JCKN3G","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":"ceab85f9dbc87bdbab4a6e514cdd01ad5dca9d7e61e99c7b194f490e086d4561","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T16:46:51Z","title_canon_sha256":"abc8ee692dd2477e66be9111d1f19f4ca91c440f466f3d9288bc89ac949ccbcc"},"schema_version":"1.0","source":{"id":"1808.03230","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03230","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03230v2","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03230","created_at":"2026-05-18T00:06:37Z"},{"alias_kind":"pith_short_12","alias_value":"4PESKAV4CDQA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4PESKAV4CDQADHN4","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4PESKAV4","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:894f9f37b68b0bf28b8a36acc55fbbe76c568998dbb910f31013db5cf14ace5b","target":"graph","created_at":"2026-05-18T00:06:37Z","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":"Hamiltonian Monte Carlo (HMC) is a very popular and generic collection of Markov chain Monte Carlo (MCMC) algorithms. One explanation for the popularity of HMC algorithms is their excellent performance as the dimension $d$ of the target becomes large: under conditions that are satisfied for many common statistical models, optimally-tuned HMC algorithms have a running time that scales like $d^{0.25}$. In stark contrast, the running time of the usual Random-Walk Metropolis (RWM) algorithm, optimally tuned, scales like $d$. This superior scaling of the HMC algorithm with dimension is attributed t","authors_text":"Aaron Smith, Natesh S. Pillai, Oren Mangoubi","cross_cats":["cs.LG","stat.CO","stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T16:46:51Z","title":"Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03230","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:c067ea3c17d20fc0f20b0e7ac467482778edbdf86692b983867aefb3023870a2","target":"record","created_at":"2026-05-18T00:06:37Z","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":"ceab85f9dbc87bdbab4a6e514cdd01ad5dca9d7e61e99c7b194f490e086d4561","cross_cats_sorted":["cs.LG","stat.CO","stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-08-09T16:46:51Z","title_canon_sha256":"abc8ee692dd2477e66be9111d1f19f4ca91c440f466f3d9288bc89ac949ccbcc"},"schema_version":"1.0","source":{"id":"1808.03230","kind":"arxiv","version":2}},"canonical_sha256":"e3c92502bc10e0019dbcba71f4894dd9ae061dcd52bd4fd7f4ce9367b7663390","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3c92502bc10e0019dbcba71f4894dd9ae061dcd52bd4fd7f4ce9367b7663390","first_computed_at":"2026-05-18T00:06:37.104202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:37.104202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+m1mexf08C/RE44Kj9nUxfbn8+9shXQgOAlI/K44OMff9eWcvKuDghQyD51dTMk7aMv9PrONKUj5rWfLTTxrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:37.104731Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03230","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c067ea3c17d20fc0f20b0e7ac467482778edbdf86692b983867aefb3023870a2","sha256:894f9f37b68b0bf28b8a36acc55fbbe76c568998dbb910f31013db5cf14ace5b"],"state_sha256":"dc5134b9201bab22e9aab25732672026e33a12a45bed87415100917ad2539309"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9DRZJ76KgBXSUx8KNMF7j8x9p4XXaVkogFGSWjvyLeydUNmTCmX7ZY9k3aMH6qSM6J67vm28Ar60P/FwkP+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T14:09:50.638434Z","bundle_sha256":"fac9d67d28113e05eb71c39804f6fae998abbbc2a1c97c61f4130bab0332b06e"}}