{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ADGT6WV5P26ZBXN5SJQ73YDK4Z","short_pith_number":"pith:ADGT6WV5","schema_version":"1.0","canonical_sha256":"00cd3f5abd7ebd90ddbd9261fde06ae668d71cabc4703510868d6edbba67d61d","source":{"kind":"arxiv","id":"1311.6765","version":7},"attestation_state":"computed","paper":{"title":"Hypothesis testing by convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"A. Goldenshluger, A. Juditski, A. Nemirovski","submitted_at":"2013-11-26T18:33:18Z","abstract_excerpt":"We discuss a general approach to handling \"multiple hypotheses\" testing in the case when a particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated with the hypothesis. With our approach, this problem reduces to testing the hypotheses pairwise. Our central result is a test for a pair of hypotheses of the outlined type which, under appropriate assumptions, is provably nearly optimal. The test is yielded by a solution to a convex programming problem, so that our construction admits computationally efficient"},"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":"1311.6765","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-11-26T18:33:18Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"da049e53eae71996b63a9944582be81496657f3c8469e19a9e80ea7592d0c4a6","abstract_canon_sha256":"2482422abf51797283ce7683918f7755e317100b9ea9b87df30c3ae3b2ba61be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:12.423083Z","signature_b64":"+YOSqn0a59J+ysnCOL1hxzbLKf1kvUSd16m9MoEtO/b6NudDgLzHxLE2eAcdk2QGOLLsDSp/q8qIVSgMMnKIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00cd3f5abd7ebd90ddbd9261fde06ae668d71cabc4703510868d6edbba67d61d","last_reissued_at":"2026-05-18T01:20:12.422413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:12.422413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypothesis testing by convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"A. Goldenshluger, A. Juditski, A. Nemirovski","submitted_at":"2013-11-26T18:33:18Z","abstract_excerpt":"We discuss a general approach to handling \"multiple hypotheses\" testing in the case when a particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated with the hypothesis. With our approach, this problem reduces to testing the hypotheses pairwise. Our central result is a test for a pair of hypotheses of the outlined type which, under appropriate assumptions, is provably nearly optimal. The test is yielded by a solution to a convex programming problem, so that our construction admits computationally efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6765","kind":"arxiv","version":7},"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":"1311.6765","created_at":"2026-05-18T01:20:12.422511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6765v7","created_at":"2026-05-18T01:20:12.422511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6765","created_at":"2026-05-18T01:20:12.422511+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADGT6WV5P26Z","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADGT6WV5P26ZBXN5","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADGT6WV5","created_at":"2026-05-18T12:27:38.830355+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/ADGT6WV5P26ZBXN5SJQ73YDK4Z","json":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z.json","graph_json":"https://pith.science/api/pith-number/ADGT6WV5P26ZBXN5SJQ73YDK4Z/graph.json","events_json":"https://pith.science/api/pith-number/ADGT6WV5P26ZBXN5SJQ73YDK4Z/events.json","paper":"https://pith.science/paper/ADGT6WV5"},"agent_actions":{"view_html":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z","download_json":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z.json","view_paper":"https://pith.science/paper/ADGT6WV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6765&json=true","fetch_graph":"https://pith.science/api/pith-number/ADGT6WV5P26ZBXN5SJQ73YDK4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/ADGT6WV5P26ZBXN5SJQ73YDK4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z/action/storage_attestation","attest_author":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z/action/author_attestation","sign_citation":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z/action/citation_signature","submit_replication":"https://pith.science/pith/ADGT6WV5P26ZBXN5SJQ73YDK4Z/action/replication_record"}},"created_at":"2026-05-18T01:20:12.422511+00:00","updated_at":"2026-05-18T01:20:12.422511+00:00"}