{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T19:57:11Z","timestamp":1769543831193,"version":"3.49.0"},"reference-count":52,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3655214","type":"journal-article","created":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T20:55:44Z","timestamp":1768856144000},"page":"9696-9716","source":"Crossref","is-referenced-by-count":0,"title":["Spectral Filtering Using Periodic Autoregressive Moving Average Graph Neural Networks for Heterophilic Graphs"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7236-7213","authenticated-orcid":false,"given":"Baimyrza","family":"Kalmyrzayev","sequence":"first","affiliation":[{"name":"School of Engineering and Digital Sciences, Nazarbayev University, Astana, Kazakhstan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6116-5616","authenticated-orcid":false,"given":"Hashim","family":"Ali","sequence":"additional","affiliation":[{"name":"School of Engineering and Digital Sciences, Nazarbayev University, Astana, Kazakhstan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5979-0682","authenticated-orcid":false,"given":"Muhammad","family":"Tahir Akhtar","sequence":"additional","affiliation":[{"name":"School of Engineering and Digital Sciences, Nazarbayev University, Astana, Kazakhstan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01094"},{"key":"ref2","first-page":"15870","article-title":"Motif-based graph self-supervised learning for molecular property prediction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462990"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2025.3546874"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref7","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref8","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref9","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Brody"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref11","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref12","article-title":"GraphSAINT: Graph sampling based inductive learning method","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zeng"},{"key":"ref13","first-page":"7134","article-title":"Position-aware graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17283"},{"key":"ref15","first-page":"4465","article-title":"Distance encoding: Design provably more powerful neural networks for graph representation learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17332"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3267902"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2025.3548860"},{"key":"ref21","article-title":"Graph neural networks for graphs with heterophily: A survey","author":"Zheng","year":"2022","journal-title":"arXiv:2202.07082"},{"key":"ref22","article-title":"Spectral networks and locally connected networks on graphs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Bruna"},{"key":"ref23","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kipf"},{"key":"ref24","article-title":"Analyzing the expressive power of graph neural networks in a spectral perspective","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Balc\u0131lar"},{"key":"ref25","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref26","first-page":"8376","article-title":"Revisiting graph neural networks: Graph filtering perspective","volume-title":"Proc. 25th Int. Conf. Pattern Recognit. (ICPR)","author":"Hoang"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482226"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i6.20664"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref32","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":"ref33","first-page":"14239","article-title":"BernNet: Learning arbitrary graph spectral filters via Bernstein approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"He"},{"key":"ref34","article-title":"Adaptive universal generalized PageRank graph neural network","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Chien"},{"key":"ref35","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref36","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"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2879624"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2614793"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref41","volume-title":"Statistical Digital Signal Processing and Modeling","author":"Hayes","year":"1996"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2820126"},{"key":"ref43","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref45","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Pei"},{"key":"ref46","article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Platonov"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref48","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. Int. Conf. Mach. Learn. Graph Represent. Learn. Beyond Workshop","author":"Morris"},{"key":"ref49","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"1","author":"Chen"},{"key":"ref50","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":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00169"},{"key":"ref52","first-page":"1341","article-title":"Half-hop: A graph upsampling approach for slowing down message passing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Azabou"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11357922.pdf?arnumber=11357922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:01:05Z","timestamp":1769493665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11357922\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3655214","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}