{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FYR7QW66NRTHIWNQPKVCJDPLC7","short_pith_number":"pith:FYR7QW66","schema_version":"1.0","canonical_sha256":"2e23f85bde6c667459b07aaa248deb17c40f1b78b0ae98de56cecc9e33ec1c31","source":{"kind":"arxiv","id":"1412.1605","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1605","created_at":"2026-05-18T00:50:07.192529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1605v2","created_at":"2026-05-18T00:50:07.192529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1605","created_at":"2026-05-18T00:50:07.192529+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYR7QW66NRTH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYR7QW66NRTHIWNQ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYR7QW66","created_at":"2026-05-18T12:28:28.263976+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/FYR7QW66NRTHIWNQPKVCJDPLC7","json":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7.json","graph_json":"https://pith.science/api/pith-number/FYR7QW66NRTHIWNQPKVCJDPLC7/graph.json","events_json":"https://pith.science/api/pith-number/FYR7QW66NRTHIWNQPKVCJDPLC7/events.json","paper":"https://pith.science/paper/FYR7QW66"},"agent_actions":{"view_html":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7","download_json":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7.json","view_paper":"https://pith.science/paper/FYR7QW66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1605&json=true","fetch_graph":"https://pith.science/api/pith-number/FYR7QW66NRTHIWNQPKVCJDPLC7/graph.json","fetch_events":"https://pith.science/api/pith-number/FYR7QW66NRTHIWNQPKVCJDPLC7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/action/storage_attestation","attest_author":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/action/author_attestation","sign_citation":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/action/citation_signature","submit_replication":"https://pith.science/pith/FYR7QW66NRTHIWNQPKVCJDPLC7/action/replication_record"}},"created_at":"2026-05-18T00:50:07.192529+00:00","updated_at":"2026-05-18T00:50:07.192529+00:00"}