{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KTI2TTTIWNV7PQYT55RTY6ZVB4","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":"0518aabd4e428961eda70a347034a0099c356beae2f38cf64d557dbf9eb33ed4","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-11-08T16:48:11Z","title_canon_sha256":"e713bfd12079c54d144e5810aaf3caab9b5b61bd47497ef7c457aaabfaa22dae"},"schema_version":"1.0","source":{"id":"2011.04020","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04020","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04020v2","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04020","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"KTI2TTTIWNV7","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_16","alias_value":"KTI2TTTIWNV7PQYT","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_8","alias_value":"KTI2TTTI","created_at":"2026-07-05T03:11:26Z"}],"graph_snapshots":[{"event_id":"sha256:f136b1759e6a1e8a2daa1629abc82fa113eafce3398925a0dc484675076efc48","target":"graph","created_at":"2026-07-05T03:11:26Z","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/2011.04020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic linear bandits with high-dimensional sparse features are a practical model for a variety of domains, including personalized medicine and online advertising. We derive a novel $\\Omega(n^{2/3})$ dimension-free minimax regret lower bound for sparse linear bandits in the data-poor regime where the horizon is smaller than the ambient dimension and where the feature vectors admit a well-conditioned exploration distribution. This is complemented by a nearly matching upper bound for an explore-then-commit algorithm showing that that $\\Theta(n^{2/3})$ is the optimal rate in the data-poor reg","authors_text":"Botao Hao, Mengdi Wang, Tor Lattimore","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-11-08T16:48:11Z","title":"High-Dimensional Sparse Linear Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04020","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:99cef1e4c18cc80a4bb5d743203cb85c1d127fcdcd300383969fed3d46ce0972","target":"record","created_at":"2026-07-05T03:11:26Z","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":"0518aabd4e428961eda70a347034a0099c356beae2f38cf64d557dbf9eb33ed4","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-11-08T16:48:11Z","title_canon_sha256":"e713bfd12079c54d144e5810aaf3caab9b5b61bd47497ef7c457aaabfaa22dae"},"schema_version":"1.0","source":{"id":"2011.04020","kind":"arxiv","version":2}},"canonical_sha256":"54d1a9ce68b36bf7c313ef633c7b350f0899e46ebcbc55fc28131c971f2deea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54d1a9ce68b36bf7c313ef633c7b350f0899e46ebcbc55fc28131c971f2deea7","first_computed_at":"2026-07-05T03:11:26.725019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:26.725019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YC86qyJvXrSJWP1FsHdAX1cNx3yd2c9DrEdG7tuUppkkn38S/qdXxeHRBwIsdVmSQ77kQWMXeYFrTY34MA8dDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:26.725487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04020","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99cef1e4c18cc80a4bb5d743203cb85c1d127fcdcd300383969fed3d46ce0972","sha256:f136b1759e6a1e8a2daa1629abc82fa113eafce3398925a0dc484675076efc48"],"state_sha256":"a931adb68e249599071943e8bbf83accf15dbf8ecaa07450353bcbcd4bca615b"}