{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LNA2LXCGSXPFC3J3GWMNZ4PFSD","short_pith_number":"pith:LNA2LXCG","canonical_record":{"source":{"id":"1704.03561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T22:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"2d572ca6031eec9b21a0f5b4283ecae460c3a11c227c29b3c9a8d899296379dd","abstract_canon_sha256":"c9eab7e330492277686a2d3055a39426daece09d308ec89584287668ea42c705"},"schema_version":"1.0"},"canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","source":{"kind":"arxiv","id":"1704.03561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03561","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03561v1","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03561","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"LNA2LXCGSXPF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNA2LXCGSXPFC3J3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNA2LXCG","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LNA2LXCGSXPFC3J3GWMNZ4PFSD","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T22:50:36Z","cross_cats_sorted":[],"title_canon_sha256":"2d572ca6031eec9b21a0f5b4283ecae460c3a11c227c29b3c9a8d899296379dd","abstract_canon_sha256":"c9eab7e330492277686a2d3055a39426daece09d308ec89584287668ea42c705"},"schema_version":"1.0"},"canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:27.447913Z","signature_b64":"60LJmnbC6ZTYkB5G76yn7Lp3TI5mDCoBvxPtzEcpvnH3hUu/cRCObEhetd0KgdgMRjD3KoH7btHL8TR33f1/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","last_reissued_at":"2026-05-18T00:46:27.447195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:27.447195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03561","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-18T00:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8dqMfiDu0z0G0JmOkmXm3FtGRsMLxUYcWu689iHBoZV33WJPjSp2lzzxZ6GCTPzHyf2SoL5z+dfRgQwIR46CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:23:46.803670Z"},"content_sha256":"28762b8dcfc719e5095b413ff6d62f0545f64d3d6a3b1326710c59fec1955cf2","schema_version":"1.0","event_id":"sha256:28762b8dcfc719e5095b413ff6d62f0545f64d3d6a3b1326710c59fec1955cf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LNA2LXCGSXPFC3J3GWMNZ4PFSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Fundamental Theorem of Perfect Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mark Huber","submitted_at":"2017-04-11T22:50:36Z","abstract_excerpt":"Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has output according to an input distribution $\\pi$. Perfect simulations are a subclass of exact simulations where recursion is used either explicitly or implicitly. The FTPS gives two simple criteria that, when satisfied, give a correct perfect simulation algorithm. First the algorithm must terminate in finite time with probability 1. Second, the algorithm must be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03561","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-18T00:46:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/xhGFhvjSWxefZcLHKGeBIK4twF02zt+T+Au2LOLpbXKqPWTWg7PiY+9mVoQ1MqOFv8m36UYGKmIug2bw+KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:23:46.804450Z"},"content_sha256":"808f7d97eb7ef52eaf84ea8d074c8a0e508edf79447c0a4270ed84637fa675b5","schema_version":"1.0","event_id":"sha256:808f7d97eb7ef52eaf84ea8d074c8a0e508edf79447c0a4270ed84637fa675b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/bundle.json","state_url":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/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-09T07:23:46Z","links":{"resolver":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD","bundle":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/bundle.json","state":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LNA2LXCGSXPFC3J3GWMNZ4PFSD","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":"c9eab7e330492277686a2d3055a39426daece09d308ec89584287668ea42c705","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T22:50:36Z","title_canon_sha256":"2d572ca6031eec9b21a0f5b4283ecae460c3a11c227c29b3c9a8d899296379dd"},"schema_version":"1.0","source":{"id":"1704.03561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03561","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03561v1","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03561","created_at":"2026-05-18T00:46:27Z"},{"alias_kind":"pith_short_12","alias_value":"LNA2LXCGSXPF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LNA2LXCGSXPFC3J3","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LNA2LXCG","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:808f7d97eb7ef52eaf84ea8d074c8a0e508edf79447c0a4270ed84637fa675b5","target":"graph","created_at":"2026-05-18T00:46:27Z","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":"Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has output according to an input distribution $\\pi$. Perfect simulations are a subclass of exact simulations where recursion is used either explicitly or implicitly. The FTPS gives two simple criteria that, when satisfied, give a correct perfect simulation algorithm. First the algorithm must terminate in finite time with probability 1. Second, the algorithm must be","authors_text":"Mark Huber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T22:50:36Z","title":"The Fundamental Theorem of Perfect Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03561","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:28762b8dcfc719e5095b413ff6d62f0545f64d3d6a3b1326710c59fec1955cf2","target":"record","created_at":"2026-05-18T00:46:27Z","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":"c9eab7e330492277686a2d3055a39426daece09d308ec89584287668ea42c705","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-04-11T22:50:36Z","title_canon_sha256":"2d572ca6031eec9b21a0f5b4283ecae460c3a11c227c29b3c9a8d899296379dd"},"schema_version":"1.0","source":{"id":"1704.03561","kind":"arxiv","version":1}},"canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","first_computed_at":"2026-05-18T00:46:27.447195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:27.447195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"60LJmnbC6ZTYkB5G76yn7Lp3TI5mDCoBvxPtzEcpvnH3hUu/cRCObEhetd0KgdgMRjD3KoH7btHL8TR33f1/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:27.447913Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28762b8dcfc719e5095b413ff6d62f0545f64d3d6a3b1326710c59fec1955cf2","sha256:808f7d97eb7ef52eaf84ea8d074c8a0e508edf79447c0a4270ed84637fa675b5"],"state_sha256":"039a7dca869a3170ee760423c952cd127d6be5c5dd69eaed1d2f7e1a0ddccaaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h32prI0CPCLYNTrYPJzLaL105v8ju4jiTFvn1OFUIy797G+gVHnGI0mGAcUJR1bw4kro4N2ajG5SFCNfsOuODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:23:46.808311Z","bundle_sha256":"4a383923a3401f4119ddc5f6c18c3cad89e9f33a56125cfbe00dc245f8d77657"}}