{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:42:22Z","timestamp":1774975342935,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation, Singapore, under its Strategic Capability Research Centres Funding Initiative","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001381","name":"Anusandhan National Research Foundation (ANRF), Erstwhile Science and Engineering Research Board (SERB) India Project","doi-asserted-by":"publisher","award":["SRG\/2023\/001686"],"award-info":[{"award-number":["SRG\/2023\/001686"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1109\/tnnls.2025.3607995","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:54:25Z","timestamp":1760032465000},"page":"428-437","source":"Crossref","is-referenced-by-count":3,"title":["Distill to Delete: Unlearning in Graph Networks With Knowledge Distillation"],"prefix":"10.1109","volume":"37","author":[{"given":"Yash","family":"Sinha","sequence":"first","affiliation":[{"name":"School of Computing, National University of Singapore, Queenstown, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0157-0967","authenticated-orcid":false,"given":"Murari","family":"Mandal","sequence":"additional","affiliation":[{"name":"RespAI Lab, School of Computer Engineering, KIIT, Bhubaneswar, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4846-2015","authenticated-orcid":false,"given":"Mohan","family":"Kankanhalli","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Queenstown, Singapore"}]}],"member":"263","reference":[{"key":"ref1","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Conf. Neural Inf. Process. Syst.","volume":"33","author":"Hu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57959-7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3211013"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4082390"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3749987"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559352"},{"key":"ref10","first-page":"3205","article-title":"Inductive graph unlearning","volume-title":"Proc. USENIX Secur. Symp.","author":"Wang"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SaTML54575.2023.00047"},{"key":"ref12","article-title":"Learn locally, correct globally: A distributed algorithm for training graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Ramezani"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPSISA52974.2021.00002"},{"key":"ref14","article-title":"Grapheditor: An efficient graph representation learning and unlearning approach","author":"Cong","year":"2022"},{"key":"ref15","first-page":"6674","article-title":"Efficiently forgetting what you have learned in graph representation learning via projection","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Cong"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583521"},{"key":"ref17","article-title":"Certified graph unlearning","volume-title":"Proc. NeurIPS Workshop, New Frontiers Graph Learn.","author":"Chien"},{"key":"ref18","article-title":"Efficient model updates for approximate unlearning of graph-structured data","volume-title":"Proc. The 11th Int. Conf. Learn. Represent.","author":"Chien"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599271"},{"key":"ref20","article-title":"GNNDelete: A general strategy for unlearning in graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Cheng"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3266233"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i6.25879"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3265506"},{"key":"ref24","first-page":"33921","article-title":"Deep regression unlearning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Tarun"},{"key":"ref25","article-title":"Federated unlearning with knowledge distillation","author":"Wu","year":"2022","journal-title":"arXiv:2201.09441"},{"key":"ref26","article-title":"ConDa: Fast federated unlearning with contribution dampening","author":"Chundawat","year":"2024","journal-title":"arXiv:2410.04144"},{"key":"ref27","article-title":"UnStar: Unlearning with self-taught anti-sample reasoning for LLMs","author":"Sinha","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref28","article-title":"Agents are all you need for LLM unlearning","author":"Sanyal","year":"2025","journal-title":"arXiv:2502.00406"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3681177"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583547"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583305"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v39i12.33367"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01569"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-021-01453-z"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3055564"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.41"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011190"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CNS62487.2024.10735680"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00932"},{"key":"ref41","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref42","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018","journal-title":"arXiv:1811.05868"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380297"},{"key":"ref44","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kipf"},{"issue":"20","key":"ref45","first-page":"1","article-title":"Graph attention networks","volume":"1050","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"Stat"},{"key":"ref46","article-title":"How powerful are graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref47","first-page":"931","article-title":"Descent-to-delete: Gradient-based methods for machine unlearning","volume-title":"Proc. Algorithmic Learn. Theory","author":"Neel"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651265"},{"key":"ref49","article-title":"Scalable and certifiable graph unlearning: Overcoming the approximation error barrier","author":"Yi","year":"2024","journal-title":"arXiv:2408.09212"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671744"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29273"},{"key":"ref52","article-title":"Toward scalable graph unlearning: A node influence maximization based approach","author":"Li","year":"2025","journal-title":"arXiv:2501.11823"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-7356-9_29"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651578"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11339259\/11197591.pdf?arnumber=11197591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:02:01Z","timestamp":1768255321000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11197591\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":54,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3607995","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]}}}