{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ODXN335S3AWMFHSK5TBULRFMXA","short_pith_number":"pith:ODXN335S","schema_version":"1.0","canonical_sha256":"70eeddefb2d82cc29e4aecc345c4acb82aa15042e523402c5bb759919160e4c2","source":{"kind":"arxiv","id":"1708.07114","version":1},"attestation_state":"computed","paper":{"title":"Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME"],"primary_cat":"math.PR","authors_text":"Aaron Smith, Oren Mangoubi","submitted_at":"2017-08-23T17:29:10Z","abstract_excerpt":"We obtain several quantitative bounds on the mixing properties of the Hamiltonian Monte Carlo (HMC) algorithm for a strongly log-concave target distribution $\\pi$ on $\\mathbb{R}^{d}$, showing that HMC mixes quickly in this setting. One of our main results is a dimension-free bound on the mixing of an \"ideal\" HMC chain, which is used to show that the usual leapfrog implementation of HMC can sample from $\\pi$ using only $\\mathcal{O}(d^{\\frac{1}{4}})$ gradient evaluations. This dependence on dimension is sharp, and our results significantly extend and improve previous quantitative bounds on the m"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1708.07114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-08-23T17:29:10Z","cross_cats_sorted":["stat.CO","stat.ME"],"title_canon_sha256":"6c9688163c72c19eea997192fb9bc3c7b69d96580a9f94ebcb24955ec2afcd65","abstract_canon_sha256":"5d0c667274d77a522299b0904210a756b7351786fc0aec403bff9af7ca6a5cf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.362915Z","signature_b64":"WyplRtJ80SdgvzNtST2Thfd3qvPaVM6+B54UVRC6Sb81NJRNnnOYjRcxvTiBVn9zE33lb7fFUE6GYByE71IvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70eeddefb2d82cc29e4aecc345c4acb82aa15042e523402c5bb759919160e4c2","last_reissued_at":"2026-05-18T00:36:48.362258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.362258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ME"],"primary_cat":"math.PR","authors_text":"Aaron Smith, Oren Mangoubi","submitted_at":"2017-08-23T17:29:10Z","abstract_excerpt":"We obtain several quantitative bounds on the mixing properties of the Hamiltonian Monte Carlo (HMC) algorithm for a strongly log-concave target distribution $\\pi$ on $\\mathbb{R}^{d}$, showing that HMC mixes quickly in this setting. One of our main results is a dimension-free bound on the mixing of an \"ideal\" HMC chain, which is used to show that the usual leapfrog implementation of HMC can sample from $\\pi$ using only $\\mathcal{O}(d^{\\frac{1}{4}})$ gradient evaluations. This dependence on dimension is sharp, and our results significantly extend and improve previous quantitative bounds on the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07114","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07114","created_at":"2026-05-18T00:36:48.362363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07114v1","created_at":"2026-05-18T00:36:48.362363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07114","created_at":"2026-05-18T00:36:48.362363+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODXN335S3AWM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODXN335S3AWMFHSK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODXN335S","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA","json":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA.json","graph_json":"https://pith.science/api/pith-number/ODXN335S3AWMFHSK5TBULRFMXA/graph.json","events_json":"https://pith.science/api/pith-number/ODXN335S3AWMFHSK5TBULRFMXA/events.json","paper":"https://pith.science/paper/ODXN335S"},"agent_actions":{"view_html":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA","download_json":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA.json","view_paper":"https://pith.science/paper/ODXN335S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07114&json=true","fetch_graph":"https://pith.science/api/pith-number/ODXN335S3AWMFHSK5TBULRFMXA/graph.json","fetch_events":"https://pith.science/api/pith-number/ODXN335S3AWMFHSK5TBULRFMXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA/action/storage_attestation","attest_author":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA/action/author_attestation","sign_citation":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA/action/citation_signature","submit_replication":"https://pith.science/pith/ODXN335S3AWMFHSK5TBULRFMXA/action/replication_record"}},"created_at":"2026-05-18T00:36:48.362363+00:00","updated_at":"2026-05-18T00:36:48.362363+00:00"}