{"as_of":"2026-08-08T11:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55f6777b0f241898b8dd3b615e0c3b1b325b50e6f38cbff5d21acb3c0a69597a","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:24:43.521214Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.24692/citation-record","integrity":"/paper/2505.24692/integrity","json":"/paper/2505.24692/citation-record.json","paper":"/paper/2505.24692"},"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-07T12:24:48.595875Z","title":"Sample mean based index policies with o(log n) regret for the multi- armed bandit problem","venue":null,"work_id":"87807458-c6e6-4e61-9b77-23ac1ceb9834","year":1995},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.711509Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:27bb30ac6232314ba74bde768d1750200ce4e0f453665ba84051024ef64c2708","observation_id":"21c97598-b00b-446c-b0d7-8faa69ca8a6e","resolution":{"observed_at":"2026-08-07T12:24:48.725940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:48.319100Z","title":"W., and O’Neil, M","venue":null,"work_id":"f2e40625-d62e-4716-8b08-09df5547bb76","year":2015},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.754021Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:dbb8c8f3f110e05acbdf2583c50efc9af480d291af91451cba03b87cd2841f00","observation_id":"e78fee99-9f3f-4293-bb5c-90ec778e908e","resolution":{"observed_at":"2026-08-07T12:24:48.462642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:48.180803Z","title":"Finite-time analysis of the multi- armed bandit problem","venue":null,"work_id":"fc8c8bb6-91b1-422f-a82b-b092f65ff4db","year":2002},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.801189Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:07ea3c8823ade8b2d56960f72b65d09cf3262e368d063d20a01b9fd09c8d71c2","observation_id":"dc2e00b9-8081-4389-878b-98e13be8b188","resolution":{"observed_at":"2026-08-07T12:24:48.233703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:48.038817Z","title":"Improved rates for the stochastic continuum-armed bandit problem","venue":null,"work_id":"355c4739-97c1-4f50-b618-13dbc00e0f2c","year":2007},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.840121Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:ba4bf68b55aef06804daf0e6dd061d07300e1050f72fd9d0818a1dc21d10f66a","observation_id":"91262225-8ee9-407b-936c-cff770ad50ba","resolution":{"observed_at":"2026-08-07T12:24:48.083402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:47.887039Z","title":"Advances in neural information processing systems 34 (2021), 3004–3015","venue":null,"work_id":"e0516dd4-7a90-4e12-87a0-8c8ccf86f82f","year":2021},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.881129Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:cb2823a52e1976fd03ebedabe669ee90340d81df4cf42196a6df33919917151c","observation_id":"a7c90d19-6913-4c46-9d4e-bd048ecb634e","resolution":{"observed_at":"2026-08-07T12:24:47.958318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:47.689115Z","title":"Products and convolutions of gaussian probability density functions","venue":null,"work_id":"8a42c56e-c508-4225-b98d-1b2a2e579940","year":2003},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.934417Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:e34d9a49af25e43a566c7ab82e408198d25b9dcca9accf92adba3d4c4a76e6b8","observation_id":"d3d1824d-15e2-4ae4-9ea7-59153334623c","resolution":{"observed_at":"2026-08-07T12:24:47.815555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:47.486126Z","title":"Online optimization in x-armed bandits","venue":null,"work_id":"9c4bf049-d864-4b3a-9668-f94faaa2e183","year":2008},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:41.988641Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:e00fc44777d2dbf201b3c90e5fe2731a0af8af69030b2f50dc1003ad8f9d7a19","observation_id":"c2573588-beca-45fd-91d3-5aa7a1b0aff9","resolution":{"observed_at":"2026-08-07T12:24:47.597208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:47.334061Z","title":null,"venue":null,"work_id":"a5e59a64-0a1d-4aa5-974a-c404311b606f","year":2011},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.043829Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:9d20575ee3315db3425a0cb0641830b8d6fa80d2059425e83999ba26e46b4cc2","observation_id":"23fc418b-1280-42db-8644-23e3888d59c6","resolution":{"observed_at":"2026-08-07T12:24:47.408149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:47.054045Z","title":"Weighted gaussian process bandits for non-stationary environments","venue":null,"work_id":"41a87226-9c1c-4f72-b5c1-312359556d91","year":2022},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.094224Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:9253edfb82c0033a1af9fd6567fd21fee6938c2b425e98ae9991df370feedb34","observation_id":"ae4e1913-3842-4840-af37-d2551d86533f","resolution":{"observed_at":"2026-08-07T12:24:47.128135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:46.882311Z","title":"High-dimensional gaussian process bandits","venue":null,"work_id":"8ec6d277-adad-497b-8519-a9130c4eac44","year":2013},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.146690Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:e62339fb756afa5c213c64dc35f5ab679847d9cad7ec931e5a3d3cadd2ea16e4","observation_id":"6206310f-8209-45af-987f-b52c467ba437","resolution":{"observed_at":"2026-08-07T12:24:46.959054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:46.669597Z","title":null,"venue":null,"work_id":"055190bf-818c-4d00-843c-aa779a043234","year":1975},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.217633Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:5880b0d6c405d5bc6fd1b57f435363ee308cf04d849befad7164d26e3bc96c50","observation_id":"986e38c1-ff1c-4624-9902-f34c5cac81d2","resolution":{"observed_at":"2026-08-07T12:24:46.785217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0805.3415","last_updated":"2008-05-22T09:18:44Z","snapshot_observed_at":"2026-07-06T01:38:39.726709Z","submitted_at":"2008-05-22T09:18:44Z","title":"On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0805.3415","snapshot_observed_at":"2026-08-07T12:24:42.270332Z","title":"On upper-confidence bound policies for non- stationary bandit problems","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.270332Z"},"links":{"cited_paper":"/paper/0805.3415","citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:c10f86cbdf71cf0605022a74b06c25ef47caf9b6ab7a7e97b176e259fa682ed7","observation_id":"3d00c21d-630a-4310-b654-5ad2806bd96c","resolution":{"observed_at":"2026-08-07T12:24:42.270332Z","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-07T12:24:46.463354Z","title":"G., and Thompson, D","venue":null,"work_id":"edac8012-4dfc-44da-9888-1140b8a87d37","year":1952},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.316809Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:0343b11b090f471e6d7d4e44f02ae0b4b96be82b36b16fc53508a9295b26dc89","observation_id":"0e44030e-9e22-4c62-b49b-c90d5ad17c1e","resolution":{"observed_at":"2026-08-07T12:24:46.575832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:46.239020Z","title":null,"venue":null,"work_id":"7e80c2cd-52c4-4d57-ac9e-b1419fa8ed61","year":2023},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.367699Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:f566d48e16976268e053a75afd6bfe2315660407e98c538c9bc99ab5ab17748f","observation_id":"270275a5-96a4-44d5-9e50-26df4baf7fc8","resolution":{"observed_at":"2026-08-07T12:24:46.344120Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:46.038989Z","title":"Nearly tight bounds for the continuum-armed bandit problem","venue":null,"work_id":"88b88f2a-a3b0-4e79-b139-2d5f57d355da","year":2004},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.418466Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:17f96d4d119847c16ed51f1d24acbca122e579b03748ced11651e3f76ed9a465","observation_id":"8971f88a-6dd7-464c-b37f-1da7596032da","resolution":{"observed_at":"2026-08-07T12:24:46.130066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:45.861081Z","title":"Multi-armed bandits in metric spaces","venue":null,"work_id":"c2fdb1e3-ce15-4e94-aac1-a8fb7fdcd7e5","year":2008},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.482043Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:6b25c56b6e9d2c9b2744457aa5b95f1a3c2220b16a0f1d33a840239394ba2521","observation_id":"b888a09c-3231-4de8-be63-a669b28b307d","resolution":{"observed_at":"2026-08-07T12:24:45.949460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:45.661493Z","title":"Bandits and experts in metric spaces","venue":null,"work_id":"66092213-6f22-40dc-8d13-c99a67790fb2","year":2019},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.559093Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:ab4169d57a717172a78c590aff60665a1b1798815a39e6638e5d86a6a4c8ad90","observation_id":"151de921-a3b4-4f79-9206-b4c88a5270f3","resolution":{"observed_at":"2026-08-07T12:24:45.745193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:45.459788Z","title":"Discounted ucb","venue":null,"work_id":"abb03080-1ae8-454f-af02-82da473a80f5","year":2006},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.631744Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:f93f4535f8b7f2ab4a401774d161607f43b45c460f4b6c6c2e464b96479b7b7e","observation_id":"7c0136ea-ea7a-4779-85e4-9d0d685165fd","resolution":{"observed_at":"2026-08-07T12:24:45.555187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1402.6028","last_updated":"2014-02-25T01:34:43Z","snapshot_observed_at":"2026-07-06T03:36:51.545768Z","submitted_at":"2014-02-25T01:34:43Z","title":"Algorithms for multi-armed bandit problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1402.6028","snapshot_observed_at":"2026-08-07T12:24:42.697694Z","title":"Algorithms for multi-armed bandit problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.697694Z"},"links":{"cited_paper":"/paper/1402.6028","citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:bf5b058e0453a530ca4666738ca8016175ecd6f9fa03a3b0aa821980b2e036aa","observation_id":"c0c28a75-8c3c-445f-862f-4788ab0a3681","resolution":{"observed_at":"2026-08-07T12:24:42.697694Z","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-07T12:24:45.291395Z","title":"L., and Robbins, H","venue":null,"work_id":"603abf88-9ccb-4cf2-9e2d-848231ad8734","year":1985},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.743002Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:58dc57297b28d6f2fb891a87463805accb41bb2956839d9ce6b6b0334197865c","observation_id":"a21c6c86-6417-4a64-a88f-4a2fdca87fbe","resolution":{"observed_at":"2026-08-07T12:24:45.364757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:45.119022Z","title":"Gstools v1","venue":null,"work_id":"af90f4f4-4817-4bac-9dec-36b2545ca4a9","year":2022},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.800656Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:8194fd9f188368a863f8b08d4beb1927e11c6d576d1c610a1be6d4006f2d6618","observation_id":"449e39b0-d1e0-4179-b903-c10ba198e0f0","resolution":{"observed_at":"2026-08-07T12:24:45.199423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.935673Z","title":"A.On estimating regression.Theory of Probability & Its Applications 9, 1 (1964), 141–142","venue":null,"work_id":"7fe5cf8c-562a-4e63-8c69-17848377a85b","year":1964},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.859572Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:63518b472792a2984160d9b47d9fc4e0271c10686c21e18de7e299773cb4a35e","observation_id":"17222e3b-3819-48c5-a4fd-53f5bbe35cc6","resolution":{"observed_at":"2026-08-07T12:24:45.017560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.804891Z","title":"Scikit-learn: Machine learning in python","venue":null,"work_id":"9ca67742-051f-439a-9089-f34e8d63e4a6","year":2011},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.893357Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:fa4725f0ac8c61f547b2b0d695a2b0d44281d619457c49bca0b661e2a42d861c","observation_id":"63cc9eb9-ca60-43d1-9de7-8db27646d3b0","resolution":{"observed_at":"2026-08-07T12:24:44.862858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.694861Z","title":"Weighted linear bandits for non- stationary environments","venue":null,"work_id":"95505292-8510-4020-b4c8-2c973f3f22c5","year":2019},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:42.951226Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:519aa5fe116b6447adc37b8da1b8f1e3dc97f0c8898a01f01bb67a81a3d701bc","observation_id":"15582aa4-190a-47dd-9aee-2e3c7bbe2c97","resolution":{"observed_at":"2026-08-07T12:24:44.733101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07146","last_updated":"2021-10-26T08:57:39Z","snapshot_observed_at":"2026-08-06T10:55:10.645410Z","submitted_at":"2020-08-17T08:23:50Z","title":"Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07146","snapshot_observed_at":"2026-08-07T12:24:43.002375Z","title":"arXiv preprint arXiv:2008.07146 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.002375Z"},"links":{"cited_paper":"/paper/2008.07146","citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:58055f35575161532ae3e47c3865ce676110d05333b6db004f22f3351a39ff2e","observation_id":"95017b36-248e-408d-b4cf-c8a980077298","resolution":{"observed_at":"2026-08-07T12:24:43.002375Z","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-07T12:24:44.602396Z","title":"Introduction to multi-armed bandits","venue":null,"work_id":"674b56a7-5f50-4b41-84d8-4abf6928e6db","year":2019},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.056492Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:6c175dac9ab4236f97392f91f1a2c76469b0368862ce7857f14220bcd4340b23","observation_id":"99c50395-233c-4fdc-8be9-496723785ecb","resolution":{"observed_at":"2026-08-07T12:24:44.644208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.429104Z","title":"Adapting to a changing environment: the brownian restless bandits","venue":null,"work_id":"e5849e7c-a54f-4d3c-8808-62be40aae407","year":2008},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.119453Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:b81fd4b7d7b9952d48249eb91d7cbdcea1aeae9b27ed79c2db7467ba58eb213a","observation_id":"a6bce740-bcfe-4048-a723-1868b513eb92","resolution":{"observed_at":"2026-08-07T12:24:44.492912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"0912.3995","last_updated":"2010-06-09T23:24:13Z","snapshot_observed_at":"2026-07-06T02:01:58.227489Z","submitted_at":"2009-12-21T00:08:19Z","title":"Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0912.3995","snapshot_observed_at":"2026-08-07T12:24:43.179280Z","title":"M., and Seeger, M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.179280Z"},"links":{"cited_paper":"/paper/0912.3995","citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:e6e33e2c03f45fed8ce5f7cb2ba2c4183c96da5cfb5c9e1412b48a49b781c99b","observation_id":"eacb2da3-ec29-45a0-8f32-f08cff2c9b9f","resolution":{"observed_at":"2026-08-07T12:24:43.179280Z","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-07T12:24:44.324883Z","title":"S., and Barto, A","venue":null,"work_id":"5959a9d6-e1ef-4ce8-9dc9-5861e6ef8a7d","year":1999},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.231569Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:3ea752fa1652e93c5932e5ba04cd7e9567b3be9d2222cf308186f62263b9ebc3","observation_id":"7a3f0650-590f-4f3d-afc1-f9f7a4098655","resolution":{"observed_at":"2026-08-07T12:24:44.372443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.202734Z","title":null,"venue":null,"work_id":"381d2e5c-5501-4589-9a0c-77f0f1f5857d","year":1933},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.279209Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:63f331884f94fbd0e204e4866f0a28dfbc4b1bc9b7a053f154b6b0d2a13b745f","observation_id":"6f623f2b-611c-4a66-acee-5e5abaf04a9e","resolution":{"observed_at":"2026-08-07T12:24:44.256375Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:44.058041Z","title":null,"venue":null,"work_id":"6cce8ec2-b589-432e-ad94-464dcf7263f2","year":1935},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.323682Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:54546266053f2aa966e58aab79440dd1f9181b1d92d4848ee7bd19f6c8bbeb87","observation_id":"7e8f5c9b-b018-4fcd-9c74-a178a2d9d7e3","resolution":{"observed_at":"2026-08-07T12:24:44.126389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:43.910734Z","title":"Optimal order simple regret for gaussian process bandits","venue":null,"work_id":"bcc89cc1-9cbd-4a25-8263-a308c4c67212","year":2021},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.357114Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:e6703f8d180521101e2da0377f642b6ba9714dd04a8f0ea4130c46ad4b2c48b2","observation_id":"476f6c08-b3df-49fd-90a4-9995d181ad44","resolution":{"observed_at":"2026-08-07T12:24:43.976407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:43.800113Z","title":"Bandit convex optimization in non-stationary environments","venue":null,"work_id":"5972e67b-cd2d-4b11-8a34-f736c94e661b","year":2021},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.408611Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:d66d6e1a6d90438b6f2bf874eb2d4b52899bc383dbf9dfe8c4f15ac183290a1a","observation_id":"ca761f29-aeee-41bf-bf45-031f8acba536","resolution":{"observed_at":"2026-08-07T12:24:43.848955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:43.691106Z","title":"A simple approach for non- stationary linear bandits","venue":null,"work_id":"06af161a-2e7e-4837-b069-a503a6afa382","year":2020},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.464632Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:a9626a670619ca8a49d972b65db61d13062e183b06e6737ce17eb41e1ddc25f4","observation_id":"95013b5c-5caa-4726-ba71-347ad82898aa","resolution":{"observed_at":"2026-08-07T12:24:43.749648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:24:43.633143Z","title":"No-regret algorithms for time-varying bayesian optimization","venue":null,"work_id":"699047b9-4760-4b10-b9ed-43d008172460","year":2021},"citing_paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T12:24:43.521214Z"},"links":{"citing_paper":"/paper/2505.24692"},"observation_digest":"sha256:920203e336b715e8eee1ea420de58d76f988e5f33eb49b4b6baa8693f7d3e407","observation_id":"cdd07967-2312-4fd9-8a21-f6bc3a63155f","resolution":{"observed_at":"2026-08-07T12:24:43.654495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.24692","last_updated":"2025-05-30T15:15:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T12:13:10.109357Z","submitted_at":"2025-05-30T15:15:18Z","title":"Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2505.24692."}