{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HAODADV2EVU5LJMATHEPJK73WZ","short_pith_number":"pith:HAODADV2","schema_version":"1.0","canonical_sha256":"381c300eba2569d5a58099c8f4abfbb64ab205d0b20cefa20b652b5b661eab9d","source":{"kind":"arxiv","id":"2603.24792","version":2},"attestation_state":"computed","paper":{"title":"Improving online FDR procedures via online analogs of e-closure and compound e-values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Lasse Fischer, Ziyu Xu","submitted_at":"2026-03-25T20:06:38Z","abstract_excerpt":"In many scientific applications, hypotheses are generated and tested continuously in a stream. We develop a framework for improving online multiple testing procedures with false discovery rate (FDR) control under arbitrary dependence. Our approach is two-fold: we construct methods via the online e-closure principle, as well as a novel formulation of online compound e-values that is defined through donations. This yields strict power improvements over state-of-the-art e-value and p-value procedures while retaining FDR control. We further derive algorithms that compute the decision at time $t$ i"},"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":"2603.24792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2026-03-25T20:06:38Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"cc8656fe84661e477e618dbb037d0bb6d503138e39e333bea3739ccebd33b563","abstract_canon_sha256":"467371a850c1c5ba06dfec886354841ff86a0d14975b4ba977b058fbc847ddb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:38.825254Z","signature_b64":"sTJiHh73dY84dYyhQ/JX2lgRqasVoiRYPZ16F5LVMbh+EFjl1IMCMtj+5Mfsc2EOju8QzV8qNNjCGrbFPppTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"381c300eba2569d5a58099c8f4abfbb64ab205d0b20cefa20b652b5b661eab9d","last_reissued_at":"2026-07-07T02:18:38.824420Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:38.824420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving online FDR procedures via online analogs of e-closure and compound e-values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Lasse Fischer, Ziyu Xu","submitted_at":"2026-03-25T20:06:38Z","abstract_excerpt":"In many scientific applications, hypotheses are generated and tested continuously in a stream. We develop a framework for improving online multiple testing procedures with false discovery rate (FDR) control under arbitrary dependence. Our approach is two-fold: we construct methods via the online e-closure principle, as well as a novel formulation of online compound e-values that is defined through donations. This yields strict power improvements over state-of-the-art e-value and p-value procedures while retaining FDR control. We further derive algorithms that compute the decision at time $t$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.24792","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/2603.24792/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":"2603.24792","created_at":"2026-07-07T02:18:38.824540+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.24792v2","created_at":"2026-07-07T02:18:38.824540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.24792","created_at":"2026-07-07T02:18:38.824540+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAODADV2EVU5","created_at":"2026-07-07T02:18:38.824540+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAODADV2EVU5LJMA","created_at":"2026-07-07T02:18:38.824540+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAODADV2","created_at":"2026-07-07T02:18:38.824540+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09927","citing_title":"Dynamic $e$-closure for online hypotheses with any-time-valid evidence: closure principles and projective mergers","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ","json":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ.json","graph_json":"https://pith.science/api/pith-number/HAODADV2EVU5LJMATHEPJK73WZ/graph.json","events_json":"https://pith.science/api/pith-number/HAODADV2EVU5LJMATHEPJK73WZ/events.json","paper":"https://pith.science/paper/HAODADV2"},"agent_actions":{"view_html":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ","download_json":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ.json","view_paper":"https://pith.science/paper/HAODADV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.24792&json=true","fetch_graph":"https://pith.science/api/pith-number/HAODADV2EVU5LJMATHEPJK73WZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HAODADV2EVU5LJMATHEPJK73WZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ/action/storage_attestation","attest_author":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ/action/author_attestation","sign_citation":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ/action/citation_signature","submit_replication":"https://pith.science/pith/HAODADV2EVU5LJMATHEPJK73WZ/action/replication_record"}},"created_at":"2026-07-07T02:18:38.824540+00:00","updated_at":"2026-07-07T02:18:38.824540+00:00"}