{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AIRRQBIUASFILGQT2HSE233LMA","short_pith_number":"pith:AIRRQBIU","schema_version":"1.0","canonical_sha256":"0223180514048a859a13d1e44d6f6b602ff1e1c882b09ede249b89dd3d066897","source":{"kind":"arxiv","id":"1607.03188","version":2},"attestation_state":"computed","paper":{"title":"The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Gareth Roberts, Joris Bierkens, Paul Fearnhead","submitted_at":"2016-07-11T22:30:50Z","abstract_excerpt":"Standard MCMC methods can scale poorly to big data settings due to the need to evaluate the likelihood at each iteration. There have been a number of approximate MCMC algorithms that use sub-sampling ideas to reduce this computational burden, but with the drawback that these algorithms no longer target the true posterior distribution. We introduce a new family of Monte Carlo methods based upon a multi-dimensional version of the Zig-Zag process of (Bierkens, Roberts, 2017), a continuous time piecewise deterministic Markov process. While traditional MCMC methods are reversible by construction (a"},"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":"1607.03188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-07-11T22:30:50Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6b55c03bb93c868b9d6f37c56c0faf88bbae2f00e3bc82a4a9b01f30882a49a7","abstract_canon_sha256":"f7cdc0eed3fbb012ecf3c4995baa96cbfb7ada8053e1b25dce5a7413ad261eb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:01.868825Z","signature_b64":"jx2fnUbI1zvLYG1Lj4ilFQ7f71fYC09WYcviBvvO+Wi/qvk4v5p8I2kZ72t0o5hKQD4ddFEedopG2pL3lYNWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0223180514048a859a13d1e44d6f6b602ff1e1c882b09ede249b89dd3d066897","last_reissued_at":"2026-07-05T01:38:01.868392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:01.868392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Gareth Roberts, Joris Bierkens, Paul Fearnhead","submitted_at":"2016-07-11T22:30:50Z","abstract_excerpt":"Standard MCMC methods can scale poorly to big data settings due to the need to evaluate the likelihood at each iteration. There have been a number of approximate MCMC algorithms that use sub-sampling ideas to reduce this computational burden, but with the drawback that these algorithms no longer target the true posterior distribution. We introduce a new family of Monte Carlo methods based upon a multi-dimensional version of the Zig-Zag process of (Bierkens, Roberts, 2017), a continuous time piecewise deterministic Markov process. While traditional MCMC methods are reversible by construction (a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03188","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/1607.03188/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":"1607.03188","created_at":"2026-07-05T01:38:01.868451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03188v2","created_at":"2026-07-05T01:38:01.868451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03188","created_at":"2026-07-05T01:38:01.868451+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIRRQBIUASFI","created_at":"2026-07-05T01:38:01.868451+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIRRQBIUASFILGQT","created_at":"2026-07-05T01:38:01.868451+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIRRQBIU","created_at":"2026-07-05T01:38:01.868451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13127","citing_title":"State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives","ref_index":207,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA","json":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA.json","graph_json":"https://pith.science/api/pith-number/AIRRQBIUASFILGQT2HSE233LMA/graph.json","events_json":"https://pith.science/api/pith-number/AIRRQBIUASFILGQT2HSE233LMA/events.json","paper":"https://pith.science/paper/AIRRQBIU"},"agent_actions":{"view_html":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA","download_json":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA.json","view_paper":"https://pith.science/paper/AIRRQBIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03188&json=true","fetch_graph":"https://pith.science/api/pith-number/AIRRQBIUASFILGQT2HSE233LMA/graph.json","fetch_events":"https://pith.science/api/pith-number/AIRRQBIUASFILGQT2HSE233LMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA/action/storage_attestation","attest_author":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA/action/author_attestation","sign_citation":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA/action/citation_signature","submit_replication":"https://pith.science/pith/AIRRQBIUASFILGQT2HSE233LMA/action/replication_record"}},"created_at":"2026-07-05T01:38:01.868451+00:00","updated_at":"2026-07-05T01:38:01.868451+00:00"}