{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T14:45:46Z","timestamp":1758811546951,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543873.3587574","type":"proceedings-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T11:36:14Z","timestamp":1682681774000},"page":"1183-1189","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Improving the Exploration\/Exploitation Trade-Off in Web Content Discovery"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3515-026X","authenticated-orcid":false,"given":"Peter","family":"Schulam","sequence":"first","affiliation":[{"name":"Amazon Alexa, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-9797-7014","authenticated-orcid":false,"given":"Ion","family":"Muslea","sequence":"additional","affiliation":[{"name":"Amazon Alexa, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498837"},{"key":"e_1_3_2_1_2_1","volume-title":"Finite-time analysis of the multiarmed bandit problem. Machine learning 47, 2","author":"Auer Peter","year":"2002","unstructured":"Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning 47, 2 (2002), 235\u2013256."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3998\/3336451.0007.104"},{"key":"e_1_3_2_1_4_1","volume-title":"How dynamic is the Web?Computer Networks 33, 1-6","author":"Brewington E","year":"2000","unstructured":"Brian\u00a0E Brewington and George Cybenko. 2000. How dynamic is the Web?Computer Networks 33, 1-6 (2000), 257\u2013276."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.06.008"},{"key":"e_1_3_2_1_6_1","volume-title":"An empirical evaluation of Thompson sampling. Advances in neural information processing systems 24","author":"Chapelle Olivier","year":"2011","unstructured":"Olivier Chapelle and Lihong Li. 2011. An empirical evaluation of Thompson sampling. Advances in neural information processing systems 24 (2011)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958945"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50052-4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<15::AID-JOS3>3.0.CO;2-K"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242630"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0328-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2520246"},{"key":"e_1_3_2_1_13_1","volume-title":"Staying up to date with online content changes using reinforcement learning for scheduling. Advances in Neural Information Processing Systems 32","author":"Kolobov Andrey","year":"2019","unstructured":"Andrey Kolobov, Yuval Peres, Cheng Lu, and Eric\u00a0J Horvitz. 2019. Staying up to date with online content changes using reinforcement learning for scheduling. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505641"},{"key":"e_1_3_2_1_15_1","volume-title":"Web crawling. Foundations and Trends\u00ae in Information Retrieval 4, 3","author":"Olston Christopher","year":"2010","unstructured":"Christopher Olston and Marc Najork. 2010. Web crawling. Foundations and Trends\u00ae in Information Retrieval 4, 3 (2010), 175\u2013246."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367557"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159724"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433448"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680834710"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526842"},{"key":"e_1_3_2_1_21_1","unstructured":"Matt Southern. 2022. Google Considers Reducing Webpage Crawl Rate. https:\/\/www.searchenginejournal.com\/google-crawl-rate\/434265\/. Accessed: 2022-02-03."},{"volume-title":"Reinforcement learning: An introduction","author":"Sutton S","key":"e_1_3_2_1_22_1","unstructured":"Richard\u00a0S Sutton and Andrew\u00a0G Barto. 2018. Reinforcement learning: An introduction. MIT press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371219"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Austin TX USA","acronym":"WWW '23"},"container-title":["Companion Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587574","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543873.3587574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T23:37:16Z","timestamp":1755819436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543873.3587574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":24,"alternative-id":["10.1145\/3543873.3587574","10.1145\/3543873"],"URL":"https:\/\/doi.org\/10.1145\/3543873.3587574","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}