{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:10Z","timestamp":1773376930031,"version":"3.50.1"},"reference-count":43,"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"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2021YFA1001000"],"award-info":[{"award-number":["2021YFA1001000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12231014"],"award-info":[{"award-number":["12231014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195655","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Lower Bounds on the Sub-Packetization of Optimal-Access Msr Codes for Multiple-Node Repair"],"prefix":"10.1109","author":[{"given":"Lewen","family":"Wang","sequence":"first","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Qingdao,China,266237"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihao","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Qingdao,China,266237"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihuang","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Shandong University,Qingdao,China,266237"}],"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.2014.2309000"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316387"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112286"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3180034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref7","article-title":"An explicit, coupled-layer construction of a high-rate msr code with low sub-packetization level, small field size and all-node repair","volume-title":"ArXiv","volume":"abs\/1607.07335","author":"Sasidharan","year":"2016"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3432822"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250458"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref12","first-page":"139","article-title":"Clay codes: Moulding MDS codes to yield an MSR code","volume-title":"16th USENIX Conference on File and Storage Technologies (FAST 18)","author":"Vajha"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.28"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2658660"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-021-00526-3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1561\/0100000115"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2633411"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006922"},{"key":"ref24","article-title":"Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures","author":"Ye","year":"2017","journal-title":"arXiv preprint arXiv"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871451"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437474"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100216"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962548"},{"key":"ref31","first-page":"316","article-title":"Cooperative repair with minimum-storage regenerating codes for distributed storage","volume-title":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","author":"Li"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079495"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2898660"},{"key":"ref35","article-title":"A new centralized multinode repair scheme of MSR codes with error-correcting capability","author":"Li","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref36","article-title":"New centralized MSR codes with small sub-packetization","author":"Zhang","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2856206"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2972899"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3008342"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3234273"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3542118"},{"key":"ref42","article-title":"A cooperative repair scheme for Zigzag MSR codes in distributed storage systems","author":"Liu","year":"2025","journal-title":"arXiv preprint arXiv"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195655"}],"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\/11195655.pdf?arnumber=11195655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:25Z","timestamp":1773347365000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195655\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195655","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}