{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G26YZRUZWAOFJZQSL7GKSZIABM","short_pith_number":"pith:G26YZRUZ","schema_version":"1.0","canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","source":{"kind":"arxiv","id":"1709.10250","version":3},"attestation_state":"computed","paper":{"title":"DAGGER: A sequential algorithm for FDR control on DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan","submitted_at":"2017-09-29T06:38:11Z","abstract_excerpt":"We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial ordering in which hypotheses must be tested. The procedure is guaranteed to reject a sub-DAG with bounded false discovery rate (FDR) while satisfying the logical constraint that a rejected node's parents must also be rejected. It is designed for sequential testing settings, when the DAG structure is known a priori, but the $p$-values are obtained selectively (such as in a sequence of experiments), but the algorithm is als"},"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":"1709.10250","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-09-29T06:38:11Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"0b6ea9d47bd40ca3bf72abe38308af25a14fc42ec63623b7b4805f2a0768d1fa","abstract_canon_sha256":"1dd78da9e2d19b11d7ff12d605b246602b8fd2a291a0689c22af084452eb6f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:03.694878Z","signature_b64":"+k56+RjRDiqUCNpAxR/mxVm0vE6QfQ9bkorVTOWddcLmGFtmRiAFBLMm/agujRzdTorTh+bZhEplHJrRfCuLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","last_reissued_at":"2026-05-17T23:59:03.694472Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:03.694472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DAGGER: A sequential algorithm for FDR control on DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan","submitted_at":"2017-09-29T06:38:11Z","abstract_excerpt":"We propose a linear-time, single-pass, top-down algorithm for multiple testing on directed acyclic graphs (DAGs), where nodes represent hypotheses and edges specify a partial ordering in which hypotheses must be tested. The procedure is guaranteed to reject a sub-DAG with bounded false discovery rate (FDR) while satisfying the logical constraint that a rejected node's parents must also be rejected. It is designed for sequential testing settings, when the DAG structure is known a priori, but the $p$-values are obtained selectively (such as in a sequence of experiments), but the algorithm is als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10250","kind":"arxiv","version":3},"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":"1709.10250","created_at":"2026-05-17T23:59:03.694541+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.10250v3","created_at":"2026-05-17T23:59:03.694541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10250","created_at":"2026-05-17T23:59:03.694541+00:00"},{"alias_kind":"pith_short_12","alias_value":"G26YZRUZWAOF","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G26YZRUZWAOFJZQS","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G26YZRUZ","created_at":"2026-05-18T12:31:15.632608+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/G26YZRUZWAOFJZQSL7GKSZIABM","json":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM.json","graph_json":"https://pith.science/api/pith-number/G26YZRUZWAOFJZQSL7GKSZIABM/graph.json","events_json":"https://pith.science/api/pith-number/G26YZRUZWAOFJZQSL7GKSZIABM/events.json","paper":"https://pith.science/paper/G26YZRUZ"},"agent_actions":{"view_html":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM","download_json":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM.json","view_paper":"https://pith.science/paper/G26YZRUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.10250&json=true","fetch_graph":"https://pith.science/api/pith-number/G26YZRUZWAOFJZQSL7GKSZIABM/graph.json","fetch_events":"https://pith.science/api/pith-number/G26YZRUZWAOFJZQSL7GKSZIABM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/action/storage_attestation","attest_author":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/action/author_attestation","sign_citation":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/action/citation_signature","submit_replication":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/action/replication_record"}},"created_at":"2026-05-17T23:59:03.694541+00:00","updated_at":"2026-05-17T23:59:03.694541+00:00"}