{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AV7GD6NLAA6Z65TUKT6MDSWXNU","short_pith_number":"pith:AV7GD6NL","canonical_record":{"source":{"id":"1608.07014","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-25T04:08:15Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"06ba7d4f65cd0947651308c2b7921a08567612d3a1ef01c9e932ab290e20aae5","abstract_canon_sha256":"cde8a5e6649812232f46795280af676597995fe0d5f9d48f24e2a69c8186b05c"},"schema_version":"1.0"},"canonical_sha256":"057e61f9ab003d9f767454fcc1cad76d29e1941aa948b4f30adb34528998e92a","source":{"kind":"arxiv","id":"1608.07014","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07014","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07014v4","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07014","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"AV7GD6NLAA6Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AV7GD6NLAA6Z65TU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AV7GD6NL","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AV7GD6NLAA6Z65TUKT6MDSWXNU","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07014","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-25T04:08:15Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"06ba7d4f65cd0947651308c2b7921a08567612d3a1ef01c9e932ab290e20aae5","abstract_canon_sha256":"cde8a5e6649812232f46795280af676597995fe0d5f9d48f24e2a69c8186b05c"},"schema_version":"1.0"},"canonical_sha256":"057e61f9ab003d9f767454fcc1cad76d29e1941aa948b4f30adb34528998e92a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.205964Z","signature_b64":"8e0USGtNsS3eggn8GkreTuHfbzXbkKmhBwRttoPgvNva+xelk5WtFGbhC2+CFDBBKIHpyJmWsYubBTwBKaJSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057e61f9ab003d9f767454fcc1cad76d29e1941aa948b4f30adb34528998e92a","last_reissued_at":"2026-05-17T23:53:58.205214Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.205214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07014","source_version":4,"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:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+/DfYtmxM663qaLCkl1hmIOJ7666qMJoYhaV9OmXHar4P9LNtYtjJS6+K8NxbSa7BKw64sQF0wbWwVr9ea1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:50:00.094535Z"},"content_sha256":"4847d4e5e141a55edc45a71e8008aa766a9825e753aba8f819710bab8902ba98","schema_version":"1.0","event_id":"sha256:4847d4e5e141a55edc45a71e8008aa766a9825e753aba8f819710bab8902ba98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AV7GD6NLAA6Z65TUKT6MDSWXNU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential multiple testing with generalized error control: an asymptotic optimality theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Georgios Fellouris, Yanglei Song","submitted_at":"2016-08-25T04:08:15Z","abstract_excerpt":"The sequential multiple testing problem is considered under two generalized error metrics. Under the first one, the probability of at least $k$ mistakes, of any kind, is controlled. Under the second, the probabilities of at least $k_1$ false positives and at least $k_2$ false negatives are simultaneously controlled. For each formulation, the optimal expected sample size is characterized, to a first-order asymptotic approximation as the error probabilities go to 0, and a novel multiple testing procedure is proposed and shown to be asymptotically efficient under every signal configuration. These"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07014","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"},"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:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlyMq38UkyYe8D0awpC8rEJgY82WVJhY3oGMyrmxsqgCtGJLtGu8jMxj4pOhwMx9fzVhpRgw7xSeXaD1N8iGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:50:00.094890Z"},"content_sha256":"0750804c644f65b0549145418ee5028296c4715836d4b277163e1c53165cef7e","schema_version":"1.0","event_id":"sha256:0750804c644f65b0549145418ee5028296c4715836d4b277163e1c53165cef7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/bundle.json","state_url":"https://pith.science/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/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-12T06:50:00Z","links":{"resolver":"https://pith.science/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU","bundle":"https://pith.science/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/bundle.json","state":"https://pith.science/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AV7GD6NLAA6Z65TUKT6MDSWXNU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AV7GD6NLAA6Z65TUKT6MDSWXNU","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":"cde8a5e6649812232f46795280af676597995fe0d5f9d48f24e2a69c8186b05c","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-25T04:08:15Z","title_canon_sha256":"06ba7d4f65cd0947651308c2b7921a08567612d3a1ef01c9e932ab290e20aae5"},"schema_version":"1.0","source":{"id":"1608.07014","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07014","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07014v4","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07014","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"AV7GD6NLAA6Z","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AV7GD6NLAA6Z65TU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AV7GD6NL","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:0750804c644f65b0549145418ee5028296c4715836d4b277163e1c53165cef7e","target":"graph","created_at":"2026-05-17T23:53:58Z","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":"The sequential multiple testing problem is considered under two generalized error metrics. Under the first one, the probability of at least $k$ mistakes, of any kind, is controlled. Under the second, the probabilities of at least $k_1$ false positives and at least $k_2$ false negatives are simultaneously controlled. For each formulation, the optimal expected sample size is characterized, to a first-order asymptotic approximation as the error probabilities go to 0, and a novel multiple testing procedure is proposed and shown to be asymptotically efficient under every signal configuration. These","authors_text":"Georgios Fellouris, Yanglei Song","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-25T04:08:15Z","title":"Sequential multiple testing with generalized error control: an asymptotic optimality theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07014","kind":"arxiv","version":4},"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:4847d4e5e141a55edc45a71e8008aa766a9825e753aba8f819710bab8902ba98","target":"record","created_at":"2026-05-17T23:53:58Z","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":"cde8a5e6649812232f46795280af676597995fe0d5f9d48f24e2a69c8186b05c","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-25T04:08:15Z","title_canon_sha256":"06ba7d4f65cd0947651308c2b7921a08567612d3a1ef01c9e932ab290e20aae5"},"schema_version":"1.0","source":{"id":"1608.07014","kind":"arxiv","version":4}},"canonical_sha256":"057e61f9ab003d9f767454fcc1cad76d29e1941aa948b4f30adb34528998e92a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"057e61f9ab003d9f767454fcc1cad76d29e1941aa948b4f30adb34528998e92a","first_computed_at":"2026-05-17T23:53:58.205214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:58.205214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8e0USGtNsS3eggn8GkreTuHfbzXbkKmhBwRttoPgvNva+xelk5WtFGbhC2+CFDBBKIHpyJmWsYubBTwBKaJSBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:58.205964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07014","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4847d4e5e141a55edc45a71e8008aa766a9825e753aba8f819710bab8902ba98","sha256:0750804c644f65b0549145418ee5028296c4715836d4b277163e1c53165cef7e"],"state_sha256":"66543525f944fd9b0da9d2c33d27439f0404ef30aaee9ae2561f5e778b9d4aa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LJizCEAl1rp9lqyhdBJKP8EuvGisniZJePS65gbJNHEZzLfTk0ol8590z6Jdf+8lLROn2X/pGYi5c7yVuWReBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:50:00.097264Z","bundle_sha256":"d7d35f46cab8b18fbd668b72797560432f474b06750a691351acfced7ced9648"}}