{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EKRVCF4ZQJ4PCYYAPFQGODHBYS","short_pith_number":"pith:EKRVCF4Z","schema_version":"1.0","canonical_sha256":"22a35117998278f163007960670ce1c499c021945b05b1e5108c562efba9178a","source":{"kind":"arxiv","id":"1404.6909","version":2},"attestation_state":"computed","paper":{"title":"Establishing some order amongst exact approximations of MCMCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Christophe Andrieu, Matti Vihola","submitted_at":"2014-04-28T09:45:11Z","abstract_excerpt":"Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard MCMC algorithms, such as the target probability density in a Metropolis-Hastings algorithm, with estimators. Perhaps surprisingly, such approximations lead to powerful algorithms which are exact in the sense that they are guaranteed to have correct limiting distributions. In this paper we discover a general framework which allows one to compare, or order, pe"},"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":"1404.6909","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-04-28T09:45:11Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"873b7490e87eb97bf80ca405d3a95ad509672ad3db19ef39ff0827db081e5368","abstract_canon_sha256":"dbfaab68984a10aa55fdadd78d0945d0978c3fc8207703e7293087b8ecac9de7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:35.261616Z","signature_b64":"GpGTrcVSkr47GiSd2N4odpF1brXTaDZUkdm4lZ9jA/fX/Rnnc6xiZNUelXLFS+pqumtMIFNF1MJzMg2jiTWQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22a35117998278f163007960670ce1c499c021945b05b1e5108c562efba9178a","last_reissued_at":"2026-05-18T01:28:35.261169Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:35.261169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Establishing some order amongst exact approximations of MCMCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Christophe Andrieu, Matti Vihola","submitted_at":"2014-04-28T09:45:11Z","abstract_excerpt":"Exact approximations of Markov chain Monte Carlo (MCMC) algorithms are a general emerging class of sampling algorithms. One of the main ideas behind exact approximations consists of replacing intractable quantities required to run standard MCMC algorithms, such as the target probability density in a Metropolis-Hastings algorithm, with estimators. Perhaps surprisingly, such approximations lead to powerful algorithms which are exact in the sense that they are guaranteed to have correct limiting distributions. In this paper we discover a general framework which allows one to compare, or order, pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6909","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":"1404.6909","created_at":"2026-05-18T01:28:35.261239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6909v2","created_at":"2026-05-18T01:28:35.261239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6909","created_at":"2026-05-18T01:28:35.261239+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKRVCF4ZQJ4P","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKRVCF4ZQJ4PCYYA","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKRVCF4Z","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08157","citing_title":"Bring the noise: exact inference from noisy simulations in collider physics","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS","json":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS.json","graph_json":"https://pith.science/api/pith-number/EKRVCF4ZQJ4PCYYAPFQGODHBYS/graph.json","events_json":"https://pith.science/api/pith-number/EKRVCF4ZQJ4PCYYAPFQGODHBYS/events.json","paper":"https://pith.science/paper/EKRVCF4Z"},"agent_actions":{"view_html":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS","download_json":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS.json","view_paper":"https://pith.science/paper/EKRVCF4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6909&json=true","fetch_graph":"https://pith.science/api/pith-number/EKRVCF4ZQJ4PCYYAPFQGODHBYS/graph.json","fetch_events":"https://pith.science/api/pith-number/EKRVCF4ZQJ4PCYYAPFQGODHBYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS/action/storage_attestation","attest_author":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS/action/author_attestation","sign_citation":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS/action/citation_signature","submit_replication":"https://pith.science/pith/EKRVCF4ZQJ4PCYYAPFQGODHBYS/action/replication_record"}},"created_at":"2026-05-18T01:28:35.261239+00:00","updated_at":"2026-05-18T01:28:35.261239+00:00"}