{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:25Z","timestamp":1773377005524,"version":"3.50.1"},"reference-count":45,"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.11195221","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":1,"title":["Lagrange Coding for Tensor Network Contraction: Achieving Polynomial Recovery Thresholds"],"prefix":"10.1109","author":[{"given":"Kerong","family":"Wang","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara,Department of Electrical and Computer Engineering,Santa Barbara,CA,USA"}]},{"given":"Zheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara,Department of Electrical and Computer Engineering,Santa Barbara,CA,USA"}]},{"given":"Qian","family":"Yu","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara,Department of Electrical and Computer Engineering,Santa Barbara,CA,USA"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Coded computing: A transformative framework for resilient, secure, private, and communication efficient large scale distributed computing","author":"Yu","year":"2020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849245"},{"key":"ref3","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume-title":"Advances in Neural Information Processing Systems 30","author":"Yu","year":"2017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref5","author":"Chen","year":"2019","journal-title":"Secure computation for machine learning with spdz"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref7","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Yu","year":"2019"},{"key":"ref8","author":"Li","year":"2018","journal-title":"Polynomially coded regression: Optimal straggler mitigation via data encoding"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/9781680837056"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2927558"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.128.030501"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/050644756"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.22331\/q-2023-03-30-964"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619404"},{"key":"ref19","author":"Boixo","year":"2017","journal-title":"Simulation of low-depth quantum circuits as complex undirected graphical models"},{"key":"ref20","author":"Aaronson","year":"2016","journal-title":"Complexity-theoretic foundations of quantum supremacy experiments"},{"key":"ref21","author":"Efthymiou","year":"2019","journal-title":"Tensornetwork for machine learning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949814"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/17M1135578"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.36"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref26","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"Wang","year":"2018","journal-title":"ICML"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3070723"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3097380"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2925723"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3071563"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3140890"},{"key":"ref33","article-title":"Parallelized stochastic gradient descent","volume":"23","author":"Zinkevich","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5412-3_8"},{"key":"ref35","article-title":"(california State University Renteln (San Bernardino))","volume-title":"Manifolds, Tensors, and Forms-an Introduction for Mathematicians and Phys.","author":"P.","year":"2013"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2022.806549"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01409-4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-019-0086-7"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511976667"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay009"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-021-00119-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-05-09-709"},{"key":"ref43","author":"Chen","year":"2018","journal-title":"Classical simulation of intermediate-size quantum circuits"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3032196"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195221"}],"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\/11195221.pdf?arnumber=11195221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:55Z","timestamp":1773347395000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195221","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}