{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T17:46:25Z","timestamp":1794851185759,"version":"4.9.1"},"reference-count":46,"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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U24B20180"],"award-info":[{"award-number":["U24B20180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62121002"],"award-info":[{"award-number":["62121002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"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.3594687","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T18:46:50Z","timestamp":1754333210000},"page":"5866-5877","source":"Crossref","is-referenced-by-count":11,"title":["Exact and Efficient Unlearning for Large Language Model-Based Recommendation"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9092-8888","authenticated-orcid":false,"given":"Zhiyu","family":"Hu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7863-5183","authenticated-orcid":false,"given":"Yang","family":"Zhang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghao","family":"Xiao","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5199-1428","authenticated-orcid":false,"given":"Wenjie","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5828-9842","authenticated-orcid":false,"given":"Fuli","family":"Feng","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8472-7992","authenticated-orcid":false,"given":"Xiangnan","family":"He","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06291-2"},{"key":"ref2","article-title":"LLaMA-adapter V2: Parameter-efficient visual instruction model","author":"Gao","year":"2023"},{"key":"ref3","article-title":"Multimodal chain-of-thought reasoning in language models","volume":"2024","author":"Zhang","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3540912"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3604915.3608857"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3716393"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635805"},{"key":"ref8","article-title":"Privacy-preserving recommender systems with synthetic query generation using differentially private large language models","author":"Carranza","year":"2023"},{"key":"ref9","first-page":"76852","article-title":"Flocks of stochastic parrots: Differentially private prompt learning for large language models","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Duan"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417880"},{"key":"ref11","first-page":"2633","article-title":"Extracting training data from large language models","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Carlini"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3701763"},{"key":"ref14","article-title":"Forgetting fast in recommender systems","author":"Liu","year":"2022"},{"key":"ref15","first-page":"40034","article-title":"In-context unlearning: Language models as few-shot unlearners","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","author":"Pawelczyk"},{"key":"ref16","article-title":"Who\u2019s Harry Potter? Approximate unlearning in LLMs","author":"Eldan","year":"2023"},{"key":"ref17","first-page":"105425","article-title":"Large language model unlearning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yao"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-024-40044-2"},{"issue":"1","key":"ref19","first-page":"1","article-title":"General data protection regulation","volume":"25","author":"Regulation","year":"2018","journal-title":"Intouch"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511997"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559352"},{"issue":"2","key":"ref22","article-title":"LoRA: Low-rank adaptation of large language models","volume-title":"Proc. Int. Conf. Learn. Representations","volume":"1","author":"Hu"},{"key":"ref23","article-title":"Challenges and applications of large language models","author":"Kaddour","year":"2023"},{"key":"ref24","first-page":"23965","article-title":"Model soups: Averaging weights of multiple fine-tuned models improves accuracy without increasing inference time","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wortsman"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.568"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645467"},{"key":"ref27","first-page":"2790","article-title":"Parameter-efficient transfer learning for NLP","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Houlsby"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670398"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1205.2618"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591755"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20736"},{"key":"ref37","article-title":"A survey on recommendation unlearning: Fundamentals, taxonomy, evaluation, and open questions","author":"Li","year":"2024"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3603620"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3749987"},{"key":"ref40","first-page":"2008","article-title":"Approximate data deletion from machine learning models","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Izzo"},{"key":"ref41","first-page":"1589","article-title":"Fawkes: Protecting privacy against unauthorized deep learning models","volume-title":"Proc. 29th USENIX Secur. Symp.","author":"Shan"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3266233"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM55620.2022.9995016"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.280"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124760"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acllong.353"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11163535\/11112699.pdf?arnumber=11112699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T05:43:21Z","timestamp":1757742201000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11112699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":46,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3594687","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]]}}}