{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:46:11Z","timestamp":1774975571988,"version":"3.50.1"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2001"],"award-info":[{"award-number":["U23B2001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62201072"],"award-info":[{"award-number":["62201072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62101064"],"award-info":[{"award-number":["62101064"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171057"],"award-info":[{"award-number":["62171057"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62001054"],"award-info":[{"award-number":["62001054"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071067"],"award-info":[{"award-number":["62071067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Ministry of Education and China Mobile Joint Fund","doi-asserted-by":"publisher","award":["MCM20200202"],"award-info":[{"award-number":["MCM20200202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Ministry of Education and China Mobile Joint Fund","doi-asserted-by":"publisher","award":["MCM20180101"],"award-info":[{"award-number":["MCM20180101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tnet.2024.3409529","type":"journal-article","created":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T17:48:18Z","timestamp":1717696098000},"page":"4175-4190","source":"Crossref","is-referenced-by-count":4,"title":["Fast and Scalable ACL Policy Solving Under Complex Constraints With Graph Neural Networks"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3072-7422","authenticated-orcid":false,"given":"Haifeng","family":"Sun","sequence":"first","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2361-2080","authenticated-orcid":false,"given":"Xingjian","family":"Liao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2182-2228","authenticated-orcid":false,"given":"Jingyu","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-4624","authenticated-orcid":false,"given":"Qi","family":"Qi","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3345-1732","authenticated-orcid":false,"given":"Zirui","family":"Zhuang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1486-0573","authenticated-orcid":false,"given":"Jianxin","family":"Liao","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1755-0183","authenticated-orcid":false,"given":"Dapeng","family":"Oliver Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, City University of Hong Kong, Hong Kong, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP59255.2023.10355624"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/35.312842"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2012.6459944"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342088"},{"key":"ref6","volume-title":"Cisco Digital Network Architecture: Intent-based Networking for the Enterprise","author":"Szigeti","year":"2018"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107706"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560606"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking55013.2022.9829813"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2089640"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_14"},{"key":"ref12","first-page":"579","article-title":"NetComplete: Practical network-wide configuration synthesis with autocompletion","volume-title":"Proc. 15th USENIX Symp. Netw. Syst. Design Implement. (NSDI)","author":"El-Hassany"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472937"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3422604.3425936"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/679"},{"key":"ref17","first-page":"1","article-title":"Learning a SAT solver from single-bit supervision","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Selsam"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5733"},{"key":"ref19","article-title":"One model, any CSP: Graph neural networks as fast global search heuristics for constraint satisfaction","author":"T\u00f6nshoff","year":"2022","journal-title":"arXiv:2208.10227"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"issue":"43","key":"ref21","first-page":"1","article-title":"Benchmarking graph neural networks","volume":"24","author":"Dwivedi","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/595"},{"key":"ref25","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Xu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.130"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0806627105"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939766"},{"key":"ref29","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kipf"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.08.135"},{"key":"ref31","first-page":"1","article-title":"Graph neural networks with learnable structural and positional representations","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Dwivedi"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-6257-9"},{"key":"ref33","article-title":"Residual gated graph ConvNets","author":"Bresson","year":"2017","journal-title":"arXiv:1711.07553"},{"key":"ref34","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Velickovic"},{"key":"ref35","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_3"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/164"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/dac.4815"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2397393"},{"key":"ref42","first-page":"399","article-title":"Predicting learnt clauses quality in modern SAT solvers","volume-title":"Proc. 21st Int. Joint Conf. Artif. Intell. (IJCAI)","author":"Audemard"},{"key":"ref43","article-title":"MiniSat\u2014A SAT solver with conflict-clause minimization","volume-title":"Theory and Applications of Satisfiability Testing","author":"Een","year":"2005"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-80223-3_27"},{"key":"ref45","author":"Hagberg","year":"2024","journal-title":"Exploring Network Structure, Dynamics, and Function Using NetworkX"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"ref47","article-title":"Analysing the empirical time complexity of high-performance algorithms for SAT and TSP","author":"Mu","year":"2015"},{"key":"ref48","first-page":"1","article-title":"Learning to configure computer networks with neural algorithmic reasoning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Beurer-Kellner"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2774993.2774997"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.172"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2009.38"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.16"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2017.8102263"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8060604"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3176820"},{"key":"ref56","first-page":"1","article-title":"Automated analysis and debugging of network connectivity policies","volume":"1","author":"Jayaraman","year":"2014","journal-title":"Microsoft Research"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2641482"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8101136"},{"key":"ref59","first-page":"625","article-title":"Hey, Lumi! Using natural language for intent-based network management","volume-title":"Proc. USENIX Annu. Tech. Conf. (ATC)","author":"Jacobs"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref61","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kool"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP55882.2022.9940325"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP55882.2022.9940333"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3176267"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/90\/10720541\/10551736.pdf?arnumber=10551736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T04:36:50Z","timestamp":1729226210000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10551736\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":64,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3409529","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}