{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:30Z","timestamp":1773376590113,"version":"3.50.1"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206523","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2290-2295","source":"Crossref","is-referenced-by-count":5,"title":["Weighted Graph Coloring for Quantized Computing"],"prefix":"10.1109","author":[{"given":"Derya","family":"Malak","sequence":"first","affiliation":[{"name":"EURECOM,Communication Systems Department,France,06904"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517963"},{"key":"ref35","first-page":"76","article-title":"Coloring hypergraphs: A new approach to multi-user source coding","volume":"4","author":"ahlswede","year":"1979","journal-title":"J Combin Des"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3052934"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055607"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127910"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056273"},{"key":"ref14","article-title":"Multi-user linearly-separable distributed computing","author":"khalesi","year":"2022"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.720537"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834771"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3157835"},{"key":"ref32","article-title":"Distributed mean estimation with limited communication","author":"suresh","year":"2017","journal-title":"Proc Int Conf Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611384"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref39","article-title":"Lattice coding increases multicast rates for gaussian multiple-access networks","author":"nazer","year":"2007","journal-title":"Proc Allerton Conf"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142373"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056560"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557136"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332464"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020566"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DCC47342.2020.00041"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3232222"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref42","author":"scheinerman","year":"2011","journal-title":"Fractional Graph Theory A Rational Approach to the Theory of Graphs"},{"key":"ref41","article-title":"Weighted graph coloring for quantized computing","year":"2023"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.532875"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref21","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","author":"k\u00f6rner","year":"1973","journal-title":"Proc 6th Prague Conf Inf Theory"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1201\/9780429438868"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055356"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3238888"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965814"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2999675"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112952"},{"key":"ref4","article-title":"Efficient replication for straggler mitigation in distributed computing","author":"behrouzi-far","year":"2020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref6","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc Int Conf Artificial Intelligence and Statistics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.046115"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206523.pdf?arnumber=10206523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:43Z","timestamp":1773347203000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206523","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}