{"as_of":"2026-08-08T20:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24e120665a0fa9aff08836a048f5fec10873e358aebff1d410cc53e27caa8bf7","coverage":[{"denominator":67,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":67,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T15:42:48.344303Z","state":"measured"},{"denominator":67,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":67,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.20022/citation-record","integrity":"/paper/2606.20022/integrity","json":"/paper/2606.20022/citation-record.json","paper":"/paper/2606.20022"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Improved algorithms for linear stochastic bandits.Advances in neural information processing systems, 24, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:12c76f5010d6859b308e93d2be1153654d276993e16a7a6b2814a68118232b53","observation_id":"5c871f28-7789-46fc-88e5-752831465d67","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1102.2670","last_updated":"2011-02-14T04:06:31Z","snapshot_observed_at":"2026-07-06T02:23:26.911229Z","submitted_at":"2011-02-14T04:06:31Z","title":"Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems","version":1},"cited_work":{"arxiv_id":"1102.2670","doi":null,"metadata_source":"pith","pith_arxiv_id":"1102.2670","snapshot_observed_at":"2026-07-04T08:39:41.739681Z","title":"Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems","venue":"cs.AI","work_id":"5b17a5a1-3e93-484f-99ae-97134a3aa134","year":2011},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/1102.2670","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:7b96b1b3bc5a1d7116b94123fd6af24f0a53c42570cf778bec86f65f4efc66d2","observation_id":"cf06a4fa-4a43-4202-8181-31617404dc43","resolution":{"observed_at":"2026-07-04T05:39:40.438117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Associative reinforcement learning using linear probabilistic concepts","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:978691668024143f5e5a9de4badc39327cf2a57f5829a0fe56da35608a778093","observation_id":"e20b5274-f422-4fe3-85dc-e65dc2a2424d","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Robust adaptive mpc for constrained uncertain nonlinear systems.International Journal of Adaptive Control and Signal Processing, 25(2):155–167, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:7df66ff6fe06544cd3331c936c3f0a51f1a0a9a9c0789c16c83ed51cb4bca747","observation_id":"1a1bf47f-d21e-43ae-ae55-c9ec58210934","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Thompson sampling for contextual bandits with linear payoffs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:a520acee8d6d748b1da7a722bae8c17f9f54bc7de33a8e3f1df96228fde08ea4","observation_id":"3f04a2c9-3ef5-41eb-ae48-e8a2ec309d02","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"The size of the membership-set in a probabilistic framework.Automatica, 40 (2):253–260, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:ab9062dd9ee335a307b1de5a5cccac84694a6b595535644fa81a828c991bc065","observation_id":"2358db3e-49cc-43bd-acf6-cfcad02ef86d","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Convergence analysis of central and minimax algorithms in scalar regressor models.Mathematics of Control, Signals and Systems, 18(1):66–99, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:f1911ebd0be543c669838f9527c6d0bea0681316a0f72a235bc5d1bd033520bb","observation_id":"ef3a028d-cfeb-45a9-9788-a083186be91d","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Using confidence bounds for exploitation-exploration trade-offs.Journal of machine learning research, 3(Nov):397–422, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:9b00938f31f6bdd75da41ee1133cbf4177f4e04e346c34438a17ea8d7f74b2aa","observation_id":"9b13d1b2-0775-455a-9308-5d4957eb0b80","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Convergence of optimal sequential outer bounding sets in bounded error parameter estimation.Mathematics and computers in simulation, 49(6):307–317, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:387592a649dcfa826812ba46373bcec189831b04f53bed8bfc11ea34d0fb0b46","observation_id":"b5a4549e-d573-40df-984b-87b2a4e9954e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:1ee1664be3b82a6dc65754550a420a47063ad83b39c5e310086e23a24927132a","observation_id":"8ef63618-2e30-41cc-a622-19fc1d8f0570","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Convergence properties of the membership set.Automatica, 34(10):1245–1249, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:c3531c8e84c58e1644765609c28af3e71b45064ed8b08e5fa00bfbb9af740e8f","observation_id":"feeb8c90-35d8-47f8-a403-c806f6b16ce4","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:1d8dc145369dcb44b1293ecd80cca47f68b42ee0e263da6aea18052bd8d2ff53","observation_id":"68645e28-99ef-460b-87e7-1298d60ab8c3","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Active learning for stochastic contextual linear bandits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:381b0a31f7efcb3e66b4be75ee39185bed41ada8afa72d63ea619fef4ff26792","observation_id":"301f173d-f7f5-412a-bd33-5a71ab8d31c2","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:78befc085370ab241a8aeafda7821ad05bad44fd4898eec06f96d90e47e0abca","observation_id":"677e2841-7b49-4b47-b830-49b8e05e8b57","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Thompson sampling for high- dimensional sparse linear contextual bandits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:15ace7329f3a4b2e3e405db5c000a420f112a34e7acf05f60993d3c8b4f84cbe","observation_id":"7438bd79-5ef2-4de2-8791-1ab8ab43e3f0","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Contextual restless multi-armed bandits with application to demand response decision-making","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e58ebf1b9f1052cda0510b7efecfafd53abc077d3655230cc6f468457b796557","observation_id":"ad558dce-630b-4127-8743-253c4d0c5ed5","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Online residential demand response via contextual multi- armed bandits.IEEE Control Systems Letters, 5(2):433–438, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:009462a4a56cc3aec05d68d33db22deeeb2acf7969c4c62f3d2720d0b741d4e2","observation_id":"e289e930-b636-4eea-875d-9936617d9edd","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.05567","last_updated":"2022-02-11T11:53:22Z","snapshot_observed_at":"2026-08-08T14:21:57.634949Z","submitted_at":"2022-02-11T11:53:22Z","title":"Shuffle Private Linear Contextual Bandits","version":1},"cited_work":{"arxiv_id":"2202.05567","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.05567","snapshot_observed_at":"2026-07-04T05:39:40.439473Z","title":"arXiv preprint arXiv:2202.05567 , year=","venue":null,"work_id":"bab33d60-1c52-4514-99a6-f39fbe134fd4","year":2022},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/2202.05567","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e84a7a263af8927a4ae016c05828609a33c027a295a9e4bc2644df1e2e80b3b5","observation_id":"d3e0de97-9e6e-47bf-8ece-f813432a88c7","resolution":{"observed_at":"2026-07-04T05:39:40.441210Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Contextual bandits with linear payoff functions","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e26c69df08589ea8c268afe74fbb2e3a6f3fafaf9785cc755d95c4dcb3196aef","observation_id":"c3c5b483-5b46-4f29-a3d3-f10a172a32e7","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Balanced linear contextual bandits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:2c5212c00579817d194ebfaa16f2927172b012f473ed099a888327eb0dae8546","observation_id":"964485a0-8ba7-4230-923a-7e899e4cee7b","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"On the value of information in system identification—bounded noise case.Automatica, 18(2):229–238, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:6eb452bfca90e6390092a34cecf37888ed8996b034e4538006b1031782036413","observation_id":"6f4684f7-9e2d-4958-a7da-91635d7f9c8c","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Beyond ucb: Optimal and efficient contextual bandits with regression oracles","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:37c7abe9e32a8257f411af415ad4fc14ddc14b387c4b3c76264e3a61b5fa78fc","observation_id":"4999a6a2-c99a-468f-9d1e-a526aabf74b9","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00454-011-9354-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Discrete & Computational Geometry","work_id":"c369325b-65af-4921-be50-3fd3a7b4f2ac","year":2011},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:11fb449ed364586fbcb709ac3105eb29f74dc3d2edcac3a9265b648baaf4f5cc","observation_id":"11744ad9-2d30-4af7-8230-a1e3998139a2","resolution":{"observed_at":"2026-06-26T15:49:34.174850Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Robust and adaptive model predictive control of nonlinear systems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:098d976adfe2868b7b5d587ea3a5244a8db93185343cae663a0f5b6731fc16c0","observation_id":"6ebf9c48-fb03-4e35-88cf-bbd5befb4f92","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0709.0707","last_updated":"2007-09-05T16:50:16Z","snapshot_observed_at":"2026-08-05T02:48:57.618632Z","submitted_at":"2007-09-05T16:50:16Z","title":"The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases","version":1},"cited_work":{"arxiv_id":"0709.0707","doi":null,"metadata_source":"pith","pith_arxiv_id":"0709.0707","snapshot_observed_at":"2026-07-04T05:39:40.442397Z","title":"The extremal volume ellipsoids of convex bodies, their symmetry properties, and their determination in some special cases","venue":"math.MG","work_id":"5fbf483b-95ce-4c6f-834b-7d1587c5ab45","year":2007},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/0709.0707","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:c6f4812b763a3bb18d99a5edd0ee485e7592d0b19bc33e36470ba43d54a645d7","observation_id":"e858b8f7-57b0-430f-8fec-f9a4a3dd0575","resolution":{"observed_at":"2026-07-04T05:39:40.443780Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.07802","last_updated":"2019-05-28T03:44:15Z","snapshot_observed_at":"2026-08-07T07:03:44.340171Z","submitted_at":"2019-02-20T22:35:24Z","title":"AdaLinUCB: Opportunistic Learning for Contextual Bandits","version":2},"cited_work":{"arxiv_id":"1902.07802","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.07802","snapshot_observed_at":"2026-07-04T05:39:40.445380Z","title":"AdaLinUCB: Opportunistic Learning for Contextual Bandits","venue":"cs.LG","work_id":"259327dc-5040-4af0-835a-06cd3d25fa7b","year":2019},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/1902.07802","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:58155226a0b7b1cc29695c635db7b0cb290739d335e84656eab490e57c6b2659","observation_id":"f78547be-36f8-461d-a9d5-31d6b4432436","resolution":{"observed_at":"2026-07-04T05:39:40.446704Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Contexts can be cheap: Solving stochastic contextual bandits with linear bandit algorithms","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:bb06d8188455f31e3ffe804627770a512519f42428866f33464bb0760221db9e","observation_id":"87f181ef-2619-48bf-a97a-32eb31039199","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Nearly optimal algorithms for linear contextual bandits with adversarial corruptions.Advances in neural information processing systems, 35:34614–34625, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:24549df5cda14c8565c5daa49f3a621d495d65c82603f38f9714abdb10b7374d","observation_id":"8d18ad30-d1e1-4da7-85f6-12665578b52d","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Random design analysis of ridge regression","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:09513dd66c751def132606273f475b4d079e6c2e5670bc5bd00476c0fc776f7e","observation_id":"f812dbf6-99e3-4f29-abb1-f92fc9ab0155","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Extremum problems with inequalities as subsidiary conditions","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:9800668f992a261860643eae8b2d431b6fd55fd1108dffef247e8352165145b1","observation_id":"6dc36915-0c81-4942-8ad5-95bf0f283c7c","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"A smoothed analysis of the greedy algorithm for the linear contextual bandit problem.Advances in neural information processing systems, 31, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:ff9a5824e479b9a3b0f853a7d3b22fe6026f91409bc7f045fdb32e7d7e2e54ac","observation_id":"388270ac-6c09-4989-acd7-c285788c9c45","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Conservative contextual linear bandits.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:767fde66f3bab670b7d06a7b5589c2c58582a22b116cf061fd8c9c6459419fa1","observation_id":"c7a064c0-719e-43b5-9efb-105a847c4f39","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Contextual linear bandits under noisy features: Towards bayesian oracles","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:830b0136145eb2985c61608ec56ddcb706d94d3de66cafbed8acc5c2b4871715","observation_id":"22d8ba7f-7ee7-46cf-8bae-a1388ca04c4a","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Doubly robust thompson sampling with linear payoffs.Advances in neural information processing systems, 34:15830–15840, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e888463cd52e7280c4dcd5938b9fa91cae2971e36c391ce090bb3c079149c73e","observation_id":"f3054506-6c1c-4442-84c9-bef94eb13ad1","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Efficient linear bandits through matrix sketching","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:62fee6de89134850829608472859ee09ab6127c5b92bbb0c7b198bf7f3587ec8","observation_id":"e2ca5c05-0c22-4d50-a92c-8e2b911c86ed","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Least squares estimates in stochastic regression models with applications to identification and control of dynamic systems.The Annals of Statistics, pages 154–166, 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:896f1481c2d79e22098e1e9c534c2c1bb9329d8ef363dc9f045c0a28f722b247","observation_id":"cc7ccfd1-6e2b-4612-984a-46c8b8017e3d","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.09090","last_updated":"2022-04-22T20:31:59Z","snapshot_observed_at":"2026-07-06T05:48:46.196902Z","submitted_at":"2017-06-28T00:56:22Z","title":"An Actor-Critic Contextual Bandit Algorithm for Personalized Mobile Health Interventions","version":2},"cited_work":{"arxiv_id":"1706.09090","doi":"10.48550/arxiv.1706.09090","metadata_source":"arxiv_reference","pith_arxiv_id":"1706.09090","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:1706.09090 (2017)","venue":"arXiv (Cornell University)","work_id":"38c574c9-3bb8-42db-9537-9f357c291ae2","year":2017},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"cited_paper":"/paper/1706.09090","citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:31fc5c1dfeb719c5c18f01e7f6cf5fb789d72d12bc2d5aa6832d22289b5ac022","observation_id":"6e769d18-7f38-4260-8995-1473fdb72f02","resolution":{"observed_at":"2026-07-04T05:39:40.449611Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"A contextual-bandit approach to personalized news article recommendation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:97614739899a083bb9dffdc52aee6cfc38f3c3dee1cdaec28761218e8aae8d49","observation_id":"46588f8f-6f68-472e-ac65-ee77386060cc","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Nearly minimax-optimal regret for linearly parame- terized bandits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:dca18bee2189625a35de4c54088c10a52a4c792d0279d8fef13513f40d918345","observation_id":"519e2c4a-01db-4748-863b-c3d168bafb8e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Tight regret bounds for infinite-armed linear contextual bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:38f04c73dfe33fba8b9976f13254352281d083b15a68f9615fe174128403eaef","observation_id":"0cffc272-1ac6-48a3-b241-d9abfba2be7e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Learning the uncertainty sets of linear control systems via set membership: A non-asymptotic analysis","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:b57c13d44c90240f313321586a5fab61c5fa3947f5cd64fd542ce2cb9d244696","observation_id":"d6685549-2700-42c3-8e18-23771acce32e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Bypassing the simulator: Near-optimal ad- versarial linear contextual bandits.Advances in Neural Information Processing Systems, 36: 52086–52131, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:765d2aceee6a08163a8d2e00acf6fb1d48b156a4bf0628b7edecf2aebc2772b9","observation_id":"20c6c691-e37c-4041-9de2-cd04f3e5faa1","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Asymptotic properties of set membership identifi- cation algorithms.Systems & control letters, 27(3):145–155, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:b5a0581eab0e3eabd2c89013607f77df17fc594c6a9575381615ede2e4ba5202","observation_id":"64d992e6-78aa-438e-8e85-dda65c4d6b09","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Robust mpc with recursive model update.Automatica, 103:461–471, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:7ce6fe0eed874a3c52b8e876a415f835ded714b0e7f3bb2c06d1d17c1e5ba952","observation_id":"e7530efd-5776-4cc5-a4cf-f30070df1c5e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Robust adaptive model predictive control: Performance and parameter estimation.International Journal of Robust and Nonlinear Control, 31(18):8703–8724, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:1898223d5df842ef81df3df9736bc3e10499c4a07e95b8ab20a20d5f74df6927","observation_id":"902c725d-b57d-4d97-a22b-bdc97976494f","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Optimistic bayesian sampling in contextual-bandit problems.Journal of Machine Learning Research, 13(6), 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:e86ccdbb092909f2894926cc666a37c647a6cfe9f7e41e31a23c096b69ff0833","observation_id":"023b732e-f5e5-42a3-a5c1-eedeb0767658","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Optimal estimation theory for dynamic systems with set membership uncertainty: An overview.Automatica, 27(6):997–1009, 1991","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:f6f76ddaf87ec4c49c4d59219760d028b8cd632c2012c283e8101ec454f9faf5","observation_id":"d949158a-f532-4f32-b0f5-1e9c54c4be4a","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Identification of analytic nonlinear dynamical systems with non-asymptotic guarantees.Advances in Neural Information Processing Systems, 37:85500–85522, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:a7c5c3296b8bbe2722a88d22638b815fe3e88529cf3fd951bc4163b997ded30a","observation_id":"56882240-9c60-405e-b2db-8388231310c1","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Efficient and robust algorithms for adversarial linear contextual bandits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:dd35aaba6f8620c95e9ba679e40540f62a96d8df9f5aa1a5eb60ffb15399cf45","observation_id":"d3b48bf5-e2e2-4bbb-87ec-abccd92b3e25","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Leveraging good representations in linear contextual bandits","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:50c1f42ac7039a1df97b37b4436012505d190bdeacf4712ec7852c1d93eea660","observation_id":"a59b8272-d2cb-4b72-bafc-d158475efd54","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Contextual bandits and imitation learning with preference-based active queries.Advances in Neural Information Processing Systems, 36:11261–11295, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:70b4da5cc8c98b30e00594c4a7348248491aed819a33f6fbeb7e77bdb2b453d0","observation_id":"47a2ea25-e4ba-4076-89e4-ae4735a4bbaf","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Learning without mixing: Towards a sharp analysis of linear system identification","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:af2b02dbbb94928ebf09e8cca23a855a96e685312df6239a719e82e2f6018ca4","observation_id":"d935f555-2876-49e4-a03b-0ecfc35aef90","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Ensemble contextual bandits for personalized recommendation","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:58a63c95bd052b6eba2ff5a6db01c55945333bf51d7602cabded016dfa296a54","observation_id":"3c8edfe2-3f14-48b0-bbf8-05da6748a50e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Stochastic linear contextual bandits with diverse contexts","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:48b276da0f14d9615247270aba3e9e4fc57d5b97b82ce498f0f722be786ed39a","observation_id":"9a67a18f-4415-4a98-bc58-648384a0c672","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"On the sample complexity of set membership estimation for linear systems with disturbances bounded by convex sets","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:7f5b510e9893bcf50cbc06c50aba46c9794f190c568f4849f4107969b25d3d35","observation_id":"fde446f1-8ad6-45e3-ab84-2e72e57ac582","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Noise-adaptive thompson sampling for linear contex- tual bandits.Advances in Neural Information Processing Systems, 36:23630–23657, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:d8d3866bc3b36dd8106b468e31b1025d5359799e96e5ed146fd9862b2140beb1","observation_id":"9c8965c2-eb64-420f-afc8-a4513d00b62a","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Dynamic clustering based contextual combinatorial multi-armed bandit for online recommendation.Knowledge- Based Systems, 257:109927, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:4234be060e1843cd0dc9c0897ed238335c1efd5d72591291e2879638c9cf947a","observation_id":"b52afb4a-382e-435f-a402-025065a971b4","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Online adversarial stabilization of unknown net- worked systems.Proceedings of the ACM on Measurement and Analysis of Computing Systems, 7(1):1–43, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:464bedd4c070e5f5560ac0b78bf0e6760e3b676a21498ac689a2b336c68cc8fa","observation_id":"03e5d674-acb3-4fe0-8dc9-b9d0183305db","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"System identification under bounded noise: Optimal rates beyond least squares.IEEE Control Systems Letters, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:5a85d8bb2b4b96070b1b420fdedc2185a643898bdd4aeb73dbc24ba9aa3abc47","observation_id":"e0497ebd-093b-4ae3-97fe-76694de21583","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Trajectory tracking control of autonomous ground vehicles using adaptive learning mpc.IEEE Transactions on Neural Networks and Learning Systems, 32(12):5554–5564, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:027e92aa65644649bcf30e5c6410fbc9651e207f811a04adb778536112bb3b52","observation_id":"b2fe9684-a338-4937-bcbf-80fd8f5b5014","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Feel-good thompson sampling for contextual bandits and reinforcement learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:cf915f328a31de1f3f1cfd2441ed931fc53983d4c4895c9fdbdb7e12115f03c6","observation_id":"5987564d-942b-4844-bbfd-866f232e5479","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Spoiled for choice? personalized recommendation for healthcare decisions: A multiarmed bandit approach.Information Systems Research, 34(4):1493–1512, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:678c9ab02f1ce528d248ee8d480e70ac6ec748aaffb461c16cd6fabb8ca3d3df","observation_id":"a751b711-0970-4855-b9b3-983da9db1f07","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Thex t-weighted projection width ofE t−1 onto the vectorx t is Wt := 2 q x⊤ t Bt−1xt","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:a9d20d3dc68c44437f18f84f7e0a25e7c20491d37995d9fad66cdc74b5000184","observation_id":"415277b7-b9f8-4f9c-8c73-e117e0e691fb","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Proof of Corollary 3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:075044c41be48c9fbcfb7337fa541fce3b06cefcf2b25cba2314344e09e358d0","observation_id":"fc192350-1ee8-4a07-b65a-0efe0434a43e","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"Meanwhile, K µ 0 = [−2S,2S] d +µB d 2 ⊆B(0,2S √ d+µ)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:7154df4d528d154fafe61f10719eb0c390bca17db297606194a7b18d145c5c17","observation_id":"8f4eecce-34bb-442b-8749-4ebc2e847973","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"It follows that Φ0 −Φ T ≤dlog 2S √ d+µ µ !","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:f9af261404d4f18b70808b9c3ad97d913c434605572b3f16d2c98432dc710d43","observation_id":"cfe5f8e9-20f5-4c8d-92b6-17bd57bfabaf","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T15:42:48.344303Z","title":"E Numerical Settings Problem Settings.We utilize the experiment in [ 26] for our synthetic simulation settings","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-26T15:42:48.344303Z"},"links":{"citing_paper":"/paper/2606.20022"},"observation_digest":"sha256:0e666778445a1de6c8f1af306bdb0da5e04125e4ff717ffaba5e63160d54ac12","observation_id":"15969e57-c510-45d8-9179-c97d784da461","resolution":{"observed_at":"2026-06-26T15:42:48.344303Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.20022","last_updated":"2026-06-18T09:54:23Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-03T13:48:36.031100Z","submitted_at":"2026-06-18T09:54:23Z","title":"Stochastic Linear Contextual Bandits with Bounded Noise: A Set-Membership Approach"},"reference_resolution":{"displayed":67,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":61,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":67},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 67 of 67 outbound references and 0 inbound Pith citation observations for arXiv:2606.20022."}