{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5GBZBVNS7L7NVOBIBUXS4ZZCZU","short_pith_number":"pith:5GBZBVNS","canonical_record":{"source":{"id":"1012.3768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-12-16T22:07:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b9752ce6f33bdf164e9ae42e39c6415253c874f3b5114aed5198ce5fa94b0661","abstract_canon_sha256":"dfd80f865d215c4cb5f7a32ee8cac73fe8484dfffd8c50092db551d80b6f70c7"},"schema_version":"1.0"},"canonical_sha256":"e98390d5b2fafedab8280d2f2e6722cd312f373aa8947d2a788f308b114a7479","source":{"kind":"arxiv","id":"1012.3768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3768","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3768v2","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3768","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"5GBZBVNS7L7N","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GBZBVNS7L7NVOBI","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GBZBVNS","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5GBZBVNS7L7NVOBIBUXS4ZZCZU","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-12-16T22:07:03Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b9752ce6f33bdf164e9ae42e39c6415253c874f3b5114aed5198ce5fa94b0661","abstract_canon_sha256":"dfd80f865d215c4cb5f7a32ee8cac73fe8484dfffd8c50092db551d80b6f70c7"},"schema_version":"1.0"},"canonical_sha256":"e98390d5b2fafedab8280d2f2e6722cd312f373aa8947d2a788f308b114a7479","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:38.100352Z","signature_b64":"9pkhWVsriSoL+3ELwFu2x/7jloI9AJY8C98CgsItW5iwQFOVl2CFY/PCwuMBpHIAuLeFk18Y/JbAGmf8n7AFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e98390d5b2fafedab8280d2f2e6722cd312f373aa8947d2a788f308b114a7479","last_reissued_at":"2026-05-18T04:00:38.099523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:38.099523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3768","source_version":2,"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-18T04:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRcgJbDW8ynu2vrNhbg6eEZxTauyn26dKDSBpazxlfQ0JfowCsF0QSRt7V/aVdkocvHgVdKDfRybLjMq15O9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:37:27.301934Z"},"content_sha256":"d68a5980312ad851767a498a94648c82887bf0ed2d71c731cc7c9aedaac34e60","schema_version":"1.0","event_id":"sha256:d68a5980312ad851767a498a94648c82887bf0ed2d71c731cc7c9aedaac34e60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5GBZBVNS7L7NVOBIBUXS4ZZCZU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact sampling for intractable probability distributions via a Bernoulli factory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"James M. Flegal, Radu Herbei","submitted_at":"2010-12-16T22:07:03Z","abstract_excerpt":"Many applications in the field of statistics require Markov chain Monte Carlo methods. Determining appropriate starting values and run lengths can be both analytically and empirically challenging. A desire to overcome these problems has led to the development of exact, or perfect, sampling algorithms which convert a Markov chain into an algorithm that produces i.i.d. samples from the stationary distribution. Unfortunately, very few of these algorithms have been developed for the distributions that arise in statistical applications, which typically have uncountable support. Here we study an exa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3768","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"},"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-18T04:00:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Hi8I7Lpnhrv/qu7p8x64f/QL8Y8ZxJP0b/Gm47ZubobxiRcF0mOT5Djx6ABYrawfLGZFQ+g0bNmvkahAJk/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:37:27.302272Z"},"content_sha256":"122ddbd36d608a20ef449ffa7eb8f3ffa740d4638c4ab211690d7583967dead7","schema_version":"1.0","event_id":"sha256:122ddbd36d608a20ef449ffa7eb8f3ffa740d4638c4ab211690d7583967dead7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/bundle.json","state_url":"https://pith.science/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/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-06-27T04:37:27Z","links":{"resolver":"https://pith.science/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU","bundle":"https://pith.science/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/bundle.json","state":"https://pith.science/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GBZBVNS7L7NVOBIBUXS4ZZCZU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5GBZBVNS7L7NVOBIBUXS4ZZCZU","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":"dfd80f865d215c4cb5f7a32ee8cac73fe8484dfffd8c50092db551d80b6f70c7","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-12-16T22:07:03Z","title_canon_sha256":"b9752ce6f33bdf164e9ae42e39c6415253c874f3b5114aed5198ce5fa94b0661"},"schema_version":"1.0","source":{"id":"1012.3768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3768","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3768v2","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3768","created_at":"2026-05-18T04:00:38Z"},{"alias_kind":"pith_short_12","alias_value":"5GBZBVNS7L7N","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5GBZBVNS7L7NVOBI","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5GBZBVNS","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:122ddbd36d608a20ef449ffa7eb8f3ffa740d4638c4ab211690d7583967dead7","target":"graph","created_at":"2026-05-18T04:00:38Z","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":"Many applications in the field of statistics require Markov chain Monte Carlo methods. Determining appropriate starting values and run lengths can be both analytically and empirically challenging. A desire to overcome these problems has led to the development of exact, or perfect, sampling algorithms which convert a Markov chain into an algorithm that produces i.i.d. samples from the stationary distribution. Unfortunately, very few of these algorithms have been developed for the distributions that arise in statistical applications, which typically have uncountable support. Here we study an exa","authors_text":"James M. Flegal, Radu Herbei","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-12-16T22:07:03Z","title":"Exact sampling for intractable probability distributions via a Bernoulli factory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3768","kind":"arxiv","version":2},"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:d68a5980312ad851767a498a94648c82887bf0ed2d71c731cc7c9aedaac34e60","target":"record","created_at":"2026-05-18T04:00:38Z","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":"dfd80f865d215c4cb5f7a32ee8cac73fe8484dfffd8c50092db551d80b6f70c7","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2010-12-16T22:07:03Z","title_canon_sha256":"b9752ce6f33bdf164e9ae42e39c6415253c874f3b5114aed5198ce5fa94b0661"},"schema_version":"1.0","source":{"id":"1012.3768","kind":"arxiv","version":2}},"canonical_sha256":"e98390d5b2fafedab8280d2f2e6722cd312f373aa8947d2a788f308b114a7479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e98390d5b2fafedab8280d2f2e6722cd312f373aa8947d2a788f308b114a7479","first_computed_at":"2026-05-18T04:00:38.099523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:38.099523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9pkhWVsriSoL+3ELwFu2x/7jloI9AJY8C98CgsItW5iwQFOVl2CFY/PCwuMBpHIAuLeFk18Y/JbAGmf8n7AFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:38.100352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d68a5980312ad851767a498a94648c82887bf0ed2d71c731cc7c9aedaac34e60","sha256:122ddbd36d608a20ef449ffa7eb8f3ffa740d4638c4ab211690d7583967dead7"],"state_sha256":"fdc3fbfffead64d7381f61d8185fb313b06856c0197d746e355c466d15234413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wam06Iaew9JaCyQSm+1x5uQxrfx33Xqzm78do2bQ1hFPuNOGOQiFWuIksaXuaRRuzeRjpG40/Mbj8hfJnbupAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:37:27.304124Z","bundle_sha256":"c37894a6bf4579e6d93481fe3ed266970b913f8eeb203faf18c4c2ba8e569a34"}}