{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:39:37Z","timestamp":1763811577900,"version":"3.29.0"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"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,10,22]]},"DOI":"10.1109\/isncc62547.2024.10759050","type":"proceedings-article","created":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T18:45:16Z","timestamp":1732646716000},"page":"1-4","source":"Crossref","is-referenced-by-count":1,"title":["NeuroDual: A Hybrid SAT Solver Combining Graph Attention Networks with Algorithmic Techniques"],"prefix":"10.1109","author":[{"given":"Mahfuza","family":"Farooque","sequence":"first","affiliation":[{"name":"The Pennsylvania State University,Department of CSE,PA,16802"}]},{"given":"Matthew","family":"Walter","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University,Department of CSE,PA,16802"}]},{"given":"Aaron","family":"Falk","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University,Department of CSE,PA,16802"}]}],"member":"263","reference":[{"volume-title":"Learning a sat solver from single-bit supervision","year":"2019","author":"Selsam","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3233\/faia200987"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-022-1396-2"},{"volume-title":"Neurocomb: Improving sat solving with graph neural networks","year":"2022","author":"Wang","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s44196-022-00139-9"},{"volume-title":"Graph attention networks","year":"2018","author":"Veli\u010dkovi\u0107","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26287-1_14"},{"volume-title":"Minisat v1.13 - a sat solver with conflict-clause minimization","year":"2005","author":"S\u00f6rensson","key":"ref8"},{"volume-title":"Conflict-Driven Clause Learning SAT Solvers","year":"2008","author":"Marques-Silva","key":"ref9"},{"volume-title":"Satfeatpy - a python-based feature extraction system for satisfiability","year":"2022","author":"Provan-Bessell","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2016.11.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.29007\/b8t1"},{"volume-title":"Satlib: An online resource for research on sat","year":"2000","author":"Hoos","key":"ref14"},{"volume-title":"Adam: A method for stochastic optimization","year":"2017","author":"Kingma","key":"ref15"}],"event":{"name":"2024 International Symposium on Networks, Computers and Communications (ISNCC)","start":{"date-parts":[[2024,10,22]]},"location":"Washington DC, DC, USA","end":{"date-parts":[[2024,10,25]]}},"container-title":["2024 International Symposium on Networks, Computers and Communications (ISNCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10758900\/10758934\/10759050.pdf?arnumber=10759050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T19:17:15Z","timestamp":1732735035000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10759050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isncc62547.2024.10759050","relation":{},"subject":[],"published":{"date-parts":[[2024,10,22]]}}}