{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T05:44:23Z","timestamp":1777009463420,"version":"3.51.4"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372247"],"award-info":[{"award-number":["62372247"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"open research fund of National Mobile Communications Research Laboratory"},{"DOI":"10.13039\/501100008081","name":"Southeast University","doi-asserted-by":"publisher","award":["2025D01"],"award-info":[{"award-number":["2025D01"]}],"id":[{"id":"10.13039\/501100008081","id-type":"DOI","asserted-by":"publisher"}]},{"name":"open research fund of State Key Laboratory of Cyberspace Security Defense","award":["2025-MS-03"],"award-info":[{"award-number":["2025-MS-03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tr.2026.3682357","type":"journal-article","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T19:45:12Z","timestamp":1775763912000},"page":"1656-1664","source":"Crossref","is-referenced-by-count":0,"title":["Locally Repairable Codes Constructed From Attention Model"],"prefix":"10.1109","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7234-9119","authenticated-orcid":false,"given":"Yansheng","family":"Wu","sequence":"first","affiliation":[{"name":"School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5344-0708","authenticated-orcid":false,"given":"Tongfan","family":"Ji","sequence":"additional","affiliation":[{"name":"School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Ma","sequence":"additional","affiliation":[{"name":"HiSilicon (Shanghai) Technologies Company Ltd., Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1255-5815","authenticated-orcid":false,"given":"Weibei","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3486-2476","authenticated-orcid":false,"given":"Gongzhi","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Management, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.232"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2017.7926071"},{"key":"ref5","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2951403"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541338"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3322174"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3307142"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01099-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020516"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545038"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3087352"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3439408"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref20","first-page":"5998","article-title":"Attention is all you need","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"30","author":"Vaswani","year":"2017"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref22","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume":"12","author":"Sutton","year":"2000","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm52983.2022.9961033"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2986752"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3273413"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24818\/ida-ql\/2019.5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2010.11929"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812370"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref31","first-page":"1","article-title":"Neural Machine Translation by Jointly Learning to Align and Translate","volume-title":"Proc. ICLR","author":"Bahdanau","year":"2015"},{"key":"ref32","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","author":"Kwon","year":"2021"},{"key":"ref33","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/24\/11317936\/11478349.pdf?arnumber=11478349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T04:59:40Z","timestamp":1777006780000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11478349\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/tr.2026.3682357","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}