{"as_of":"2026-08-13T17:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b76edaa55817b0637f9670cc725a97d8a587899861567d7103ca63d59a6cf39f","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T16:52:19.471718Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2502.01067/citation-record","integrity":"/paper/2502.01067/integrity","json":"/paper/2502.01067/citation-record.json","paper":"/paper/2502.01067"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T16:52:19.895029Z","title":"Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons","venue":null,"work_id":"cc50d0c1-9ad9-4926-a5db-38c20a78ef04","year":2017},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.325922Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:791f21c310fdd99d8a4ffff80fd288a765f487e8f4ab059a7334d18f21564aec","observation_id":"08a79871-d5ff-48ab-923b-818cda932a36","resolution":{"observed_at":"2026-08-09T16:52:19.898886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.884236Z","title":"A sharp memory-regret trade-off for multi-pass streaming bandits","venue":null,"work_id":"39afc871-0641-4cf7-a471-d694e7f0e78c","year":2022},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.334680Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:8f32bf791b3dc3f364837a7c04aee31fe0920455bdb6f29b0f4efe0ed87cbc4a","observation_id":"a10e7301-0daf-4c56-8af4-7ee154a344fa","resolution":{"observed_at":"2026-08-09T16:52:19.887970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.874091Z","title":"Online models for content optimization","venue":null,"work_id":"fdc84932-c513-4bea-85d0-d4debdb57229","year":2008},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.338716Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:45ef89472c213b97d071d3c86d3ce06a5a698a7c392c85f5c55f5ad4a98fcdde","observation_id":"47d99e0e-9dfc-43f1-ac17-ec8d1d0a026b","resolution":{"observed_at":"2026-08-09T16:52:19.877636Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.863856Z","title":"Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits","venue":null,"work_id":"1cbaf639-d63e-492a-95ac-c041484d9f5e","year":2020},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.342655Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:1e5d45289ff62b21b3b63d388583f3d97b22c2def55d687fa39fd024f81a4bfc","observation_id":"9ba3c70e-d21b-4fe6-bdd8-6e815231a3b9","resolution":{"observed_at":"2026-08-09T16:52:19.867555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.853628Z","title":"Single-pass streaming lower bounds for multi-armed bandits exploration with instance-sensitive sample complexity","venue":null,"work_id":"cb6096ea-0cb3-45ec-8b3a-e5b136f5676d","year":2022},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.346707Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:afdf343f6d3774265086d43a13ce0258e4f24fad714651d5e2ece5b37e19ceb5","observation_id":"90737d76-6b59-4fa8-ae7d-769a6957e911","resolution":{"observed_at":"2026-08-09T16:52:19.857210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.843596Z","title":"The best arm evades: Near-optimal multi-pass streaming lower bounds for pure exploration in multi-armed bandits","venue":null,"work_id":"83b48b2e-6776-444f-a12c-c7076f43c36b","year":2024},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.350593Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:e652ad582deed1a49fb195057319964761130eff1ac5f49fc802d9b7d2b15707","observation_id":"2871219a-a426-4772-98ee-7d7af7111825","resolution":{"observed_at":"2026-08-09T16:52:19.847244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.833635Z","title":"On multi-armed bandit designs for dose-finding clinical trials","venue":null,"work_id":"b01589f2-a8e3-48a5-9964-64222827b527","year":2021},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.354494Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:9a409150a0223c672613a1b4b300c19f95738d14fa75b939a2d7e74d1381474b","observation_id":"5423e125-69ba-4626-b8d1-5d4fbbe05f2b","resolution":{"observed_at":"2026-08-09T16:52:19.837456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.823658Z","title":"Tight (lower) bounds for the fixed budget best arm identification bandit problem","venue":null,"work_id":"90e9f9d9-6d94-496a-b42b-1af969a50d08","year":2016},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.357778Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:a1afeb16c7370c1db9481696cd613fbd8ce22a700403c8123c1e5394bcab46b2","observation_id":"2e5a8494-6f7e-4614-8e2e-e6ef2ceb3eb0","resolution":{"observed_at":"2026-08-09T16:52:19.827248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1511.03774","last_updated":"2016-08-23T18:05:29Z","snapshot_observed_at":"2026-08-10T08:41:49.148140Z","submitted_at":"2015-11-12T04:49:46Z","title":"On the Optimal Sample Complexity for Best Arm Identification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.03774","snapshot_observed_at":"2026-08-09T16:52:19.361501Z","title":"On the Optimal Sample Complexity for Best Arm Identification","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.361501Z"},"links":{"cited_paper":"/paper/1511.03774","citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:c2da849dae3f5cb553de88c0f50bdf7b7434b0e0f21b9af60738605be853faf4","observation_id":"bfad449b-0da6-4db8-a34b-57ad53414dcb","resolution":{"observed_at":"2026-08-09T16:52:19.361501Z","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-09T16:52:19.813306Z","title":"Open problem: Best arm identification: Almost instance-wise optimality and the gap entropy conjecture","venue":null,"work_id":"88d26fa5-71b7-4cd4-a104-8d3756ea33c6","year":2016},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.365570Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:57469749cf7b9c985552df91b43e0c99184b1231a094d6e43cf1e170c8d8ff3a","observation_id":"b1ff2b7d-96b8-4247-8af6-56073c31b570","resolution":{"observed_at":"2026-08-09T16:52:19.816949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.802581Z","title":"Nearly instance optimal sample complexity bounds for top-k arm selection","venue":null,"work_id":"791bab62-c6a7-4396-a436-8902a7f707d6","year":2017},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.369262Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:fc8342576ccf0a352e0714db471f11cecb51d12d235cdf616b70175b6d84aa3c","observation_id":"c766ece5-2eb3-4544-a28d-30268776e534","resolution":{"observed_at":"2026-08-09T16:52:19.806283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.792332Z","title":"Towards instance optimal bounds for best arm identification","venue":null,"work_id":"44c1a253-12a5-4918-b656-e4cf455e762e","year":2017},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.373792Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:54b9cedefda50e3d607a45e7263526c2dfd51452a4c68c8bffc59cccddd3c691","observation_id":"a8a89a44-af6a-48fe-a642-83ee37b32424","resolution":{"observed_at":"2026-08-09T16:52:19.795886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.781935Z","title":"Cover and Joy A","venue":null,"work_id":"5fc6020e-431f-4f48-8887-646101dc3303","year":2006},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.377416Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:f08570a6bb8ed9274c6b887a009a80afc3505760040fd9bdde8228134057089f","observation_id":"2ebbd67a-bacc-4a46-8f15-16eca12dfb18","resolution":{"observed_at":"2026-08-09T16:52:19.785577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.770851Z","title":"PAC Bounds for Multi-Armed Bandit and Markov Decision Processes","venue":null,"work_id":"de3dad33-b58b-4298-beaa-42d3003c22b8","year":2002},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.380867Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:97f55606b90ce50edd2a97a09aafb1972b3eb1e5ca6cfcc4dfb4c7f9e5336b0e","observation_id":"d27bab4e-e73f-4693-b00a-8607690f6fc0","resolution":{"observed_at":"2026-08-09T16:52:19.774639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.760036Z","title":"Understanding memory-regret trade-off for streaming stochastic multi-armed bandits","venue":null,"work_id":"8ba41690-a325-4037-9e1a-21a3f65fc3ea","year":2025},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.384552Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:675119a2c2079e9bc9f1e329eca475081327d1c3c0a308957638e7072dc4f43a","observation_id":"3cacc14a-7e3b-4591-bde3-851cbd824b4e","resolution":{"observed_at":"2026-08-09T16:52:19.763834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.749359Z","title":"Distributed exploration in multi-armed bandits","venue":null,"work_id":"8ce5cb4e-5dc4-485a-8e2b-6f20c1e5ded3","year":2013},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.388075Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:dd827bc252949373b4dc8426849b65758818e0bb81ad96d51fff90b98b879063","observation_id":"fc16ebda-e514-4503-8ac9-b1f5745c6d2b","resolution":{"observed_at":"2026-08-09T16:52:19.753296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.739161Z","title":"Jamieson, Matthew Malloy, Robert D","venue":null,"work_id":"9687c5e5-d64a-4efa-95c6-495cb58c23cb","year":2014},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.391621Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:3bb96ef22dd8b9a5229f10c76213013ca570fa71dbddd0bd9f6667c87f7c11a6","observation_id":"d936ed91-4831-4edb-8a30-9a50af67be29","resolution":{"observed_at":"2026-08-09T16:52:19.742723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.728663Z","title":"Optimal streaming algorithms for multi-armed bandits","venue":null,"work_id":"1361050d-bc2f-4439-803b-b49024b4fca3","year":2021},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.395200Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:481d709dcc609167a94ab71f873727410f323c09db3d63143c3fbb2b03744b79","observation_id":"01d9e33d-9c0a-4f30-811b-23687251d5b4","resolution":{"observed_at":"2026-08-09T16:52:19.732378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.717785Z","title":"Efficient Selection of Multiple Bandit Arms: Theory and Practice","venue":null,"work_id":"14efffc5-5867-48c6-bfdd-c637db81762e","year":2010},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.398812Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:4cec7a3616e403268ea959d9cb774a9dfe86351c4e80eb7dcc7e3428918b9c49","observation_id":"c766d00c-8ab8-4481-9e20-b081b573632c","resolution":{"observed_at":"2026-08-09T16:52:19.721442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.707194Z","title":"Almost optimal exploration in multi-armed bandits","venue":null,"work_id":"1d8b3795-1fea-44c4-a5b5-68d502bc2c70","year":2013},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.402491Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:fb7cb5c837e4e6f00110bf88b1e7ed9a4b932c9f6b384ccb93c67b04b0fe6220","observation_id":"eda16324-31c8-453b-9b54-6c6656204473","resolution":{"observed_at":"2026-08-09T16:52:19.710886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.696068Z","title":"Collaborative top distribution identifications with limited interaction (extended abstract)","venue":null,"work_id":"6ae6c042-87a1-4421-8427-974b831c19f9","year":2020},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.406169Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:f3fac5ec1b890df072900c0b28700f13f75713389c9a47bfd7eec963cecd3664","observation_id":"3dd2b03f-b583-492a-abcb-b84576b72316","resolution":{"observed_at":"2026-08-09T16:52:19.699843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.685060Z","title":"Complexity of best-arm identification in multi-armed bandit models","venue":null,"work_id":"6417b1cf-9342-4993-bb1d-6d39a1d23098","year":2016},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.409832Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:fed2c49e4a590030dca46f2b34a12b946ac5e5a285b28edbc53f0efa91681968","observation_id":"c4e7b000-f62f-425d-936e-e007ce72c913","resolution":{"observed_at":"2026-08-09T16:52:19.688874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.674486Z","title":"Koval, Jennifer E","venue":null,"work_id":"2954f540-c984-4e11-9e6e-3e28f94e6219","year":2015},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.416861Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:98a66fdc2644b14857b00e68946846b1208cf008ffe3286b086b5e6f4360aed4","observation_id":"009e1fde-a116-48a8-a6c2-5ffdfa3e7566","resolution":{"observed_at":"2026-08-09T16:52:19.677991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.07903","last_updated":"2023-06-13T16:54:13Z","snapshot_observed_at":"2026-08-13T11:18:01.243806Z","submitted_at":"2023-06-13T16:54:13Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","version":1},"cited_work":{"arxiv_id":"2306.07903","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.07903","snapshot_observed_at":"2026-08-09T16:52:19.501174Z","title":"Tight Memory-Regret Lower Bounds for Streaming Bandits","venue":"cs.LG","work_id":"4fc21a68-ae98-41b8-8316-5a914d176473","year":2023},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.420446Z"},"links":{"cited_paper":"/paper/2306.07903","citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:fe1943cc89725aed4b82e52003301a7d1ed832e687d288b69ded1f424ad4b1bd","observation_id":"c5fd3d84-9721-4ed1-b3ba-31cd2fa9cc04","resolution":{"observed_at":"2026-08-09T16:52:19.507520Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.662303Z","title":"Multi-armed bandits with bounded arm-memory: Near-optimal guarantees for best-arm identification and regret minimization","venue":null,"work_id":"e466bba6-1c10-4d3f-abd1-d5e2ca858cc2","year":2021},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.424406Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:cf8891c62a43c4a669dc72bbd884aee72e25a7a062bab544874a56b55fa204d4","observation_id":"db36ca02-e476-4516-892c-3d3c901d5c93","resolution":{"observed_at":"2026-08-09T16:52:19.666869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.651064Z","title":"The Sample Complexity of Exploration in the Multi-Armed Bandit Problem","venue":null,"work_id":"ea2024f9-4b52-4700-82c9-35190283c84b","year":2004},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.427987Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:44c4c85b8b1314193d0125cfd4573ec9ea55efac0a7efbd7607deabec0a7969a","observation_id":"f90c15e3-db1a-414a-8a95-4df546e70462","resolution":{"observed_at":"2026-08-09T16:52:19.654805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.640449Z","title":"Learning diverse rankings with multi-armed bandits","venue":null,"work_id":"e18982ba-1260-496a-8a44-fa2c21d41ee0","year":2008},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.431563Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:65bb571cd4b4c25243dd05c767c53e455e1b9b804a5ab7a2729d1762545d2efb","observation_id":"d6c02f74-ae29-4226-ad08-258b3f90e99f","resolution":{"observed_at":"2026-08-09T16:52:19.644238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.629735Z","title":"Some aspects of the sequential design of experiments","venue":null,"work_id":"14825e3f-8c92-4528-8856-b0e11535fea8","year":1952},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.435231Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:1e6245030faee5206b72bf8177278acf53cb7f38db7a3e6af835280d82d9ff0c","observation_id":"cd72cd23-1bba-4eff-a08a-ee6a960f00f9","resolution":{"observed_at":"2026-08-09T16:52:19.633409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.619093Z","title":"Multi-armed bandits in recommendation systems: A survey of the state-of-the-art and future directions","venue":null,"work_id":"725cbfd8-053a-457c-8dc1-59d104eba9b0","year":2022},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.438968Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:3c2bf4caeae9ef501ffa49bf7db444d99175cc9d2224a3469709cbee17701df3","observation_id":"af68aa18-0ecc-4287-94d0-d4b5e56436bf","resolution":{"observed_at":"2026-08-09T16:52:19.622807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.607286Z","title":"Introduction to multi-armed bandits","venue":null,"work_id":"a51f162a-3f9c-45e1-bf98-0c3a463bb59f","year":2019},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.442143Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:4a8ce766b688f02c4fd03930e901525beeea6c7ca6124a50667146e5c029850b","observation_id":"33db49f5-6ff3-4647-9927-d3f822aebc6b","resolution":{"observed_at":"2026-08-09T16:52:19.611033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.446123Z","title":"Multi-armed bandit models for the optimal design of clinical trials: benefits and challenges","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.446123Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:2b8843806d854668f707966172a34abba33fd172d704631daf2959a123317813","observation_id":"97da8ade-4610-4132-a435-25bd2bb535a9","resolution":{"observed_at":"2026-08-09T16:52:19.446123Z","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-09T16:52:19.589786Z","title":"Tight regret bounds for single-pass streaming multi-armed bandits","venue":null,"work_id":"616ff0a1-cfa2-4a48-b44e-d5f0aafa1805","year":2023},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.449637Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:e13b3737dba4d83a7a784730a8f0c470d089e7b2eb24d7f0e9c5128dc4412260","observation_id":"798d6bac-908b-4715-9460-9d754e305035","resolution":{"observed_at":"2026-08-09T16:52:19.593595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.579132Z","title":"(23) For arms from the set B by Lemma B.4 we have that the number of pulls assigned to an arm i ∈ B is bounded by P T0 ≤ 128 n2∆2","venue":null,"work_id":"09979c05-dcde-465f-8671-500feaf29735","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.453842Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:bf3423bab8e5de059c1c760e68c062dc150a55b0c994dc7f482650338dabff99","observation_id":"a2e3e3a0-8720-4b8d-ac9f-8ec55881aa05","resolution":{"observed_at":"2026-08-09T16:52:19.583304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.568463Z","title":"We note that the size of B is bounded by n","venue":null,"work_id":"0e9914f9-9e0c-4ac5-877b-d12ee82c7d43","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.457299Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:83aacb6c86d61c99272a30da709dc49332db1977dab19586005a6bfa280f53e1","observation_id":"df526b01-733a-42f7-be35-b46df2308916","resolution":{"observed_at":"2026-08-09T16:52:19.571965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.557938Z","title":null,"venue":null,"work_id":"b5b14d8b-fd03-440b-a0ca-1aa9f02b500b","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.460982Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:59899ede35484dbc7b948acf6183b01ddbe64dbbf5c0a83835265585c0bff662","observation_id":"a4563e9c-7c96-4b71-9d84-6f605e738ba6","resolution":{"observed_at":"2026-08-09T16:52:19.561345Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.547398Z","title":"(24) As such, combining Eq (22), Eq (23), and Eq (24), we have T = TS + TB ≤ P 128 ∆2","venue":null,"work_id":"8502ad26-aab9-4390-91b2-1cd08361c573","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.464684Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:b7648d0024be18778023537d07e1b5b11ad4615cfaa0a24d4e92dcb161e49390","observation_id":"527d18f7-cb37-41fe-9f2b-e71570d64c35","resolution":{"observed_at":"2026-08-09T16:52:19.550908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.536934Z","title":null,"venue":null,"work_id":"f276eb7e-635b-46a6-8ca4-1d018564e375","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.468295Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:e3d32415a57a0647b4eecb9a7936a4a84499be7fc5a96d5216c1e9954918be1a","observation_id":"7193c32c-9f5a-429d-a8ef-963bea0824cf","resolution":{"observed_at":"2026-08-09T16:52:19.540544Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-09T16:52:19.526025Z","title":"36 Finalizing the proof of Theorem 3","venue":null,"work_id":"f7304f1f-beaf-4687-8656-eea4a0a06f74","year":null},"citing_paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T16:52:19.471718Z"},"links":{"citing_paper":"/paper/2502.01067"},"observation_digest":"sha256:bd5bb19f3228ddcec778fe90768dcda122a80bcac1ce0990c3efd2eacafdc5da","observation_id":"e41a02e7-1790-4f0f-a28c-b88e8bdf09ae","resolution":{"observed_at":"2026-08-09T16:52:19.529875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01067","last_updated":"2025-02-03T05:24:35Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-11T19:38:26.693747Z","submitted_at":"2025-02-03T05:24:35Z","title":"Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":33},"total_outbound_references":38},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2502.01067."}