{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:7HWO7KB6RZDR4MNAAT3PEV4M3V","short_pith_number":"pith:7HWO7KB6","schema_version":"1.0","canonical_sha256":"f9ecefa83e8e471e31a004f6f2578cdd7d7ef896f629eab98f9f3e11406e3d76","source":{"kind":"arxiv","id":"math/0612488","version":2},"attestation_state":"computed","paper":{"title":"Sequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Axel Gandy","submitted_at":"2006-12-17T19:13:58Z","abstract_excerpt":"This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical p-value, is uniformly bounded by an arbitrarily small constant. Previously suggested sequential or non-sequential algorithms, using a bounded sample size, do not have this property. Although the algorithm is open-ended, the expected number of steps is finite, except when the p-value is on the threshold between rejecting and not rejecting. The algorithm is s"},"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":"math/0612488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2006-12-17T19:13:58Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"664df3b82afd460d4ac824123d0ee5a0e26b5af524ef6b928facfb47e01d9aa9","abstract_canon_sha256":"72d8bc28721cb16c4976541c555f651fed4334d121ea899f787936e1a2dbed2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:15.075177Z","signature_b64":"r5W8ngpApRAApXs7xYKYbYDzuGI+rPQP9g6cQymsNZGZ953dcCICTp9t/CieZrkpY0Bw30WaxlCFk9dNhSoFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ecefa83e8e471e31a004f6f2578cdd7d7ef896f629eab98f9f3e11406e3d76","last_reissued_at":"2026-05-18T03:17:15.074693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:15.074693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Implementation of Monte Carlo Tests with Uniformly Bounded Resampling Risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Axel Gandy","submitted_at":"2006-12-17T19:13:58Z","abstract_excerpt":"This paper introduces an open-ended sequential algorithm for computing the p-value of a test using Monte Carlo simulation. It guarantees that the resampling risk, the probability of a different decision than the one based on the theoretical p-value, is uniformly bounded by an arbitrarily small constant. Previously suggested sequential or non-sequential algorithms, using a bounded sample size, do not have this property. Although the algorithm is open-ended, the expected number of steps is finite, except when the p-value is on the threshold between rejecting and not rejecting. The algorithm is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0612488","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":"math/0612488","created_at":"2026-05-18T03:17:15.074761+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0612488v2","created_at":"2026-05-18T03:17:15.074761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0612488","created_at":"2026-05-18T03:17:15.074761+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HWO7KB6RZDR","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HWO7KB6RZDR4MNA","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HWO7KB6","created_at":"2026-05-18T12:25:53.939244+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/7HWO7KB6RZDR4MNAAT3PEV4M3V","json":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V.json","graph_json":"https://pith.science/api/pith-number/7HWO7KB6RZDR4MNAAT3PEV4M3V/graph.json","events_json":"https://pith.science/api/pith-number/7HWO7KB6RZDR4MNAAT3PEV4M3V/events.json","paper":"https://pith.science/paper/7HWO7KB6"},"agent_actions":{"view_html":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V","download_json":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V.json","view_paper":"https://pith.science/paper/7HWO7KB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0612488&json=true","fetch_graph":"https://pith.science/api/pith-number/7HWO7KB6RZDR4MNAAT3PEV4M3V/graph.json","fetch_events":"https://pith.science/api/pith-number/7HWO7KB6RZDR4MNAAT3PEV4M3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V/action/storage_attestation","attest_author":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V/action/author_attestation","sign_citation":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V/action/citation_signature","submit_replication":"https://pith.science/pith/7HWO7KB6RZDR4MNAAT3PEV4M3V/action/replication_record"}},"created_at":"2026-05-18T03:17:15.074761+00:00","updated_at":"2026-05-18T03:17:15.074761+00:00"}