{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:00:07Z","timestamp":1768280407060,"version":"3.49.0"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"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 &#x0026; 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":[[2026,2]]},"DOI":"10.1109\/tpami.2025.3611386","type":"journal-article","created":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T17:30:51Z","timestamp":1758130251000},"page":"1229-1242","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Deformable Convolution on Graphs: Large-Range Modeling and Robustness"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9429-1635","authenticated-orcid":false,"given":"Ziyan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6238-1596","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Opto-Electronic Information Acquisition and Protection Technology, School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICESC51422.2021.9532631"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2022.3194869"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WIIAT.2008.235"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3014591"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2935173"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/diagnostics12061376"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref10","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref11","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Adv. Neural Inf. Process. Syst.","author":"Defferrard","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref13","article-title":"Graph wavelet neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref14","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref15","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref16","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":"ref17","article-title":"AdaGCN: Adaboosting graph convolutional networks into deep models","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sun"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/425"},{"key":"ref19","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3119958"},{"key":"ref21","first-page":"13266","article-title":"Representing long-range context for graph neural networks with global attention","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3487553.3524258"},{"key":"ref23","first-page":"27387","article-title":"Nodeformer: A scalable graph structure learning transformer for node classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wu"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.89"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20765"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2024.3378886"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5120\/9332-3638"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref30","first-page":"855","volume-title":"Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Grover"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s12517-014-1717-z"},{"key":"ref33","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref34","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0103-5"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/194"},{"key":"ref38","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref40","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref41","article-title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sun"},{"key":"ref42","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref45","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref46","article-title":"Graph capsule convolutional neural networks","author":"Verma","year":"2018"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3011866"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8851698"},{"key":"ref49","first-page":"21997","article-title":"DropGNN: Random dropouts increase the expressiveness of graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Papp"},{"key":"ref50","article-title":"Wasserstein embedding for graph learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kolouri"},{"key":"ref51","first-page":"20286","article-title":"Factorizable graph convolutional networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref52","article-title":"Accurate learning of graph representations with graph multiset pooling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Baek"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-025-60252-z"},{"key":"ref54","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref57","article-title":"GraphSAINT: Graph sampling based inductive learning method","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zeng"},{"key":"ref58","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref59","article-title":"GRAPH-BERT: Only attention is needed for learning graph representations","author":"Zhang","year":"2020"},{"key":"ref60","first-page":"54656","article-title":"Less is more: On the over-globalizing problem in graph transformers","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xing"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"ref62","article-title":"Long range graph benchmark","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dwivedi"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0275-4"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10602-1_48"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"ref66","article-title":"Adversarial attacks on graph neural networks via meta learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Z\u00fcgner"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.18017"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11345188\/11169430.pdf?arnumber=11169430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:00:54Z","timestamp":1768255254000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11169430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":67,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3611386","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":[[2026,2]]}}}