{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QXL2N4VVZQTHTIMBI5EPOTPNBM","short_pith_number":"pith:QXL2N4VV","canonical_record":{"source":{"id":"1309.5352","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-20T19:21:01Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"4d94cb82cc64a5c1f9a2a2c59678477f256286e5172645a9fa4d091e86cedf19","abstract_canon_sha256":"9071d7237bee71cc10ac6e42fda50ef990fc81b50f982e0661e80b6739949020"},"schema_version":"1.0"},"canonical_sha256":"85d7a6f2b5cc2679a1814748f74ded0b2e300d1a9093cafd270dcae1b006a320","source":{"kind":"arxiv","id":"1309.5352","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5352","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5352v3","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5352","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"QXL2N4VVZQTH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXL2N4VVZQTHTIMB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXL2N4VV","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QXL2N4VVZQTHTIMBI5EPOTPNBM","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5352","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-20T19:21:01Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"4d94cb82cc64a5c1f9a2a2c59678477f256286e5172645a9fa4d091e86cedf19","abstract_canon_sha256":"9071d7237bee71cc10ac6e42fda50ef990fc81b50f982e0661e80b6739949020"},"schema_version":"1.0"},"canonical_sha256":"85d7a6f2b5cc2679a1814748f74ded0b2e300d1a9093cafd270dcae1b006a320","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:37.073467Z","signature_b64":"W8t7sh28l9une3/m+IKoook4XCZexkKolIMCCP8uxZEAVGVM07llW0WH4X1i43KdjAFfmswmafmUPVe1exThAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d7a6f2b5cc2679a1814748f74ded0b2e300d1a9093cafd270dcae1b006a320","last_reissued_at":"2026-05-18T02:20:37.072887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:37.072887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5352","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-18T02:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUiC4xB+23zsGidIc4fLhpqh9BVol9G9wSnVCWfYyGhzXvERKE3OrTa0BRsa4sfg/yG7EpWN+pLGNKKbqQAMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:38:19.936442Z"},"content_sha256":"03be5a4dfaa85f7d58d881e7522b3b2aa5bd2243f1758c84e5a265baf2b20a83","schema_version":"1.0","event_id":"sha256:03be5a4dfaa85f7d58d881e7522b3b2aa5bd2243f1758c84e5a265baf2b20a83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QXL2N4VVZQTHTIMBI5EPOTPNBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Selection Procedures and False Discovery Rate Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandra Chouldechova, Max Grazier G'Sell, Robert Tibshirani, Stefan Wager","submitted_at":"2013-09-20T19:21:01Z","abstract_excerpt":"We consider a multiple hypothesis testing setting where the hypotheses are ordered and one is only permitted to reject an initial contiguous block, H_1,\\dots,H_k, of hypotheses. A rejection rule in this setting amounts to a procedure for choosing the stopping point k. This setting is inspired by the sequential nature of many model selection problems, where choosing a stopping point or a model is equivalent to rejecting all hypotheses up to that point and none thereafter. We propose two new testing procedures, and prove that they control the false discovery rate in the ordered testing setting. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5352","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-18T02:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFqPKvee/Ks1em2PY4CctgB5DS6tco0ZsSo8IJEf70+v8RSETkS/aik1VXEH+oskfU3s2eTtjC60ZZ06D0MIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:38:19.937170Z"},"content_sha256":"49b402dc3919c81bc673497fee61a0bccc1b97fb7a684af19ded40cc3346430e","schema_version":"1.0","event_id":"sha256:49b402dc3919c81bc673497fee61a0bccc1b97fb7a684af19ded40cc3346430e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/bundle.json","state_url":"https://pith.science/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/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-05-26T21:38:19Z","links":{"resolver":"https://pith.science/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM","bundle":"https://pith.science/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/bundle.json","state":"https://pith.science/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXL2N4VVZQTHTIMBI5EPOTPNBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QXL2N4VVZQTHTIMBI5EPOTPNBM","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":"9071d7237bee71cc10ac6e42fda50ef990fc81b50f982e0661e80b6739949020","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-20T19:21:01Z","title_canon_sha256":"4d94cb82cc64a5c1f9a2a2c59678477f256286e5172645a9fa4d091e86cedf19"},"schema_version":"1.0","source":{"id":"1309.5352","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5352","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5352v3","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5352","created_at":"2026-05-18T02:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"QXL2N4VVZQTH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXL2N4VVZQTHTIMB","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXL2N4VV","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:49b402dc3919c81bc673497fee61a0bccc1b97fb7a684af19ded40cc3346430e","target":"graph","created_at":"2026-05-18T02:20:37Z","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 consider a multiple hypothesis testing setting where the hypotheses are ordered and one is only permitted to reject an initial contiguous block, H_1,\\dots,H_k, of hypotheses. A rejection rule in this setting amounts to a procedure for choosing the stopping point k. This setting is inspired by the sequential nature of many model selection problems, where choosing a stopping point or a model is equivalent to rejecting all hypotheses up to that point and none thereafter. We propose two new testing procedures, and prove that they control the false discovery rate in the ordered testing setting. ","authors_text":"Alexandra Chouldechova, Max Grazier G'Sell, Robert Tibshirani, Stefan Wager","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-20T19:21:01Z","title":"Sequential Selection Procedures and False Discovery Rate Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5352","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:03be5a4dfaa85f7d58d881e7522b3b2aa5bd2243f1758c84e5a265baf2b20a83","target":"record","created_at":"2026-05-18T02:20:37Z","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":"9071d7237bee71cc10ac6e42fda50ef990fc81b50f982e0661e80b6739949020","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-09-20T19:21:01Z","title_canon_sha256":"4d94cb82cc64a5c1f9a2a2c59678477f256286e5172645a9fa4d091e86cedf19"},"schema_version":"1.0","source":{"id":"1309.5352","kind":"arxiv","version":3}},"canonical_sha256":"85d7a6f2b5cc2679a1814748f74ded0b2e300d1a9093cafd270dcae1b006a320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d7a6f2b5cc2679a1814748f74ded0b2e300d1a9093cafd270dcae1b006a320","first_computed_at":"2026-05-18T02:20:37.072887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:37.072887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8t7sh28l9une3/m+IKoook4XCZexkKolIMCCP8uxZEAVGVM07llW0WH4X1i43KdjAFfmswmafmUPVe1exThAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:37.073467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5352","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03be5a4dfaa85f7d58d881e7522b3b2aa5bd2243f1758c84e5a265baf2b20a83","sha256:49b402dc3919c81bc673497fee61a0bccc1b97fb7a684af19ded40cc3346430e"],"state_sha256":"e4d17b33d87cd1d5bfa9bb9376915ae29f6d35ec26c0b3acbfe97625e8076f1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovF4lSy27WyiGKHG8uQz3tfb6O0t2Fn+t3sZhwzJhPYbuqZn1MJDQ8aPAaXqI7j7qn+zACeZaqdH43FYFOr+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:38:19.940902Z","bundle_sha256":"fce7541402c043e754060751f4a4e99e6d0156ff30a0a0a359573633d1fff97b"}}