{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T19:00:54Z","timestamp":1763146854556,"version":"3.45.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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":["61901267"],"award-info":[{"award-number":["61901267"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tcomm.2025.3585701","type":"journal-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T13:28:15Z","timestamp":1751549295000},"page":"11031-11044","source":"Crossref","is-referenced-by-count":0,"title":["On the Fundamental Limits of Decentralized Linearly Separable Computation Under Cyclic Assignment"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4308-8650","authenticated-orcid":false,"given":"Haoning","family":"Chen","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0360-0610","authenticated-orcid":false,"given":"Minquan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Key Laboratory of Education Blockchain and Intelligent Technology, Ministry of Education, and Guangxi Key Laboratory of Multi-Source Information Mining and Security, Guangxi Normal University, Guilin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4383-9995","authenticated-orcid":false,"given":"Youlong","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, ShanghaiTech University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619632"},{"volume-title":"Amazon Web Services","year":"2015","author":"Amazon","key":"ref2"},{"volume-title":"Cloud Architecture Patterns: Using Microsoft Azure","year":"2012","author":"Wilder","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-4470-8"},{"key":"ref5","first-page":"10","article-title":"Spark: Cluster computing with working sets","volume-title":"Proc. 2nd USENIX Workshop Hot Topics Cloud Comput.","author":"Zaharia"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3091684"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref10","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref11","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ye"},{"key":"ref12","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457580"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685364"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3238373"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM54140.2023.10437745"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3372698"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127910"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3107432"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206661"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142373"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619573"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3122873"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1201\/9781315365459"},{"key":"ref27","article-title":"Vers: Fully distributed coded computing system with distributed encoding","author":"Abadi Khooshemehr","year":"2023","journal-title":"arXiv:2304.05691"},{"key":"ref28","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. ACM NIPS","author":"Lian"},{"article-title":"Fully-decentralized coded computing for reliable large-scale computing","year":"2020","author":"Jeong","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504556"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619632"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11245648\/11071361.pdf?arnumber=11071361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T18:49:42Z","timestamp":1763146182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11071361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":32,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2025.3585701","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"type":"print","value":"0090-6778"},{"type":"electronic","value":"1558-0857"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}