{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:18Z","timestamp":1773376998997,"version":"3.50.1"},"reference-count":17,"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":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}],"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":["62371411,6190115,12025104"],"award-info":[{"award-number":["62371411,6190115,12025104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100015956","name":"Key Area Research and Development Program of Guangdong Province","doi-asserted-by":"publisher","award":["2020B0101110003"],"award-info":[{"award-number":["2020B0101110003"]}],"id":[{"id":"10.13039\/501100015956","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.11195675","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":0,"title":["New Piggybacking Codes for Efficient Repair of Single-Node and Double-Node Erasures"],"prefix":"10.1109","author":[{"given":"Zhengyi","family":"Jiang","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}]},{"given":"Hao","family":"Shi","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}]},{"given":"Zhongyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Mathematical Sciences"}]},{"given":"Bo","family":"Bai","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs Huawei Tech. Co. Ltd.,Hong Kong"}]},{"given":"Gong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs Huawei Tech. Co. Ltd.,Hong Kong"}]},{"given":"Hanxu","family":"Hou","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs Huawei Tech. Co. Ltd.,Hong Kong"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Availability in Globally Distributed Storage Systems","volume-title":"Proc. of the 9th Usenix Symposium on Operating Systems Design and Implementation","author":"Ford"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553670"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/isit.2018.8437486"},{"key":"ref10","article-title":"Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization","author":"Hou","year":"1907","journal-title":"arXiv preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2939111"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2805347"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2941933"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518037"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834881"}],"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\/11195675.pdf?arnumber=11195675","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\/11195675\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195675","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}