{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T15:38:56Z","timestamp":1782833936055,"version":"3.54.5"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003452","name":"Innovation and Technology Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003452","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571389","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Caching for Dynamic Content Through Strategic Information Sharing"],"prefix":"10.1109","author":[{"given":"Guocong","family":"Quan","sequence":"first","affiliation":[{"name":"Sun Yat-Sen University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojun","family":"Lin","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522722"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"ref3","first-page":"385","article-title":"Scaling Memcache at Facebook","volume-title":"10th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Nishtala"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/511399.511340"},{"key":"ref5","first-page":"483","article-title":"AdaptSize: Orchestrating the hot object memory cache in a content delivery network","volume-title":"14th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Berger"},{"key":"ref6","article-title":"Greedydual-size: A cost-aware WWW proxy caching algorithm","volume-title":"2nd Web Caching Workshop","author":"Cao"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3015474"},{"key":"ref8","first-page":"1","article-title":"Caching policies over unreliable channels","volume-title":"2020 18th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT)","author":"Sena"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575718"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3640457.3688037"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3600006.3613142"},{"key":"ref12","author":"Zhou","year":"2024","journal-title":"ERCache: An efficient and reliable caching framework for large-scale user representations in meta\u2019s ads system"},{"key":"ref13","author":"Liu","year":"2022","journal-title":"Monolith: Real time recommendation system with collisionless embedding table"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835896"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107000"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539300"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1033"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622195"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.3390\/en14020436"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006506"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488731"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3352029"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MASS62177.2024.00040"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1239\/aap\/1444308876"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3369611"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2307\/3214163"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2307\/3214547"},{"key":"ref28","article-title":"Dynamic programming and optimal control 3rd edition, volume ii","volume":"1","author":"Bertsekas","year":"2007","journal-title":"Belmont, MA: Athena Scientific"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621350"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1109\/INFOCOM59046.2026.11571389","article-title":"Optimal caching for dynamic content through strategic information sharing","volume-title":"Technical Report, The Chinese University of Hong Kong","author":"Quan","year":"2026"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/apr.2021.61"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/15-AAP1137"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467030"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2908557"},{"key":"ref36","volume":"abs\/1906.00091","author":"Naumov","year":"2019","journal-title":"Deep learning recommendation model for personalization and recommendation systems"},{"key":"ref37","volume-title":"Criteo 1TB click logs dataset"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571389.pdf?arnumber=11571389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:12:26Z","timestamp":1782796346000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571389","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}