{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:20:13Z","timestamp":1777044013033,"version":"3.51.4"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195276","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"01-06","source":"Crossref","is-referenced-by-count":2,"title":["Collaborative Coded Caching for Partially Connected Networks"],"prefix":"10.1109","author":[{"given":"Kagan","family":"Akcay","sequence":"first","affiliation":[{"name":"Technische Universitt Berlin,Electrical Engineering and Computer Science Department,Berlin,Germany,10587"}]},{"given":"Eleftherios","family":"Lampiris","sequence":"additional","affiliation":[{"name":"Technische Universitt Berlin,Electrical Engineering and Computer Science Department,Berlin,Germany,10587"}]},{"given":"MohammadJavad","family":"Salehi","sequence":"additional","affiliation":[{"name":"University of Oulu,Centre for Wireless Communications,Oulu,Finland,90570"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technische Universitt Berlin,Electrical Engineering and Computer Science Department,Berlin,Germany,10587"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS.2016.7502842"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2614722"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2669942"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2909240"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989128"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3193723"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206827"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2888615"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2844960"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955384"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3061678"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10437939"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF59524.2023.10477062"},{"issue":"3","key":"ref16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","article-title":"An automatic method of solving discrete programming problems","volume":"28","author":"Land","year":"1960","journal-title":"Econometrica"},{"issue":"2","key":"ref17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(89)90032-X","article-title":"An lc branch-and-bound algorithm for the module assignment problem","volume":"32","author":"Chern","year":"1989","journal-title":"Information Processing Letters"},{"key":"ref18","volume-title":"Combinatorial optimization","volume":"1","author":"Korte","year":"2011"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2016.7606851"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849515"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2947438"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3416888"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248916"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2599110"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007038"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006726"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195276","volume-title":"Collaborative coded caching for partially connected networks","author":"Akcay","year":"2025"},{"key":"ref30","volume-title":"Graph theory","author":"Diestel","year":"2024"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2877684"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195276.pdf?arnumber=11195276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:53Z","timestamp":1773347393000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195276\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195276","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}