{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:42Z","timestamp":1773377022661,"version":"3.50.1"},"reference-count":44,"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.11195588","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":["Optimal Moments on Redundancies in Job Cloning"],"prefix":"10.1109","author":[{"given":"Sahasrajit","family":"Sarmasarkar","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}]},{"given":"Harish","family":"Pillai","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Bombay"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-1809.1939.tb02219.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728433"},{"key":"ref3","volume-title":"Distributed computing AWS"},{"issue":"72","key":"ref4","first-page":"1","article-title":"Redundancy techniques for straggler mitigation in distributed optimization and learning","volume":"20","author":"Karakus","year":"2019","journal-title":"Journal of Machine Learning Research"},{"key":"ref5","article-title":"Straggler mitigation at scale","volume":"abs\/1906.10664","author":"Aktas","year":"2019","journal-title":"CoRR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"issue":"1","key":"ref7","article-title":"Coded computing","volume":"17","author":"Li","year":"2020","journal-title":"Foundations and Trends \u00ae in Communications and Information Theory"},{"key":"ref8","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research","volume":"70","author":"Tandon","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref10","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"Yu","year":"2017"},{"key":"ref11","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. PMLR","author":"Yu","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848034"},{"key":"ref14","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","volume-title":"10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13)","author":"Ananthanarayanan","year":"2013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2825236.2825258"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2005.347045"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592042"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref21","first-page":"337","article-title":"Partially balanced incomplete block designs","author":"Bose","year":"1939","journal-title":"Sankhy\u0101: The Indian fournal of Statistics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/2681737"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1046\/j.0039-0402.2003.00109.x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828144"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC49272.2021.9594170"},{"key":"ref27","article-title":"An application of incomplete block designs to the construction of error-correcting codes","author":"Smith","year":"1968","journal-title":"North Carolina State University. Dept. of Statistics, Tech. Rep."},{"key":"ref28","volume-title":"Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)","author":"Colbourn","year":"2006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176343002"},{"issue":"3","key":"ref30","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1214\/aoms\/1177706549","article-title":"A note on incomplete block designs","volume":"29","author":"Kshirsagar","year":"1958","journal-title":"The Annals of Mathematical Statistics"},{"issue":"3","key":"ref31","doi-asserted-by":"crossref","first-page":"701","DOI":"10.2307\/2336535","article-title":"Conditions for universal optimality of block designs","volume":"73","author":"Yeh","year":"1986","journal-title":"Biometrika"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.01.011"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/71.689446"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2000.840932"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1577"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/90.650143"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/233013.233034"},{"key":"ref38","first-page":"3","article-title":"Heavy-tailed probability distributions in the world wide web","volume":"1","author":"Crovella","year":"1998","journal-title":"A practical guide to heavy tails"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-27727-7_1"},{"key":"ref40","article-title":"On partial maximally-recoverable and maximally-recoverable codes","volume-title":"CoRR","volume":"abs\/1501.07130","author":"Babu","year":"2015"},{"issue":"3","key":"ref41","first-page":"229","article-title":"Flexible forward error correction codes with application to partial media data recovery","volume":"24","author":"Korhonen","year":"2009","journal-title":"Signal Processing: Image Communication"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3133791"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3230779"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"}],"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\/11195588.pdf?arnumber=11195588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:06Z","timestamp":1773347406000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195588\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195588","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}