{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HE3Y43PVDONG35UL5JRDMS3TPI","short_pith_number":"pith:HE3Y43PV","schema_version":"1.0","canonical_sha256":"39378e6df51b9a6df68bea62364b737a2979cfd65aa6bf72ea73db6046b8ac58","source":{"kind":"arxiv","id":"2502.07672","version":2},"attestation_state":"computed","paper":{"title":"Cheap Permutation Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Carles Domingo-Enrich, Lester Mackey, Raaz Dwivedi","submitted_at":"2025-02-11T16:19:07Z","abstract_excerpt":"Permutation tests are a popular choice for distinguishing distributions and testing independence, due to their exact, finite-sample control of false positives and their minimax optimality when paired with U-statistics. However, standard permutation tests are also expensive, requiring a test statistic to be computed hundreds or thousands of times to detect a separation between distributions. In this work, we offer a simple approach to accelerate testing: group your datapoints into bins and permute only those bins. For U and V-statistics, we prove that these cheap permutation tests have two rema"},"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":"2502.07672","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-02-11T16:19:07Z","cross_cats_sorted":["stat.CO","stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"55545a342e552f3613821d5f0ba2f9a03143f1dff99511533e3ee88d252b7dee","abstract_canon_sha256":"6be4856d98e316a696c3840cbd7021101f1e7a0e7c8ede8327c902bb81822d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:42.441131Z","signature_b64":"RkIDfjt1BK5l90Y+/gBqFIcVl7AjThvPKBD5X3lUTTTFIcaQGbEExs/hiJDZI4xMFylwG28uLP1dyE0W5R0aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39378e6df51b9a6df68bea62364b737a2979cfd65aa6bf72ea73db6046b8ac58","last_reissued_at":"2026-07-05T10:38:42.440703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:42.440703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cheap Permutation Testing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO","stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Carles Domingo-Enrich, Lester Mackey, Raaz Dwivedi","submitted_at":"2025-02-11T16:19:07Z","abstract_excerpt":"Permutation tests are a popular choice for distinguishing distributions and testing independence, due to their exact, finite-sample control of false positives and their minimax optimality when paired with U-statistics. However, standard permutation tests are also expensive, requiring a test statistic to be computed hundreds or thousands of times to detect a separation between distributions. In this work, we offer a simple approach to accelerate testing: group your datapoints into bins and permute only those bins. For U and V-statistics, we prove that these cheap permutation tests have two rema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.07672","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.07672/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.07672","created_at":"2026-07-05T10:38:42.440762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.07672v2","created_at":"2026-07-05T10:38:42.440762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.07672","created_at":"2026-07-05T10:38:42.440762+00:00"},{"alias_kind":"pith_short_12","alias_value":"HE3Y43PVDONG","created_at":"2026-07-05T10:38:42.440762+00:00"},{"alias_kind":"pith_short_16","alias_value":"HE3Y43PVDONG35UL","created_at":"2026-07-05T10:38:42.440762+00:00"},{"alias_kind":"pith_short_8","alias_value":"HE3Y43PV","created_at":"2026-07-05T10:38:42.440762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.11824","citing_title":"Theoretical Foundations of Conformal Prediction","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI","json":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI.json","graph_json":"https://pith.science/api/pith-number/HE3Y43PVDONG35UL5JRDMS3TPI/graph.json","events_json":"https://pith.science/api/pith-number/HE3Y43PVDONG35UL5JRDMS3TPI/events.json","paper":"https://pith.science/paper/HE3Y43PV"},"agent_actions":{"view_html":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI","download_json":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI.json","view_paper":"https://pith.science/paper/HE3Y43PV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.07672&json=true","fetch_graph":"https://pith.science/api/pith-number/HE3Y43PVDONG35UL5JRDMS3TPI/graph.json","fetch_events":"https://pith.science/api/pith-number/HE3Y43PVDONG35UL5JRDMS3TPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI/action/storage_attestation","attest_author":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI/action/author_attestation","sign_citation":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI/action/citation_signature","submit_replication":"https://pith.science/pith/HE3Y43PVDONG35UL5JRDMS3TPI/action/replication_record"}},"created_at":"2026-07-05T10:38:42.440762+00:00","updated_at":"2026-07-05T10:38:42.440762+00:00"}