{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T04:47:44Z","timestamp":1785818864587,"version":"3.56.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"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. Artif. Intell."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tai.2026.3664026","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T21:03:33Z","timestamp":1770930213000},"page":"4392-4406","source":"Crossref","is-referenced-by-count":0,"title":["Learning From Heterophilic Graphs: A Spectral Theory Perspective on the Impact of Self-Loops and Parallel Edges"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4120-5514","authenticated-orcid":false,"given":"Kushal","family":"Bose","sequence":"first","affiliation":[{"name":"Indian Statistical Institute","place":["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":"Indian Statistical Institute","place":["Kolkata, India"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref2","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20319"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467373"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"ref7","article-title":"Revisiting graph neural networks: All we have is low-pass filters","author":"Nt","year":"2019"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref9","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref10","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref11","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Int. Conf. Mach. Learn.","author":"Wu","year":"2019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/9781108552349"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2321121"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-813677-5.00011-0"},{"key":"ref16","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":"ref17","article-title":"A survey on spectral graph neural networks","author":"Bo","year":"2023"},{"key":"ref18","article-title":"Benchmarking spectral graph neural networks: A comprehensive study on effectiveness and efficiency","author":"Liao","year":"2024"},{"key":"ref19","first-page":"81471","article-title":"Position: Spectral GNNs rely less on graph Fourier basis than conceived","volume-title":"Proc. 42nd Int. Conf. Mach. Learn. Position Paper Track","author":"Guo","year":"2025"},{"key":"ref20","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3627816"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3186016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482226"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref26","article-title":"Do we need anisotropic graph neural networks?","author":"Tailor","year":"2021"},{"key":"ref27","article-title":"Simple spectral graph convolution","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhu","year":"2021"},{"key":"ref28","article-title":"Signed graph neural networks: A frequency perspective","author":"Singh","year":"2023","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref29","article-title":"Simplifying node classification on heterophilous graphs with compatible label propagation","author":"Zhong","year":"2022","journal-title":"Trans. Mach. Learn. Res. (TMLR)"},{"key":"ref30","first-page":"55348","article-title":"SLoG: An inductive spectral graph neural network beyond polynomial filter","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Xu","year":"2025"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2026.3680353"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679088"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2026.133500"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0446"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3746252.3761256"},{"key":"ref37","first-page":"25261","article-title":"A new perspective on the effects of spectrum in graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.,","author":"Yang","year":"2022"},{"key":"ref38","article-title":"Herofilter: Adaptive spectral graph filter for varying heterophilic relations","author":"Zhang","year":"2025"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i17.34022"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref41","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer","year":"2017"},{"key":"ref42","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020"},{"key":"ref43","article-title":"Is heterophily a real nightmare for graph neural networks to do node classification?","author":"Luan","year":"2021"},{"key":"ref44","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":"ref45","article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","author":"Platonov","year":"2023"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9078688\/11635975\/11394803.pdf?arnumber=11394803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T04:42:21Z","timestamp":1785818541000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11394803\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":46,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tai.2026.3664026","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}