{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WANXJP3B7N6CNN4TZTLNXP4HNE","short_pith_number":"pith:WANXJP3B","canonical_record":{"source":{"id":"2502.17175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-24T14:12:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a284392b75434aea42e61a4caaffe8f15081c98f4b8b9951b63d22618b4e9ee","abstract_canon_sha256":"3cb879d7a9ce9ddd92ee55ce2570563c518d70a41ade37b09a8732d392bb3745"},"schema_version":"1.0"},"canonical_sha256":"b01b74bf61fb7c26b793ccd6dbbf8769084e7f2c6714d54b202116fcbf59cb2c","source":{"kind":"arxiv","id":"2502.17175","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17175","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17175v1","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17175","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"WANXJP3B7N6C","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_16","alias_value":"WANXJP3B7N6CNN4T","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_8","alias_value":"WANXJP3B","created_at":"2026-07-05T10:19:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WANXJP3B7N6CNN4TZTLNXP4HNE","target":"record","payload":{"canonical_record":{"source":{"id":"2502.17175","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-24T14:12:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0a284392b75434aea42e61a4caaffe8f15081c98f4b8b9951b63d22618b4e9ee","abstract_canon_sha256":"3cb879d7a9ce9ddd92ee55ce2570563c518d70a41ade37b09a8732d392bb3745"},"schema_version":"1.0"},"canonical_sha256":"b01b74bf61fb7c26b793ccd6dbbf8769084e7f2c6714d54b202116fcbf59cb2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:06.909473Z","signature_b64":"FWftp1tsjU1eDXOi2jX4VME5ndkzL+ZE0Xc+bEHqTdoLhvnV+b7LNqrvNLXS81MLtQpjzevNhqmmpNgEqNIZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b01b74bf61fb7c26b793ccd6dbbf8769084e7f2c6714d54b202116fcbf59cb2c","last_reissued_at":"2026-07-05T10:19:06.908987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:06.908987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.17175","source_version":1,"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-05T10:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYO0kdo742FgLJYASkAOdVBpYRzcUuYGHp1UZee/lD8jvYSc1+1yaGDm6aTexXHtS83w68Am6Ia3qML8n6DrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:15:19.621786Z"},"content_sha256":"83fbd4258c37a35f1cdce5f2ddbf9147ed83b84ae427e3548321c506fff51aee","schema_version":"1.0","event_id":"sha256:83fbd4258c37a35f1cdce5f2ddbf9147ed83b84ae427e3548321c506fff51aee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WANXJP3B7N6CNN4TZTLNXP4HNE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Bandits on Ellipsoids: Minimax Optimal Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hedi Hadiji, Raymond Zhang, Richard Combes","submitted_at":"2025-02-24T14:12:31Z","abstract_excerpt":"We consider linear stochastic bandits where the set of actions is an ellipsoid. We provide the first known minimax optimal algorithm for this problem. We first derive a novel information-theoretic lower bound on the regret of any algorithm, which must be at least $\\Omega(\\min(d \\sigma \\sqrt{T} + d \\|\\theta\\|_{A}, \\|\\theta\\|_{A} T))$ where $d$ is the dimension, $T$ the time horizon, $\\sigma^2$ the noise variance, $A$ a matrix defining the set of actions and $\\theta$ the vector of unknown parameters. We then provide an algorithm whose regret matches this bound to a multiplicative universal const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17175","kind":"arxiv","version":1},"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/2502.17175/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-05T10:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CePAu2zZWQEvGI+AZsPnpfWXlOmfIdTwA59ovYVufmRHCRPKUCdfAof6i3Qw3Q04WnlWndLozL4johhBaWJJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:15:19.622166Z"},"content_sha256":"d1f2d21283833957e7df12d6c1121ba6a9e29e91b661236f2a13d479afca9330","schema_version":"1.0","event_id":"sha256:d1f2d21283833957e7df12d6c1121ba6a9e29e91b661236f2a13d479afca9330"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/bundle.json","state_url":"https://pith.science/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/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-07-07T04:15:19Z","links":{"resolver":"https://pith.science/pith/WANXJP3B7N6CNN4TZTLNXP4HNE","bundle":"https://pith.science/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/bundle.json","state":"https://pith.science/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WANXJP3B7N6CNN4TZTLNXP4HNE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WANXJP3B7N6CNN4TZTLNXP4HNE","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":"3cb879d7a9ce9ddd92ee55ce2570563c518d70a41ade37b09a8732d392bb3745","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-24T14:12:31Z","title_canon_sha256":"0a284392b75434aea42e61a4caaffe8f15081c98f4b8b9951b63d22618b4e9ee"},"schema_version":"1.0","source":{"id":"2502.17175","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17175","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17175v1","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17175","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"WANXJP3B7N6C","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_16","alias_value":"WANXJP3B7N6CNN4T","created_at":"2026-07-05T10:19:06Z"},{"alias_kind":"pith_short_8","alias_value":"WANXJP3B","created_at":"2026-07-05T10:19:06Z"}],"graph_snapshots":[{"event_id":"sha256:d1f2d21283833957e7df12d6c1121ba6a9e29e91b661236f2a13d479afca9330","target":"graph","created_at":"2026-07-05T10:19:06Z","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/2502.17175/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider linear stochastic bandits where the set of actions is an ellipsoid. We provide the first known minimax optimal algorithm for this problem. We first derive a novel information-theoretic lower bound on the regret of any algorithm, which must be at least $\\Omega(\\min(d \\sigma \\sqrt{T} + d \\|\\theta\\|_{A}, \\|\\theta\\|_{A} T))$ where $d$ is the dimension, $T$ the time horizon, $\\sigma^2$ the noise variance, $A$ a matrix defining the set of actions and $\\theta$ the vector of unknown parameters. We then provide an algorithm whose regret matches this bound to a multiplicative universal const","authors_text":"Hedi Hadiji, Raymond Zhang, Richard Combes","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-24T14:12:31Z","title":"Linear Bandits on Ellipsoids: Minimax Optimal Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17175","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:83fbd4258c37a35f1cdce5f2ddbf9147ed83b84ae427e3548321c506fff51aee","target":"record","created_at":"2026-07-05T10:19:06Z","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":"3cb879d7a9ce9ddd92ee55ce2570563c518d70a41ade37b09a8732d392bb3745","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-24T14:12:31Z","title_canon_sha256":"0a284392b75434aea42e61a4caaffe8f15081c98f4b8b9951b63d22618b4e9ee"},"schema_version":"1.0","source":{"id":"2502.17175","kind":"arxiv","version":1}},"canonical_sha256":"b01b74bf61fb7c26b793ccd6dbbf8769084e7f2c6714d54b202116fcbf59cb2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b01b74bf61fb7c26b793ccd6dbbf8769084e7f2c6714d54b202116fcbf59cb2c","first_computed_at":"2026-07-05T10:19:06.908987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:06.908987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FWftp1tsjU1eDXOi2jX4VME5ndkzL+ZE0Xc+bEHqTdoLhvnV+b7LNqrvNLXS81MLtQpjzevNhqmmpNgEqNIZDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:06.909473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.17175","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83fbd4258c37a35f1cdce5f2ddbf9147ed83b84ae427e3548321c506fff51aee","sha256:d1f2d21283833957e7df12d6c1121ba6a9e29e91b661236f2a13d479afca9330"],"state_sha256":"692cadb700fe8ca3d90393f6712852677c6efa98da0437c2f674c29e2bb58df8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcqfqw95qyY/wkYrwl5AUURNWmK+iiJ3OroBXYTiInRm9r2RWZRot6G8l4LClU4MXvP434cmmWlfzCdpYp+ZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:15:19.624213Z","bundle_sha256":"6d440bab0e237dfb512b2c7322646ddade5b1564637f7093f69b19ae470f4e89"}}