{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FYR7QW66NRTHIWNQPKVCJDPLC7","short_pith_number":"pith:FYR7QW66","canonical_record":{"source":{"id":"1412.1605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-04T10:11:03Z","cross_cats_sorted":["stat.CO","stat.TH"],"title_canon_sha256":"ac34708932e583aaa80381e2e83fd33c5691641375c3217a4640c5990338edf9","abstract_canon_sha256":"c653fd67f042af1057255b4f48c7fa17557094f5d6d5191c1e9d0365ba8d0e8c"},"schema_version":"1.0"},"canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","source":{"kind":"arxiv","id":"1412.1605","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1605","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1605v2","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1605","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FYR7QW66NRTH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FYR7QW66NRTHIWNQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FYR7QW66","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FYR7QW66NRTHIWNQPKVCJDPLC7","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-04T10:11:03Z","cross_cats_sorted":["stat.CO","stat.TH"],"title_canon_sha256":"ac34708932e583aaa80381e2e83fd33c5691641375c3217a4640c5990338edf9","abstract_canon_sha256":"c653fd67f042af1057255b4f48c7fa17557094f5d6d5191c1e9d0365ba8d0e8c"},"schema_version":"1.0"},"canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.193117Z","signature_b64":"HN83LCox8JZm7a4SHuhdMW715bR1G2j4J6CPOZ/EREEQr1curH2yphz0g/jtOV68724a8QqcwJq0iMFi3tuzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","last_reissued_at":"2026-05-18T00:50:07.192401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.192401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1605","source_version":2,"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-18T00:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Vuwslq27zr50TkusEpISpG48UCDKTf2XcFnuIemvry4S+K3WBSqA3dy5B43m6Vwq9JYkNNa9846eoPwosCsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:08:28.136889Z"},"content_sha256":"2c68b9987bbcfc5436b0c5b49394654d8ef0f01e70eae708f0885845d120a0ff","schema_version":"1.0","event_id":"sha256:2c68b9987bbcfc5436b0c5b49394654d8ef0f01e70eae708f0885845d120a0ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FYR7QW66NRTHIWNQPKVCJDPLC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On sequential hypotheses testing via convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Anatoli Juditsky, Arkadi Nemirovski","submitted_at":"2014-12-04T10:11:03Z","abstract_excerpt":"We propose a new approach to sequential testing which is an adaptive (on-line) extension of the (off-line) framework developed in [10]. It relies upon testing of pairs of hypotheses in the case where each hypothesis states that the vector of parameters underlying the dis- tribution of observations belongs to a convex set. The nearly optimal under appropriate conditions test is yielded by a solution to an efficiently solvable convex optimization prob- lem. The proposed methodology can be seen as a computationally friendly reformulation of the classical sequential testing."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1605","kind":"arxiv","version":2},"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-18T00:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mdavTM/e5zlyEXAWTjXu9RwPakbiexmeoh3liV/aMOewVDclLk2ek7nUkymgx47vflIbqE8xXBlTUld9uMMXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:08:28.137301Z"},"content_sha256":"f81446e583fc5c788d32e78c092a0726c6ca07de86febf26fae11e0bafe26dbf","schema_version":"1.0","event_id":"sha256:f81446e583fc5c788d32e78c092a0726c6ca07de86febf26fae11e0bafe26dbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/bundle.json","state_url":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/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-09T13:08:28Z","links":{"resolver":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7","bundle":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/bundle.json","state":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FYR7QW66NRTHIWNQPKVCJDPLC7","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":"c653fd67f042af1057255b4f48c7fa17557094f5d6d5191c1e9d0365ba8d0e8c","cross_cats_sorted":["stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-04T10:11:03Z","title_canon_sha256":"ac34708932e583aaa80381e2e83fd33c5691641375c3217a4640c5990338edf9"},"schema_version":"1.0","source":{"id":"1412.1605","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1605","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1605v2","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1605","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"FYR7QW66NRTH","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FYR7QW66NRTHIWNQ","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FYR7QW66","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f81446e583fc5c788d32e78c092a0726c6ca07de86febf26fae11e0bafe26dbf","target":"graph","created_at":"2026-05-18T00:50:07Z","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 new approach to sequential testing which is an adaptive (on-line) extension of the (off-line) framework developed in [10]. It relies upon testing of pairs of hypotheses in the case where each hypothesis states that the vector of parameters underlying the dis- tribution of observations belongs to a convex set. The nearly optimal under appropriate conditions test is yielded by a solution to an efficiently solvable convex optimization prob- lem. The proposed methodology can be seen as a computationally friendly reformulation of the classical sequential testing.","authors_text":"Anatoli Juditsky, Arkadi Nemirovski","cross_cats":["stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-04T10:11:03Z","title":"On sequential hypotheses testing via convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1605","kind":"arxiv","version":2},"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:2c68b9987bbcfc5436b0c5b49394654d8ef0f01e70eae708f0885845d120a0ff","target":"record","created_at":"2026-05-18T00:50:07Z","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":"c653fd67f042af1057255b4f48c7fa17557094f5d6d5191c1e9d0365ba8d0e8c","cross_cats_sorted":["stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-12-04T10:11:03Z","title_canon_sha256":"ac34708932e583aaa80381e2e83fd33c5691641375c3217a4640c5990338edf9"},"schema_version":"1.0","source":{"id":"1412.1605","kind":"arxiv","version":2}},"canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","first_computed_at":"2026-05-18T00:50:07.192401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:07.192401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HN83LCox8JZm7a4SHuhdMW715bR1G2j4J6CPOZ/EREEQr1curH2yphz0g/jtOV68724a8QqcwJq0iMFi3tuzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:07.193117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1605","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c68b9987bbcfc5436b0c5b49394654d8ef0f01e70eae708f0885845d120a0ff","sha256:f81446e583fc5c788d32e78c092a0726c6ca07de86febf26fae11e0bafe26dbf"],"state_sha256":"7c4b7cbec40006ada3083cb218f42db7f8e2f7f9b037cd80a1e203c937536ed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aF/aQncVn1qPGix3waglhfnlMToUuER1pplg4jSdbfTy6qXYPoWJS4ye4cIXEBZBr+BykeA5Frp9oLzbQ9LdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:08:28.139786Z","bundle_sha256":"72a25ed7a50c0778680f887590c155c1e8901d7ed24b0c0a9bb35dbbc7de7d3c"}}