{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2O4YIRZ4SOLCB7VRH4X7WNBMKK","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":"419c8bd0fb40a482f590f8a758cd2b72c179b91c4463bb347db72653550116b4","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T21:29:23Z","title_canon_sha256":"2d9578ebd6ef9d1322107381a9181ca7702fdeb01d0b00bdc93259747fa52bbe"},"schema_version":"1.0","source":{"id":"2605.24741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.24741","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.24741v1","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24741","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_12","alias_value":"2O4YIRZ4SOLC","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_16","alias_value":"2O4YIRZ4SOLCB7VR","created_at":"2026-05-26T01:03:55Z"},{"alias_kind":"pith_short_8","alias_value":"2O4YIRZ4","created_at":"2026-05-26T01:03:55Z"}],"graph_snapshots":[{"event_id":"sha256:107513145a16eefe22df4fa0e9619afb2ac69fda602402d0ce8ea637b3f38e02","target":"graph","created_at":"2026-05-26T01:03:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.24741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ankit Pensia, Shankar Vallinayagam, Varun Jog","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T21:29:23Z","title":"On the Sample Complexity of Robust Binary Hypothesis Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24741","kind":"arxiv","version":1},"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:d80853d47d9bf125ac437b6b05c585ff7a8a044af59d4a78bea03c442aee5d5a","target":"record","created_at":"2026-05-26T01:03:55Z","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":"419c8bd0fb40a482f590f8a758cd2b72c179b91c4463bb347db72653550116b4","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-05-23T21:29:23Z","title_canon_sha256":"2d9578ebd6ef9d1322107381a9181ca7702fdeb01d0b00bdc93259747fa52bbe"},"schema_version":"1.0","source":{"id":"2605.24741","kind":"arxiv","version":1}},"canonical_sha256":"d3b984473c939620feb13f2ffb342c5294933d3d1c1cd9746e444ba893da13e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3b984473c939620feb13f2ffb342c5294933d3d1c1cd9746e444ba893da13e9","first_computed_at":"2026-05-26T01:03:55.885217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:55.885217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/wJWJdj2/9issegCqkgngGw3utdQJk2ep7IWtc3ZQR28HxtfBKMQQ7eNToUCOAEA7FZcDUAF7Q14XqGav5mhAg==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:55.886026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.24741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80853d47d9bf125ac437b6b05c585ff7a8a044af59d4a78bea03c442aee5d5a","sha256:107513145a16eefe22df4fa0e9619afb2ac69fda602402d0ce8ea637b3f38e02"],"state_sha256":"c6c137f172121be0127cc189ab43b7de521d5dd70b396c3d0399f8e337ab02ee"}