{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T17:51:56Z","timestamp":1776275516901,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619551","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"2436-2441","source":"Crossref","is-referenced-by-count":5,"title":["GRLinQ: A Distributed Link Scheduling Mechanism with Graph Reinforcement Learning"],"prefix":"10.1109","author":[{"given":"Zhiwei","family":"Shan","sequence":"first","affiliation":[{"name":"University of Liverpool,Liverpool,England,L69 3GJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinping","family":"Yi","sequence":"additional","affiliation":[{"name":"Southeast University,Nanjing,China,210096"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Liang","sequence":"additional","affiliation":[{"name":"Southeast University,Nanjing,China,210096"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Shou","family":"Liao","sequence":"additional","affiliation":[{"name":"National Tsing Hua University,Hsinchu,Taiwan,30013"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi","family":"Jin","sequence":"additional","affiliation":[{"name":"Southeast University,Nanjing,China,210096"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408342"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2578439"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2582818"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2432751"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536671"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499189"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913633"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937119"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3001219"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628376"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2264633"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328102"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006944"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904352"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3040983"},{"key":"ref16","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","first-page":"134","article-title":"Learning what to defer for maximum independent sets","volume-title":"International Conference on Machine Learning. PMLR","author":"Ahn","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206636"},{"key":"ref19","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14711\/thesis-991012757468803412"},{"key":"ref21","article-title":"How powerful are graph neural networks?","volume-title":"International Conference on Learning Representations","author":"Xu","year":"2019"},{"key":"ref22","article-title":"Recommendation itu-r p.1411\u20138","volume-title":"International Telecommunication Union","year":"2015"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619551.pdf?arnumber=10619551","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:24Z","timestamp":1773347304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619551\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619551","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}