{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VETIEBWHWU6MHH6ABPQYTWSSEB","short_pith_number":"pith:VETIEBWH","schema_version":"1.0","canonical_sha256":"a9268206c7b53cc39fc00be189da5220570dc226954655ceb6021fb0cacd9022","source":{"kind":"arxiv","id":"1608.05973","version":5},"attestation_state":"computed","paper":{"title":"Irreversible Samplers from Jump and Continuous Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Emily B. Fox, Lei Wu, Tianqi Chen, Yi-An Ma","submitted_at":"2016-08-21T17:40:09Z","abstract_excerpt":"In this paper, we propose irreversible versions of the Metropolis Hastings (MH) and Metropolis adjusted Langevin algorithm (MALA) with a main focus on the latter. For the former, we show how one can simply switch between different proposal and acceptance distributions upon rejection to obtain an irreversible jump sampler (I-Jump). The resulting algorithm has a simple implementation akin to MH, but with the demonstrated benefits of irreversibility. We then show how the previously proposed MALA method can also be extended to exploit irreversible stochastic dynamics as proposal distributions in t"},"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":"1608.05973","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-21T17:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"be27d3b08dba09421fa27b10e30db1f17e5c279acc279676fc6e1525f313837d","abstract_canon_sha256":"2f69e63b2bf319055936abbd3345574881d46fb73383e729960828177e025f82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:29.194960Z","signature_b64":"ByDJxvm69vJsNV/WaOKQUojveIYjhcNylKhrt5gSubVT9wP1V4ZsRlTJoAkinmAADF9QQgGsx1rGn0KJ0m2NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9268206c7b53cc39fc00be189da5220570dc226954655ceb6021fb0cacd9022","last_reissued_at":"2026-05-18T00:21:29.194339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:29.194339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Irreversible Samplers from Jump and Continuous Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Emily B. Fox, Lei Wu, Tianqi Chen, Yi-An Ma","submitted_at":"2016-08-21T17:40:09Z","abstract_excerpt":"In this paper, we propose irreversible versions of the Metropolis Hastings (MH) and Metropolis adjusted Langevin algorithm (MALA) with a main focus on the latter. For the former, we show how one can simply switch between different proposal and acceptance distributions upon rejection to obtain an irreversible jump sampler (I-Jump). The resulting algorithm has a simple implementation akin to MH, but with the demonstrated benefits of irreversibility. We then show how the previously proposed MALA method can also be extended to exploit irreversible stochastic dynamics as proposal distributions in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05973","kind":"arxiv","version":5},"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":"1608.05973","created_at":"2026-05-18T00:21:29.194430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05973v5","created_at":"2026-05-18T00:21:29.194430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05973","created_at":"2026-05-18T00:21:29.194430+00:00"},{"alias_kind":"pith_short_12","alias_value":"VETIEBWHWU6M","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VETIEBWHWU6MHH6A","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VETIEBWH","created_at":"2026-05-18T12:30:48.956258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.30532","citing_title":"True Self-Avoiding Walk for Accelerating Markov-Chain Monte Carlo Integration","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB","json":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB.json","graph_json":"https://pith.science/api/pith-number/VETIEBWHWU6MHH6ABPQYTWSSEB/graph.json","events_json":"https://pith.science/api/pith-number/VETIEBWHWU6MHH6ABPQYTWSSEB/events.json","paper":"https://pith.science/paper/VETIEBWH"},"agent_actions":{"view_html":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB","download_json":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB.json","view_paper":"https://pith.science/paper/VETIEBWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05973&json=true","fetch_graph":"https://pith.science/api/pith-number/VETIEBWHWU6MHH6ABPQYTWSSEB/graph.json","fetch_events":"https://pith.science/api/pith-number/VETIEBWHWU6MHH6ABPQYTWSSEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB/action/storage_attestation","attest_author":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB/action/author_attestation","sign_citation":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB/action/citation_signature","submit_replication":"https://pith.science/pith/VETIEBWHWU6MHH6ABPQYTWSSEB/action/replication_record"}},"created_at":"2026-05-18T00:21:29.194430+00:00","updated_at":"2026-05-18T00:21:29.194430+00:00"}