{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T01:35:56Z","timestamp":1775698556026,"version":"3.50.1"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"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","award":["2325416"],"award-info":[{"award-number":["2325416"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2325417"],"award-info":[{"award-number":["2325417"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1109\/tkde.2023.3331318","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T19:10:41Z","timestamp":1699470641000},"page":"4116-4128","source":"Crossref","is-referenced-by-count":7,"title":["Network Controllability Perspectives on Graph Representation"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6715-0068","authenticated-orcid":false,"given":"Anwar","family":"Said","sequence":"first","affiliation":[{"name":"Computer Science Department, Vanderbilt University, Nashville, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8303-1114","authenticated-orcid":false,"given":"Obaid Ullah","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Electrical Engineering Department, University of Texas at Dallas, Richardson, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9013-1463","authenticated-orcid":false,"given":"Waseem","family":"Abbas","sequence":"additional","affiliation":[{"name":"Systems Engineering Department, University of Texas at Dallas, Richardson, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6961-0961","authenticated-orcid":false,"given":"Mudassir","family":"Shabbir","sequence":"additional","affiliation":[{"name":"Computer Science Department, Information Technology University, Lahore, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0923-6293","authenticated-orcid":false,"given":"Xenofon","family":"Koutsoukos","sequence":"additional","affiliation":[{"name":"Computer Science Department, Vanderbilt University, Nashville, TN, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400835355"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.02.029"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2012.2195411"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2310254"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/060674909"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2546180"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu029"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2308619"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref11","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553443"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.05.032"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0195-3"},{"key":"ref17","first-page":"88","article-title":"Hunt for the unique, stable, sparse and fast feature learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Verma"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219991"},{"key":"ref19","article-title":"Wasserstein weisfeiler-lehman graph kernels","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Togninalli"},{"key":"ref20","article-title":"GOT: An optimal transport framework for graph comparison","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Maretic"},{"key":"ref21","article-title":"Optimal transport with laplacian regularization","volume-title":"Proc. Workshop Optimal Transport Mach. Learn.","author":"Flamary"},{"key":"ref22","first-page":"853","article-title":"Generalizing graph matching beyond quadratic assignment model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yu"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.02.005"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref26","volume-title":"Graph-Powered Machine Learning","author":"Negro","year":"2021"},{"key":"ref27","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/194"},{"key":"ref29","first-page":"6410","article-title":"Graph convolutional policy network for goal-directed molecular graph generation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3172903"},{"key":"ref31","article-title":"Deep convolutional networks on graph-structured data","author":"Henaff","year":"2015"},{"key":"ref32","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref34","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref36","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2015.2453711"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00332-018-9448-z"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.37236\/3748"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.07.004"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.112918"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801384937"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/090764566"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.3870"},{"key":"ref45","article-title":"Tudataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. Workshop Graph Representation Learn. Beyond","author":"Morris"},{"key":"ref46","first-page":"694","article-title":"Global graph kernels using geometric embeddings","author":"Johansson","year":"2014","journal-title":"Int. Conf. Mach. Learn."},{"key":"ref47","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shervashidze"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492582"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref50","article-title":"Hierarchical graph representation learning with differentiable pooling","author":"Ying","year":"2018"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.11"},{"key":"ref52","article-title":"Nested graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref53","article-title":"Weisfeiler and lehman go cellular: CW networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bodnar"},{"key":"ref54","first-page":"1026","article-title":"Weisfeiler and lehman go topological: Message passing simplicial networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bodnar"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM51629.2021.00142"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00039"},{"issue":"54","key":"ref57","first-page":"1","article-title":"GraKel: A graph kernel library in python","volume":"21","author":"Siglidis","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref58","article-title":"A fair comparison of graph neural networks for graph classification","author":"Errica","year":"2019"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/146847.146929"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201310003"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/361573.361582"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827598347666"},{"key":"ref63","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525087"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00951"},{"key":"ref66","first-page":"8748","article-title":"Learning transferable visual models from natural language supervision","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Radford"},{"key":"ref67","article-title":"Representation learning with contrastive predictive coding","author":"Oord","year":"2018"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2709081"},{"key":"ref69","first-page":"7134","article-title":"Position-aware graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0044459"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/04\/P04011"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.07.021"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/10589999\/10313056-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10589999\/10313056.pdf?arnumber=10313056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T06:10:10Z","timestamp":1721283010000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10313056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":72,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3331318","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]}}}