{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LLF5AIMZ34XN43UCTUWDMTB5AM","short_pith_number":"pith:LLF5AIMZ","schema_version":"1.0","canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","source":{"kind":"arxiv","id":"1509.03808","version":3},"attestation_state":"computed","paper":{"title":"A Markov Jump Process for More Efficient Hamiltonian Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Andrew B. Berger, Jascha Sohl-Dickstein, Mayur Mudigonda, Michael R. DeWeese","submitted_at":"2015-09-13T04:29:13Z","abstract_excerpt":"In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a Hamiltonian Monte Carlo algorithm using a continuous time Markov jump process, and are thus able to escape this constraint. Transition rates in a Markov jump process need only be non-negative. We demonstrate that the new algorithm leads to improved mixing for several example problems, both by evaluating the spectral gap of the Markov operator, and by computing au"},"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":"1509.03808","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-13T04:29:13Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"4d4e824cbe480f13be9701017c87284419d4b464cc7bd3aabc4284054ec18481","abstract_canon_sha256":"bebe2f1d0d610f88864513b475ad3ec77b5a5540e9d0a6bbb6f15bb256d211ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.996032Z","signature_b64":"cH6/+MrN+AdwQfrAPx7Y0EapKyMXINe3DuUwHKEIa8qrgtX1kuPcrGcQ0UU7JfeWY0kXqGxyhdXP6E6uQb0xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","last_reissued_at":"2026-05-18T01:30:33.995267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.995267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Markov Jump Process for More Efficient Hamiltonian Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Andrew B. Berger, Jascha Sohl-Dickstein, Mayur Mudigonda, Michael R. DeWeese","submitted_at":"2015-09-13T04:29:13Z","abstract_excerpt":"In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a Hamiltonian Monte Carlo algorithm using a continuous time Markov jump process, and are thus able to escape this constraint. Transition rates in a Markov jump process need only be non-negative. We demonstrate that the new algorithm leads to improved mixing for several example problems, both by evaluating the spectral gap of the Markov operator, and by computing au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03808","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":""},"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":"1509.03808","created_at":"2026-05-18T01:30:33.995388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03808v3","created_at":"2026-05-18T01:30:33.995388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03808","created_at":"2026-05-18T01:30:33.995388+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLF5AIMZ34XN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLF5AIMZ34XN43UC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLF5AIMZ","created_at":"2026-05-18T12:29:29.992203+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/LLF5AIMZ34XN43UCTUWDMTB5AM","json":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM.json","graph_json":"https://pith.science/api/pith-number/LLF5AIMZ34XN43UCTUWDMTB5AM/graph.json","events_json":"https://pith.science/api/pith-number/LLF5AIMZ34XN43UCTUWDMTB5AM/events.json","paper":"https://pith.science/paper/LLF5AIMZ"},"agent_actions":{"view_html":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM","download_json":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM.json","view_paper":"https://pith.science/paper/LLF5AIMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03808&json=true","fetch_graph":"https://pith.science/api/pith-number/LLF5AIMZ34XN43UCTUWDMTB5AM/graph.json","fetch_events":"https://pith.science/api/pith-number/LLF5AIMZ34XN43UCTUWDMTB5AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/action/storage_attestation","attest_author":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/action/author_attestation","sign_citation":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/action/citation_signature","submit_replication":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/action/replication_record"}},"created_at":"2026-05-18T01:30:33.995388+00:00","updated_at":"2026-05-18T01:30:33.995388+00:00"}