{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZGZLRQUVNI4N75FFPBYVIOUMWD","short_pith_number":"pith:ZGZLRQUV","schema_version":"1.0","canonical_sha256":"c9b2b8c2956a38dff4a57871543a8cb0c4d4e2ea23acba7b549cc934837db727","source":{"kind":"arxiv","id":"2303.15918","version":2},"attestation_state":"computed","paper":{"title":"Unbiasing Hamiltonian Monte Carlo algorithms for a general Hamiltonian function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gabriel Stoltz, R\\'egis Santet, Tony Leli\\`evre","submitted_at":"2023-03-28T12:12:07Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo method that allows to sample high dimensional probability measures. It relies on the integration of the Hamiltonian dynamics to propose a move which is then accepted or rejected thanks to a Metropolis procedure. Unbiased sampling is guaranteed by the preservation by the numerical integrators of two key properties of the Hamiltonian dynamics: volume-preservation and reversibility up to momentum reversal. For separable Hamiltonian functions, some standard explicit numerical schemes, such as the St\\\"ormer-Verlet integrator, satisfy these"},"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":"2303.15918","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NA","submitted_at":"2023-03-28T12:12:07Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"4976e8d78e5d2952c4bed29c6ceff7514cecec995d1fc72809659a56b8fa0a34","abstract_canon_sha256":"8423f34be140d30ac13c84c1a4ede70b51f96bc8e40f2c0aea240b692a4fd4e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:57.433715Z","signature_b64":"yjXAbQWPdnj0iih+9GtJav9DWKxTv7HBYp3CCwk6Rb4PnmOCSlQP68JFgVHrfO10+lWGWpnG6j1/YA5OUmZcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b2b8c2956a38dff4a57871543a8cb0c4d4e2ea23acba7b549cc934837db727","last_reissued_at":"2026-07-05T06:37:57.433191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:57.433191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unbiasing Hamiltonian Monte Carlo algorithms for a general Hamiltonian function","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Gabriel Stoltz, R\\'egis Santet, Tony Leli\\`evre","submitted_at":"2023-03-28T12:12:07Z","abstract_excerpt":"Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo method that allows to sample high dimensional probability measures. It relies on the integration of the Hamiltonian dynamics to propose a move which is then accepted or rejected thanks to a Metropolis procedure. Unbiased sampling is guaranteed by the preservation by the numerical integrators of two key properties of the Hamiltonian dynamics: volume-preservation and reversibility up to momentum reversal. For separable Hamiltonian functions, some standard explicit numerical schemes, such as the St\\\"ormer-Verlet integrator, satisfy these"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.15918","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.15918/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.15918","created_at":"2026-07-05T06:37:57.433254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.15918v2","created_at":"2026-07-05T06:37:57.433254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.15918","created_at":"2026-07-05T06:37:57.433254+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGZLRQUVNI4N","created_at":"2026-07-05T06:37:57.433254+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGZLRQUVNI4N75FF","created_at":"2026-07-05T06:37:57.433254+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGZLRQUV","created_at":"2026-07-05T06:37:57.433254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02943","citing_title":"Efficient Langevin sampling with position-dependent diffusion","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD","json":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD.json","graph_json":"https://pith.science/api/pith-number/ZGZLRQUVNI4N75FFPBYVIOUMWD/graph.json","events_json":"https://pith.science/api/pith-number/ZGZLRQUVNI4N75FFPBYVIOUMWD/events.json","paper":"https://pith.science/paper/ZGZLRQUV"},"agent_actions":{"view_html":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD","download_json":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD.json","view_paper":"https://pith.science/paper/ZGZLRQUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.15918&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGZLRQUVNI4N75FFPBYVIOUMWD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGZLRQUVNI4N75FFPBYVIOUMWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD/action/storage_attestation","attest_author":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD/action/author_attestation","sign_citation":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD/action/citation_signature","submit_replication":"https://pith.science/pith/ZGZLRQUVNI4N75FFPBYVIOUMWD/action/replication_record"}},"created_at":"2026-07-05T06:37:57.433254+00:00","updated_at":"2026-07-05T06:37:57.433254+00:00"}