{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T18:22:28Z","timestamp":1782757348827,"version":"3.54.5"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Ningbo Science and Technology Innovation Project","award":["2022Z075"],"award-info":[{"award-number":["2022Z075"]}]},{"name":"Ningbo Science and Technology Innovation Project","award":["2023CX050006"],"award-info":[{"award-number":["2023CX050006"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61802372"],"award-info":[{"award-number":["61802372"]}],"id":[{"id":"10.13039\/501100001809","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,11]]},"DOI":"10.1109\/tkde.2024.3397692","type":"journal-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:39:10Z","timestamp":1715103550000},"page":"6330-6343","source":"Crossref","is-referenced-by-count":13,"title":["Graph Rewiring and Preprocessing for Graph Neural Networks Based on Effective Resistance"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0403-0103","authenticated-orcid":false,"given":"Xu","family":"Shen","sequence":"first","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0540-5053","authenticated-orcid":false,"given":"Pietro","family":"Li\u00f2","sequence":"additional","affiliation":[{"name":"Faculty of Department of Computer Science and Technology, University of Cambridge, Cambridge, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4544-4727","authenticated-orcid":false,"given":"Lintao","family":"Yang","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1925-1430","authenticated-orcid":false,"given":"Ru","family":"Yuan","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6113-3534","authenticated-orcid":false,"given":"Yuyang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7445-2638","authenticated-orcid":false,"given":"Chengbin","family":"Peng","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539121"},{"key":"ref2","article-title":"A note on over-smoothing for graph neural networks","author":"Cai","year":"2020"},{"key":"ref3","article-title":"Revisiting over-smoothing in deep GCNs","author":"Yang","year":"2020"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref5","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114711"},{"key":"ref7","first-page":"4316","article-title":"Redundancy-free message passing for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref8","article-title":"Tackling over-smoothing for general graph convolutional networks","author":"Huang","year":"2020"},{"key":"ref9","article-title":"On the bottleneck of graph neural networks and its practical implications","author":"Alon","year":"2020"},{"key":"ref10","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","author":"Topping","year":"2021"},{"key":"ref11","first-page":"21618","article-title":"Rethinking graph transformers with spectral attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kreuzer"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/244"},{"key":"ref13","first-page":"25956","article-title":"Revisiting over-smoothing and over-squashing using ollivier-ricci curvature","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nguyen"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583269"},{"key":"ref15","article-title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","author":"Karhadkar","year":"2022"},{"key":"ref16","first-page":"2528","article-title":"Understanding oversquashing in GNNs through the lens of effective resistance","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Black"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2008.11.001"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614997"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9558-1"},{"key":"ref20","first-page":"7865","article-title":"On over-squashing in message passing neural networks: The impact of width, depth, and topology","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Di Giovanni"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3008732"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3075052"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3080635"},{"key":"ref25","first-page":"5171","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5731"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3103984"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/e24091190"},{"key":"ref30","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00447-x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3290032"},{"key":"ref33","first-page":"4776","article-title":"How powerful are k-hop message passing graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3081010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3105544"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00178"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref38","first-page":"7264","article-title":"Convolutional neural networks on graphs with Chebyshev approximation, revisited","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"He"},{"key":"ref39","article-title":"Graph wavelet neural network","author":"Xu","year":"2019"},{"key":"ref40","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref41","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"key":"ref42","first-page":"14239","article-title":"BernNet: Learning arbitrary graph spectral filters via bernstein approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"He"},{"key":"ref43","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref44","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"Oono","year":"2019"},{"key":"ref45","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref46","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref47","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25545"},{"key":"ref49","article-title":"Diffwire: Inductive graph rewiring via the lov$\\backslash$\u2216\u2019asz bound","author":"Arnaiz-Rodr\u00edguez","year":"2022"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741125"},{"issue":"1\/46","key":"ref51","article-title":"Random walks on graphs","volume":"2","author":"Lov\u00e1sz","year":"1993","journal-title":"Combinatorics Paul Erdos Eighty"},{"key":"ref52","article-title":"Graph clustering using effective resistance","volume-title":"Proc. 9th Innov. Theor. Comput. Sci. Conf.","author":"Alev"},{"key":"ref53","article-title":"Fast graph attention networks using effective resistance based graph sparsification","author":"Srinivasa","year":"2020"},{"key":"ref54","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref55","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref57","first-page":"13366","article-title":"Diffusion improves graph learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasteiger"},{"key":"ref58","article-title":"Pairnorm: Tackling oversmoothing in GNNs","author":"Zhao","year":"2019"},{"key":"ref59","first-page":"4917","article-title":"Towards deeper graph neural networks with differentiable group normalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref61","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref62","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"key":"ref63","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498408"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10709365\/10521752.pdf?arnumber=10521752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T05:40:36Z","timestamp":1728452436000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10521752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":64,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3397692","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,11]]}}}