{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UOWKTDYZPK5BT7DAV7YZIMC4BX","short_pith_number":"pith:UOWKTDYZ","schema_version":"1.0","canonical_sha256":"a3aca98f197aba19fc60aff194305c0de28de93d3f0f7ad0dad02ba2e49141bf","source":{"kind":"arxiv","id":"2306.07819","version":2},"attestation_state":"computed","paper":{"title":"False discovery proportion envelopes with m-consistency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Etienne Roquain, Gilles Blanchard, Iqraa Meah","submitted_at":"2023-06-13T14:52:08Z","abstract_excerpt":"We provide new non-asymptotic false discovery proportion (FDP) confidence envelopes in several multiple testing settings relevant for modern high dimensional-data methods. We revisit the multiple testing scenarios considered in the recent work of Katsevich and Ramdas (2020): top-$k$, preordered (including knockoffs), online. Our emphasis is on obtaining FDP confidence bounds that both have non-asymptotic coverage and are asymptotically accurate in a specific sense, as the number $m$ of tested hypotheses grows. Namely, we introduce and study the property (which we call $m$-consistency) that the"},"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":"2306.07819","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2023-06-13T14:52:08Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"f49f4a10bbc5d8a4e14f4e5b264df45fb46f877072d3f7df64048939c3997e85","abstract_canon_sha256":"873f24d04f75b79e9f14f8735ff6ba8e8028619503b1be5d400d4a6fc1ff64b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:43.627386Z","signature_b64":"gjwnbXAvxAUxuhu2tRJjiyxGNGqNxWt1v07Ir2WNsuGr2FVyVUQizx7jSlFaQZ1N18/SwGKeE8movQnK27eKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3aca98f197aba19fc60aff194305c0de28de93d3f0f7ad0dad02ba2e49141bf","last_reissued_at":"2026-07-05T09:07:43.626917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:43.626917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"False discovery proportion envelopes with m-consistency","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Etienne Roquain, Gilles Blanchard, Iqraa Meah","submitted_at":"2023-06-13T14:52:08Z","abstract_excerpt":"We provide new non-asymptotic false discovery proportion (FDP) confidence envelopes in several multiple testing settings relevant for modern high dimensional-data methods. We revisit the multiple testing scenarios considered in the recent work of Katsevich and Ramdas (2020): top-$k$, preordered (including knockoffs), online. Our emphasis is on obtaining FDP confidence bounds that both have non-asymptotic coverage and are asymptotically accurate in a specific sense, as the number $m$ of tested hypotheses grows. Namely, we introduce and study the property (which we call $m$-consistency) that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07819","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/2306.07819/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":"2306.07819","created_at":"2026-07-05T09:07:43.626975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07819v2","created_at":"2026-07-05T09:07:43.626975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07819","created_at":"2026-07-05T09:07:43.626975+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOWKTDYZPK5B","created_at":"2026-07-05T09:07:43.626975+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOWKTDYZPK5BT7DA","created_at":"2026-07-05T09:07:43.626975+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOWKTDYZ","created_at":"2026-07-05T09:07:43.626975+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/UOWKTDYZPK5BT7DAV7YZIMC4BX","json":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX.json","graph_json":"https://pith.science/api/pith-number/UOWKTDYZPK5BT7DAV7YZIMC4BX/graph.json","events_json":"https://pith.science/api/pith-number/UOWKTDYZPK5BT7DAV7YZIMC4BX/events.json","paper":"https://pith.science/paper/UOWKTDYZ"},"agent_actions":{"view_html":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX","download_json":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX.json","view_paper":"https://pith.science/paper/UOWKTDYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07819&json=true","fetch_graph":"https://pith.science/api/pith-number/UOWKTDYZPK5BT7DAV7YZIMC4BX/graph.json","fetch_events":"https://pith.science/api/pith-number/UOWKTDYZPK5BT7DAV7YZIMC4BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX/action/storage_attestation","attest_author":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX/action/author_attestation","sign_citation":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX/action/citation_signature","submit_replication":"https://pith.science/pith/UOWKTDYZPK5BT7DAV7YZIMC4BX/action/replication_record"}},"created_at":"2026-07-05T09:07:43.626975+00:00","updated_at":"2026-07-05T09:07:43.626975+00:00"}