{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7IQRWTXBRJUGYPQWRZ2PX44PMA","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":"f84eb74c94f2509be8e11f132c3ed6026ec9b65f55ddcf614745b5b83315a32e","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T15:14:58Z","title_canon_sha256":"9419666c24fa9809fff751492760d4fd4249324b2e2527d8af94a44a6b893546"},"schema_version":"1.0","source":{"id":"2410.05117","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.05117","created_at":"2026-07-05T09:45:55Z"},{"alias_kind":"arxiv_version","alias_value":"2410.05117v2","created_at":"2026-07-05T09:45:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05117","created_at":"2026-07-05T09:45:55Z"},{"alias_kind":"pith_short_12","alias_value":"7IQRWTXBRJUG","created_at":"2026-07-05T09:45:55Z"},{"alias_kind":"pith_short_16","alias_value":"7IQRWTXBRJUGYPQW","created_at":"2026-07-05T09:45:55Z"},{"alias_kind":"pith_short_8","alias_value":"7IQRWTXB","created_at":"2026-07-05T09:45:55Z"}],"graph_snapshots":[{"event_id":"sha256:d7d98c8ca25588d6e48995b63228ad15a3b9bf8a0678411f7895a21146474c1e","target":"graph","created_at":"2026-07-05T09:45: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/2410.05117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a unifying framework for information-theoretic lower bound in statistical estimation and interactive decision making. Classical lower bound techniques -- such as Fano's method, Le Cam's method, and Assouad's lemma -- are central to the study of minimax risk in statistical estimation, yet are insufficient to provide tight lower bounds for \\emph{interactive decision making} algorithms that collect data interactively (e.g., algorithms for bandits and reinforcement learning). Recent work of Foster et al. (2021, 2023) provides minimax lower bounds for interactive decision making using se","authors_text":"Alexander Rakhlin, Dylan J. Foster, Fan Chen, Jian Qian, Yanjun Han, Yunbei Xu","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T15:14:58Z","title":"Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05117","kind":"arxiv","version":2},"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:229416bd781121f4367660d22fcab999b0e1ddfd3de50d2fa6e95946fc92a1c0","target":"record","created_at":"2026-07-05T09:45: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":"f84eb74c94f2509be8e11f132c3ed6026ec9b65f55ddcf614745b5b83315a32e","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-07T15:14:58Z","title_canon_sha256":"9419666c24fa9809fff751492760d4fd4249324b2e2527d8af94a44a6b893546"},"schema_version":"1.0","source":{"id":"2410.05117","kind":"arxiv","version":2}},"canonical_sha256":"fa211b4ee18a686c3e168e74fbf38f601bfb53d3cb4b4b9cd94ef745a95ccce1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa211b4ee18a686c3e168e74fbf38f601bfb53d3cb4b4b9cd94ef745a95ccce1","first_computed_at":"2026-07-05T09:45:55.955953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:45:55.955953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xLM6MIjTtsrMumX/l9IySmPFP00kxBCvnhV2nKQ21ycQGDTGjX2hOqkL2NSP0NlIVlNEpc5sZSe6xfqcqmwWCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:45:55.956487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.05117","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:229416bd781121f4367660d22fcab999b0e1ddfd3de50d2fa6e95946fc92a1c0","sha256:d7d98c8ca25588d6e48995b63228ad15a3b9bf8a0678411f7895a21146474c1e"],"state_sha256":"6e654aae68f81474d8816ad79e706167f6dafd21eb82da19f4a0724e65160180"}