{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:49:29Z","timestamp":1780674569410,"version":"3.54.1"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3112746","type":"journal-article","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T20:30:15Z","timestamp":1631824215000},"page":"1-1","source":"Crossref","is-referenced-by-count":31,"title":["Eigen-GNN: a Graph Structure Preserving Plug-in for GNNs"],"prefix":"10.1109","author":[{"given":"Ziwei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenwu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref2","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref3","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Klicpera"},{"key":"ref4","first-page":"15413","article-title":"Understanding the representation power of graph neural networks in learning graph topology","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Dehmamy"},{"key":"ref5","first-page":"7092","article-title":"Universal invariant and equivariant graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","volume":"32","author":"Keriven"},{"key":"ref6","article-title":"What graph neural networks cannot learn: Depth vs width","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Loukas"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref8","article-title":"Graph neural networks exponentially lose expressive power for node classification","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Oono"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18178\/wcse.2019.06.016"},{"key":"ref10","article-title":"Revisiting graph neural networks: All we have is low-pass filters","author":"Maehara","year":"2019"},{"key":"ref11","first-page":"1","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2010350"},{"key":"ref18","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Bruna"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.5555\/3157382.3157527"},{"key":"ref21","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref22","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref24","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Velickovic"},{"key":"ref25","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Xu"},{"key":"ref26","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018"},{"key":"ref27","article-title":"Measuring and improving the use of graph information in graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Hou"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref30","first-page":"1","article-title":"Provably powerful graph networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Maron"},{"key":"ref31","first-page":"1","article-title":"Position-aware graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5997"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330982"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3090664"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref36","article-title":"Dropedge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Rong"},{"key":"ref37","article-title":"Pairnorm: Tackling oversmoothing in GNNS","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Zhao"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref39","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"issue":"65","key":"ref40","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2879624"},{"key":"ref43","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Mikolov"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186116"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.5555\/3157096.3157320"},{"key":"ref46","first-page":"1","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref48","first-page":"4663","article-title":"Relational pooling for graph representations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Murphy"},{"key":"ref49","volume-title":"Spectral Graph Theory","author":"Chung","year":"1997"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.5555\/2980539.2980649"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219969"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00113"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-39778-7_10"},{"key":"ref55","article-title":"Invariant and equivariant graph networks","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Maron"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/294"},{"key":"ref57","article-title":"On the equivalence between positional node embeddings and structural graph representations","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Srinivasan"},{"key":"ref58","article-title":"A simple and general graph neural network with stochastic message passing","author":"Zhang","year":"2020","journal-title":"arXiv:2009.02562"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"ref60","first-page":"2110","article-title":"DeepInf: Modeling influence locality in large social networks","volume-title":"Proc. Int. Conf. Knowl. Discov. Data Mining","author":"Qiu"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976700.38"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611503014412"},{"key":"ref65","first-page":"15894","article-title":"On the equivalence between graph isomorphism testing and function approximation with GNNS","volume-title":"Proc. Int. Conf. Neural Inf. Process Syst.","author":"Chen"},{"key":"ref66","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref68","first-page":"17","article-title":"On the evolution of random graphs","author":"Erd\u0151s","year":"1960","journal-title":"in Publication of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-020-01331-0"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2852750"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3063-0"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802206"},{"key":"ref73","first-page":"942","article-title":"Stochastic training of graph convolutional networks with variance reduction","volume-title":"Proc. Int. Conf. Learn. Representation","author":"Chen"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09540311.pdf?arnumber=9540311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:52:46Z","timestamp":1705013566000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9540311\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3112746","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":[[2021]]}}}