{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T07:02:22Z","timestamp":1782975742001,"version":"3.54.5"},"reference-count":64,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23A20300"],"award-info":[{"award-number":["U23A20300"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005320","name":"Xidian University","doi-asserted-by":"publisher","award":["GNYZ2024XX007"],"award-info":[{"award-number":["GNYZ2024XX007"]}],"id":[{"id":"10.13039\/501100005320","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/sp63933.2026.00212","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:34:20Z","timestamp":1782934460000},"page":"398-416","source":"Crossref","is-referenced-by-count":0,"title":["Are LLM-Enhanced Graph Neural Networks Robust Against Poisoning Attacks?"],"prefix":"10.1109","author":[{"given":"Yuhang","family":"Ma","sequence":"first","affiliation":[{"name":"School of Cyber Engineering, Xidian University,State Key Laboratory of Integrated Services Networks,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University,State Key Laboratory of Integrated Services Networks,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Cyber Engineering, Xidian University,State Key Laboratory of Integrated Services Networks,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"9263","article-title":"Gnnguard: Defending graph neural networks against adversarial attacks","volume":"33","author":"Zhang","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref2","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref3","article-title":"Link prediction based on graph neural networks","volume":"31","author":"Zhang","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref4","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv preprint arXiv"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/00437956.1954.11659520"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1310.4546"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690322"},{"key":"ref9","article-title":"Harnessing explanations: Llm-to-lm interpreter for enhanced textattributed graph representation learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"He","year":"2024"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3655103.3655110"},{"key":"ref11","article-title":"One for all: Towards training one graph model for all classification tasks","author":"Liu","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref12","first-page":"5734","article-title":"Efficient tuning and inference for large language models on textual graphs","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Zhu","year":"2024"},{"key":"ref13","article-title":"Node feature extraction by self-supervised multi-scale neighborhood prediction","author":"Chien","year":"2021","journal-title":"arXiv preprint arXiv"},{"key":"ref14","article-title":"Simteg: A frustratingly simple approach improves textual graph learning","author":"Duan","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1340"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SPW50608.2020.00028"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371851"},{"key":"ref18","article-title":"Learning on graphs with large language models (llms): A deep dive into model robustness","author":"Guo","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3690624.3709256"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref22","article-title":"Llama: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref23","volume-title":"Embeddings API reference","year":"2024"},{"key":"ref24","volume-title":"Linq-Embed-Mistral: Elevating text retrieval with improved GPT data through task-specific control and quality refinement","author":"Kim","year":"2024"},{"key":"ref25","article-title":"Text embeddings by weakly-supervised contrastive pre-training","author":"Wang","year":"2022","journal-title":"arXiv preprint arXiv"},{"key":"ref26","article-title":"Smarter, better, faster, longer: A modern bidirectional encoder for fast, memory efficient, and long context finetuning and inference","author":"Warner","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref27","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv preprint arXiv"},{"key":"ref28","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220078"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3078755"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3296936"},{"key":"ref32","article-title":"Adversarial attacks on graph neural networks via meta learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Z\u00fcgner","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1038\/s41562-017-0290-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3364972"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SPW.2018.00016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.500"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.371"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3201243"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403049"},{"key":"ref42","first-page":"7637","article-title":"Robustness of graph neural networks at scale","volume":"34","author":"Geisler","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref43","first-page":"8123","article-title":"A survey of graph meets large language model: progress and future directions","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Li","year":"2024"},{"key":"ref44","article-title":"Gpt-4 technical report","author":"Achiam","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref45","article-title":"Bert: a review of applications in natural language processing and understanding","author":"Koroteev","year":"2021","journal-title":"arXiv preprint arXiv"},{"key":"ref46","article-title":"Roberta: A robustly optimized bert pretraining approach","author":"Liu","year":"2019","journal-title":"arXiv preprint arXiv"},{"key":"ref47","first-page":"1877","article-title":"Language models are few-shot learners","volume":"33","author":"Brown","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref48","article-title":"Deberta: Decoding-enhanced bert with disentangled attention","author":"He","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref49","first-page":"4171","article-title":"Bert: Pretraining of deep bidirectional transformers for language understanding","volume-title":"Proc. Conf. North Amer. Assoc. Comput. Linguist. Human Lang. Technol.","author":"Devlin","year":"2019"},{"key":"ref50","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref51","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody","year":"2022"},{"issue":"Nov","key":"ref52","first-page":"2579","article-title":"Visualizing data using t-sne","volume":"9","author":"Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"ref55","article-title":"Learning deep representations by mutual information estimation and maximization","author":"Hjelm","year":"2018","journal-title":"arXiv preprint arXiv"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25618"},{"key":"ref57","article-title":"Unifying graph convolutional neural networks and label propagation","author":"Wang","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref58","article-title":"word2vec parameter learning explained","author":"Rong","year":"2014","journal-title":"arXiv preprint arXiv"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref60","article-title":"Deeprobust: A pytorch library for adversarial attacks and defenses","author":"Li","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref61","article-title":"Openattack: An open-source textual adversarial attack toolkit","author":"Zeng","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"ref64","first-page":"1003","article-title":"Efficient robustness certificates for discrete data: sparsity-aware randomized smoothing for graphs, images and more","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bojchevski","year":"2020"}],"event":{"name":"2026 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["2026 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11573355\/11573356\/11573575.pdf?arnumber=11573575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:36:09Z","timestamp":1782970569000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11573575\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":64,"URL":"https:\/\/doi.org\/10.1109\/sp63933.2026.00212","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}