{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:56Z","timestamp":1773376676271,"version":"3.50.1"},"reference-count":50,"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.10206636","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2386-2391","source":"Crossref","is-referenced-by-count":6,"title":["Learning to Code on Graphs for Topological Interference Management"],"prefix":"10.1109","author":[{"given":"Zhiwei","family":"Shan","sequence":"first","affiliation":[{"name":"University of Liverpool,Liverpool,England,L69 3GJ"}]},{"given":"Xinping","family":"Yi","sequence":"additional","affiliation":[{"name":"University of Liverpool,Liverpool,England,L69 3GJ"}]},{"given":"Han","family":"Yu","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology,Gothenburg,Sweden,SE41296"}]},{"given":"Chung-Shou","family":"Liao","sequence":"additional","affiliation":[{"name":"National Tsing Hua University,Hsinchu,Taiwan,30013"}]},{"given":"Shi","family":"Jin","sequence":"additional","affiliation":[{"name":"Southeast University,Nanjing,China,210096"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2931319"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2795019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006768"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2837880"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.072813.131107"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875137"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2533488"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2714699"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.2385851"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2544758"},{"key":"ref50","article-title":"Gurobi Optimizer Reference Manual","year":"2022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.21136\/CPM.1955.108220"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421354"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206636"},{"key":"ref41","article-title":"How powerful are graph neural networks?","author":"xu","year":"2019","journal-title":"International Conference on Learning Representations"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2948638"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2792045"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3216632"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691291"},{"key":"ref3","article-title":"Topological interference management with alternating connectivity: The Wyner-type three user interference channel","author":"gherekhloo","year":"2013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2479857"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3102623"},{"key":"ref40","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"International Conference on Learning Representations"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.03.006"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"ref37","first-page":"134","article-title":"Learning what to defer for maximum independent sets","author":"ahn","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874841"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620407"},{"key":"ref33","author":"deo","year":"2006","journal-title":"Discrete Optimization Algorithms with PASCAL Programs"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620256"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2285151"},{"key":"ref39","article-title":"Inductive representation learning on large graphs","volume":"30","author":"hamilton","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref38","article-title":"Proximal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"arXiv 1707 06347"},{"key":"ref24","article-title":"Turbo autoencoder: Deep learning based channel codes for point-to-point communication channels","volume":"32","author":"jiang","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2986752"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517735"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3010964"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2387162"},{"key":"ref22","article-title":"Communication algorithms via deep learning","author":"kim","year":"2018","journal-title":"International Conference on Learning Representations"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3186238"},{"key":"ref28","first-page":"8577","article-title":"Factor graph neural networks","volume":"33","author":"zhang","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685430"},{"key":"ref29","first-page":"685","article-title":"Neural enhanced belief propagation on factor graphs","author":"satorras","year":"2021","journal-title":"International Conference on Artificial Intelligence and Statistics"}],"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\/10206636.pdf?arnumber=10206636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:35Z","timestamp":1773347255000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206636\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206636","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}