{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:56:53Z","timestamp":1781301413475,"version":"3.54.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62506087"],"award-info":[{"award-number":["62506087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.patcog.2026.113631","type":"journal-article","created":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:09:33Z","timestamp":1775437773000},"page":"113631","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["DSA-GNN: Optimizing long-tail in graph structures via degree suppression with attention"],"prefix":"10.1016","volume":"179","author":[{"given":"Guanwei","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingxiao","family":"Guan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Can","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siyuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wensheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.113631_bib0001","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2023.109867","article-title":"Adaptive filters in graph convolutional neural networks","volume":"144","author":"Apicella","year":"2023","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113631_bib0002","article-title":"Multi-channel set polynomial based label regularized graph neural networks against extreme data scarcity","author":"Zhang","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113631_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.110940","article-title":"NLA-GNN: non-local information aggregated graph neural network for heterogeneous graph embedding","volume":"158","author":"Wang","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113631_bib0004","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2024.110484","article-title":"GANN: graph alignment neural network for semi-supervised learning","volume":"154","author":"Song","year":"2024","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113631_bib0005","series-title":"International Conference on Machine Learning","first-page":"31613","article-title":"Exphormer: sparse transformers for graphs","author":"Shirzad","year":"2023"},{"key":"10.1016\/j.patcog.2026.113631_bib0006","doi-asserted-by":"crossref","first-page":"7264","DOI":"10.52202\/068431-0527","article-title":"Convolutional neural networks on graphs with chebyshev approximation, revisited","volume":"35","author":"He","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0007","article-title":"Heterogeneous graph contrastive learning with spectral augmentation and dual aggregation","author":"Zhang","year":"2025","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113631_bib0008","series-title":"International Conference on Learning Representations (ICLR)","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.patcog.2026.113631_bib0009","unstructured":"Y. Rong, W. Huang, T. Xu, J. Huang, Dropedge: towards deep graph convolutional networks on node classification, in: International Conference on Learning Representations, 2020. https:\/\/openreview.net\/forum?id=Hkx1qkrKPr."},{"key":"10.1016\/j.patcog.2026.113631_bib0010","series-title":"International Conference on Machine Learning","first-page":"11773","article-title":"Graph neural networks inspired by classical iterative algorithms","author":"Yang","year":"2021"},{"key":"10.1016\/j.patcog.2026.113631_bib0011","series-title":"International Conference on Machine Learning","first-page":"1725","article-title":"Simple and deep graph convolutional networks","author":"Chen","year":"2020"},{"key":"10.1016\/j.patcog.2026.113631_bib0012","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume":"29","author":"Defferrard","year":"2016","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"7","key":"10.1016\/j.patcog.2026.113631_bib0013","first-page":"3496","article-title":"Graph neural networks with convolutional arma filters","volume":"44","author":"Bianchi","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113631_bib0014","first-page":"14239","article-title":"Bernnet: learning arbitrary graph spectral filters via bernstein approximation","volume":"34","author":"He","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0015","series-title":"International Conference on Learning Representations","article-title":"Adaptive universal generalized PageRank graph neural network","author":"Chien","year":"2021"},{"key":"10.1016\/j.patcog.2026.113631_bib0016","first-page":"4694","article-title":"Evennet: ignoring odd-hop neighbors improves robustness of graph neural networks","volume":"35","author":"Lei","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0017","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"13437","article-title":"PC-Conv: unifying homophily and heterophily with two-fold filtering","volume":"38","author":"Li","year":"2024"},{"key":"10.1016\/j.patcog.2026.113631_bib0018","first-page":"20310","article-title":"How universal polynomial bases enhance spectral graph neural networks: heterophily, over-smoothing, and over-squashing","volume":"235","author":"Huang","year":"2024","journal-title":"Int. Conf. Mach. Learn."},{"key":"10.1016\/j.patcog.2026.113631_bib0019","series-title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V. 1","first-page":"213-223","article-title":"Large-scale spectral graph neural networks via Laplacian sparsification: technical report","author":"Ding","year":"2025"},{"key":"10.1016\/j.patcog.2026.113631_bib0020","series-title":"Proceedings of the ACM Web Conference 2022","first-page":"1214","article-title":"RawlsGCN: towards Rawlsian difference principle on graph convolutional network","author":"Kang","year":"2022"},{"key":"10.1016\/j.patcog.2026.113631_bib0021","first-page":"7793","article-title":"Beyond homophily in graph neural networks: current limitations and effective designs","volume":"33","author":"Zhu","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0022","series-title":"Proceedings of the 31st ACM International Conference on Information & Knowledge Management","first-page":"2434","article-title":"LTE4G: long-tail experts for graph neural networks","author":"Yun","year":"2022"},{"issue":"5","key":"10.1016\/j.patcog.2026.113631_bib0023","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TKDE.2023.3315284","article-title":"Tackling long-tailed distribution issue in graph neural networks via normalization","volume":"36","author":"Liang","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10.1016\/j.patcog.2026.113631_bib0024","first-page":"238","article-title":"Centrality in social networks: conceptual clarification","volume":"1","author":"Freeman","year":"2002","journal-title":"Social Network Crit. Concepts Sociol. Londres Routledge"},{"issue":"20","key":"10.1016\/j.patcog.2026.113631_bib0025","first-page":"10","article-title":"Graph attention networks","volume":"1050","author":"Velickovic","year":"2017","journal-title":"Statistics"},{"key":"10.1016\/j.patcog.2026.113631_bib0026","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111649","article-title":"Simple and deep graph attention networks","volume":"293","author":"Su","year":"2024","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0027","unstructured":"H. Pei, B. Wei, K.C.-C. Chang, Y. Lei, B. Yang, Geom-GCN: geometric graph convolutional networks, (2020). arxiv: 2002.05287\">arxiv preprint arXiv: 2002.05287."},{"key":"10.1016\/j.patcog.2026.113631_bib0028","series-title":"The Eleventh International Conference on Learning Representations","article-title":"A critical look at evaluation of GNNs under heterophily: are we really making progress?","author":"Platonov","year":"2023"},{"key":"10.1016\/j.patcog.2026.113631_bib0029","series-title":"International Conference on Machine Learning","first-page":"23341","article-title":"How powerful are spectral graph neural networks","author":"Wang","year":"2022"},{"key":"10.1016\/j.patcog.2026.113631_bib0030","series-title":"International Conference on Learning Representations (ICLR)","article-title":"Predict then propagate: graph neural networks meet personalized PageRank","author":"Gasteiger","year":"2019"},{"key":"10.1016\/j.patcog.2026.113631_bib0031","series-title":"International Conference on Machine Learning","first-page":"1341","article-title":"HALF-HOP: a graph upsampling approach for slowing down message passing","author":"Azabou","year":"2023"},{"key":"10.1016\/j.patcog.2026.113631_bib0032","series-title":"The Eleventh International Conference on Learning Representations","article-title":"Specformer: spectral graph neural networks meet transformers","author":"Bo","year":"2023"},{"key":"10.1016\/j.patcog.2026.113631_bib0033","first-page":"21834","article-title":"Dirichlet energy constrained learning for deep graph neural networks","volume":"34","author":"Zhou","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0034","first-page":"3836","article-title":"PDE-GCN: novel architectures for graph neural networks motivated by partial differential equations","volume":"34","author":"Eliasof","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0035","first-page":"1362","article-title":"Revisiting heterophily for graph neural networks","volume":"35","author":"Luan","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0036","series-title":"The Thirteenth International Conference on Learning Representations","article-title":"GNNs getting ComFy: community and feature similarity guided rewiring","author":"Rubio-Madrigal","year":"2025"},{"key":"10.1016\/j.patcog.2026.113631_bib0037","first-page":"57150","article-title":"Enhancing graph transformers with hierarchical distance structural encoding","volume":"37","author":"Luo","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0038","doi-asserted-by":"crossref","first-page":"93540","DOI":"10.52202\/079017-2966","article-title":"Unifying homophily and heterophily for spectral graph neural networks via triple filter ensembles","volume":"37","author":"Duan","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.patcog.2026.113631_bib0039","series-title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V. 2","first-page":"1353","article-title":"Partition-wise graph filtering: a unified perspective through the lens of graph coarsening","author":"Li","year":"2025"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326005960?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326005960?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T21:15:12Z","timestamp":1781298912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326005960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":39,"alternative-id":["S0031320326005960"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113631","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"DSA-GNN: Optimizing long-tail in graph structures via degree suppression with attention","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113631","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"113631"}}