{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:55:43Z","timestamp":1766472943096,"version":"3.48.0"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005089","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["L252162"],"award-info":[{"award-number":["L252162"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005089","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["L232113"],"award-info":[{"award-number":["L232113"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3638667","type":"journal-article","created":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T18:42:12Z","timestamp":1764355332000},"page":"13401-13415","source":"Crossref","is-referenced-by-count":0,"title":["Copyright Protection of General Information via Simulation Task Supervision"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4840-9521","authenticated-orcid":false,"given":"Chenxi","family":"Hu","sequence":"first","affiliation":[{"name":"School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8006-6701","authenticated-orcid":false,"given":"Yangyi","family":"Hu","sequence":"additional","affiliation":[{"name":"resides, Beijing, China"}]},{"given":"Huangxiang","family":"Li","sequence":"additional","affiliation":[{"name":"Baidu Inc., Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3086-0218","authenticated-orcid":false,"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[{"name":"College of Command and Control Engineering, Army Engineering University of PLA, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9298-9359","authenticated-orcid":false,"given":"Ning","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Oral Implantology, Peking University School and Hospital of Stomatology, National Center for Stomatology, National Clinical Research Center for Oral Diseases, National Engineering Research Center of Oral Biomaterials and Digital Medical Devices, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"PaLM: Scaling language modeling with pathways","volume":"24","author":"Chowdhery","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref2","article-title":"Language models are few-shot learners","author":"Brown","year":"2020","journal-title":"arXiv:2005.14165"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.bigscience-1.9"},{"key":"ref4","article-title":"Llama 2: Open foundation and fine-tuned chat models","author":"Touvron","year":"2023","journal-title":"arXiv:2307.09288"},{"key":"ref5","first-page":"27730","article-title":"Training language models to follow instructions with human feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ouyang"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.findings-eacl.83"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.85"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-61572-6_3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.720"},{"key":"ref10","article-title":"SILO language models: Isolating legal risk in a nonparametric datastore","author":"Min","year":"2023","journal-title":"arXiv:2308.04430"},{"article-title":"Beyond fair use: Legal risk evaluation for training LLMs on copyrighted text","volume-title":"Proc. ICML Workshop Generative AI Law","author":"Noorjahan","key":"ref11"},{"key":"ref12","first-page":"32","article-title":"Patents in an era of infinite monkeys and artificial intelligence","volume":"19","author":"Hattenbach","year":"2015","journal-title":"Stan. Tech. L. Rev."},{"issue":"3","key":"ref13","first-page":"431","article-title":"Artificial intelligence and the copyright dilemma","volume":"57","author":"Hristov","year":"2016","journal-title":"Idea"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3331606"},{"issue":"5","key":"ref15","article-title":"Copyright infringement in AI-generated artworks","volume":"53","author":"Gillotte","year":"2019","journal-title":"UC Davis L. Rev."},{"volume-title":"Computer Associates International","year":"1992","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/13600834.2019.1573501"},{"issue":"1","key":"ref18","article-title":"The California consumer privacy act: Towards a European-style privacy regime in the United States","volume":"23","author":"Pardau","year":"2018","journal-title":"J. Tech. L. Pol\u2019y"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71782-7_35"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.35"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645669"},{"key":"ref23","article-title":"Large language model unlearning","author":"Yao","year":"2023","journal-title":"arXiv:2310.10683"},{"key":"ref24","article-title":"Negative preference optimization: From catastrophic collapse to effective unlearning","author":"Zhang","year":"2024","journal-title":"arXiv:2404.05868"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.738"},{"key":"ref26","article-title":"Who\u2019s Harry potter? Approximate unlearning in LLMs","author":"Eldan","year":"2023","journal-title":"arXiv:2310.02238"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.805"},{"key":"ref28","article-title":"Towards comprehensive post safety alignment of large language models via safety patching","author":"Zhao","year":"2024","journal-title":"arXiv:2405.13820"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.findings-naacl.288"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2025.acl-long.297"},{"key":"ref31","first-page":"39448","article-title":"Trainable transformer in transformer","volume-title":"Proc. ICML","author":"Panigrahi"},{"key":"ref32","article-title":"Does fine-tuning GPT-3 with the OpenAI API leak personally-identifiable information?","author":"Yu Sun","year":"2023","journal-title":"arXiv:2307.16382"},{"key":"ref33","first-page":"49008","article-title":"Algorithm and hardness for dynamic attention maintenance in large language models","volume-title":"Proc. ICML","author":"Brand"},{"key":"ref34","first-page":"1621","article-title":"Sophia: A scalable stochastic second-order optimizer for language model pre-training","volume-title":"Proc. ICLR","author":"Liu"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i16.29741"},{"key":"ref36","first-page":"3513","article-title":"Making AI forget you: Data deletion in machine learning","volume-title":"Proc. NeurIPS","volume":"32","author":"Ginart"},{"key":"ref37","first-page":"3832","article-title":"Certified data removal from machine learning models","volume-title":"Proc. ICML","author":"Guo"},{"key":"ref38","first-page":"18075","article-title":"Remember what you want to forget: Algorithms for machine unlearning","volume-title":"Proc. NeurIPS","author":"Sekhari"},{"article-title":"Efficient model updates for approximate unlearning of graph-structured data","volume-title":"Proc. ICLR","author":"Chien","key":"ref39"},{"key":"ref40","first-page":"28525","article-title":"The wmdp benchmark: Measuring and reducing malicious use with unlearning","volume-title":"Proc. 41st Int. Conf. Mach. Learn.","volume":"235","author":"Li","year":"2024"},{"key":"ref41","article-title":"An adversarial perspective on machine unlearning for AI safety","volume-title":"Trans. Mach. Learn. Res.","author":"Lucki","year":"2025"},{"key":"ref42","article-title":"The boy who survived: Removing Harry Potter from an LLM is harder than reported","volume-title":"arXiv:2403.12082","author":"Shostack","year":"2024"},{"article-title":"SalUn: Empowering machine unlearning via gradient-based weight saliency in both image classification and generation","volume-title":"Proc. ICLR","author":"Fan","key":"ref43"},{"key":"ref44","article-title":"TOFU: A task of fictitious unlearning for LLMs","author":"Maini","year":"2024","journal-title":"arXiv:2401.06121"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.457"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.52202\/079017-4415"},{"article-title":"On the reliability of watermarks for large language models","volume-title":"Proc. ICLR","author":"Kirchenbauer","key":"ref47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.423"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i10.21321"},{"key":"ref50","first-page":"5431","article-title":"CATER: Intellectual property protection on text generation APIs via conditional watermarks","volume-title":"Proc. NeurIPS","author":"He"},{"key":"ref51","first-page":"35277","article-title":"On provable copyright protection for generative models","volume-title":"Proc. ICML","author":"Vyas"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-industry.60"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref54","first-page":"17061","article-title":"A watermark for large language models","volume-title":"Proc. 40th Int. Conf. Mach. Learn.","author":"Kirchenbauer"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.398"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.28"},{"article-title":"Locating and editing factual associations in GPT","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Meng","key":"ref57"},{"article-title":"Mass-editing memory in a transformer","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Meng","key":"ref58"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00027"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.107"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.259"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.inlg-main.3"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1580"},{"key":"ref64","first-page":"14014","article-title":"Are sixteen heads really better than one?","volume-title":"Proc. NeurIPS","volume":"32","author":"Michel"},{"key":"ref65","article-title":"Pointer sentinel mixture models","author":"Merity","year":"2016","journal-title":"arXiv:1609.07843"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1144"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1017"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5446"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"ref70","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i17.29818"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.446"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11271336.pdf?arnumber=11271336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T06:54:10Z","timestamp":1766472850000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11271336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":72,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3638667","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}