{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZJSNHUMBMMJFWJTWRH5V7YZAJ2","short_pith_number":"pith:ZJSNHUMB","schema_version":"1.0","canonical_sha256":"ca64d3d18163125b267689fb5fe3204eaa1c0070af3cf468e43ea655f456d383","source":{"kind":"arxiv","id":"1707.05296","version":2},"attestation_state":"computed","paper":{"title":"Piecewise-Deterministic Markov Chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Arnaud Doucet, George Deligiannidis, Paul Vanetti","submitted_at":"2017-07-17T17:49:19Z","abstract_excerpt":"A novel class of non-reversible Markov chain Monte Carlo schemes relying on continuous-time piecewise-deterministic Markov Processes has recently emerged. In these algorithms, the state of the Markov process evolves according to a deterministic dynamics which is modified using a Markov transition kernel at random event times. These methods enjoy remarkable features including the ability to update only a subset of the state components while other components implicitly keep evolving and the ability to use an unbiased estimate of the gradient of the log-target while preserving the target as invar"},"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":"1707.05296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-07-17T17:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"98027520d0171390c9aac835f0956a4419eb465ae88e6b935d7b9d73ce553215","abstract_canon_sha256":"33636a0b5a5f4cedbe2902e0250d19c6736f82373fa5a4f8624b959540083fdc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:59.252186Z","signature_b64":"SpyHISPUQHnOAKXgo/P3FolkFw/Yep/4CAYXATRjFJVZyNx/E74tIY4+KL5CceXG0RQIX3XXt0IZ+9EC4Gq1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca64d3d18163125b267689fb5fe3204eaa1c0070af3cf468e43ea655f456d383","last_reissued_at":"2026-05-18T00:15:59.251693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:59.251693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Piecewise-Deterministic Markov Chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Alexandre Bouchard-C\\^ot\\'e, Arnaud Doucet, George Deligiannidis, Paul Vanetti","submitted_at":"2017-07-17T17:49:19Z","abstract_excerpt":"A novel class of non-reversible Markov chain Monte Carlo schemes relying on continuous-time piecewise-deterministic Markov Processes has recently emerged. In these algorithms, the state of the Markov process evolves according to a deterministic dynamics which is modified using a Markov transition kernel at random event times. These methods enjoy remarkable features including the ability to update only a subset of the state components while other components implicitly keep evolving and the ability to use an unbiased estimate of the gradient of the log-target while preserving the target as invar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05296","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":""},"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":"1707.05296","created_at":"2026-05-18T00:15:59.251765+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05296v2","created_at":"2026-05-18T00:15:59.251765+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05296","created_at":"2026-05-18T00:15:59.251765+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJSNHUMBMMJF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJSNHUMBMMJFWJTW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJSNHUMB","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2302.08724","citing_title":"Piecewise Deterministic Markov Processes for Bayesian Neural Networks","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2","json":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2.json","graph_json":"https://pith.science/api/pith-number/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/graph.json","events_json":"https://pith.science/api/pith-number/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/events.json","paper":"https://pith.science/paper/ZJSNHUMB"},"agent_actions":{"view_html":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2","download_json":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2.json","view_paper":"https://pith.science/paper/ZJSNHUMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05296&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/action/storage_attestation","attest_author":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/action/author_attestation","sign_citation":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/action/citation_signature","submit_replication":"https://pith.science/pith/ZJSNHUMBMMJFWJTWRH5V7YZAJ2/action/replication_record"}},"created_at":"2026-05-18T00:15:59.251765+00:00","updated_at":"2026-05-18T00:15:59.251765+00:00"}