{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T21:16:21Z","timestamp":1779311781463,"version":"3.51.4"},"reference-count":87,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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":["U2441242"],"award-info":[{"award-number":["U2441242"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tpami.2025.3543211","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T18:20:37Z","timestamp":1739902837000},"page":"4377-4394","source":"Crossref","is-referenced-by-count":5,"title":["Shared Growth of Graph Neural Networks via Prompted Free-Direction Knowledge Distillation"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8746-6900","authenticated-orcid":false,"given":"Kaituo","family":"Feng","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2173-153X","authenticated-orcid":false,"given":"Yikun","family":"Miao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9789-7632","authenticated-orcid":false,"given":"Changsheng","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-9866","authenticated-orcid":false,"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref3","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3111054"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3209686"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3080635"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3154319"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00710"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450068"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/320"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403236"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150464"},{"key":"ref17","article-title":"Distilling the knowledge in a neural network","author":"Hinton","year":"2015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i16.17680"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330841"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.109687"},{"key":"ref22","article-title":"Signed directed graph contrastive learning with Laplacian augmentation","author":"Ko","year":"2023"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2023.3313206"},{"key":"ref24","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref25","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019"},{"key":"ref26","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20700"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539320"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2024.3388453"},{"key":"ref31","article-title":"Towards open temporal graph neural networks","author":"Feng","year":"2023"},{"key":"ref32","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018"},{"issue":"9","key":"ref33","first-page":"12","article-title":"The reduction of a graph to canonical form and the algebra which appears therein","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsia Ser."},{"key":"ref34","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467221"},{"key":"ref36","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"Gasteiger","year":"2018"},{"key":"ref37","article-title":"The pagerank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"key":"ref38","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref39","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref40","first-page":"742","article-title":"Learning efficient object detection models with knowledge distillation","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3240508.3240567"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1139"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-1441"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25944"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3223018"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/314"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389706"},{"key":"ref48","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","author":"Zhang","year":"2021"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/s0262-4079(20)31816-9"},{"key":"ref50","first-page":"12012","article-title":"Linkless link prediction via relational distillation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2743240"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12281"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3223407"},{"key":"ref57","first-page":"1861","article-title":"Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Haarnoja"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2899570"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3185101"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3118815"},{"key":"ref61","article-title":"Safe, multi-agent, reinforcement learning for autonomous driving","author":"Shalev-Shwartz","year":"2016"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"ref63","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Brown"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"ref65","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.4637382","article-title":"SGL-PT: A strong graph learner with graph prompt tuning","author":"Zhu","year":"2023"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775086"},{"key":"ref67","first-page":"29885","article-title":"Topology-imbalance learning for semi-supervised node classification","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/181"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467196"},{"key":"ref70","first-page":"3478","article-title":"RMM: Reinforced memory management for class-incremental learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Liu"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403088"},{"key":"ref72","first-page":"1","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref73","article-title":"Representation learning with contrastive predictive coding","author":"Oord","year":"2018"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref75","article-title":"GEOM-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020"},{"key":"ref76","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref77","first-page":"4563","article-title":"Adaptive sampling towards fast graph representation learning","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Huang"},{"key":"ref78","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":"ref79","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"issue":"11","key":"ref80","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref81","first-page":"1341","article-title":"Half-hop: A graph upsampling approach for slowing down message passing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Azabou"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00031"},{"key":"ref83","first-page":"1","article-title":"Entropy-SGD: Biasing gradient descent into wide valleys","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chaudhari"},{"key":"ref84","first-page":"4694","article-title":"When does label smoothing help?","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"M\u00fcller"},{"key":"ref85","article-title":"Layer normalization","author":"Ba","year":"2016"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00806"},{"key":"ref87","first-page":"1607","article-title":"Born again neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Furlanello"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/10990047\/10891755.pdf?arnumber=10891755","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T17:38:24Z","timestamp":1746725904000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10891755\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":87,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3543211","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,6]]}}}