{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T18:43:11Z","timestamp":1763059391809,"version":"build-2065373602"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Brazilian National Council for Scientific and Technological Development (CNPq) Procs","award":["420934\/2023-5","308101\/2022-7","465446\/2014-0","142089\/2018-4"],"award-info":[{"award-number":["420934\/2023-5","308101\/2022-7","465446\/2014-0","142089\/2018-4"]}]},{"name":"Brazilian Coordination for the Improvement of Higher Education (CAPES) Finance Code 001; Sao Paulo Research Foundation (FAPESP) Procs","award":["2020\/05183-0","2023\/00811-0","2023\/00812-7"],"award-info":[{"award-number":["2020\/05183-0","2023\/00811-0","2023\/00812-7"]}]},{"name":"National Science Foundation","award":["2319425"],"award-info":[{"award-number":["2319425"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tnsm.2025.3574626","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T13:42:12Z","timestamp":1749217332000},"page":"4775-4787","source":"Crossref","is-referenced-by-count":1,"title":["Establishing Trust for Using Natural Language for Intent-Based Networking"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0624-5001","authenticated-orcid":false,"given":"Arthur Selle","family":"Jacobs","sequence":"first","affiliation":[{"name":"Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0539-2237","authenticated-orcid":false,"given":"Ricardo Jos\u00e9","family":"Pfitscher","sequence":"additional","affiliation":[{"name":"Mobility Engineering Department, Federal University of Santa Catarina (Joinville), Joinville, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4196-3359","authenticated-orcid":false,"given":"Rafael Hengen","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8956-8660","authenticated-orcid":false,"given":"Lisandro Zambenedetti","family":"Granville","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Federal University of Rio Grande do Sul, Porto Alegre, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9144-7187","authenticated-orcid":false,"given":"Ronaldo Alves","family":"Ferreira","sequence":"additional","affiliation":[{"name":"College of Computing, Federal University of Mato Grosso do Sul, Campo Grande, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1384-8188","authenticated-orcid":false,"given":"Walter","family":"Willinger","sequence":"additional","affiliation":[{"name":"NIKSUN Inc., Princeton, NJ, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4825-4352","authenticated-orcid":false,"given":"Sanjay G.","family":"Rao","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098834"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934909"},{"volume-title":"Improving networks with artificial intelligence","year":"2020","author":"Apostolopoulos","key":"ref3"},{"volume-title":"Intent-based networking\u2014Concepts and definitions","year":"2019","author":"Clemm","key":"ref4"},{"volume-title":"Juniper networks CEO: \u2018The goal now is a self-driving network","year":"2020","author":"Narcisi","key":"ref5"},{"volume-title":"The practice of network verification in Alibaba\u2019s global WAN","year":"2021","author":"Liu","key":"ref6"},{"article-title":"The zero touch network","volume-title":"12th Int. Conf. Netw. Service Manag","author":"Koley","key":"ref7"},{"key":"ref8","first-page":"609","article-title":"Net2Text: Query-guided summarization of network forwarding behaviors","volume-title":"Proc. USENIX NSDI","author":"Birkner"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2017.8116375"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM59352.2023.10327837"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3626111.3628183"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560609"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.23919\/CNSM50824.2020.9269037"},{"key":"ref14","first-page":"625","article-title":"Hey, Lumi! Using natural language for intent-based network management","volume-title":"Proc. USENIX ATC","author":"Jacobs"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2022.3215919"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2022.109477","article-title":"Intent-driven autonomous network and service management in future cellular networks: A structured literature review","volume":"220","author":"Mehmood","year":"2023","journal-title":"Comput. Netw."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.23919\/INM.2017.7987279"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900476"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.cose.2018.09.013","article-title":"A comprehensive approach to the automatic refinement and verification of access control policies","volume":"80","author":"Cheminod","year":"2019","journal-title":"Comput. Security"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787506"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3143361.3143380"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342088"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2019.8806662"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3129990"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.101.2100141"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3603166.3632236"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICIN60470.2024.10494474"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109457"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CCIS59572.2023.10263079"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/APCC55198.2022.9943612"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2024.3435752"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/NetSoft57336.2023.10175410"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS59830.2024.10575429"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2024.3420120"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2300313"},{"key":"ref36","article-title":"Making network configuration human friendly","author":"Wang","year":"2023","journal-title":"arXiv:2309.06342v1"},{"volume-title":"Speech and Language Processing","year":"2019","author":"Jurafsky","key":"ref37"},{"issue":"5","key":"ref38","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.csi.2012.09.004","article-title":"Named entity recognition: Fallacies, challenges and opportunities","volume":"35","author":"Marrero","year":"2013","journal-title":"Comput. Stand. Interfaces"},{"key":"ref39","first-page":"357","article-title":"Named entity recognition with bidirectional LSTM-CNNs","volume":"4","author":"Chiu","year":"2016","journal-title":"Trans. ACL"},{"key":"ref40","first-page":"282","article-title":"Conditional random fields: Probabilistic models for segmenting and labeling sequence data","volume-title":"Proc. ICML","author":"Lafferty"},{"key":"ref41","article-title":"Attention is all you need","author":"Vaswani","year":"2017","journal-title":"arXiv:1706.03762"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981314"},{"key":"ref43","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"Devlin","year":"2018","journal-title":"arXiv:1810.04805"},{"key":"ref44","article-title":"DIET: Lightweight language understanding for dialogue systems","author":"Bunk","year":"2020","journal-title":"arXiv:2004.09936"},{"key":"ref45","article-title":"Gpt-4 technical report","volume-title":"arXiv:2303.08774","author":"Achiam","year":"2023"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3229584.3229590"},{"volume-title":"Lumi supplemental material","year":"2024","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2867239"},{"key":"ref49","first-page":"59","article-title":"Kinetic: Verifiable dynamic network control","volume-title":"Proc. USENIX NSDI","author":"Kim"},{"key":"ref50","first-page":"15","article-title":"VeriFlow: Verifying network-wide invariants in real time","volume-title":"Proc. USENIX NSDI","author":"Khurshid"},{"key":"ref51","first-page":"469","article-title":"A general approach to network configuration analysis","volume-title":"Proc. USENIX NSDI","author":"Fogel"},{"key":"ref52","first-page":"1039","article-title":"Finding contradictions in text","volume-title":"Proc. Conf. ACL","author":"Marneffe"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"volume-title":"SpaCy 2: Natural language understanding with bloom embeddings, convolutional neural networks, and incremental parsing","year":"2017","author":"Honnibal","key":"ref54"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2501398"},{"key":"ref56","first-page":"201","article-title":"Tiramisu: Fast and general network verification","volume-title":"Proc. USENIX NSDI","author":"Abhashkumar"},{"key":"ref57","first-page":"953","article-title":"Plankton: Scalable network configuration verification through model checking","volume-title":"Proc. USENIX NSDI","author":"Prabhu"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/NetSoft54395.2022.9844054"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230555"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405894"},{"volume-title":"Datasets for natural language processing","year":"2020","author":"Brownlee","key":"ref61"},{"volume-title":"Alphabetical List of free\/public domain datasets with text data for use in natural language processing (NLP)","year":"2011","key":"ref62"},{"volume-title":"Chatito: Generate datasets for AI Chatbots, NLP tasks, named entity recognition or text classification models using a simple DSL!","year":"2022","key":"ref63"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4275028\/11194281\/11024152-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4275028\/11194281\/11024152.pdf?arnumber=11024152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T17:38:06Z","timestamp":1759945086000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11024152\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":63,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2025.3574626","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"type":"electronic","value":"1932-4537"},{"type":"electronic","value":"2373-7379"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}