{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VJZL42AOYLAKSJEJKARBBLGTMW","short_pith_number":"pith:VJZL42AO","canonical_record":{"source":{"id":"1706.04410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T11:21:02Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1507afd09de9f995582701317e8b229de6afea2ff32335343ab6cf605f5e96ee","abstract_canon_sha256":"561e452c4dc7e3295d21dda45c3e56e6b28c23a57ea2efe3a753fcfad36533f3"},"schema_version":"1.0"},"canonical_sha256":"aa72be680ec2c0a92489502210acd36596da00ed94550ee7648cfd4c2f01e9db","source":{"kind":"arxiv","id":"1706.04410","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04410","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04410v3","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04410","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"VJZL42AOYLAK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VJZL42AOYLAKSJEJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VJZL42AO","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VJZL42AOYLAKSJEJKARBBLGTMW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T11:21:02Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"1507afd09de9f995582701317e8b229de6afea2ff32335343ab6cf605f5e96ee","abstract_canon_sha256":"561e452c4dc7e3295d21dda45c3e56e6b28c23a57ea2efe3a753fcfad36533f3"},"schema_version":"1.0"},"canonical_sha256":"aa72be680ec2c0a92489502210acd36596da00ed94550ee7648cfd4c2f01e9db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:14.006137Z","signature_b64":"HIy9O6hC6lIOUFffm3GI4/mRdV0UApWv9V3lxejsCs7WcoJirbxXP86Q1jNYOiKm4zBkjFV2n4q9AKT/BHqJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa72be680ec2c0a92489502210acd36596da00ed94550ee7648cfd4c2f01e9db","last_reissued_at":"2026-05-18T00:19:14.005404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:14.005404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04410","source_version":3,"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:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNz73epRqM/B3mOhIwDZZscLknwbVJXgrJ4r6UEJUQLYyL5oAPir/2k7buag3UC8S3XW8JvscdIH3BxXCtJMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:43:26.627369Z"},"content_sha256":"2ceebc4894f0acfb32e170ce0993132305446ceb62c88b723db7999e0e66e75e","schema_version":"1.0","event_id":"sha256:2ceebc4894f0acfb32e170ce0993132305446ceb62c88b723db7999e0e66e75e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VJZL42AOYLAKSJEJKARBBLGTMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Oliver Johnson, Ramji Venkataramanan","submitted_at":"2017-06-14T11:21:02Z","abstract_excerpt":"In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an information-theoretic setting, it is known that Fano's inequality typically does not give a sharp converse result (error lower bound) for channel coding problems. Moreover, recent work has shown that an argument based on binary hypothesis testing gives tighter results. We adapt this technique to the statistical setting, and argue that Fano's inequality can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04410","kind":"arxiv","version":3},"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:19:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjjAroN3IlumG1icrzaNBCxKwhtGIztUcO/25xeHfLDY7U4K84Fegkk63uvGm8yM4DEoZC/lXSUk4ojs8BmwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:43:26.628076Z"},"content_sha256":"2dbdd559a281da7280724bf3195bbd66e2a18ae6b7c8432af87fd85462d161c9","schema_version":"1.0","event_id":"sha256:2dbdd559a281da7280724bf3195bbd66e2a18ae6b7c8432af87fd85462d161c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJZL42AOYLAKSJEJKARBBLGTMW/bundle.json","state_url":"https://pith.science/pith/VJZL42AOYLAKSJEJKARBBLGTMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJZL42AOYLAKSJEJKARBBLGTMW/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-06T20:43:26Z","links":{"resolver":"https://pith.science/pith/VJZL42AOYLAKSJEJKARBBLGTMW","bundle":"https://pith.science/pith/VJZL42AOYLAKSJEJKARBBLGTMW/bundle.json","state":"https://pith.science/pith/VJZL42AOYLAKSJEJKARBBLGTMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJZL42AOYLAKSJEJKARBBLGTMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VJZL42AOYLAKSJEJKARBBLGTMW","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":"561e452c4dc7e3295d21dda45c3e56e6b28c23a57ea2efe3a753fcfad36533f3","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T11:21:02Z","title_canon_sha256":"1507afd09de9f995582701317e8b229de6afea2ff32335343ab6cf605f5e96ee"},"schema_version":"1.0","source":{"id":"1706.04410","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04410","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04410v3","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04410","created_at":"2026-05-18T00:19:14Z"},{"alias_kind":"pith_short_12","alias_value":"VJZL42AOYLAK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VJZL42AOYLAKSJEJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VJZL42AO","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:2dbdd559a281da7280724bf3195bbd66e2a18ae6b7c8432af87fd85462d161c9","target":"graph","created_at":"2026-05-18T00:19:14Z","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":"In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an information-theoretic setting, it is known that Fano's inequality typically does not give a sharp converse result (error lower bound) for channel coding problems. Moreover, recent work has shown that an argument based on binary hypothesis testing gives tighter results. We adapt this technique to the statistical setting, and argue that Fano's inequality can ","authors_text":"Oliver Johnson, Ramji Venkataramanan","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T11:21:02Z","title":"A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04410","kind":"arxiv","version":3},"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:2ceebc4894f0acfb32e170ce0993132305446ceb62c88b723db7999e0e66e75e","target":"record","created_at":"2026-05-18T00:19:14Z","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":"561e452c4dc7e3295d21dda45c3e56e6b28c23a57ea2efe3a753fcfad36533f3","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-14T11:21:02Z","title_canon_sha256":"1507afd09de9f995582701317e8b229de6afea2ff32335343ab6cf605f5e96ee"},"schema_version":"1.0","source":{"id":"1706.04410","kind":"arxiv","version":3}},"canonical_sha256":"aa72be680ec2c0a92489502210acd36596da00ed94550ee7648cfd4c2f01e9db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa72be680ec2c0a92489502210acd36596da00ed94550ee7648cfd4c2f01e9db","first_computed_at":"2026-05-18T00:19:14.005404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:14.005404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIy9O6hC6lIOUFffm3GI4/mRdV0UApWv9V3lxejsCs7WcoJirbxXP86Q1jNYOiKm4zBkjFV2n4q9AKT/BHqJAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:14.006137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04410","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ceebc4894f0acfb32e170ce0993132305446ceb62c88b723db7999e0e66e75e","sha256:2dbdd559a281da7280724bf3195bbd66e2a18ae6b7c8432af87fd85462d161c9"],"state_sha256":"331e21bc1e1cf7c0e45f2f2cda586e22472c6b0e8393fd4e61120d76ddc853d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iX4M920pPzVumz9214fKM/T3bPaGhTb96flPvuIAuN0t/5Y1OAt90DEFEQhYZZOMOauqrE4AxK/Tw+r7igfdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:43:26.631556Z","bundle_sha256":"6f93a3a1fb5bf9d459adf8e5f7d91faf18f13856f297021a7e683daf803c7681"}}