{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KTI2TTTIWNV7PQYT55RTY6ZVB4","short_pith_number":"pith:KTI2TTTI","canonical_record":{"source":{"id":"2011.04020","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-11-08T16:48:11Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e713bfd12079c54d144e5810aaf3caab9b5b61bd47497ef7c457aaabfaa22dae","abstract_canon_sha256":"0518aabd4e428961eda70a347034a0099c356beae2f38cf64d557dbf9eb33ed4"},"schema_version":"1.0"},"canonical_sha256":"54d1a9ce68b36bf7c313ef633c7b350f0899e46ebcbc55fc28131c971f2deea7","source":{"kind":"arxiv","id":"2011.04020","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KTI2TTTIWNV7PQYT55RTY6ZVB4","target":"record","payload":{"canonical_record":{"source":{"id":"2011.04020","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2020-11-08T16:48:11Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"e713bfd12079c54d144e5810aaf3caab9b5b61bd47497ef7c457aaabfaa22dae","abstract_canon_sha256":"0518aabd4e428961eda70a347034a0099c356beae2f38cf64d557dbf9eb33ed4"},"schema_version":"1.0"},"canonical_sha256":"54d1a9ce68b36bf7c313ef633c7b350f0899e46ebcbc55fc28131c971f2deea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:26.725487Z","signature_b64":"YC86qyJvXrSJWP1FsHdAX1cNx3yd2c9DrEdG7tuUppkkn38S/qdXxeHRBwIsdVmSQ77kQWMXeYFrTY34MA8dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d1a9ce68b36bf7c313ef633c7b350f0899e46ebcbc55fc28131c971f2deea7","last_reissued_at":"2026-07-05T03:11:26.725019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:26.725019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.04020","source_version":2,"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-07-05T03:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bn+trKJGX68Zc7lxWE0x1cUd9kg0zcFI6Ge+zpq658VZ7BIyM+FEBSRVWw/vOIchpp8PGyjcL/8fKVrwBL1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:02:54.051718Z"},"content_sha256":"99cef1e4c18cc80a4bb5d743203cb85c1d127fcdcd300383969fed3d46ce0972","schema_version":"1.0","event_id":"sha256:99cef1e4c18cc80a4bb5d743203cb85c1d127fcdcd300383969fed3d46ce0972"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KTI2TTTIWNV7PQYT55RTY6ZVB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Sparse Linear Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Botao Hao, Mengdi Wang, Tor Lattimore","submitted_at":"2020-11-08T16:48:11Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04020","kind":"arxiv","version":2},"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/2011.04020/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"},"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-07-05T03:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CWtBC5RqTqfOqsJc1Nrkb2//eJvfveZgL6rI1500dJCnDVyZvop9EjQvbzcexwmkXh4cFFo8/KHPGJplDXLiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:02:54.052680Z"},"content_sha256":"f136b1759e6a1e8a2daa1629abc82fa113eafce3398925a0dc484675076efc48","schema_version":"1.0","event_id":"sha256:f136b1759e6a1e8a2daa1629abc82fa113eafce3398925a0dc484675076efc48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/bundle.json","state_url":"https://pith.science/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/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-08-04T17:02:54Z","links":{"resolver":"https://pith.science/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4","bundle":"https://pith.science/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/bundle.json","state":"https://pith.science/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTI2TTTIWNV7PQYT55RTY6ZVB4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHaWcInAh2spC6/5XSRE3L1A3HSoyP9qAMDlHbJHcTV33EhNGDWOUtgA8VPIo5bOquGMf3y//j6eyFXnYO/PCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:02:54.059508Z","bundle_sha256":"dfc353e92d2295710fd04775bc61274f264da79ba74f625429d87be32e9caa84"}}