{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BT7IG7YWAVILQLLU3U4PMZXGFW","short_pith_number":"pith:BT7IG7YW","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"},"canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","source":{"kind":"arxiv","id":"1110.1248","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1248","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1248v2","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1248","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"BT7IG7YWAVIL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BT7IG7YWAVILQLLU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BT7IG7YW","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BT7IG7YWAVILQLLU3U4PMZXGFW","target":"record","payload":{"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"},"canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","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"},"source_kind":"arxiv","source_id":"1110.1248","source_version":2,"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-18T03:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7ac1lEc5/SzjM87Y/1xewANZHexUyqyUXc2l88COJKW0ASXBTUtoXqil+3kih/CBEx8AGUwLhx9xl/jmCjAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:48.038480Z"},"content_sha256":"3a59827c7a93ec14a817ba759227d0e7f242efec4d0573f15e6abbf403dba61b","schema_version":"1.0","event_id":"sha256:3a59827c7a93ec14a817ba759227d0e7f242efec4d0573f15e6abbf403dba61b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BT7IG7YWAVILQLLU3U4PMZXGFW","target":"graph","payload":{"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"},"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-18T03:31:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIGiPkbiLykY12RqfNJslMtkqs9Jq6Ej7VovYOa65edAGAB86iKsoHivLt42xLOzh3enaGj9vaw5EXWceRCZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:48.038841Z"},"content_sha256":"afddfd1463cd0c38d0693bf81241590dbde13be64435ab311f808420c8dfe3ff","schema_version":"1.0","event_id":"sha256:afddfd1463cd0c38d0693bf81241590dbde13be64435ab311f808420c8dfe3ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/bundle.json","state_url":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/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-05-30T03:51:48Z","links":{"resolver":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW","bundle":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/bundle.json","state":"https://pith.science/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BT7IG7YWAVILQLLU3U4PMZXGFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BT7IG7YWAVILQLLU3U4PMZXGFW","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":"c3fadfca6a1cde5d0ced2c5aaff7006f620df5c22fb51e4397bc163fb109563b","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-06T12:50:58Z","title_canon_sha256":"b96f7336e4068e30574bfb4fcac0355d26871d7754116f4f07ddbd277f3da279"},"schema_version":"1.0","source":{"id":"1110.1248","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1248","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1248v2","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1248","created_at":"2026-05-18T03:31:17Z"},{"alias_kind":"pith_short_12","alias_value":"BT7IG7YWAVIL","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BT7IG7YWAVILQLLU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BT7IG7YW","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:afddfd1463cd0c38d0693bf81241590dbde13be64435ab311f808420c8dfe3ff","target":"graph","created_at":"2026-05-18T03:31:17Z","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":"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","authors_text":"Axel Gandy, Patrick Rubin-Delanchy","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-06T12:50:58Z","title":"An algorithm to compute the power of Monte Carlo tests with guaranteed precision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1248","kind":"arxiv","version":2},"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:3a59827c7a93ec14a817ba759227d0e7f242efec4d0573f15e6abbf403dba61b","target":"record","created_at":"2026-05-18T03:31:17Z","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":"c3fadfca6a1cde5d0ced2c5aaff7006f620df5c22fb51e4397bc163fb109563b","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2011-10-06T12:50:58Z","title_canon_sha256":"b96f7336e4068e30574bfb4fcac0355d26871d7754116f4f07ddbd277f3da279"},"schema_version":"1.0","source":{"id":"1110.1248","kind":"arxiv","version":2}},"canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cfe837f160550b82d74dd38f666e62da9870054d5a5fd11413d06ef42ea0daf","first_computed_at":"2026-05-18T03:31:17.967785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:17.967785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"avkBBTN3a9Hp9UjkHFgsfaLBvS7AQduJ3XVBBIVSYJ5QJTzhmvSeEk96srfGtjZ2CTVQJeoWeUkQPvhVZrDcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:17.968630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1248","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a59827c7a93ec14a817ba759227d0e7f242efec4d0573f15e6abbf403dba61b","sha256:afddfd1463cd0c38d0693bf81241590dbde13be64435ab311f808420c8dfe3ff"],"state_sha256":"6fefa4d85087ab71049381087af1655d30bef802cf60e9b9100b0df1a57f00f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZFLDKbxZFZrjl8ZwIiNRK5wH/mrEC4XD7WydLO5c/nBkSk6hhzP37jXKDltYFxCqYdqfTUid4H9Pyoy68yACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:51:48.041088Z","bundle_sha256":"3f0a35141701853be292ff1122cd6ccaed54243393f06d569288379156c83d8d"}}