{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:01:55Z","timestamp":1777341715520,"version":"3.51.4"},"reference-count":71,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":["62477029"],"award-info":[{"award-number":["62477029"]}],"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":["61702317"],"award-info":[{"award-number":["61702317"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education Humanities and Social Sciences Research Youth Fund Project","award":["22YJCZH046"],"award-info":[{"award-number":["22YJCZH046"]}]},{"name":"Fundamental Research Funds for the Central Universities, China","award":["GK202505028"],"award-info":[{"award-number":["GK202505028"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2025.3605805","type":"journal-article","created":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T17:54:39Z","timestamp":1756922079000},"page":"1902-1917","source":"Crossref","is-referenced-by-count":1,"title":["DAGCN: A Novel Directed Aggregation Graph Convolutional Network for Optimizing Receptive Field Expansion"],"prefix":"10.1109","volume":"13","author":[{"given":"Ce","family":"Yang","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5288-5523","authenticated-orcid":false,"given":"Fei","family":"Hao","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1037-210X","authenticated-orcid":false,"given":"Wangyang","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0641-4792","authenticated-orcid":false,"given":"Carmen","family":"De Maio","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Salerno, Fisciano, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5829-6850","authenticated-orcid":false,"given":"Liang","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shenyang Aerospace University, Shenyang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref2","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Defferrard","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21967-2_11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3501396"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2023.102616"},{"key":"ref8","article-title":"Revisiting graph neural networks: All we have is low-pass filters","author":"Nt","year":"2019"},{"key":"ref9","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"issue":"20","key":"ref10","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Casanova","year":"2017","journal-title":"Stat"},{"key":"ref11","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton","year":"2017"},{"key":"ref12","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/fi16090318"},{"key":"ref14","first-page":"748","article-title":"Directional graph networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Beaini","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2025.3531108"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2023.03.018"},{"key":"ref17","article-title":"Deep Gaussian embedding of graphs: Unsupervised inductive learning via ranking","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Bojchevski","year":"2018"},{"key":"ref18","article-title":"GEOM-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei","year":"2020"},{"key":"ref19","article-title":"Spectral-based graph convolutional network for directed graphs","author":"Ma","year":"2019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref21","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija","year":"2019"},{"key":"ref22","article-title":"Directed graph convolutional network","author":"Tong","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref24","article-title":"Simga: A simple and effective heterophilous graph neural network with efficient global aggregation","author":"Liu","year":"2023"},{"key":"ref25","first-page":"13022","article-title":"A fractional graph Laplacian approach to oversmoothing","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Maskey","year":"2024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICACTA58201.2023.10393573"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1073"},{"key":"ref28","article-title":"SoGCN: Second-order graph convolutional networks","author":"Wang","year":"2021"},{"key":"ref29","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija","year":"2019"},{"key":"ref30","first-page":"841","article-title":"N-GCN: Multi-scale graph convolution for semi-supervised node classification","volume-title":"Proc. 35th Uncertainty Artif. Intell. Conf.","volume":"115","author":"Abu-El-Haija","year":"2020"},{"key":"ref31","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu","year":"2018"},{"key":"ref32","article-title":"Combining neural networks with personalized pagerank for classification on graphs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Gasteiger","year":"2019"},{"key":"ref33","article-title":"Attention-based graph neural network for semi-supervised learning","author":"Thekumparampil","year":"2018"},{"key":"ref34","first-page":"4805","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Ying","year":"2018"},{"key":"ref35","article-title":"Gated graph sequence neural networks","author":"Li","year":"2015"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/mwc.006.2400131"},{"key":"ref37","first-page":"19580","article-title":"Directed graph contrastive learning","volume":"34","author":"Tong","journal-title":"in Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20682"},{"key":"ref39","article-title":"Directed acyclic graph neural networks","volume-title":"Proc.Int. Conf. Learn. Representations","author":"Thost","year":"2021"},{"key":"ref40","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Lim","year":"2021"},{"key":"ref41","first-page":"1362","article-title":"Revisiting heterophily for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Luan","year":"2022"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330836"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2916583"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3049262"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3262514"},{"key":"ref46","article-title":"Understanding graph convolutional networks for text classification","author":"Han","year":"2022"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462834"},{"key":"ref48","article-title":"Improved hyperparameter tuning for graph learning with warm-start configuration","author":"Ligman","year":"2021"},{"key":"ref49","article-title":"Hyperparameter optimization of graph neural networks for the opencatalyst dataset: A case study","volume-title":"Proc. AI Accelerated Mater. Des. NeurIPS 2022 Workshop","author":"Gonzales","year":"2022"},{"key":"ref50","article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Platonov","year":"2023"},{"key":"ref51","first-page":"25:1","article-title":"Edge directionality improves learning on heterophilic graphs","volume-title":"Proc. 2nd Learn. Graphs Conf.","volume":"231","author":"Rossi","year":"2024"},{"key":"ref52","article-title":"Gradient-based neural dag learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lachapelle","year":"2020"},{"key":"ref53","first-page":"1588","article-title":"D-VAE: A variational autoencoder for directed acyclic graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Zhang","year":"2019"},{"key":"ref54","article-title":"Dag-plan: Generating directed acyclic dependency graphs for dual-arm cooperative planning","author":"Gao","year":"2024"},{"key":"ref55","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Zhu","year":"2020"},{"key":"ref56","article-title":"Adaptive universal generalized pagerank graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chien","year":"2020"},{"key":"ref57","first-page":"17907","article-title":"Digraph inception convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Tong","year":"2020"},{"key":"ref58","first-page":"27003","article-title":"Magnet: A neural network for directed graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Zhang","year":"2021"},{"key":"ref59","article-title":"Empowering wireless networks with artificial intelligence generated graph","author":"Wang","year":"2024"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3146836"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3123276"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2018.8439897"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10097148"},{"key":"ref64","article-title":"Directed graph transformers","author":"Wang","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330961"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3177455"},{"key":"ref67","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2022"},{"key":"ref68","article-title":"A survey on oversmoothing in graph neural networks","author":"Rusch","year":"2023"},{"key":"ref69","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. NIPS","author":"Hamilton","year":"2017"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121280"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2380315"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11150569.pdf?arnumber=11150569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:43:59Z","timestamp":1764787439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11150569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":71,"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3605805","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}