{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LNA2LXCGSXPFC3J3GWMNZ4PFSD","short_pith_number":"pith:LNA2LXCG","schema_version":"1.0","canonical_sha256":"5b41a5dc4695de516d3b3598dcf1e590ce578cb9d06ed016811b24d3ecba16e4","source":{"kind":"arxiv","id":"1704.03561","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.03561","created_at":"2026-05-18T00:46:27.447337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03561v1","created_at":"2026-05-18T00:46:27.447337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03561","created_at":"2026-05-18T00:46:27.447337+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNA2LXCGSXPF","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNA2LXCGSXPFC3J3","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNA2LXCG","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD","json":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD.json","graph_json":"https://pith.science/api/pith-number/LNA2LXCGSXPFC3J3GWMNZ4PFSD/graph.json","events_json":"https://pith.science/api/pith-number/LNA2LXCGSXPFC3J3GWMNZ4PFSD/events.json","paper":"https://pith.science/paper/LNA2LXCG"},"agent_actions":{"view_html":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD","download_json":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD.json","view_paper":"https://pith.science/paper/LNA2LXCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03561&json=true","fetch_graph":"https://pith.science/api/pith-number/LNA2LXCGSXPFC3J3GWMNZ4PFSD/graph.json","fetch_events":"https://pith.science/api/pith-number/LNA2LXCGSXPFC3J3GWMNZ4PFSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/action/storage_attestation","attest_author":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/action/author_attestation","sign_citation":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/action/citation_signature","submit_replication":"https://pith.science/pith/LNA2LXCGSXPFC3J3GWMNZ4PFSD/action/replication_record"}},"created_at":"2026-05-18T00:46:27.447337+00:00","updated_at":"2026-05-18T00:46:27.447337+00:00"}