{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,4]],"date-time":"2026-09-04T03:25:39Z","timestamp":1788492339652,"version":"build-2803163510"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2408085J037"],"award-info":[{"award-number":["2408085J037"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Technologies R&D Program of Anhui Province","award":["202423k09020039"],"award-info":[{"award-number":["202423k09020039"]}]},{"name":"Open Research Fund of the State Key Laboratory of Brain-Machine Intelligence, Zhejiang University","award":["BMI2400004"],"award-info":[{"award-number":["BMI2400004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tpami.2025.3593912","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T18:50:56Z","timestamp":1753901456000},"page":"10862-10869","source":"Crossref","is-referenced-by-count":4,"title":["Graph Spiking Attention Network: Sparsity, Efficiency and Robustness"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1272-1596","authenticated-orcid":false,"given":"Beibei","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology of Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6238-1596","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology of Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8375-3590","authenticated-orcid":false,"given":"Jin","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology of Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1033-8908","authenticated-orcid":false,"given":"Lu","family":"Bai","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Beijing Normal University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1414-3307","authenticated-orcid":false,"given":"Bin","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology of Anhui University, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref2","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref3","article-title":"Dropedge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3183143"},{"key":"ref5","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref6","article-title":"How attentive are graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/257"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3072345"},{"key":"ref9","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zheng"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3070599"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3285215"},{"key":"ref12","article-title":"Not all neighbors are worth attending to: Graph selective attention networks for semi-supervised learning","author":"He","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104129"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3363703"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3389\/fnins.2018.00774"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00266"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/338"},{"key":"ref18","article-title":"Spikformer: When spiking neural network meets transformer","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhou"},{"key":"ref19","first-page":"1692","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Liu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/211"},{"key":"ref21","first-page":"2641","article-title":"Learning conjoint attentions for graph neural nets","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"He"},{"key":"ref22","article-title":"How to find your friendly neighborhood: Graph attention design with self-supervision","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kim"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011311"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0361-9230(99)00161-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512201"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583335"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr46437.2021.01650"},{"key":"ref29","article-title":"Graph neural networks exponentially lose expressive power for node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Oono"},{"key":"ref30","article-title":"Bridging smoothness and approximation: Theoretical insights into over-smoothing in graph neural networks","author":"Yang","year":"2024"},{"key":"ref31","first-page":"21997","article-title":"DropGNN: Random dropouts increase the expressiveness of graph neural networks","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Papp"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref33","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur"},{"key":"ref34","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref36","article-title":"Caltech-256 object category dataset","author":"Griffin","year":"2007"},{"key":"ref37","article-title":"Tudataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. ICML Workshop Graph Representation Learn. Beyond","author":"Morris"},{"key":"ref38","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref39","article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref40","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref41","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref42","first-page":"27387","article-title":"Nodeformer: A scalable graph structure learning transformer for node classification","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"ref44","article-title":"Deeprobust: A pytorch library for adversarial attacks and defenses","author":"Li","year":"2020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3534678"},{"key":"ref47","first-page":"25058","article-title":"Not all low-pass filters are robust in graph convolutional networks","volume-title":"Proc. Int. conf. Neural Inf. Process. Syst.","author":"Chang"},{"key":"ref48","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhu"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11192800\/11104926.pdf?arnumber=11104926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T17:36:37Z","timestamp":1759772197000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11104926\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":48,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3593912","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}