{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YKFMWBEJOJCZ27B6PGMF6YPL2D","short_pith_number":"pith:YKFMWBEJ","schema_version":"1.0","canonical_sha256":"c28acb048972459d7c3e79985f61ebd0db45b8ae5e8bdd5a0a357a559445cfcc","source":{"kind":"arxiv","id":"1609.06035","version":4},"attestation_state":"computed","paper":{"title":"AdaPT: An interactive procedure for multiple testing with side information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Lihua Lei, William Fithian","submitted_at":"2016-09-20T06:49:04Z","abstract_excerpt":"We consider the problem of multiple hypothesis testing with generic side information: for each hypothesis $H_i$ we observe both a p-value $p_i$ and some predictor $x_i$ encoding contextual information about the hypothesis. For large-scale problems, adaptively focusing power on the more promising hypotheses (those more likely to yield discoveries) can lead to much more powerful multiple testing procedures. We propose a general iterative framework for this problem, called the Adaptive p-value Thresholding (AdaPT) procedure, which adaptively estimates a Bayes-optimal p-value rejection threshold a"},"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":"1609.06035","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-09-20T06:49:04Z","cross_cats_sorted":[],"title_canon_sha256":"dd71e91bc3e11a51dc77eed5e4a04a2f97ec4cee39fe21579d72818ee6f70731","abstract_canon_sha256":"6627bdef86c0a6012a6b490f1589d2c7091e6ffe712f6516265008e56ee886c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:53.295654Z","signature_b64":"DOEpErj+kPmaM/xtlvvHcaerXuFcBCxF3DR96BJcPdgOiQzk6Ltryc+6A78o8Ofezz0LWZQb9fRyaHMFjEK3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c28acb048972459d7c3e79985f61ebd0db45b8ae5e8bdd5a0a357a559445cfcc","last_reissued_at":"2026-05-18T00:09:53.294941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:53.294941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaPT: An interactive procedure for multiple testing with side information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Lihua Lei, William Fithian","submitted_at":"2016-09-20T06:49:04Z","abstract_excerpt":"We consider the problem of multiple hypothesis testing with generic side information: for each hypothesis $H_i$ we observe both a p-value $p_i$ and some predictor $x_i$ encoding contextual information about the hypothesis. For large-scale problems, adaptively focusing power on the more promising hypotheses (those more likely to yield discoveries) can lead to much more powerful multiple testing procedures. We propose a general iterative framework for this problem, called the Adaptive p-value Thresholding (AdaPT) procedure, which adaptively estimates a Bayes-optimal p-value rejection threshold a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06035","kind":"arxiv","version":4},"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":"1609.06035","created_at":"2026-05-18T00:09:53.295056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06035v4","created_at":"2026-05-18T00:09:53.295056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06035","created_at":"2026-05-18T00:09:53.295056+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKFMWBEJOJCZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKFMWBEJOJCZ27B6","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKFMWBEJ","created_at":"2026-05-18T12:30:53.716459+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17559","citing_title":"Controlling False Discovery in Arbitrarily Structured Hypothesis Spaces via Reproducing Kernels","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D","json":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D.json","graph_json":"https://pith.science/api/pith-number/YKFMWBEJOJCZ27B6PGMF6YPL2D/graph.json","events_json":"https://pith.science/api/pith-number/YKFMWBEJOJCZ27B6PGMF6YPL2D/events.json","paper":"https://pith.science/paper/YKFMWBEJ"},"agent_actions":{"view_html":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D","download_json":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D.json","view_paper":"https://pith.science/paper/YKFMWBEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06035&json=true","fetch_graph":"https://pith.science/api/pith-number/YKFMWBEJOJCZ27B6PGMF6YPL2D/graph.json","fetch_events":"https://pith.science/api/pith-number/YKFMWBEJOJCZ27B6PGMF6YPL2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D/action/storage_attestation","attest_author":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D/action/author_attestation","sign_citation":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D/action/citation_signature","submit_replication":"https://pith.science/pith/YKFMWBEJOJCZ27B6PGMF6YPL2D/action/replication_record"}},"created_at":"2026-05-18T00:09:53.295056+00:00","updated_at":"2026-05-18T00:09:53.295056+00:00"}