{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LLF5AIMZ34XN43UCTUWDMTB5AM","short_pith_number":"pith:LLF5AIMZ","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"},"canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","source":{"kind":"arxiv","id":"1509.03808","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03808","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03808v3","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03808","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"LLF5AIMZ34XN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLF5AIMZ34XN43UC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLF5AIMZ","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LLF5AIMZ34XN43UCTUWDMTB5AM","target":"record","payload":{"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"},"canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","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"},"source_kind":"arxiv","source_id":"1509.03808","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbAPpesAwqSNox/ZIwkR+5yDOn6La7XABp/T+s2BWyiANvptvDJCqG7vvPPGz2XGbrajab/XJl1Uc9ltOze1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:47:03.624828Z"},"content_sha256":"07a89937d4964796928094a0d62c18a040695520178a7b248f64e8a05d2162f6","schema_version":"1.0","event_id":"sha256:07a89937d4964796928094a0d62c18a040695520178a7b248f64e8a05d2162f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LLF5AIMZ34XN43UCTUWDMTB5AM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xM86IUYKJA4ZTr8TmGvn39dNzUIZT0mK+6gIkcI0SDQodWTLd0MXfvpq+m4un4JoGiMQSBsbOznYvlSm2KuLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:47:03.625553Z"},"content_sha256":"430bfb790dfa3785c3618ddd6d69dac1f76432c9354889fcd18badc5a35ba7b7","schema_version":"1.0","event_id":"sha256:430bfb790dfa3785c3618ddd6d69dac1f76432c9354889fcd18badc5a35ba7b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/bundle.json","state_url":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T14:47:03Z","links":{"resolver":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM","bundle":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/bundle.json","state":"https://pith.science/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLF5AIMZ34XN43UCTUWDMTB5AM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLF5AIMZ34XN43UCTUWDMTB5AM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"bebe2f1d0d610f88864513b475ad3ec77b5a5540e9d0a6bbb6f15bb256d211ed","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-13T04:29:13Z","title_canon_sha256":"4d4e824cbe480f13be9701017c87284419d4b464cc7bd3aabc4284054ec18481"},"schema_version":"1.0","source":{"id":"1509.03808","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03808","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03808v3","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03808","created_at":"2026-05-18T01:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"LLF5AIMZ34XN","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLF5AIMZ34XN43UC","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLF5AIMZ","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:430bfb790dfa3785c3618ddd6d69dac1f76432c9354889fcd18badc5a35ba7b7","target":"graph","created_at":"2026-05-18T01:30:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew B. Berger, Jascha Sohl-Dickstein, Mayur Mudigonda, Michael R. DeWeese","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-13T04:29:13Z","title":"A Markov Jump Process for More Efficient Hamiltonian Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03808","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:07a89937d4964796928094a0d62c18a040695520178a7b248f64e8a05d2162f6","target":"record","created_at":"2026-05-18T01:30:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"bebe2f1d0d610f88864513b475ad3ec77b5a5540e9d0a6bbb6f15bb256d211ed","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-13T04:29:13Z","title_canon_sha256":"4d4e824cbe480f13be9701017c87284419d4b464cc7bd3aabc4284054ec18481"},"schema_version":"1.0","source":{"id":"1509.03808","kind":"arxiv","version":3}},"canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5acbd02199df2ede6e829d2c364c3d0309f79950cd802a7c8305e0e4fa60199f","first_computed_at":"2026-05-18T01:30:33.995267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:33.995267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cH6/+MrN+AdwQfrAPx7Y0EapKyMXINe3DuUwHKEIa8qrgtX1kuPcrGcQ0UU7JfeWY0kXqGxyhdXP6E6uQb0xCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:33.996032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03808","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07a89937d4964796928094a0d62c18a040695520178a7b248f64e8a05d2162f6","sha256:430bfb790dfa3785c3618ddd6d69dac1f76432c9354889fcd18badc5a35ba7b7"],"state_sha256":"5d2e4b696a7eb670fbd99d833e2493898aaff445fb5a3335f55e675fe5005f5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+HJ349t3yAOMX2gwQdzBqRY+Se9xVMoa8slHKwTq12+STiorzxV/mdnZzpJ6/GxjQn4JENdCdadm5ecgp9WJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:47:03.629153Z","bundle_sha256":"cdbab617dca5c33961d083e6c0006cf33602de21a1a65125a6dadaf96ecad758"}}