{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:15Z","timestamp":1773376755274,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619528","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"1041-1046","source":"Crossref","is-referenced-by-count":1,"title":["Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions"],"prefix":"10.1109","author":[{"given":"Zhengyi","family":"Jiang","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linqi","family":"Song","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Bai","sequence":"additional","affiliation":[{"name":"Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab,Hong Kong,SAR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab,Hong Kong,SAR"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanxu","family":"Hou","sequence":"additional","affiliation":[{"name":"Central Research Institute, 2012 Labs, Huawei Tech. Co. Ltd.,Theory Lab,Hong Kong,SAR"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10436803"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2944397"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3105439"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037161"},{"key":"ref15","volume-title":"Optimal oblivious updates in distributed storage networks","author":"Nakkiran","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865750"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2991021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM42981.2021.9488813"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174250"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10437570"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902835"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174461"},{"key":"ref23","article-title":"Erasure Coding in Windows Azure Storage","volume-title":"Usenix Conference on Technical Conference","author":"Huang","year":"2012"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619528.pdf?arnumber=10619528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:06Z","timestamp":1773347286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619528","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}