{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T05:11:18Z","timestamp":1735708278861,"version":"3.32.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,24]],"date-time":"2024-11-24T00:00:00Z","timestamp":1732406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"SERB","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,11,24]]},"DOI":"10.1109\/itw61385.2024.10806966","type":"proceedings-article","created":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T19:18:57Z","timestamp":1735586337000},"page":"85-90","source":"Crossref","is-referenced-by-count":0,"title":["On the Regret of Coded Caching with Adversarial Requests"],"prefix":"10.1109","author":[{"given":"Anupam","family":"Nayak","sequence":"first","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kota Srinivas","family":"Reddy","sequence":"additional","affiliation":[{"name":"IIT Madras"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"IIT Bombay"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref2","article-title":"O\u2019Reilly Media, Inc","author":"Wessels","year":"2001","journal-title":"Web caching"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2317316"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2664817"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2557804"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2768517"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3179266"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282746"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2639522"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2930692"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2695611"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3150336"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053372"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2765503"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036313"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940885"},{"volume-title":"Bandit algorithms","year":"2017","author":"Lattimore","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394482"},{"key":"ref20","article-title":"Decentralized and online coded caching with shared caches: Fundamental limits with uncoded prefetching","author":"Peter","year":"2021","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/NCC60321.2024.10485776"},{"key":"ref22","first-page":"1034","article-title":"Following the perturbed leader for online structured learning","volume-title":"International Conference on Machine Learning","author":"Cohen"},{"article-title":"Online linear optimization via smoothing","volume-title":"Conference on Learning Theory","author":"Abernethy","key":"ref23"},{"key":"ref24","first-page":"928","article-title":"Online convex programming and generalized infinitesi-mal gradient ascent","volume-title":"Proceedings of the 20th international conference on machine learning (icml-03)","author":"Zinkevich"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737446"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815445"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2968424"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500487"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-31234-2_9"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517925"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3392143"},{"key":"ref32","article-title":"Leadcache: Regret-optimal caching in networks","author":"Paria","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3126663"},{"volume-title":"On the regret of coded caching problem with adversarial requests","author":"Nayak","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"}],"event":{"name":"2024 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2024,11,24]]},"location":"Shenzhen, China","end":{"date-parts":[[2024,11,28]]}},"container-title":["2024 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10806859\/10806904\/10806966.pdf?arnumber=10806966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T06:41:04Z","timestamp":1735627264000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10806966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,24]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/itw61385.2024.10806966","relation":{},"subject":[],"published":{"date-parts":[[2024,11,24]]}}}