{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T22:31:14Z","timestamp":1780353074681,"version":"3.54.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tnnls.2025.3565108","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T13:35:24Z","timestamp":1749476124000},"page":"16238-16252","source":"Crossref","is-referenced-by-count":1,"title":["Can Graph Neural Networks Tackle Heterophily? Yes, With a Label-Guided Graph Rewiring Approach!"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4120-5514","authenticated-orcid":false,"given":"Kushal","family":"Bose","sequence":"first","affiliation":[{"name":"Electronics and Communication Sciences Unit (ECSU), Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7079-9448","authenticated-orcid":false,"given":"Saptarshi","family":"Banerjee","sequence":"additional","affiliation":[{"name":"Electronics and Communication Sciences Unit (ECSU), Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-4508","authenticated-orcid":false,"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[{"name":"Electronics and Communication Sciences Unit (ECSU), Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learning","volume":"70","author":"Gilmer"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref4","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref5","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Wu"},{"key":"ref6","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref7","article-title":"SIGN: Scalable inception graph neural networks","author":"Frasca","year":"2020","journal-title":"arXiv:2004.11198"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2024.3389966"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref10","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref11","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20319"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref15","article-title":"Is heterophily a real nightmare for graph neural networks to do node classification?","author":"Luan","year":"2021","journal-title":"arXiv:2109.05641"},{"key":"ref16","article-title":"Adaptive universal generalized PageRank graph neural network","author":"Chien","year":"2020","journal-title":"arXiv:2006.07988"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00169"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20864"},{"key":"ref19","first-page":"10654","article-title":"Universal graph convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Jin"},{"key":"ref20","article-title":"Make heterophily graphs better fit GNN: A graph rewiring approach","author":"Bi","year":"2022","journal-title":"arXiv:2209.08264"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3520147"},{"key":"ref22","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3371592"},{"key":"ref24","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020","journal-title":"arXiv:2002.05287"},{"key":"ref25","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"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"ref27","first-page":"20310","article-title":"How universal polynomial bases enhance spectral graph neural networks: Heterophily, over-smoothing, and over-squashing","volume-title":"Proc. ICML","author":"Huang"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/310"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/293"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467373"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"ref32","article-title":"Simplified graph convolution with heterophily","author":"Chanpuriya","year":"2022","journal-title":"arXiv:2202.04139"},{"key":"ref33","first-page":"1","article-title":"Label-wise graph convolutional network for heterophilic graphs","volume-title":"Proc. Learn. Graphs Conf.","author":"Dai"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3267902"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref37","article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","author":"Platonov","year":"2023","journal-title":"arXiv:2302.11640"},{"key":"ref38","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","author":"Gasteiger","year":"2018","journal-title":"arXiv:1810.05997"},{"key":"ref39","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Topping"},{"key":"ref40","article-title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Karhadkar"},{"key":"ref41","article-title":"On the bottleneck of graph neural networks and its practical implications","author":"Alon","year":"2020","journal-title":"arXiv:2006.05205"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11151745\/11027915.pdf?arnumber=11027915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:24:09Z","timestamp":1757096649000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11027915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3565108","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}