{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2O4YIRZ4SOLCB7VRH4X7WNBMKK","short_pith_number":"pith:2O4YIRZ4","schema_version":"1.0","canonical_sha256":"d3b984473c939620feb13f2ffb342c5294933d3d1c1cd9746e444ba893da13e9","source":{"kind":"arxiv","id":"2605.24741","version":1},"attestation_state":"computed","paper":{"title":"On the Sample Complexity of Robust Binary Hypothesis Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Ankit Pensia, Shankar Vallinayagam, Varun Jog","submitted_at":"2026-05-23T21:29:23Z","abstract_excerpt":"We study the sample complexity of robust binary hypothesis testing under three standard contamination models: $\\varepsilon$-additive (Huber), $\\varepsilon$-subtractive, and $\\varepsilon$-total variation (TV), denoted by $n^*_{\\mathrm{Hub}}(\\varepsilon)$, $n^*_{\\mathrm{Sub}}(\\varepsilon)$, and $n^*_{\\mathrm{TV}}(\\varepsilon)$, respectively. For subtractive contamination, we show that least favourable distributions exist and provide explicit formulas for the same, bringing this model in line with the classical Huber and TV models. Next we show that in all three models, sample complexity may be h"},"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":"2605.24741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T21:29:23Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"2d9578ebd6ef9d1322107381a9181ca7702fdeb01d0b00bdc93259747fa52bbe","abstract_canon_sha256":"419c8bd0fb40a482f590f8a758cd2b72c179b91c4463bb347db72653550116b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:55.886026Z","signature_b64":"/wJWJdj2/9issegCqkgngGw3utdQJk2ep7IWtc3ZQR28HxtfBKMQQ7eNToUCOAEA7FZcDUAF7Q14XqGav5mhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3b984473c939620feb13f2ffb342c5294933d3d1c1cd9746e444ba893da13e9","last_reissued_at":"2026-05-26T01:03:55.885217Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:55.885217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sample Complexity of Robust Binary Hypothesis Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Ankit Pensia, Shankar Vallinayagam, Varun Jog","submitted_at":"2026-05-23T21:29:23Z","abstract_excerpt":"We study the sample complexity of robust binary hypothesis testing under three standard contamination models: $\\varepsilon$-additive (Huber), $\\varepsilon$-subtractive, and $\\varepsilon$-total variation (TV), denoted by $n^*_{\\mathrm{Hub}}(\\varepsilon)$, $n^*_{\\mathrm{Sub}}(\\varepsilon)$, and $n^*_{\\mathrm{TV}}(\\varepsilon)$, respectively. For subtractive contamination, we show that least favourable distributions exist and provide explicit formulas for the same, bringing this model in line with the classical Huber and TV models. Next we show that in all three models, sample complexity may be h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24741","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.24741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.24741","created_at":"2026-05-26T01:03:55.885356+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24741v1","created_at":"2026-05-26T01:03:55.885356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24741","created_at":"2026-05-26T01:03:55.885356+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O4YIRZ4SOLC","created_at":"2026-05-26T01:03:55.885356+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O4YIRZ4SOLCB7VR","created_at":"2026-05-26T01:03:55.885356+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O4YIRZ4","created_at":"2026-05-26T01:03:55.885356+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/2O4YIRZ4SOLCB7VRH4X7WNBMKK","json":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK.json","graph_json":"https://pith.science/api/pith-number/2O4YIRZ4SOLCB7VRH4X7WNBMKK/graph.json","events_json":"https://pith.science/api/pith-number/2O4YIRZ4SOLCB7VRH4X7WNBMKK/events.json","paper":"https://pith.science/paper/2O4YIRZ4"},"agent_actions":{"view_html":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK","download_json":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK.json","view_paper":"https://pith.science/paper/2O4YIRZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24741&json=true","fetch_graph":"https://pith.science/api/pith-number/2O4YIRZ4SOLCB7VRH4X7WNBMKK/graph.json","fetch_events":"https://pith.science/api/pith-number/2O4YIRZ4SOLCB7VRH4X7WNBMKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK/action/storage_attestation","attest_author":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK/action/author_attestation","sign_citation":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK/action/citation_signature","submit_replication":"https://pith.science/pith/2O4YIRZ4SOLCB7VRH4X7WNBMKK/action/replication_record"}},"created_at":"2026-05-26T01:03:55.885356+00:00","updated_at":"2026-05-26T01:03:55.885356+00:00"}