{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:38Z","timestamp":1775815478736,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2024YFB2505604"],"award-info":[{"award-number":["2024YFB2505604"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306137"],"award-info":[{"award-number":["62306137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Australian Research Council under the streams of Future Fellowship","award":["FT210100624"],"award-info":[{"award-number":["FT210100624"]}]},{"name":"Australian Research Council under the streams of Future Fellowship","award":["DP240101108"],"award-info":[{"award-number":["DP240101108"]}]},{"name":"Australian Research Council under the streams of Future Fellowship","award":["LP230200892"],"award-info":[{"award-number":["LP230200892"]}]},{"name":"Australian Research Council under the streams of Future Fellowship","award":["LP240200546"],"award-info":[{"award-number":["LP240200546"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/tkde.2025.3589596","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T17:40:09Z","timestamp":1752687609000},"page":"6189-6201","source":"Crossref","is-referenced-by-count":2,"title":["Teaching MLPs to Master Heterogeneous Graph-Structured Knowledge for Efficient and Accurate Inference"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3337-0886","authenticated-orcid":false,"given":"Yunhui","family":"Liu","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1146-8925","authenticated-orcid":false,"given":"Xinyi","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Information Technology and Electrical Engineering, University of Queensland, Brisbane, QLD, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9649-1796","authenticated-orcid":false,"given":"Tieke","family":"He","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhua","family":"Zhao","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1395-261X","authenticated-orcid":false,"given":"Hongzhi","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Information Technology and Electrical Engineering, University of Queensland, Brisbane, QLD, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3045924"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331258"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3222168"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2833443"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3142056"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-36559-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3101356"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467350"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00217"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380297"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3079239"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3435887"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671563"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599843"},{"key":"ref17","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref18","article-title":"Learning MLPs on graphs: A unified view of effectiveness, robustness, and efficiency","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Tian"},{"key":"ref19","first-page":"37571","article-title":"Quantifying the knowledge in GNNs for reliable distillation into MLPs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref20","article-title":"VQGraph: Rethinking graph representation space for bridging GNNs and MLPs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yang"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1503.02531"},{"key":"ref22","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref23","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM58522.2023.00172"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26232"},{"key":"ref26","first-page":"12012","article-title":"Linkless link prediction via relational distillation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645542"},{"key":"ref28","article-title":"LightHGNN: Distilling hypergraph neural networks into MLPs for 100\u00d7 faster inference","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Feng"},{"key":"ref29","article-title":"In defense of pseudo-labeling: An uncertainty-aware pseudo-label selection framework for semi-supervised learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rizve"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389706"},{"key":"ref31","first-page":"76214","article-title":"Deep insights into noisy pseudo labeling on graph data","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467415"},{"key":"ref33","article-title":"OGB-LSC: A large-scale challenge for machine learning on graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref34","article-title":"On graph neural networks versus graph-augmented MLPs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen"},{"key":"ref35","article-title":"Rethinking softmax with cross-entropy: Neural network classifier as mutual information estimator","author":"Qin","year":"2019","journal-title":"arXiv: 1911.10688"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-019-0237-x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3701716.3715302"},{"key":"ref38","first-page":"5776","article-title":"MiniLM: Deep self-attention distillation for task-agnostic compression of pre-trained transformers","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Wang"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"ref40","article-title":"RoBERTa: A robustly optimized BERT pretraining approach","author":"Liu","year":"2019"},{"key":"ref41","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref42","article-title":"Relational graph attention networks","author":"Busbridge","year":"2019"},{"key":"ref43","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref44","article-title":"Learning accurate, efficient, and interpretable MLPs on multiplex graphs via node-wise multi-view ensemble distillation","volume-title":"Proc. Int. Conf. Database Syst. Adv. Appl.","author":"Liu"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.08.022"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3374773"},{"key":"ref47","article-title":"Single teacher, multiple perspectives: Teacher knowledge augmentation for enhanced knowledge distillation","volume-title":"Proc. 13th Int. Conf. Learn. Representations","author":"Hossain"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11163535\/11081456.pdf?arnumber=11081456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T05:42:19Z","timestamp":1757742139000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11081456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":47,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3589596","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}