{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:54:19Z","timestamp":1764658459516,"version":"3.46.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["AMPS-2229075"],"award-info":[{"award-number":["AMPS-2229075"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100030807","name":"Commonwealth Cyber Initiative","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100030807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,30]]},"DOI":"10.1109\/qce65121.2025.10318","type":"proceedings-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:22:52Z","timestamp":1764613372000},"page":"193-198","source":"Crossref","is-referenced-by-count":0,"title":["RELIC: Reinforcement Learning Based Ising Optimization via Graph Compression"],"prefix":"10.1109","author":[{"given":"Duy Do","family":"Le","sequence":"first","affiliation":[{"name":"Independent Researcher,Hanoi,Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Truong-Son","family":"Hy","sequence":"additional","affiliation":[{"name":"The University of Alabama at Birmingham,Department of Computer Science,Birmingham,AL,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thang N.","family":"Dinh","sequence":"additional","affiliation":[{"name":"Virginia Commonwealth University,Department of Computer Science,Richmond,VA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Computers and intractability: A guide to the theory of np-completeness","year":"1979","author":"Gary","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1364\/OE.27.010288"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00468-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.043131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abe7953"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612354"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383203"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/QCE53715.2022.00030"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i11.33235"},{"key":"ref12","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"Li","year":"2018","journal-title":"Neural Information Processing Systems"},{"key":"ref13","article-title":"Exact combinatorial optimization with graph convolutional neural networks","author":"Gasse","year":"2019","journal-title":"Neural Information Processing Systems"},{"key":"ref14","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","volume":"abs\/1906.01227","author":"Joshi","year":"2019","journal-title":"ArXiv"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3636"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00589-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00587-0"},{"journal-title":"Learning Combinatorial Optimization Algorithms over Graphs","year":"2018","author":"Dai","key":"ref18"},{"journal-title":"Neural Combinatorial Optimization with Reinforcement Learning","year":"2017","author":"Bello","key":"ref19"},{"journal-title":"Attention, Learn to Solve Routing Problems!","year":"2019","author":"Kool","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref22","article-title":"Graph Reinforcement Learning for Combinatorial Optimization: A Survey and Unifying Perspective","author":"Darvariu","year":"2024","journal-title":"Transactions on Machine Learning Research"}],"event":{"name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","start":{"date-parts":[[2025,8,30]]},"location":"Albuquerque, NM, USA","end":{"date-parts":[[2025,9,5]]}},"container-title":["2025 IEEE International Conference on Quantum Computing and Engineering (QCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11249812\/11249815\/11250082.pdf?arnumber=11250082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:50:56Z","timestamp":1764658256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/qce65121.2025.10318","relation":{},"subject":[],"published":{"date-parts":[[2025,8,30]]}}}