{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:10Z","timestamp":1773376990851,"version":"3.50.1"},"reference-count":36,"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.11195429","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":1,"title":["Unfolding FPLinQ with Graph Reinforcement Learning for D2D Spectrum Sharing"],"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":"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"}]},{"given":"Giuseppe","family":"Caire","sequence":"additional","affiliation":[{"name":"Technical University of Berlin,Berlin,Germany,10623"}]}],"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.2582818"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2432751"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536671"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2499189"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628376"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2578439"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2913633"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3001219"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2937119"},{"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\/ACSSC.2015.7421354"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006944"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2147784"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904352"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3040983"},{"key":"ref18","article-title":"GRLinQ: An intelligent spectrum sharing mechanism for device-to-device communications with graph reinforcement learning","author":"Shan","year":"2024","journal-title":"arXiv preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3091551"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3219840"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036965"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3071480"},{"key":"ref23","article-title":"A deep unfolding-based scalarization approach for power control in D2D networks","author":"Hauffen","year":"2024","journal-title":"arXiv preprint"},{"key":"ref24","volume-title":"DeepFP: Deep-unfolded fractional programming for massive MIMO beamforming","author":"Zhu","year":"2025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2812748"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-022-09327-y"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3033334"},{"key":"ref28","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref29","first-page":"134","article-title":"Learning what to defer for maximum independent sets","volume-title":"International Conference on Machine Learning","author":"Ahn","year":"2020"},{"key":"ref30","article-title":"Asynchronous methods for deep reinforcement learning","author":"Mnih","year":"2016","journal-title":"arXiv preprint"},{"key":"ref31","first-page":"399","article-title":"Learning fast approximations of sparse coding","volume-title":"Proceedings of the 27th international conference on international conference on machine learning","author":"Gregor","year":"2010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2019.2941271"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3016905"},{"key":"ref34","article-title":"Prox-imal policy optimization algorithms","author":"Schulman","year":"2017","journal-title":"arXiv preprint"},{"key":"ref35","article-title":"How powerful are graph neural networks?","volume-title":"International Conference on Learning Representations","author":"Xu","year":"2019"},{"key":"ref36","article-title":"International Telecommunication Union","volume-title":"Recommendation ITU-R P.1411-8","year":"2015"}],"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\/11195429.pdf?arnumber=11195429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:50Z","timestamp":1773347390000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195429","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}