{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:06Z","timestamp":1773377046420,"version":"3.50.1"},"reference-count":33,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195452","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":["Order Optimal Cascaded Coded Distributed Computing with Low Complexity and Improved Flexibility"],"prefix":"10.1109","author":[{"given":"Mingming","family":"Zhang","sequence":"first","affiliation":[{"name":"Guangxi Normal University,Guilin,China"}]},{"given":"Youlong","family":"Wu","sequence":"additional","affiliation":[{"name":"ShanghaiTech University,Shanghai,China"}]},{"given":"Dianhua","family":"Wu","sequence":"additional","affiliation":[{"name":"Guangxi Normal University,Guilin,China"}]},{"given":"Minquan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Guangxi Normal University,Guilin,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2587645"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2248487.2150984"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018448"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996730"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3020549"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485811"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174132"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2992989"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2999675"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322245"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457580"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3087628"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3049821"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3095040"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2020.3030667"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2021.3098593"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3054906"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3158828"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10001706"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2021.3091684"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3373128"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10160235"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3238373"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3043825"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3087788"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3211932"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2024.3372698"},{"key":"ref30","article-title":"Sharper asymptotically optimal cdc schemes via combinatorial designs","author":"Cheng","year":"2023","journal-title":"arXiv preprint"},{"key":"ref31","article-title":"A construction of asymptotically optimal cascaded cdc schemes via combinatorial designs","author":"Cheng","year":"2023","journal-title":"arXiv preprint"},{"key":"ref32","article-title":"Cascaded coded distributed computing with low complexity and improved flexibility","author":"Zhang","year":"2025","journal-title":"arXiv preprint"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/e23080985"}],"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\/11195452.pdf?arnumber=11195452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:17Z","timestamp":1773347417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195452","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}