{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T04:32:39Z","timestamp":1768797159489,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tit.2024.3425808","type":"journal-article","created":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T17:25:20Z","timestamp":1720632320000},"page":"7723-7739","source":"Crossref","is-referenced-by-count":3,"title":["Access-Redundancy Tradeoffs in Quantized Linear Computations"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5223-5643","authenticated-orcid":false,"given":"Vinayak","family":"Ramkumar","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1686-1994","authenticated-orcid":false,"given":"Netanel","family":"Raviv","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering-Systems, Tel Aviv University, Tel Aviv, Israel"}]}],"member":"263","reference":[{"key":"ref1","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref2","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Yu"},{"key":"ref3","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref4","volume-title":"Covering Codes","author":"Cohen","year":"1997"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81645-2_25"},{"key":"ref6","first-page":"1782","article-title":"Efficient exact verification of binarized neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Jia"},{"key":"ref7","first-page":"8880","article-title":"Enhancing robustness of neural networks through Fourier stabilization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Raviv"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834464"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/12.737680"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813498"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3115433"},{"key":"ref12","article-title":"Attacking binarized neural networks","author":"Galloway","year":"2017","journal-title":"arXiv:1711.00449"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.45285"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2385084"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057227"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/08073408x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849547"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322305"},{"key":"ref19","first-page":"20","article-title":"Tight bounds for the partial-sums problem","volume-title":"Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Patrascu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73848"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.11"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126797"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1822"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7283004"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619536"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1946.11991722"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.37236\/32"},{"key":"ref35","volume":"16","author":"MacWilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3158762"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206543"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2023.105834"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10736150\/10592068.pdf?arnumber=10592068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T23:30:50Z","timestamp":1732663850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10592068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":38,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3425808","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}