{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T18:12:06Z","timestamp":1760724726637,"version":"build-2065373602"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,15]]},"DOI":"10.1109\/hpec67600.2025.11196625","type":"proceedings-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T17:35:37Z","timestamp":1760636137000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks"],"prefix":"10.1109","author":[{"given":"Hanjing","family":"Xu","sequence":"first","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,Indiana,USA"}]},{"given":"Xiaoyuan","family":"Liu","sequence":"additional","affiliation":[{"name":"Fujitsu Research of America,Santa Clara,California,USA"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Computer Science,West Lafayette,Indiana,USA"}]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[{"name":"University of Delaware,Department of Computer and Information Sciences,Newark,Delaware,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-023-00603-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.8b00803"},{"issue":"6","key":"ref3","first-page":"18","article-title":"A hybrid approach for solving optimization problems on small quantum computers","volume-title":"Computer","volume":"52","author":"Shaydulin","year":"2019"},{"issue":"7671","key":"ref4","first-page":"195","article-title":"Quantum machine learning","volume-title":"Nature","volume":"549","author":"Biamonte","year":"2017"},{"article-title":"A quantum approximate optimization algorithm","year":"2014","author":"Farhi","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-024-00770-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.104.052419"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8c2b"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-021-03342-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00034"},{"article-title":"For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances","year":"2018","author":"Brandao","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.111.022418"},{"article-title":"Cross-problem parameter transfer in quantum approximate optimization algorithm: A machine learning approach","volume-title":"Proceedings of IEEE Quantum Computing and Engineering","author":"Nguyen","key":"ref13"},{"article-title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","volume-title":"Proceedings of IEEE Quantum Computing and Engineering","author":"Tyagin","key":"ref14"},{"article-title":"Graph attention networks","year":"2017","author":"Veli\u010dkovi\u0107","key":"ref15"},{"article-title":"How attentive are graph attention networks?","year":"2021","author":"Brody","key":"ref16"},{"volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","year":"1990","author":"Garey","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00088-X"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S1093-3263(97)00089-2"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.487"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9337-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.12"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/QCE60285.2024.00020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(03)00084-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/090775087"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.90.015002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/15\/10\/028"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-2582-1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3389\/frqst.2023.1200975"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3584706"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/QCE60285.2024.00070"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100255"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/256292.256294"},{"article-title":"graph2vec: Learning distributed representations of graphs","year":"2017","author":"Narayanan","key":"ref36"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"article-title":"Pennylane: Automatic differentiation of hybrid quantum-classical computations","year":"2018","author":"Bergholm","key":"ref38"},{"journal-title":"METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices","year":"1998","author":"Karypis","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"article-title":"Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors","year":"2025","author":"Cazals","key":"ref41"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3390\/a15060202"}],"event":{"name":"2025 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2025,9,15]]},"location":"Wakefield, MA, USA","end":{"date-parts":[[2025,9,19]]}},"container-title":["2025 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11196085\/11196088\/11196625.pdf?arnumber=11196625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:38:31Z","timestamp":1760722711000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11196625\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,15]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/hpec67600.2025.11196625","relation":{},"subject":[],"published":{"date-parts":[[2025,9,15]]}}}