{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CICADTVILREXYCJH45TAGBPDPZ","short_pith_number":"pith:CICADTVI","schema_version":"1.0","canonical_sha256":"120401cea85c497c0927e7660305e37e6a115212ee274f5f3dcf8412d67038c7","source":{"kind":"arxiv","id":"2107.14542","version":3},"attestation_state":"computed","paper":{"title":"Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.CO"],"primary_cat":"math.PR","authors_text":"Alain Durmus, Aur\\'elien Enfroy, \\'Eric Moulines, Gabriel Stoltz","submitted_at":"2021-07-30T10:45:03Z","abstract_excerpt":"We study the convergence in total variation and $V$-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to approximatively sample from a target distribution of interest. We show first that, for a very large class of schemes, a minorization condition uniform in the stepsize holds. This class encompasses popular methods such as the Euler-Maruyama scheme and the schemes based on splitting strategies. Second, we provide mild conditions ensuring that the class of schemes that we co"},"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":"2107.14542","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-07-30T10:45:03Z","cross_cats_sorted":["cs.NA","math.NA","stat.CO"],"title_canon_sha256":"194fe2a6797a0c967f2a5afadfb448682b151854c98861981e8680964a9f889a","abstract_canon_sha256":"6671f391365dd9672cc399628d140ea47cf57978985ec415b9a8438fa2bf3db2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:03:06.202153Z","signature_b64":"+aN9x3H5W1Su55dKt5BGOeQuIUmIEzAvAavibPZkGv6G19KZZkhIj2Gh6D0uBjpIfuMWM9yX0g8fX+1AxRnxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"120401cea85c497c0927e7660305e37e6a115212ee274f5f3dcf8412d67038c7","last_reissued_at":"2026-07-05T06:03:06.201651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:03:06.201651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","stat.CO"],"primary_cat":"math.PR","authors_text":"Alain Durmus, Aur\\'elien Enfroy, \\'Eric Moulines, Gabriel Stoltz","submitted_at":"2021-07-30T10:45:03Z","abstract_excerpt":"We study the convergence in total variation and $V$-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to approximatively sample from a target distribution of interest. We show first that, for a very large class of schemes, a minorization condition uniform in the stepsize holds. This class encompasses popular methods such as the Euler-Maruyama scheme and the schemes based on splitting strategies. Second, we provide mild conditions ensuring that the class of schemes that we co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.14542","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.14542/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":"2107.14542","created_at":"2026-07-05T06:03:06.201711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.14542v3","created_at":"2026-07-05T06:03:06.201711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.14542","created_at":"2026-07-05T06:03:06.201711+00:00"},{"alias_kind":"pith_short_12","alias_value":"CICADTVILREX","created_at":"2026-07-05T06:03:06.201711+00:00"},{"alias_kind":"pith_short_16","alias_value":"CICADTVILREXYCJH","created_at":"2026-07-05T06:03:06.201711+00:00"},{"alias_kind":"pith_short_8","alias_value":"CICADTVI","created_at":"2026-07-05T06:03:06.201711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18911","citing_title":"A Langevin sampling algorithm inspired by the Adam optimizer","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ","json":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ.json","graph_json":"https://pith.science/api/pith-number/CICADTVILREXYCJH45TAGBPDPZ/graph.json","events_json":"https://pith.science/api/pith-number/CICADTVILREXYCJH45TAGBPDPZ/events.json","paper":"https://pith.science/paper/CICADTVI"},"agent_actions":{"view_html":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ","download_json":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ.json","view_paper":"https://pith.science/paper/CICADTVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.14542&json=true","fetch_graph":"https://pith.science/api/pith-number/CICADTVILREXYCJH45TAGBPDPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/CICADTVILREXYCJH45TAGBPDPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ/action/storage_attestation","attest_author":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ/action/author_attestation","sign_citation":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ/action/citation_signature","submit_replication":"https://pith.science/pith/CICADTVILREXYCJH45TAGBPDPZ/action/replication_record"}},"created_at":"2026-07-05T06:03:06.201711+00:00","updated_at":"2026-07-05T06:03:06.201711+00:00"}