{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T19:47:26Z","timestamp":1786132046103,"version":"build-2736575974"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"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":"crossref","award":["2408085J037"],"award-info":[{"award-number":["2408085J037"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62576004"],"award-info":[{"award-number":["62576004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1109\/tpami.2026.3686463","type":"journal-article","created":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:49:36Z","timestamp":1776887376000},"page":"11216-11223","source":"Crossref","is-referenced-by-count":0,"title":["Reliable and Compact Graph Fine-Tuning via Graph Sparse Prompting"],"prefix":"10.1109","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6238-1596","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"first","affiliation":[{"name":"Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2877-2470","authenticated-orcid":false,"given":"Hao","family":"Wu","sequence":"additional","affiliation":[{"name":"Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1272-1596","authenticated-orcid":false,"given":"Beibei","family":"Wang","sequence":"additional","affiliation":[{"name":"Anhui University","place":["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":"Anhui University","place":["Hefei, 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":"Anhui University","place":["Hefei, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref3","first-page":"22379","article-title":"AFEC: Active forgetting of negative transfer in continual learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang","year":"2021"},{"key":"ref4","article-title":"Graph prompt learning: A comprehensive survey and beyond","author":"Sun","year":"2023"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70362-1_25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.52202\/075280-2285"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2026.123516"},{"key":"ref12","article-title":"A unified graph selective prompt learning for graph neural networks","author":"Jiang","year":"2024"},{"key":"ref13","first-page":"2177","article-title":"Virtual node tuning for few-shot node classification","volume-title":"Proc. ACM SIGKDD Conf. Knowl. Discov. Data Mining","author":"Tan","year":"2023"},{"key":"ref14","first-page":"64377","article-title":"Does graph prompt work? A data operation perspective with theoretical analysis","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2025"},{"key":"ref15","first-page":"1813","article-title":"Efficient and robust feature selection via joint $\\ell _{(2,1)}$\u2113(2,1)-norms minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Nie","year":"2010"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref17","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"ref19","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"ref21","article-title":"Self-supervised learning on graphs: Deep insights and new direction","author":"Jin","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0718"},{"key":"ref23","article-title":"One for all: Towards training one graph model for all classification tasks","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Liu","year":"2024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645685"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i15.29596"},{"key":"ref26","article-title":"Text-free multi-domain graph pre-training: Toward graph foundation models","author":"Yu","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref30","article-title":"Pitfalls of graph neural network evaluation","volume-title":"Proc. NeurIPS Workshop Relational Representation Learn.","author":"Shchur","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742839"},{"key":"ref32","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Pei","year":"2020"},{"key":"ref33","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu","year":"2020"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref35","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. ICML 2020 Workshop Graph Representation Learn. Beyond","author":"Morris","year":"2020"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3023"},{"key":"ref37","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref38","article-title":"GraphSAINT: Graph sampling based inductive learning method","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zeng","year":"2020"},{"key":"ref39","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"ref40","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11643729\/11491913.pdf?arnumber=11491913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T19:09:15Z","timestamp":1786129755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11491913\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":40,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2026.3686463","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,9]]}}}