{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3DLUVTH66X4RNNRXU2YCZHCWGT","short_pith_number":"pith:3DLUVTH6","schema_version":"1.0","canonical_sha256":"d8d74accfef5f916b637a6b02c9c5634d58c91a138cdffa02196114bc60b498b","source":{"kind":"arxiv","id":"2103.16620","version":2},"attestation_state":"computed","paper":{"title":"Speed Up Zig-Zag","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.PR","authors_text":"Gareth O. Roberts, Giorgos Vasdekis","submitted_at":"2021-03-30T18:46:25Z","abstract_excerpt":"Zig-Zag is Piecewise Deterministic Markov Process, efficiently used for simulation in an MCMC setting. As we show in this article, it fails to be exponentially ergodic on heavy tailed target distributions. We introduce an extension of the Zig-Zag process by allowing the process to move with a non-constant speed function $s$, depending on the current state of the process. We call this process Speed Up Zig-Zag (SUZZ). We provide conditions that guarantee stability properties for the SUZZ process, including non-explosivity, exponential ergodicity in heavy tailed targets and central limit theorem."},"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":"2103.16620","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2021-03-30T18:46:25Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"99b2bd4e00b4399295a694c65bf31ab4751d0721dadd213ae6953c1514baca5d","abstract_canon_sha256":"1e3b09c04634a903d26a263ceb62107ba7912aa31a019e180d51abc7846f7a40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:53.034512Z","signature_b64":"yJuPPABt+Eg9rxFsuRu7CsQtYOYlVq+JAMfGleoJM86LjZu/8oCRDuyKKnWTlsNZzRrnV1JwcWGaV1D8T217Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d74accfef5f916b637a6b02c9c5634d58c91a138cdffa02196114bc60b498b","last_reissued_at":"2026-07-05T05:02:53.033796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:53.033796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speed Up Zig-Zag","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.PR","authors_text":"Gareth O. Roberts, Giorgos Vasdekis","submitted_at":"2021-03-30T18:46:25Z","abstract_excerpt":"Zig-Zag is Piecewise Deterministic Markov Process, efficiently used for simulation in an MCMC setting. As we show in this article, it fails to be exponentially ergodic on heavy tailed target distributions. We introduce an extension of the Zig-Zag process by allowing the process to move with a non-constant speed function $s$, depending on the current state of the process. We call this process Speed Up Zig-Zag (SUZZ). We provide conditions that guarantee stability properties for the SUZZ process, including non-explosivity, exponential ergodicity in heavy tailed targets and central limit theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.16620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.16620/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":"2103.16620","created_at":"2026-07-05T05:02:53.033860+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.16620v2","created_at":"2026-07-05T05:02:53.033860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.16620","created_at":"2026-07-05T05:02:53.033860+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DLUVTH66X4R","created_at":"2026-07-05T05:02:53.033860+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DLUVTH66X4RNNRX","created_at":"2026-07-05T05:02:53.033860+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DLUVTH6","created_at":"2026-07-05T05:02:53.033860+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14983","citing_title":"Large sample scaling analysis of the Zig-Zag algorithm for Bayesian inference","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT","json":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT.json","graph_json":"https://pith.science/api/pith-number/3DLUVTH66X4RNNRXU2YCZHCWGT/graph.json","events_json":"https://pith.science/api/pith-number/3DLUVTH66X4RNNRXU2YCZHCWGT/events.json","paper":"https://pith.science/paper/3DLUVTH6"},"agent_actions":{"view_html":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT","download_json":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT.json","view_paper":"https://pith.science/paper/3DLUVTH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.16620&json=true","fetch_graph":"https://pith.science/api/pith-number/3DLUVTH66X4RNNRXU2YCZHCWGT/graph.json","fetch_events":"https://pith.science/api/pith-number/3DLUVTH66X4RNNRXU2YCZHCWGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT/action/storage_attestation","attest_author":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT/action/author_attestation","sign_citation":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT/action/citation_signature","submit_replication":"https://pith.science/pith/3DLUVTH66X4RNNRXU2YCZHCWGT/action/replication_record"}},"created_at":"2026-07-05T05:02:53.033860+00:00","updated_at":"2026-07-05T05:02:53.033860+00:00"}