{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:29Z","timestamp":1773377009185,"version":"3.50.1"},"reference-count":58,"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"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","award":["101077361"],"award-info":[{"award-number":["101077361"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195361","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":3,"title":["Non-Linear Function Computation Broadcast"],"prefix":"10.1109","author":[{"given":"Mohammad Reza Deylam","family":"Salehi","sequence":"first","affiliation":[{"name":"EURECOM,Communication Systems Department,France"}]},{"given":"Vijith Kumar Kizhakke","family":"Purakkal","sequence":"additional","affiliation":[{"name":"EURECOM,Communication Systems Department,France"}]},{"given":"Derya","family":"Malak","sequence":"additional","affiliation":[{"name":"EURECOM,Communication Systems Department,France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3277882"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2023.3264649"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2021.3105026"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3027003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869092"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_60"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/35.685371"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.62056\/av4fe0iuc"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2959760"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3392685"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3382257"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848850"},{"key":"ref17","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","volume-title":"Proc., Prague Conf. Inf. Theory","author":"K\u00f6rner"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055037"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195361"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(87)90013-6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.21236\/ada205784"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316332"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2192094"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130406"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref29","article-title":"Structured codes for distributed matrix multiplication","author":"Malak","year":"2025","journal-title":"arXiv preprint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055508"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056560"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871609"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1974.tb02812.x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2787182"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057272"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.532875"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332464"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3390\/e26060448"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton58177.2023.10313467"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC53906.2023.10304520"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton63246.2024.10735279"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CISS59072.2024.10480175"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TON.2024.3520530"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref47","article-title":"Spark: Cluster computing with working sets","volume-title":"Proc., USENIX HotTop Cloud Comp. Works.","author":"Zaharia"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112952"},{"key":"ref49","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc., Int. Conf. Machine Learn.","author":"Tandon"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3283967"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1561\/0100000094"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056588"},{"key":"ref54","first-page":"856","article-title":"Finding maximum independent sets in sparse and general graphs","volume-title":"Proc., SODA","volume":"99","author":"Beigel"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/0607062"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139030687"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057103"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885466"}],"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\/11195361.pdf?arnumber=11195361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:59Z","timestamp":1773347399000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":58,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195361","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}