{"as_of":"2026-08-15T01:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58cab60b034e4952f6a13bcb38be8fed0eb70ecaede1ca35c4d5d3ca89236ba3","coverage":[{"denominator":151,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T23:49:45.560687Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2412.02251/citation-record","integrity":"/paper/2412.02251/integrity","json":"/paper/2412.02251/citation-record.json","paper":"/paper/2412.02251"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:45.105954Z","title":"Reinforcement Learning: An Introduction, 2012.; MIT Press: Cambridge, USA","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.105954Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1a8ad8882dced81383380032bd919da255a52949b93fb0e251fdd3bc5017b692","observation_id":"81e2ae6b-a340-45fe-bd5f-dda852e2d05f","resolution":{"observed_at":"2026-08-11T23:49:45.105954Z","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-08-11T23:49:45.111138Z","title":"Statistical Reinforcement Learning: Modern Machine Learning Approaches; Chapman and Hall/CRC: New York, NY, USA, 2015; pp","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.111138Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:4d9b29e524492e16e6a52eacc9a91e58dfd657d52cad90c160bbf990c5db1046","observation_id":"0763cc2e-29ea-40cd-8042-21971c31b88c","resolution":{"observed_at":"2026-08-11T23:49:45.111138Z","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-08-11T23:49:45.115995Z","title":"Autonomous Driving: Technical, Legal and Social Aspects; Springer: Berlin, Germany, 2016; pp","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.115995Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b0b4ac65058c3656f5fd2ff94441a963d7eaf399430db7bcd8026f111cc29007","observation_id":"c8b36f9e-0c64-496a-bf41-120b816fb448","resolution":{"observed_at":"2026-08-11T23:49:45.115995Z","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-08-11T23:49:45.120851Z","title":"Large-scale bandit approaches for recommender systems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.120851Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8f435ee8ee8760f270baaade9bc5758a15aec0fc3580438e365b0b426b2f0a17","observation_id":"146ee90a-bc47-4d69-bc04-b3ae1635a1ce","resolution":{"observed_at":"2026-08-11T23:49:45.120851Z","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-08-11T23:49:45.125727Z","title":"Unmanned aerial vehicles in agriculture: A survey","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.125727Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:786830db6b3518aa42cc5ba3001eea63449a3673c425959c8f38934722347103","observation_id":"7a4c438f-769b-4f2e-8f18-eb191b9f41bf","resolution":{"observed_at":"2026-08-11T23:49:45.125727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-13T15:58:13.809876Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-11T23:49:45.130683Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.130683Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:d3b633c8e922de1290f4068ad1898039d3afb7cd85253172631a045aef7fccdc","observation_id":"2910521b-025d-4383-8cf3-d60929beb4e3","resolution":{"observed_at":"2026-08-11T23:49:45.130683Z","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-08-11T23:49:45.136157Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.136157Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:762c5ba618a98939e702f16b5c47b37353d532479bdf1b5d124612ab3c389274","observation_id":"6ed0ff82-ab3c-4f2f-9106-69e7603efe2c","resolution":{"observed_at":"2026-08-11T23:49:45.136157Z","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-08-11T23:49:45.140768Z","title":"Portfolio choices with orthogonal bandit learning","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.140768Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:3ac810a4512f00cd4cdec3b4b6eb4cff12cfdbe7d4c07ff6373d4f4bc21bdd1f","observation_id":"6177706e-6555-40da-a457-b52081b7a2cb","resolution":{"observed_at":"2026-08-11T23:49:45.140768Z","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-08-11T23:49:45.145344Z","title":"Causal Inference: A Statistical Learning Approach","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.145344Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:cf194a41ceadb4f323f9e363e106e364cb9131667ed2615fda3016efbfcc7840","observation_id":"2a6824a6-b70f-4e8a-9df5-392257e3461d","resolution":{"observed_at":"2026-08-11T23:49:45.145344Z","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":"2019.88428","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:46.316956Z","title":"Enhancing digital twins through reinforcement learning","venue":null,"work_id":"c417e718-67ae-42ca-937f-50988b9eb9fd","year":2019},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.150177Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:7590510f276b30fcce6f670855dd0a42b8b8a8f68531cf7b21ed55bd65c9606c","observation_id":"b68d1733-7928-4208-8f0e-1a8e3fa4a969","resolution":{"observed_at":"2026-08-11T23:49:46.325636Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T23:49:45.154994Z","title":"A digital twin to train deep reinforcement learning agent for smart manufacturing plants: Environment, interfaces and intelligence","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.154994Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:f7b928763b89a9a85352438b3aeebfc68de27c25dd765de5e0886ab8832aa983","observation_id":"46f5a32c-e922-4b55-a0d8-164ee9b9092a","resolution":{"observed_at":"2026-08-11T23:49:45.154994Z","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-08-11T23:49:45.159564Z","title":"Contextual bandits for adapting treatment in a mouse model of de novo carcinogenesis","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.159564Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1c8f867ddaba434ea0ec76cd58975d9b255eb5c07de79bc13e6069cba5a6383c","observation_id":"8ef55838-1cb8-45ea-bda9-cf20b193c793","resolution":{"observed_at":"2026-08-11T23:49:45.159564Z","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-08-11T23:49:45.163948Z","title":"Bandit algorithms for precision medicine","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.163948Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:d63df155c19dea0ab33cb814344df5012066885324e6e44cd1d1641e44c1a77d","observation_id":"f7334007-da33-43ba-acac-85043d93a927","resolution":{"observed_at":"2026-08-11T23:49:45.163948Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10040","last_updated":"2019-04-02T14:17:40Z","snapshot_observed_at":"2026-08-14T16:52:57.977160Z","submitted_at":"2019-04-02T14:17:40Z","title":"A Survey on Practical Applications of Multi-Armed and Contextual Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10040","snapshot_observed_at":"2026-08-11T23:49:45.168307Z","title":"A survey on practical applications of multi-armed and contextual bandits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.168307Z"},"links":{"cited_paper":"/paper/1904.10040","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:fe21a05dcbab451ae1a4893f53ed30f929afb910b7b8b744f1503dfe1a29d441","observation_id":"1493f2cb-e410-4ccb-a2f6-d009240318db","resolution":{"observed_at":"2026-08-11T23:49:45.168307Z","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-08-11T23:49:45.173294Z","title":"Introduction to Multi-Armed Bandits","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.173294Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:60aff17de9fb0e277aa9ace690eda5e926f5587dd339e81fe37a16e657ac3938","observation_id":"c2e159da-547d-484f-a105-e75b78f2cf9f","resolution":{"observed_at":"2026-08-11T23:49:45.173294Z","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-08-11T23:49:45.178067Z","title":"Survey of multiarmed bandit algorithms applied to recommendation systems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.178067Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:33020e6128289188471f5a618887823c8b8c15e3a3032bd3d3fff1fe0e0bf809","observation_id":"b663a39f-af77-47c5-b9fc-d45e7e50f14e","resolution":{"observed_at":"2026-08-11T23:49:45.178067Z","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-08-11T23:49:45.182703Z","title":"A map of bandits for e-commerce","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.182703Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:70cbb1c23f0c39428029f936dccad0bfbc16ab47a8b62e73ad392fc8b5ad32da","observation_id":"8ba06eed-5259-4ea6-b6f7-c7b32d6e0444","resolution":{"observed_at":"2026-08-11T23:49:45.182703Z","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-08-11T23:49:45.187182Z","title":"Bandit algorithms: A comprehensive review and their dynamic selection from a portfolio for multicriteria top-k recommendation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.187182Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a5fca5e6b28a045917fe15569e263bdce93951379171af05136dfe3b24ebe986","observation_id":"4ff4db26-42cd-4450-b635-4530023264ef","resolution":{"observed_at":"2026-08-11T23:49:45.187182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1510.00757","last_updated":"2015-11-03T18:37:43Z","snapshot_observed_at":"2026-08-14T22:29:44.120623Z","submitted_at":"2015-10-02T23:28:11Z","title":"A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1510.00757","snapshot_observed_at":"2026-08-11T23:49:45.191877Z","title":"A survey of online experiment design with the stochastic multi-armed bandit","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.191877Z"},"links":{"cited_paper":"/paper/1510.00757","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:e49bacc899d19cadb29fff358df2a99b157fa038c4e1a57f44142619e7ed01f4","observation_id":"d1e498d6-2f4d-44a2-b26e-f308672166a0","resolution":{"observed_at":"2026-08-11T23:49:45.191877Z","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-08-11T23:49:45.196567Z","title":"A survey on Multi-Armed, Contextual and Causal bandit algorithms for online learning Preprint","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.196567Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:5fbb08afe5a03aff8235a7f4cb5c907e5059f04f614b8b15effcfe033dc4a84e","observation_id":"9e18d052-e029-4971-9d8e-83904ef4a5cd","resolution":{"observed_at":"2026-08-11T23:49:45.196567Z","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-08-11T23:49:45.201065Z","title":"Bandit Algorithms; Cambridge University Press: Cambridge, UK, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.201065Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:27c00290fcf0ecb96395fd0c2e34373d24b9f0f7585388c3b88a9de5743fc5f3","observation_id":"18d2babb-9127-4835-8491-6691b5f9f468","resolution":{"observed_at":"2026-08-11T23:49:45.201065Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.15595","last_updated":"2025-01-31T20:20:09Z","snapshot_observed_at":"2026-08-13T04:54:22.480679Z","submitted_at":"2023-12-25T03:13:21Z","title":"Zero-Inflated Bandits","version":3},"cited_work":{"arxiv_id":"2312.15595","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.15595","snapshot_observed_at":"2026-08-11T23:49:46.191437Z","title":"Zero-Inflated Bandits","venue":"stat.ML","work_id":"486e004c-5bd0-4ae0-9925-91ce1bacb312","year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.210208Z"},"links":{"cited_paper":"/paper/2312.15595","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:28597a1888c2c62e0a3ac469fd5dd4d2bdac4f7666355099855479bd5b53ad1d","observation_id":"e660a637-79a5-4803-9475-25cae82f4745","resolution":{"observed_at":"2026-08-11T23:49:46.197396Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T23:49:45.215023Z","title":"Sharper sub-weibull concentrations","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.215023Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8ecf8fd44869c5a9651190821ef6d4294e5f92435a5e9b300e350bcf49555ab1","observation_id":"11d767a9-e3ae-4969-bb73-816579296c37","resolution":{"observed_at":"2026-08-11T23:49:45.215023Z","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-08-11T23:49:45.219384Z","title":"Non-asymptotic guarantees for robust statistical learning under infinite variance assumption","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.219384Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:7886326316f3813bc742481e54feeed7bdd4a71f45fa6c15353efa0402b3135a","observation_id":"6f4da297-5c5c-41be-8bdc-3c39d85c0b7f","resolution":{"observed_at":"2026-08-11T23:49:45.219384Z","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-08-11T23:49:45.223746Z","title":"Time-uniform, nonparametric, nonasymptotic confidence sequences","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.223746Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1687704c93b8d948e1afe78d7304ac27d9bdb8d489b120dfebd4e3df67266c17","observation_id":"2a983691-7e96-4bdc-b970-64945597e827","resolution":{"observed_at":"2026-08-11T23:49:45.223746Z","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-08-11T23:49:45.228530Z","title":"Some aspects of the sequential design of experiments","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.228530Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:ea78eb7495a308a15f849b9847d2d34aec1d3e9b44740dd82fb47bd441158d0c","observation_id":"9f90ae80-ca73-4873-8e82-93c49cb2fad1","resolution":{"observed_at":"2026-08-11T23:49:45.228530Z","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-08-11T23:49:45.233103Z","title":"Regret Analysis of Stochastic and Nonstochastic Multi-Armed Bandit Problems","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.233103Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:7443d1863bc031657cf21e12bc39ab1f78664860ef1d86f330b37bc973697041","observation_id":"aadd7250-5557-4d76-8258-1f50df2f8518","resolution":{"observed_at":"2026-08-11T23:49:45.233103Z","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-08-11T23:49:45.237612Z","title":"Asymptotically efficient adaptive allocation rules","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.237612Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:03b76b86d44005afde07f42f58dfd1cb5b85ccab203da0348c4b2da6d4ad1ab2","observation_id":"4e9e63ad-da77-48b9-9f47-84b84dc758ac","resolution":{"observed_at":"2026-08-11T23:49:45.237612Z","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-08-11T23:49:45.241951Z","title":"Nearly dimension-independent sparse linear bandit over small action spaces via best subset selection","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.241951Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1e912e2f42cf55901c2af60866591c58df37afe0952362eaf4226fb7c57cd82d","observation_id":"77ec6fe0-057d-4d24-9ac1-334123927a80","resolution":{"observed_at":"2026-08-11T23:49:45.241951Z","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-08-11T23:49:45.246202Z","title":"High-dimensional sparse linear bandits","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.246202Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a3f37a22e7eafaa80d3e9b097edabd801976b124d8bd2f5677e7e6d44bcb726e","observation_id":"9b5579a0-7ba9-4928-af3f-74da1637b0ca","resolution":{"observed_at":"2026-08-11T23:49:45.246202Z","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-08-11T23:49:45.250476Z","title":"Efficient sparse linear bandits under high dimensional data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.250476Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:896f09c243919869a91d9e1c7a58a29915b85ec0a95271a6c27e3f1e7392c15d","observation_id":"a8de1382-7523-4791-98e3-179518be1a0f","resolution":{"observed_at":"2026-08-11T23:49:45.250476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.13180","last_updated":"2023-11-24T18:31:21Z","snapshot_observed_at":"2026-08-13T05:19:55.167694Z","submitted_at":"2023-11-22T06:06:54Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.13180","snapshot_observed_at":"2026-08-11T23:49:45.254987Z","title":"Provably Efficient High-Dimensional Bandit Learning with Batched Feedbacks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.254987Z"},"links":{"cited_paper":"/paper/2311.13180","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8cf2fd4ad7b1a2323d534a546ff8ea23eb7ce22dfcb8d01d40f2743d7fdd1ac7","observation_id":"aaa3fac3-8f7a-452c-a3a7-10f0d67660de","resolution":{"observed_at":"2026-08-11T23:49:45.254987Z","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":"2303.07287","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:46.148065Z","title":"Tight non-asymptotic inference via sub-Gaussian intrinsic moment norm","venue":null,"work_id":"6b99e044-bb7d-42dc-be6a-9ac66135029d","year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.259751Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a4d70785d85661f29969aa384fb3b06b69514a059ea32df983c8d21eb883f1a2","observation_id":"8e280187-cb73-492b-b5a8-c2c0eabc1aeb","resolution":{"observed_at":"2026-08-11T23:49:46.157537Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-11T23:49:45.264361Z","title":"A perspective on off-policy evaluation in reinforcement learning","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.264361Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:4492213ffaf682515ed5bd19d26be653028fc6389d236d20b2853b609fe0171c","observation_id":"4a42304f-ae47-4d9b-a341-f4503ddea64a","resolution":{"observed_at":"2026-08-11T23:49:45.264361Z","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-08-11T23:49:45.268785Z","title":"The continuum-armed bandit problem","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.268785Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1def7ae2405b6275b411805f4a02f50e194c111640b5bad9d5e63cf4771fbbc8","observation_id":"1279b8b7-cc81-4a4c-99a0-af66e4e35df6","resolution":{"observed_at":"2026-08-11T23:49:45.268785Z","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-08-11T23:49:45.273167Z","title":"Optimal Design of Experiments; SIAM, Philadelphia, USA, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.273167Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8dd5fe16dd0662ade2dcb96e8b9b7afed12232f44eed3d774fad84c1ce7f492c","observation_id":"c25e6dff-b202-4be8-9d19-6b8740d8a597","resolution":{"observed_at":"2026-08-11T23:49:45.273167Z","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-08-11T23:49:45.277612Z","title":"Bayesian Optimization; Cambridge University Press: Cambridge, UK, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.277612Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:0821d1b05441cb3e29d71fb6038cd6699bdfb083518186cb6f63fadd649b3f00","observation_id":"38cec936-1523-47ee-97f3-23a8d2daa0f6","resolution":{"observed_at":"2026-08-11T23:49:45.277612Z","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-08-11T23:49:45.282127Z","title":"Gaussian processes for regression","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.282127Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:abcd08ec6489ec31b0d84a047c5484eb821386dd00587929910f99dd6dacbf37","observation_id":"c8373239-9780-43b6-bb94-00336b46f47e","resolution":{"observed_at":"2026-08-11T23:49:45.282127Z","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-08-11T23:49:45.286491Z","title":"On the mathematical foundations of theoretical statistics","venue":null,"work_id":null,"year":1922},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.286491Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1531a83b8fb135d387e60bdbe8a9abcde03e489f1809d7982701af5054c11ef4","observation_id":"21f3fa6d-e1cd-4880-b0f1-cf2edaa2090a","resolution":{"observed_at":"2026-08-11T23:49:45.286491Z","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-08-11T23:49:45.290888Z","title":"Propriétés locales des fonctions à séries de Fourier aléatoires","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.290888Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:cfd5650bf2965ad4aa087d52fcb575115fbecb177777825f00037a2adcd272c4","observation_id":"007c882e-4e17-42fe-8d68-5f67392086f2","resolution":{"observed_at":"2026-08-11T23:49:45.290888Z","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-08-11T23:49:45.295105Z","title":"Sur un nouveau théoreme-limite de la théorie des probabilités","venue":null,"work_id":null,"year":1938},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.295105Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:c47f1daa1314d2214ec5a61020f93b9085af8046590a7f6d2223fef8a12fef6d","observation_id":"3b7ad123-6581-40b3-a742-c4c918e0620d","resolution":{"observed_at":"2026-08-11T23:49:45.295105Z","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-08-11T23:49:45.299626Z","title":"Probability: A Graduate Course, 2nd ed.; Springer: New York, USA, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.299626Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a403c328505c031cbce404a4ad2a41180f7f5aa07122863521683d1455a6bf6c","observation_id":"b48fb4ad-f0c0-4346-994c-2dc758bcdd99","resolution":{"observed_at":"2026-08-11T23:49:45.299626Z","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-08-11T23:49:45.304051Z","title":"Introduction to High-Dimensional Statistics, 2nd ed.; Chapman and Hall/CRC: Boca Raton, USA, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.304051Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a882a189c871c75799f4ad6bee335bf257ed055089a82e3cfe3f879d3e6d0e59","observation_id":"7e2d752e-1afd-4785-8494-79b6e355e8a5","resolution":{"observed_at":"2026-08-11T23:49:45.304051Z","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-08-11T23:49:45.308391Z","title":"Probability Inequalities for Sums of Bounded Random Variables","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.308391Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:7471c371b76e79c07644bec5587633f2106d1fdcc625a501566e2b6ccdbe4d45","observation_id":"16680a2d-327b-4fc1-b584-1d4467fb7c79","resolution":{"observed_at":"2026-08-11T23:49:45.308391Z","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-08-11T23:49:45.312614Z","title":"Asymptotic minimax character of the sample distribution function and of the classical multinomial estimator","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.312614Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:dc3ad57c83d0430576bf2f556e9fb29d803f30a0abb326421a59ca1a69dd7bae","observation_id":"a5f1cd02-3502-4c97-9c7c-1cca30942cb5","resolution":{"observed_at":"2026-08-11T23:49:45.312614Z","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-08-11T23:49:45.317122Z","title":"Concentration inequalities for statistical inference","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.317122Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:58f15128fdf9b79b62f69d58f2fe683e50afc43c6e658fddb4646570d4d42dde","observation_id":"38aa9feb-7fee-43f6-af06-2c17892522d2","resolution":{"observed_at":"2026-08-11T23:49:45.317122Z","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-08-11T23:49:45.321325Z","title":"Statistics and Information Theory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.321325Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:3eb52cfa29de635e48b59f844aa40c3b888f343fb0fc9856987d17c6078f3b7e","observation_id":"c170a874-cbb0-46b2-b9f1-50af497e6621","resolution":{"observed_at":"2026-08-11T23:49:45.321325Z","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-08-11T23:49:45.325594Z","title":"High-Dimensional Statistics: A Non-Asymptotic Viewpoint; Cambridge University Press: Cambridge, UK, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.325594Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:a1b44a74e4995e2982772e62247b36125605d043dbac1139098c96ee143133c1","observation_id":"d86d7eea-c0bb-4d37-8f24-51cb97d264f0","resolution":{"observed_at":"2026-08-11T23:49:45.325594Z","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-08-11T23:49:45.330280Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.330280Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:76c7d694b4e38b34872a5444d7bca57013c9ea822b24a09efbf29b538507c918","observation_id":"b9e840b0-df6d-4a64-9abb-971223082f06","resolution":{"observed_at":"2026-08-11T23:49:45.330280Z","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-08-11T23:49:45.334939Z","title":"Provably optimal algorithms for generalized linear contextual bandits","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.334939Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:d1871aa7fd5e9c89f8db3605941008adb7f09b4b906f29a37a38e8d610bf0e2e","observation_id":"36fb986f-a123-4a46-9cc6-d492c544fc6e","resolution":{"observed_at":"2026-08-11T23:49:45.334939Z","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-08-11T23:49:45.339313Z","title":"Towards practical mean bounds for small samples","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.339313Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b3ffce20feadcd5f49cb4fa96776c213d61857dfc0b82600533c96ff98264798","observation_id":"94b0d7f9-1013-4a10-b454-b599440179bf","resolution":{"observed_at":"2026-08-11T23:49:45.339313Z","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-08-11T23:49:45.343675Z","title":"Estimating means of bounded random variables by betting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.343675Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:6b84c63baffbf176a143efe2769aabb478b80cacc208286e8aceb2c4ff6aed40","observation_id":"1ce7abff-9dd7-4b91-913a-39d689f77a56","resolution":{"observed_at":"2026-08-11T23:49:45.343675Z","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-08-11T23:49:45.348013Z","title":"Policy optimization using semiparametric models for dynamic pricing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.348013Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:844e22ee1361ff1fefa015c06390bac8cedb19bf7a70ed2a228e6d206a411c16","observation_id":"38b3e4ed-c75d-4fa1-a923-71e7ba6fcdef","resolution":{"observed_at":"2026-08-11T23:49:45.348013Z","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-08-11T23:49:45.352476Z","title":"Sums of Independent Random Variables; Springer: Berlin, German, 1975","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.352476Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:c875ad1d9f3c0bae9771425fe29c67387037f780917be8ce8559cdad4255e965","observation_id":"0bae87f5-3fc8-433f-bdab-2b918c778cb4","resolution":{"observed_at":"2026-08-11T23:49:45.352476Z","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-08-11T23:49:45.356984Z","title":"Computer Age Statistical Inference, Student Edition: Algorithms, Evidence, and Data Science; Cambridge University Press: Cambridge, UK, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.356984Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:445840eb332d14d684eb1a9ae2a78fb4696d5275d23bcf783254244e3e86d243","observation_id":"833b26c5-ad1f-4cf8-b452-ef015cc708c9","resolution":{"observed_at":"2026-08-11T23:49:45.356984Z","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-08-11T23:49:45.361173Z","title":"A Probabilistic Theory of Pattern Recognition; Springer: New York, USA, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.361173Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:c5b4b47b6a279bbe487196a02f9d89846dcd2cfc2bd37be25483e7b67b1b1b24","observation_id":"a8020c61-8b5f-4338-9c1d-ac346b5dffb5","resolution":{"observed_at":"2026-08-11T23:49:45.361173Z","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-08-11T23:49:45.365609Z","title":"Large deviation methods for approximate probabilistic inference","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.365609Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:706254c390268f726c1d8032111537528c69422f93dcbe60d6aa2dce81e007a5","observation_id":"2beb2960-2734-4728-8ff8-0819b2a53de8","resolution":{"observed_at":"2026-08-11T23:49:45.365609Z","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-08-11T23:49:45.370308Z","title":"Some nonasymptotic results on resampling in high dimension, I: confidence regions","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.370308Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:e312f62f4c4184497d858f2e2f04083b1a99a2223a9a00397ded6fba2e72fe6b","observation_id":"cda4a12c-373d-4a9a-ac4c-eb6d331d5a4b","resolution":{"observed_at":"2026-08-11T23:49:45.370308Z","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-08-11T23:49:45.374728Z","title":"Inference in a class of optimization problems: Confidence regions and finite sample bounds on errors in coverage probabilities","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.374728Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:56e15d5e98adb5e3a2daaa88b015e863f911723bbaaaef25ff0d57c16fa77aa4","observation_id":"b8b800d3-6308-4c96-ace3-7edd9a3ae446","resolution":{"observed_at":"2026-08-11T23:49:45.374728Z","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-08-11T23:49:45.379259Z","title":"Mathematical Statistics: A Non-Asymptotic Approach","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.379259Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b49ee6ed608c8b9660a250b8b4d96dc27d723079ca2dd5b9f304dbe8b80a785d","observation_id":"da189c86-2fab-4207-b468-13a19b545775","resolution":{"observed_at":"2026-08-11T23:49:45.379259Z","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-08-11T23:49:45.383624Z","title":"Finite-time analysis of vector autoregressive models under linear restrictions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.383624Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:2a9430f10233e10b0aa9e36a624d8aea3e263529acdddb36e2eb9a050bc0fd2e","observation_id":"0b6c26e6-9fce-4ab5-89d1-f31bfea5cb4a","resolution":{"observed_at":"2026-08-11T23:49:45.383624Z","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-08-11T23:49:45.387930Z","title":"Fast nonasymptotic testing and support recovery for large sparse Toeplitz covariance matrices","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.387930Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:64fca146c828831e5aa3b7d58adcd3b50d86a9f7f46142f21847131636c3766e","observation_id":"abafe999-fa65-41af-97e4-8a109f9288b9","resolution":{"observed_at":"2026-08-11T23:49:45.387930Z","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-08-11T23:49:45.392139Z","title":"Valid and Approximately Valid Confidence Intervals for Current Status Data.J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.392139Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:371acda0adf7fcb05fe52650d8e04db35bba5c06d7ff3035f7f287cf9c875dd1","observation_id":"9f98a572-b2f0-45a6-ba61-d069a5d2a060","resolution":{"observed_at":"2026-08-11T23:49:45.392139Z","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-08-11T23:49:45.396454Z","title":"Finite sample change point inference and identification for high-dimensional mean vectors","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.396454Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b8d8cb1b2df17fca0835cbf66e394d9ff44b742c870bd00da9cca2377a975556","observation_id":"2a499c20-b3e4-4afc-b241-95808271f910","resolution":{"observed_at":"2026-08-11T23:49:45.396454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.06971","last_updated":"2018-03-19T15:02:15Z","snapshot_observed_at":"2026-08-14T19:34:47.464919Z","submitted_at":"2018-03-19T15:02:15Z","title":"What Doubling Tricks Can and Can't Do for Multi-Armed Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.06971","snapshot_observed_at":"2026-08-11T23:49:45.400727Z","title":"What doubling tricks can and can’t do for multi-armed bandits","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.400727Z"},"links":{"cited_paper":"/paper/1803.06971","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b064d93ba78271ee1b2c054e26c136594800b427cdc12deaca231fdadc666ed1","observation_id":"acca8b0a-bf46-45a8-9d6a-51ae7f15d22e","resolution":{"observed_at":"2026-08-11T23:49:45.400727Z","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-08-11T23:49:45.405883Z","title":"Adaptive treatment allocation and the multi-armed bandit problem","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.405883Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:9fd9c8d90f61a8bbdb567566929b4f17fb4e5d3516f1cfa04e623a3990835d2f","observation_id":"c4dbcb1e-14b2-4f0d-bb80-4e06f19b971c","resolution":{"observed_at":"2026-08-11T23:49:45.405883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02279","last_updated":"2024-10-04T02:19:45Z","snapshot_observed_at":"2026-08-12T22:31:51.845740Z","submitted_at":"2024-10-03T07:58:43Z","title":"On Lai's Upper Confidence Bound in Multi-Armed Bandits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02279","snapshot_observed_at":"2026-08-11T23:49:45.410543Z","title":"On Lai’s Upper Confidence Bound in Multi-Armed Bandits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.410543Z"},"links":{"cited_paper":"/paper/2410.02279","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:58c96dc2a6249bf1eda79247be2747580c920ab83e82ae82e16ec14f9c0b3b4f","observation_id":"de269d7c-e0f9-4aca-8285-636085728be5","resolution":{"observed_at":"2026-08-11T23:49:45.410543Z","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-08-11T23:49:45.415483Z","title":"Introduction to Nonparametric Estimation; Springer: New York, USA, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.415483Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b419bda23d68acfb1e35dd003dd9870e1edf12ee9594b374800b3eb910f0c745","observation_id":"f2a2e000-cde3-473a-8a28-747ea8919f58","resolution":{"observed_at":"2026-08-11T23:49:45.415483Z","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-08-11T23:49:45.420361Z","title":"Minimax policies for adversarial and stochastic bandits","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.420361Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:cd95dc76445622314fa546dfe2c2c2426c247ab4bcd5c0fe3761ffa412e0b005","observation_id":"16c7332e-151a-4c1b-9c98-ca7ae2b5f94e","resolution":{"observed_at":"2026-08-11T23:49:45.420361Z","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-08-11T23:49:45.424829Z","title":"A tutorial on thompson sampling","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.424829Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:69a28d96afc541da72709a30eaaac755bb2a160c0f64e359305e8cb7cfdd3cda","observation_id":"4b2a6ebf-b3a0-4dde-bf1e-ee65a8cc0d5c","resolution":{"observed_at":"2026-08-11T23:49:45.424829Z","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-08-11T23:49:45.429282Z","title":"On the likelihood that one unknown probability exceeds another in view of the evidence of two samples","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.429282Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:f81c6c70a534ac5d55216925e6b38e5d70b9b11746fb6bde4d27e07e97c95263","observation_id":"94513faa-9a8b-47c0-8bed-013cddeacc05","resolution":{"observed_at":"2026-08-11T23:49:45.429282Z","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-08-11T23:49:45.433940Z","title":"MOTS: Minimax Optimal Thompson Sampling","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.433940Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:155c2a930f812694c3e89608f7e0df470789d94c5df46afdde96580fdfe567fb","observation_id":"92685353-2ebb-4a2e-b3e0-2d666eb90632","resolution":{"observed_at":"2026-08-11T23:49:45.433940Z","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-08-11T23:49:45.438601Z","title":"A contextual-bandit approach to personalized news article recommendation","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.438601Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:250b23f0fceec735ffe1d9aa7d09501af309189bebe02870e47ca38a016f676b","observation_id":"326d80b4-8544-4d47-8749-d11622990384","resolution":{"observed_at":"2026-08-11T23:49:45.438601Z","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-08-11T23:49:45.443689Z","title":"Mathematical Analysis of Machine Learning Algorithms; Cambridge University Press: Cambridge, UK, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.443689Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:2f640bca211fe704828bc9cfc3c162a8734c06f08c4e5d09dc3c49f04fe39d5f","observation_id":"5aed4a19-384e-41b2-b7e4-41be0f3f6c5d","resolution":{"observed_at":"2026-08-11T23:49:45.443689Z","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-08-11T23:49:45.448168Z","title":"Stochastic Linear Optimization under Bandit Feedback","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.448168Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:de1eb5b2b5784c1b7258b3d2bf2aa6e2edad0399ac8a8bcf13ac90823a61c66e","observation_id":"25f87bce-a295-4012-b7bf-2961c0dba3b7","resolution":{"observed_at":"2026-08-11T23:49:45.448168Z","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-08-11T23:49:45.452681Z","title":"Thompson sampling for contextual bandits with linear payoffs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.452681Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:dd42a28ab096b863d29df359a700efcf36c8d94ff9db8bf836b2363827423c4d","observation_id":"bbe83f8b-4038-467b-a687-828dd9018685","resolution":{"observed_at":"2026-08-11T23:49:45.452681Z","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-08-11T23:49:45.457287Z","title":"Learning to optimize via posterior sampling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.457287Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:74c238177dd37b39f593c36e811a50b95082a7164b686d77bff90df695f24147","observation_id":"40d024b9-407d-4201-bc66-b3748d8beb05","resolution":{"observed_at":"2026-08-11T23:49:45.457287Z","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-08-11T23:49:45.461771Z","title":"Neural contextual bandits with UCB-based exploration","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.461771Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:77c5b6c064b16fbeaeccd33ff2985084d2b9a2e49218e9953479530752faf5d9","observation_id":"148de462-3bdb-44e0-bfd7-b3afc3850f10","resolution":{"observed_at":"2026-08-11T23:49:45.461771Z","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-08-11T23:49:45.466130Z","title":"Neural Thompson Sampling","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.466130Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:cc92993c6dd8fd3812e368dab643200761b60b5d966a1989984f6f472399ba96","observation_id":"f0cf4b56-45b7-4d2b-983f-3f1c93157514","resolution":{"observed_at":"2026-08-11T23:49:45.466130Z","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-08-11T23:49:45.470508Z","title":"Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.470508Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:59d98af37bb1ad57693f027dd16a927d5e2acd147a69b912f5d8180deb1477e3","observation_id":"d6c9c7b6-f5f9-4126-b6a7-13ba4e937213","resolution":{"observed_at":"2026-08-11T23:49:45.470508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1012.2599","last_updated":"2010-12-12T22:53:04Z","snapshot_observed_at":"2026-07-06T02:20:34.514024Z","submitted_at":"2010-12-12T22:53:04Z","title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1012.2599","snapshot_observed_at":"2026-08-11T23:49:45.474766Z","title":"A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.474766Z"},"links":{"cited_paper":"/paper/1012.2599","citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b92680734c36eb8b6f3689a94768543bd595f0fb65aef7c98941a15ee0004e74","observation_id":"e5a52e18-bc88-4919-8692-1b434c476c84","resolution":{"observed_at":"2026-08-11T23:49:45.474766Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.334990Z","title":"A tutorial on Gaussian process regression: Modelling, exploring, and exploiting functions","venue":null,"work_id":"a4920976-93a1-4e87-9f94-73cb8ac1e3b9","year":2018},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.479627Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:46963f3083392ed0d3b1cae3bbe73e62fbb2d72b0fea468910d1afdcc8848f13","observation_id":"b9606d3c-d4f0-4371-bf7b-118843db379a","resolution":{"observed_at":"2026-08-11T23:49:47.340253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.320572Z","title":"Elements of Information Theory; Wiley-Interscience, Hoboken, USA, 2006","venue":null,"work_id":"73441e72-6834-4dfa-b06e-5dfa4c9b0cbc","year":2006},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.483925Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:5b069e7fa3db233bf79d7ccf5f7b9d096f69efe4b26af1f981b930ed119af0ce","observation_id":"dbad38de-2f1d-474b-a08a-300e75ac4650","resolution":{"observed_at":"2026-08-11T23:49:47.324955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.305486Z","title":"On kernelized multi-armed bandits","venue":null,"work_id":"b89fe4e5-eb5c-4e82-a16f-c57813f3e97f","year":2017},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.488200Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:f67af59b347bdf3c683e3eea94f8e93afb375918ef647e78de92b2093cd481ac","observation_id":"9e41b9bd-cc34-4e3a-bb0f-70170977bc64","resolution":{"observed_at":"2026-08-11T23:49:47.310155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.290375Z","title":"Contextual Gaussian Process Bandit Optimization","venue":null,"work_id":"d60db321-965d-4785-bea1-50721d6b9282","year":2011},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.492480Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:8a5c58795850f6ac52b81da8d1f5785730c4ca0bf257ebd8381aa5447686d738","observation_id":"ead6b690-1975-4a2b-8593-128bc70a1f2d","resolution":{"observed_at":"2026-08-11T23:49:47.295550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.276076Z","title":"Active learning for level set estimation","venue":null,"work_id":"f76441fb-b393-4276-b1f7-eaddabc3824d","year":2013},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.497046Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:0ee8db5b7f59aca64f99306cddbf9f58147cdbe6d536380841c1d5892b47995e","observation_id":"d33701a6-d9b9-46a7-a6d0-f7cc191a05a0","resolution":{"observed_at":"2026-08-11T23:49:47.280740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.261640Z","title":"Gaussian process classification bandits","venue":null,"work_id":"1b9933ab-31cd-4927-b8b2-7bfaf1afaa87","year":2024},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.501612Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:424a99b99793ecec6737d0d1ce433aa3a01eb3b365cc5e373f90fbc7c31a4b37","observation_id":"c994caed-5650-4922-8384-a433b3b41d6f","resolution":{"observed_at":"2026-08-11T23:49:47.266604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.246913Z","title":"Gaussian Process Bandits Preprint","venue":null,"work_id":"282e3b22-8826-436b-8713-b0f87383b146","year":2016},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.506055Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:c426e4ebf191cec2739eb8ae658b50ad1d074d3385b92c45a832580233688802","observation_id":"1657248b-581b-4abc-af6c-2a392416c68b","resolution":{"observed_at":"2026-08-11T23:49:47.251926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.231010Z","title":"Uncertainty Quantification Using Martingales for Misspecified Gaussian Processes","venue":null,"work_id":"a7f380cd-71f6-40cd-9050-b8324dbecccc","year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.510576Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:7f91ad87ecd472b8c7c77b0d3aac2b1c50e8788a02a41f788233712e0db3a0d0","observation_id":"8c782a54-0861-4e89-a7ea-a3fcaeb31811","resolution":{"observed_at":"2026-08-11T23:49:47.235911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.215089Z","title":"Confidence Bound Minimization for Bayesian Optimization with Student’s-t Processes","venue":null,"work_id":"630ea3c5-be51-4f7c-85c5-da82ad0706e9","year":2020},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.515366Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:e2acb70c53deb76f15dfc62cae6f60615b057e2ee25ec36bd9e2a889b4f0d9cb","observation_id":"d8b7d0f2-f67a-4472-a53c-b14152415b3b","resolution":{"observed_at":"2026-08-11T23:49:47.220095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.199476Z","title":"Gaussian Processes for Machine Learning; MIT Press: Cambridge, MA, USA, 2006; Volume 2","venue":null,"work_id":"dc2a4fdd-948b-4559-879c-814b8b5b322d","year":2006},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.519987Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1c926d24c27acc34894900b3f6b6cc93b69738761e0098518bf703346a975b92","observation_id":"3bd6f81f-be0d-4d87-a302-2061656ed001","resolution":{"observed_at":"2026-08-11T23:49:47.204200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.184326Z","title":"Continuum-Armed Bandits: A Function Space Perspective","venue":null,"work_id":"cb4b316d-e826-4735-bfa7-5bbb0c544100","year":2021},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.524597Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:9700bbd380a4d5d2f8d3e2cffaad9fe2f14a3b3419ce0bc983a36b199a2027e2","observation_id":"3afeb841-b61d-4813-bc85-ecc90d50c56c","resolution":{"observed_at":"2026-08-11T23:49:47.189172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.167611Z","title":"Theoretical Foundations of Functional Data Analysis, with an Introduction to Linear Operators; John Wiley & Sons, West Sussex, 2015","venue":null,"work_id":"4e5fceb2-c4bf-456f-a9f4-f0650960fd69","year":2015},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.529261Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:1f9b52017b920fab91b059c90f1ffdca19f292860824ed459ba7e94edc35b25c","observation_id":"b36f8349-ecb1-4791-a26d-789ac9adefef","resolution":{"observed_at":"2026-08-11T23:49:47.173468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.152335Z","title":"Gaussian Process Regression Analysis for Functional Data; CRC Press: 2011","venue":null,"work_id":"b1bd14e7-3039-4933-9e8c-6fabc2d0c917","year":2011},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.533371Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b15e700f4b9d2df52b1694d786e79ecd6fd0a064a15045ca7444d9312499f082","observation_id":"55f0dbb1-4804-465c-b1ef-e50312025aa8","resolution":{"observed_at":"2026-08-11T23:49:47.157647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.136401Z","title":"Growing-dimensional partially functional linear models: non-asymptotic optimal prediction error","venue":null,"work_id":"98c4845b-dbfc-4c8c-9489-66a91c0bcd77","year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.538165Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:77d16e23bc8dff6f57ef0bb2789ca70d4df3ee338f6902437dfc8aa17acd4738","observation_id":"201cd93e-c87c-4dd5-9a06-cb7fe5d82577","resolution":{"observed_at":"2026-08-11T23:49:47.141639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.120258Z","title":"Functional data analysis for sparse longitudinal data","venue":null,"work_id":"ecfcd23c-fadc-47eb-a5e9-ac7ca968c9ab","year":2005},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.542556Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:56be4a3ae70e15de5a9f5f08f339d814897731a08e8c08bd5e2c9a8c7e5dfad9","observation_id":"54e88e2e-fa05-41ac-b077-f7af6b19afab","resolution":{"observed_at":"2026-08-11T23:49:47.125243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.103544Z","title":"Functional linear regression for discretely observed data: From ideal to reality","venue":null,"work_id":"fc012805-d569-40d4-b0ce-9cab2aa77f40","year":2023},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.547059Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:12368dee20e12883cec7d883fc0735ea5ec0bdbc479a94ad817842dcbea191eb","observation_id":"b2113caa-3a05-4bf1-a889-cb0eb9a682ff","resolution":{"observed_at":"2026-08-11T23:49:47.109499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.087744Z","title":"Stochastic continuum-armed bandits with additive models: Minimax regrets and adaptive algorithm","venue":null,"work_id":"26810a73-f0bc-4060-b1cc-153c3d03ad24","year":2022},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.551662Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:06f0d480a0f007813c3c4039f0d85c0aebbd41c1bba658f4ddb9a79fa994f149","observation_id":"bba2a456-18ea-4383-8c42-75907155f359","resolution":{"observed_at":"2026-08-11T23:49:47.092979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.072150Z","title":"Optimal designs for longitudinal and functional data","venue":null,"work_id":"7f15dcb2-ce63-40e2-8a31-4d4d406305fb","year":2017},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.556235Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:b45610a77b9fb4aff3008ab0ef3f3195866c162717c9d7df9bb5a0af0b6ac176","observation_id":"37b6be50-ceae-4c39-88a6-5ed148000fb2","resolution":{"observed_at":"2026-08-11T23:49:47.076889Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T23:49:47.057212Z","title":"One-armed bandit problems with covariates","venue":null,"work_id":"bfceb487-4c38-443f-a46a-45192f69bceb","year":1991},"citing_paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View","version":3},"reference_index":101,"source":"pdf_text","source_observed_at":"2026-08-11T23:49:45.560687Z"},"links":{"citing_paper":"/paper/2412.02251"},"observation_digest":"sha256:c624d480f0653407df488ed7553431713a00758534dc4dce1c884d35a8f8ee85","observation_id":"b3066bb7-8604-466e-9212-3bf77b7a2637","resolution":{"observed_at":"2026-08-11T23:49:47.061860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.02251","last_updated":"2025-02-19T18:48:18Z","latest_version":3,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-14T01:10:18.836345Z","submitted_at":"2024-12-03T08:28:47Z","title":"Selective Reviews of Bandit Problems in AI via a Statistical View"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":78,"verified_exact":2,"verified_fuzzy":19},"total_outbound_references":151},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 100 of 151 outbound references and 0 inbound Pith citation observations for arXiv:2412.02251."}