{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G26YZRUZWAOFJZQSL7GKSZIABM","short_pith_number":"pith:G26YZRUZ","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"},"canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","source":{"kind":"arxiv","id":"1709.10250","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10250","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10250v3","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10250","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"G26YZRUZWAOF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G26YZRUZWAOFJZQS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G26YZRUZ","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G26YZRUZWAOFJZQSL7GKSZIABM","target":"record","payload":{"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"},"canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","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"},"source_kind":"arxiv","source_id":"1709.10250","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6qH6IRy5BsVRSrDPWy+S+1vgcYtjuDDgl4yjhvd4ouTYzMOOzvRolQTPSexRCXm/sLvyPG/JPWNiciW+GggPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:26:45.390638Z"},"content_sha256":"5b2f306bc2145d8ceef0297863ff84a0cffc734bbc66fe4a2f996bcea941d1fe","schema_version":"1.0","event_id":"sha256:5b2f306bc2145d8ceef0297863ff84a0cffc734bbc66fe4a2f996bcea941d1fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G26YZRUZWAOFJZQSL7GKSZIABM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9CLrTgMXbozIRHQMYCRqZgJu6QNCBPOBKqbAUfgqrfpS0unzhAM1ZmFzam6m0zp/f+Su3lPyjzrcs4tpGbL0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:26:45.391306Z"},"content_sha256":"080774b3c5588e707c464a190f16a9cc44b74c5b9a511703e3cb410ac4c93564","schema_version":"1.0","event_id":"sha256:080774b3c5588e707c464a190f16a9cc44b74c5b9a511703e3cb410ac4c93564"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/bundle.json","state_url":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G26YZRUZWAOFJZQSL7GKSZIABM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T00:26:45Z","links":{"resolver":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM","bundle":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/bundle.json","state":"https://pith.science/pith/G26YZRUZWAOFJZQSL7GKSZIABM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G26YZRUZWAOFJZQSL7GKSZIABM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G26YZRUZWAOFJZQSL7GKSZIABM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1dd78da9e2d19b11d7ff12d605b246602b8fd2a291a0689c22af084452eb6f69","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-09-29T06:38:11Z","title_canon_sha256":"0b6ea9d47bd40ca3bf72abe38308af25a14fc42ec63623b7b4805f2a0768d1fa"},"schema_version":"1.0","source":{"id":"1709.10250","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10250","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10250v3","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10250","created_at":"2026-05-17T23:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"G26YZRUZWAOF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G26YZRUZWAOFJZQS","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G26YZRUZ","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:080774b3c5588e707c464a190f16a9cc44b74c5b9a511703e3cb410ac4c93564","target":"graph","created_at":"2026-05-17T23:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aaditya Ramdas, Jianbo Chen, Martin J. Wainwright, Michael I. Jordan","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-09-29T06:38:11Z","title":"DAGGER: A sequential algorithm for FDR control on DAGs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10250","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5b2f306bc2145d8ceef0297863ff84a0cffc734bbc66fe4a2f996bcea941d1fe","target":"record","created_at":"2026-05-17T23:59:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1dd78da9e2d19b11d7ff12d605b246602b8fd2a291a0689c22af084452eb6f69","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-09-29T06:38:11Z","title_canon_sha256":"0b6ea9d47bd40ca3bf72abe38308af25a14fc42ec63623b7b4805f2a0768d1fa"},"schema_version":"1.0","source":{"id":"1709.10250","kind":"arxiv","version":3}},"canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36bd8cc699b01c54e6125fcca965000b3b9c32e34f0a217cd5e7881e073fe4fc","first_computed_at":"2026-05-17T23:59:03.694472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:03.694472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+k56+RjRDiqUCNpAxR/mxVm0vE6QfQ9bkorVTOWddcLmGFtmRiAFBLMm/agujRzdTorTh+bZhEplHJrRfCuLAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:03.694878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10250","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b2f306bc2145d8ceef0297863ff84a0cffc734bbc66fe4a2f996bcea941d1fe","sha256:080774b3c5588e707c464a190f16a9cc44b74c5b9a511703e3cb410ac4c93564"],"state_sha256":"6cead79e9b37bad4b4c2b0d85ad543ff5ac64cd9db061bc7021b2392bc495952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aO2EvBasfNUUepapQyssq+SyDxHDI6DzWiYM529y051KbW8Njy9O7K49VMCeuV1Rw0S3R9bQn9Pv7/Jl7T3iAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:26:45.395859Z","bundle_sha256":"c849b32fd4d05f63b7e8669bb9ce5ed19dfe4b7ecfe535a1cde2e8d76d9d77d4"}}