{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4MXDBTOZUW6G3L2CONNA23TS3","short_pith_number":"pith:E4MXDBTO","canonical_record":{"source":{"id":"1907.06748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-15T20:46:43Z","cross_cats_sorted":["math.PR","stat.CO"],"title_canon_sha256":"91c792529cd59879f33ccea97c0f9b6b57a439ed6100dd89321b4a98bc2c8a97","abstract_canon_sha256":"dbb04c229f6808b9e173445a66f9f746fa3a3c756314e38d6e69255f7595d1d7"},"schema_version":"1.0"},"canonical_sha256":"271971866ecd2de36d7a139ad06b7396e29c8cd096d8b67fa3869edbe687eb5e","source":{"kind":"arxiv","id":"1907.06748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06748","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06748v1","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06748","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"E4MXDBTOZUW6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4MXDBTOZUW6G3L2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4MXDBTO","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4MXDBTOZUW6G3L2CONNA23TS3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-15T20:46:43Z","cross_cats_sorted":["math.PR","stat.CO"],"title_canon_sha256":"91c792529cd59879f33ccea97c0f9b6b57a439ed6100dd89321b4a98bc2c8a97","abstract_canon_sha256":"dbb04c229f6808b9e173445a66f9f746fa3a3c756314e38d6e69255f7595d1d7"},"schema_version":"1.0"},"canonical_sha256":"271971866ecd2de36d7a139ad06b7396e29c8cd096d8b67fa3869edbe687eb5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:29.292514Z","signature_b64":"No44zxTcogqykVxupUdM9Runhd6lKGGJ0Plpl8EWQVpwTfx12GYBgIw9biIkcEi7la7Oam9Uf3FqXmkWD/bNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271971866ecd2de36d7a139ad06b7396e29c8cd096d8b67fa3869edbe687eb5e","last_reissued_at":"2026-05-17T23:40:29.291912Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:29.291912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06748","source_version":1,"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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqthNsuk5pS7u4xfEDI7dV1X8nK4GneQibr2Iyd90bR6/zBpJ/U8Wmu6/zU95y9iX/Vns9/zDLRrAcx/d4iJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:42.768080Z"},"content_sha256":"712ca55fe4854bca2bd46124ff501b8aca8b19876caba7fdaeead1100e8ff7bf","schema_version":"1.0","event_id":"sha256:712ca55fe4854bca2bd46124ff501b8aca8b19876caba7fdaeead1100e8ff7bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4MXDBTOZUW6G3L2CONNA23TS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Designing Perfect Simulation Algorithms using Local Correctness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.CO"],"primary_cat":"cs.DS","authors_text":"Mark Huber","submitted_at":"2019-07-15T20:46:43Z","abstract_excerpt":"Consider a randomized algorithm that draws samples exactly from a distribution using recursion. Such an algorithm is called a perfect simulation, and here a variety of methods for building this type of algorithm are shown to derive from the same result: the Fundamental Theorem of Perfect Simulation (FTPS). The FTPS gives two necessary and sufficient conditions for the output of a recursive probabilistic algorithm to come exactly from the desired distribution. First, the algorithm must terminate with probability 1. Second, the algorithm must be locally correct, which means that if the recursive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06748","kind":"arxiv","version":1},"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-17T23:40:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBKmtAxMJSfrAItxlPnS1pCSj+E9VT8Ynf1IUpNLpvputYNxIY0TlZZGfTImlDfB+badkFHpo8AEg9t9e7vtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:10:42.768810Z"},"content_sha256":"69d585f6136d16bd702a289dde5cef2ab7c4914f9a6a6fdf380781e909e241bd","schema_version":"1.0","event_id":"sha256:69d585f6136d16bd702a289dde5cef2ab7c4914f9a6a6fdf380781e909e241bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4MXDBTOZUW6G3L2CONNA23TS3/bundle.json","state_url":"https://pith.science/pith/E4MXDBTOZUW6G3L2CONNA23TS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4MXDBTOZUW6G3L2CONNA23TS3/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-09T06:10:42Z","links":{"resolver":"https://pith.science/pith/E4MXDBTOZUW6G3L2CONNA23TS3","bundle":"https://pith.science/pith/E4MXDBTOZUW6G3L2CONNA23TS3/bundle.json","state":"https://pith.science/pith/E4MXDBTOZUW6G3L2CONNA23TS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4MXDBTOZUW6G3L2CONNA23TS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4MXDBTOZUW6G3L2CONNA23TS3","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":"dbb04c229f6808b9e173445a66f9f746fa3a3c756314e38d6e69255f7595d1d7","cross_cats_sorted":["math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-15T20:46:43Z","title_canon_sha256":"91c792529cd59879f33ccea97c0f9b6b57a439ed6100dd89321b4a98bc2c8a97"},"schema_version":"1.0","source":{"id":"1907.06748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06748","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06748v1","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06748","created_at":"2026-05-17T23:40:29Z"},{"alias_kind":"pith_short_12","alias_value":"E4MXDBTOZUW6","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4MXDBTOZUW6G3L2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4MXDBTO","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:69d585f6136d16bd702a289dde5cef2ab7c4914f9a6a6fdf380781e909e241bd","target":"graph","created_at":"2026-05-17T23:40:29Z","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":"Consider a randomized algorithm that draws samples exactly from a distribution using recursion. Such an algorithm is called a perfect simulation, and here a variety of methods for building this type of algorithm are shown to derive from the same result: the Fundamental Theorem of Perfect Simulation (FTPS). The FTPS gives two necessary and sufficient conditions for the output of a recursive probabilistic algorithm to come exactly from the desired distribution. First, the algorithm must terminate with probability 1. Second, the algorithm must be locally correct, which means that if the recursive","authors_text":"Mark Huber","cross_cats":["math.PR","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-15T20:46:43Z","title":"Designing Perfect Simulation Algorithms using Local Correctness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06748","kind":"arxiv","version":1},"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:712ca55fe4854bca2bd46124ff501b8aca8b19876caba7fdaeead1100e8ff7bf","target":"record","created_at":"2026-05-17T23:40:29Z","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":"dbb04c229f6808b9e173445a66f9f746fa3a3c756314e38d6e69255f7595d1d7","cross_cats_sorted":["math.PR","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-15T20:46:43Z","title_canon_sha256":"91c792529cd59879f33ccea97c0f9b6b57a439ed6100dd89321b4a98bc2c8a97"},"schema_version":"1.0","source":{"id":"1907.06748","kind":"arxiv","version":1}},"canonical_sha256":"271971866ecd2de36d7a139ad06b7396e29c8cd096d8b67fa3869edbe687eb5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"271971866ecd2de36d7a139ad06b7396e29c8cd096d8b67fa3869edbe687eb5e","first_computed_at":"2026-05-17T23:40:29.291912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:29.291912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"No44zxTcogqykVxupUdM9Runhd6lKGGJ0Plpl8EWQVpwTfx12GYBgIw9biIkcEi7la7Oam9Uf3FqXmkWD/bNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:29.292514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:712ca55fe4854bca2bd46124ff501b8aca8b19876caba7fdaeead1100e8ff7bf","sha256:69d585f6136d16bd702a289dde5cef2ab7c4914f9a6a6fdf380781e909e241bd"],"state_sha256":"d61fcf3da579b5e682a4364df05689a06103a5e872d0060492b2b6c31712c33e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5izuxTZBD0fldHyvtlFffZ2+0FvoOW8ByDu0NUFMetdsoq0FLMNq2M53hLQBr52RzeZ6EVxvVyfKUFl6Fn7uDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:10:42.772903Z","bundle_sha256":"3d911fa897f6ce1ad1300b81002f9d965f9856319775d1baf0e179fe77999d15"}}