{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BT7IG7YWAVILQLLU3U4PMZXGFW","short_pith_number":"pith:BT7IG7YW","schema_version":"1.0","canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","source":{"kind":"arxiv","id":"1110.1248","version":2},"attestation_state":"computed","paper":{"title":"An algorithm to compute the power of Monte Carlo tests with guaranteed precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Axel Gandy, Patrick Rubin-Delanchy","submitted_at":"2011-10-06T12:50:58Z","abstract_excerpt":"This article presents an algorithm that generates a conservative confidence interval of a specified length and coverage probability for the power of a Monte Carlo test (such as a bootstrap or permutation test). It is the first method that achieves this aim for almost any Monte Carlo test. Previous research has focused on obtaining as accurate a result as possible for a fixed computational effort, without providing a guaranteed precision in the above sense. The algorithm we propose does not have a fixed effort and runs until a confidence interval with a user-specified length and coverage probab"},"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":"1110.1248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-06T12:50:58Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b96f7336e4068e30574bfb4fcac0355d26871d7754116f4f07ddbd277f3da279","abstract_canon_sha256":"c3fadfca6a1cde5d0ced2c5aaff7006f620df5c22fb51e4397bc163fb109563b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:17.968630Z","signature_b64":"avkBBTN3a9Hp9UjkHFgsfaLBvS7AQduJ3XVBBIVSYJ5QJTzhmvSeEk96srfGtjZ2CTVQJeoWeUkQPvhVZrDcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","last_reissued_at":"2026-05-18T03:31:17.967785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:17.967785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm to compute the power of Monte Carlo tests with guaranteed precision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Axel Gandy, Patrick Rubin-Delanchy","submitted_at":"2011-10-06T12:50:58Z","abstract_excerpt":"This article presents an algorithm that generates a conservative confidence interval of a specified length and coverage probability for the power of a Monte Carlo test (such as a bootstrap or permutation test). It is the first method that achieves this aim for almost any Monte Carlo test. Previous research has focused on obtaining as accurate a result as possible for a fixed computational effort, without providing a guaranteed precision in the above sense. The algorithm we propose does not have a fixed effort and runs until a confidence interval with a user-specified length and coverage probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1248","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":"1110.1248","created_at":"2026-05-18T03:31:17.967937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1248v2","created_at":"2026-05-18T03:31:17.967937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1248","created_at":"2026-05-18T03:31:17.967937+00:00"},{"alias_kind":"pith_short_12","alias_value":"BT7IG7YWAVIL","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BT7IG7YWAVILQLLU","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BT7IG7YW","created_at":"2026-05-18T12:26:24.575870+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/BT7IG7YWAVILQLLU3U4PMZXGFW","json":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW.json","graph_json":"https://pith.science/api/pith-number/BT7IG7YWAVILQLLU3U4PMZXGFW/graph.json","events_json":"https://pith.science/api/pith-number/BT7IG7YWAVILQLLU3U4PMZXGFW/events.json","paper":"https://pith.science/paper/BT7IG7YW"},"agent_actions":{"view_html":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW","download_json":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW.json","view_paper":"https://pith.science/paper/BT7IG7YW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1248&json=true","fetch_graph":"https://pith.science/api/pith-number/BT7IG7YWAVILQLLU3U4PMZXGFW/graph.json","fetch_events":"https://pith.science/api/pith-number/BT7IG7YWAVILQLLU3U4PMZXGFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/action/storage_attestation","attest_author":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/action/author_attestation","sign_citation":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/action/citation_signature","submit_replication":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/action/replication_record"}},"created_at":"2026-05-18T03:31:17.967937+00:00","updated_at":"2026-05-18T03:31:17.967937+00:00"}