{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:02:13Z","timestamp":1767679333089,"version":"3.48.0"},"reference-count":53,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tkde.2025.3632233","type":"journal-article","created":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T18:43:06Z","timestamp":1762972986000},"page":"1292-1305","source":"Crossref","is-referenced-by-count":0,"title":["Restricted Black-Box Attack on Graphs Beyond Homophily"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2700-3840","authenticated-orcid":false,"given":"Runlin","family":"Lei","sequence":"first","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4856-3023","authenticated-orcid":false,"given":"Haipeng","family":"Ding","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3620-5086","authenticated-orcid":false,"given":"Zhewei","family":"Wei","sequence":"additional","affiliation":[{"name":"Gaoling School of Artificial Intelligence, Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref2","first-page":"6790","article-title":"GemNet: Universal directional graph neural networks for molecules","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Gasteiger"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-024-03343-0"},{"article-title":"Graph neural networks for graphs with heterophily: A survey","year":"2022","author":"Zheng","key":"ref5"},{"article-title":"The heterophilic graph learning handbook: Benchmarks, models, theoretical analysis, applications and challenges","year":"2024","author":"Luan","key":"ref6"},{"article-title":"Is homophily a necessity for graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Ma","key":"ref7"},{"key":"ref8","first-page":"1362","article-title":"Revisiting heterophily for graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Luan"},{"key":"ref9","first-page":"1123","article-title":"Adversarial attack on graph structured data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"article-title":"Adversarial attacks on graph neural networks via meta learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Z\u00fcgner","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/550"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3447556.3447566"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5741"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539435"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00081"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-2253-2_28"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635826"},{"article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","key":"ref19"},{"article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic","key":"ref20"},{"key":"ref21","first-page":"7637","article-title":"Robustness of graph neural networks at scale","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Geisler"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20350"},{"key":"ref23","first-page":"695","article-title":"Adversarial attacks on node embeddings via graph poisoning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bojchevski"},{"key":"ref24","first-page":"4756","article-title":"Towards more practical adversarial attacks on graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ma"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498497"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467416"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484796"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20350"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3465336.3475110"},{"key":"ref30","first-page":"8590","article-title":"Contextual stochastic block models","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Deshpande"},{"article-title":"Adaptive universal generalized PageRank graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chien","key":"ref31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/403"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.100"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46478-7_31"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref36","first-page":"1027","article-title":"k-means: The advantages of careful seeding","volume-title":"Proc. Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Arthur"},{"article-title":"GreatX: A collection of GNN robustness methods","year":"2023","author":"Li","key":"ref37"},{"article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","key":"ref38"},{"article-title":"Revisiting graph adversarial attack and defense from a data distribution perspective","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei","key":"ref42"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Platonov","key":"ref44"},{"key":"ref45","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"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/310"},{"key":"ref48","first-page":"9263","article-title":"GNNGUARD: Defending graph neural networks against adversarial attacks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref49","first-page":"4694","article-title":"EvenNet: Ignoring odd-hop neighbors improves robustness of graph neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Lei"},{"article-title":"Graph clustering with graph neural networks","year":"2020","author":"Tsitsulin","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380214"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3267902"},{"article-title":"Characterizing graph datasets for node classification: Beyond homophily-heterophily dichotomy","year":"2022","author":"Platonov","key":"ref53"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11329113\/11244263.pdf?arnumber=11244263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:58:20Z","timestamp":1767679100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11244263\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":53,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3632233","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}