{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:34:05Z","timestamp":1764686045103,"version":"3.46.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Luiss University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Machine Unlearning (MU) is the problem of removing the influence of user\u2019s unwanted evidence from a trained machine-learning model. MU is typically formulated so that the input unwanted evidence corresponds to a subset of the training set utilized to train the model upstream, which is commonly referred to as the \u201cforget set\u201d. However, this requirement is often difficult to satisfy in real-world scenarios, as users may be unaware of the peculiarities of the training set or simply they do not have access to it. In a more realistic setting, users provide their unwanted evidence in a form that is more abstract than or anyway different from a precise subset of training data. In such cases, executing MU methods requires an essential and challenging preliminary step, which, to the best of our knowledge, has never been addressed so far: identifying the forget set based on user\u2019s unwanted evidence. In this paper, we fill this important gap in the MU literature and introduce the\n                    <jats:sc>Forget-Set Identification<\/jats:sc>\n                    (\n                    <jats:sc>ForSId<\/jats:sc>\n                    ) problem: given a trained machine-learning model, an \u201cunwanted set\u201d of samples (evidence to unlearn), and a \u201cwanted set\u201d of samples (evidence to retain), identify the forget set as a subset of the training set, such that the similarity in the predictions of the original model and the model retrained on the training data remaining after the removal of the forget set is:\n                    <jats:italic>(i)<\/jats:italic>\n                    low on the unwanted set, indicating that the unwanted samples have been effectively unlearned by the model, and\n                    <jats:italic>(ii)<\/jats:italic>\n                    high on the wanted set, to ensure that the model keeps its original performance on the data to be retained. We define\n                    <jats:sc>ForSId<\/jats:sc>\n                    as an optimization problem, prove its NP-hardness, and devise an algorithm based on a theoretical connection to\n                    <jats:sc>Red-Blue Set Cover<\/jats:sc>\n                    . Our\n                    <jats:sc>ForSId<\/jats:sc>\n                    is a novel complementary problem to MU. It serves as a foundational step to be performed before executing MU methods, allowing for extending the range of applicability of MU to all those settings where user\u2019s unlearning evidence does not correspond to (or is too hard to be directly expressed in terms of) a forget set. We conduct extensive experiments based on the exact unlearning task (which is the most reliable one) on several real-world datasets and settings, involving nontrivial baselines. Results demonstrate high performance of our proposed algorithm and clear superiority over the baselines.\n                  <\/jats:p>","DOI":"10.1007\/s10994-025-06897-9","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T19:46:07Z","timestamp":1760557567000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The forget-set identification problem"],"prefix":"10.1007","volume":"114","author":[{"given":"Andrea","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Stilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"6897_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2024.106485","volume":"186","author":"VP Abidha","year":"2024","unstructured":"Abidha, V. P., & Ashok, P. (2024). Red blue set cover problem on axis-parallel hyperplanes and other objects. Information Processing Letters, 186, Article 106485.","journal-title":"Information Processing Letters"},{"issue":"3","key":"6897_CR2","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00453-016-0216-x","volume":"79","author":"P Ashok","year":"2017","unstructured":"Ashok, P., Kolay, S., & Saurabh, S. (2017). Multivariate complexity analysis of geometric red blue set cover. Algorithmica, 79(3), 667\u2013697.","journal-title":"Algorithmica"},{"key":"6897_CR3","unstructured":"Birhane, A., Prabhu, V. U., & Kahembwe, E. (2021). Multimodal datasets: Misogyny, pornography, and malignant stereotypes. CoRR abs\/2110.01963."},{"key":"6897_CR4","doi-asserted-by":"crossref","unstructured":"Bonato, J., Cotogni, M., & Sabetta, L. (2024). Is retain set all you need in machine unlearning? restoring performance of unlearned models with out-of-distribution images. In: Proc. of European Conf. on Computer Vision (ECCV), 1\u201319.","DOI":"10.1007\/978-3-031-73232-4_1"},{"key":"6897_CR5","unstructured":"Cadamuro, G., Gilad-Bachrach, R., & Zhu, J. (2016). Debugging machine learning models. https:\/\/api.semanticscholar.org\/CorpusID:14629198."},{"key":"6897_CR6","doi-asserted-by":"crossref","unstructured":"Cao, Y., & Yang, J. (2015). Towards making systems forget with machine unlearning. In: Proc. of IEEE Symposium on Security and Privacy (S &P), 463\u2013480.","DOI":"10.1109\/SP.2015.35"},{"issue":"1","key":"6897_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operations Research, 98(1), 353\u2013371. https:\/\/doi.org\/10.1023\/A:1019225027893","journal-title":"Annals of Operations Research"},{"key":"6897_CR8","unstructured":"Carr, R.D., Doddi, S., Konjevod, G., & Marathe, M.V. (2000). On the red-blue set cover problem. In: Proc. of ACM-SIAM Symp. on Discrete Algorithms (SODA), 345\u2013353."},{"issue":"5","key":"6897_CR9","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.comgeo.2014.12.005","volume":"48","author":"TM Chan","year":"2015","unstructured":"Chan, T. M., & Hu, N. (2015). Geometric red-blue set cover for unit squares and related problems. Computational Geometry: Theory and Applications, 48(5), 380\u2013385.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"6897_CR10","unstructured":"Chen, R., Yang, J., Xiong, H., Bai, J., Hu, T., Hao, J., Feng, Y., Zhou, J. T., Wu, J., & Liu, Z. (2023). Fast model debias with machine unlearning. In: Proc. of Conf. on Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"6897_CR11","unstructured":"Chlamt\u00e1c, E., Makarychev, Y., & Vakilian, A. (2023). Approximating red-blue set cover and minimum monotone satisfying assignment. In: Proc. of Int. Conf. on Approximation Algorithms for Combinatorial Optimization Problems and Int. Conf. on Randomization and Computation (APPROX\/RANDOM), 11\u201311119."},{"key":"6897_CR12","doi-asserted-by":"crossref","unstructured":"Chundawat, V.S., Tarun, A.K., Mandal, M., & Kankanhalli, M.S. (2023). Can bad teaching induce forgetting? Unlearning in deep networks using an incompetent teacher. In: Proc. of AAAI Conf. on Artificial Intelligence (AAAI), 7210\u20137217.","DOI":"10.1609\/aaai.v37i6.25879"},{"key":"6897_CR13","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1109\/TIFS.2023.3265506","volume":"18","author":"VS Chundawat","year":"2023","unstructured":"Chundawat, V. S., Tarun, A. K., Mandal, M., & Kankanhalli, M. (2023). Zero-shot machine unlearning. IEEE Transactions on Information Forensics and Security, 18, 2345\u20132354. https:\/\/doi.org\/10.1109\/TIFS.2023.3265506","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"6897_CR14","doi-asserted-by":"publisher","unstructured":"Cortez, P., Cerdeira, A., Almeida, F., Matos, T., & Reis, J. (2009). Wine Quality. UCI Machine Learning Repository. https:\/\/doi.org\/10.24432\/C56S3T","DOI":"10.24432\/C56S3T"},{"key":"6897_CR15","doi-asserted-by":"publisher","DOI":"10.1145\/3582000","author":"W Cunha","year":"2023","unstructured":"Cunha, W., Viegas, F., Fran\u00e7a, C., Rosa, T., Rocha, L., & Gon\u00e7alves, M. A. (2023). A comparative survey of instance selection methods applied to non-neural and transformer-based text classification. ACM Computing Surveys. https:\/\/doi.org\/10.1145\/3582000","journal-title":"ACM Computing Surveys"},{"key":"6897_CR50","doi-asserted-by":"publisher","unstructured":"D\u2019Angelo, A., Savelli, C., Tagliente, G., Giobergia, F., Baralis, E., & Stilo, G. (2025). How to make reproducible research in machine unlearning with ERASURE.In: Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence (IJCAI-25). International Joint Conferences on Artificial Intelligence Organization, 11025\u201311029. https:\/\/doi.org\/10.24963\/ijcai.2025\/1255","DOI":"10.24963\/ijcai.2025\/1255"},{"key":"6897_CR16","doi-asserted-by":"crossref","unstructured":"Dang, Q.-V. (2021). Right to be forgotten in the age of machine learning. In: Advances in Digital Science, 403\u2013411.","DOI":"10.1007\/978-3-030-71782-7_35"},{"issue":"4","key":"6897_CR17","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00224-006-1266-2","volume":"41","author":"M Elkin","year":"2007","unstructured":"Elkin, M., & Peleg, D. (2007). The hardness of approximating spanner problems. Theory of Computing Systems (TOCS), 41(4), 691\u2013729.","journal-title":"Theory of Computing Systems (TOCS)"},{"key":"6897_CR18","unstructured":"European Parliament and Council of the European Union: Regulation of the European Parliament and of the Council laying down harmonised rules on artificial intelligence (Artificial Intelligence Act) and amending certain Union legislative acts. COM\/2021\/206 final (2021). https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/?uri=CELEX%3A52021PC0206."},{"key":"6897_CR19","doi-asserted-by":"crossref","unstructured":"Fan, C., Liu, J., Hero, A.O., & Liu, S. (2024). Challenging forgets: Unveiling the worst-case forget sets in machine unlearning. In: Proc. of European Conf. on Computer Vision (ECCV), 278\u2013297.","DOI":"10.1007\/978-3-031-72664-4_16"},{"key":"6897_CR20","doi-asserted-by":"crossref","unstructured":"Foster, J., Schoepf, S., & Brintrup, A. (2024). Fast machine unlearning without retraining through selective synaptic dampening. In: Proc. of AAAI Conf. on Artificial Intelligence (AAAI), 12043\u201312051.","DOI":"10.1609\/aaai.v38i11.29092"},{"key":"6897_CR21","doi-asserted-by":"crossref","unstructured":"Gandikota, R., Materzynska, J., Fiotto-Kaufman, J., & Bau, D. (2023). Erasing concepts from diffusion models. In: Proc. of IEEE Int. Conf. on Computer Vision (ICCV), 2426\u20132436.","DOI":"10.1109\/ICCV51070.2023.00230"},{"key":"6897_CR22","unstructured":"Ginart, A., Guan, M.Y., Valiant, G., & Zou, J. (2019). Making AI forget you: Data deletion in machine learning. In: Proc. of Conf. on Advances in Neural Information Processing Systems (NeurIPS), 3513\u20133526."},{"key":"6897_CR23","doi-asserted-by":"crossref","unstructured":"Golatkar, A., Achille, A., & Soatto, S. (2020). Eternal sunshine of the spotless net: Selective forgetting in deep networks. In: Proc. of IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 9301\u20139309.","DOI":"10.1109\/CVPR42600.2020.00932"},{"key":"6897_CR24","doi-asserted-by":"publisher","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","volume":"80","author":"S Katoch","year":"2021","unstructured":"Katoch, S., Chauhan, S. S., & Kumar, V. (2021). A review on genetic algorithm: past, present, and future. Multimedia Tools and Applications, 80, 8091\u20138126. https:\/\/doi.org\/10.1007\/s11042-020-10139-6","journal-title":"Multimedia Tools and Applications"},{"key":"6897_CR25","doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack Problems. Springer.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"6897_CR26","unstructured":"Koh, P.W., & Liang, P. (2017). Understanding black-box predictions via influence functions. In: Proc. of Int. Conf. on Machine Learning (ICML), 1885\u20131894."},{"key":"6897_CR27","unstructured":"Krizhevsky, A., & Hinton, G. (2010). Convolutional deep belief networks on CIFAR-10. Unpublished manuscript, 40(7), 1\u20139."},{"key":"6897_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139176224","volume-title":"Kernel Methods and Machine Learning","author":"SY Kung","year":"2014","unstructured":"Kung, S. Y. (2014). Kernel Methods and Machine Learning. Cambridge University Press."},{"key":"6897_CR29","unstructured":"Kuwana, Y., Goto, Y., Shibata, T., & Irie, G. (2024). Black-box forgetting. In: Proc. of Conf. on Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"6897_CR30","unstructured":"Kwak, C., Lee, J., Park, K., & Lee, H. (2017). Let machines unlearn\u2014machine unlearning and the right to be forgotten. In: Proc. of Americas Conf. on Information Systems (AMCIS)."},{"key":"6897_CR31","unstructured":"Lev, O., & Wilson, A. (2024). Faster Machine Unlearning via Natural Gradient Descent. arXiv:2407.08169."},{"key":"6897_CR32","unstructured":"Liu, Y., Sun, C., Wu, Y., & Zhou, A. (2023). Unlearning with Fisher Masking. arXiv:2310.05331."},{"key":"6897_CR33","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.jmp.2017.05.006","volume":"80","author":"A Ly","year":"2017","unstructured":"Ly, A., Marsman, M., Verhagen, J., Grasman, R. P. P. P., & Wagenmakers, E.-J. (2017). A tutorial on fisher information. Journal of Mathematical Psychology, 80, 40\u201355.","journal-title":"Journal of Mathematical Psychology"},{"issue":"1","key":"6897_CR34","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s00453-022-01012-z","volume":"85","author":"RR Madireddy","year":"2023","unstructured":"Madireddy, R. R., & Mudgal, A. (2023). A constant-factor approximation algorithm for red-blue set cover with unit disks. Algorithmica, 85(1), 100\u2013132.","journal-title":"Algorithmica"},{"issue":"3","key":"6897_CR35","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.clsr.2013.03.010","volume":"29","author":"A Mantelero","year":"2013","unstructured":"Mantelero, A. (2013). The EU proposal for a general data protection regulation and the roots of the \u2018right to be forgotten\u2019. Computer Law & Security Review, 29(3), 229\u2013235.","journal-title":"Computer Law & Security Review"},{"key":"6897_CR36","unstructured":"Newatia, A., Cooper, M., & Krishnan, R. (2024). Unlearning tabular data without a \u201dforget set\u201d. In: Proc. of the Third Table Representation Learning Workshop @NeurIPS 2024."},{"issue":"2","key":"6897_CR37","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10462-010-9165-y","volume":"34","author":"JA Olvera-L\u00f3pez","year":"2010","unstructured":"Olvera-L\u00f3pez, J. A., Carrasco-Ochoa, J. A., Mart\u00ednez-Trinidad, J. F., & Kittler, J. (2010). A review of instance selection methods. Artificial Intelligence Review, 34(2), 133\u2013143. https:\/\/doi.org\/10.1007\/s10462-010-9165-y","journal-title":"Artificial Intelligence Review"},{"key":"6897_CR38","doi-asserted-by":"crossref","unstructured":"Shibata, T., Irie, G., Ikami, D., & Mitsuzumi, Y. (2021). Learning with selective forgetting. In: Proc. of Int. Joint Conf. on Artificial Intelligence (IJCAI), 989\u2013996.","DOI":"10.24963\/ijcai.2021\/137"},{"issue":"9","key":"6897_CR39","doi-asserted-by":"publisher","first-page":"13046","DOI":"10.1109\/TNNLS.2023.3266233","volume":"35","author":"AK Tarun","year":"2024","unstructured":"Tarun, A. K., Chundawat, V. S., Mandal, M., & Kankanhalli, M. S. (2024). Fast yet effective machine unlearning. IEEE Transactions on Neural Networks and Learning Systems (TNNLS), 35(9), 13046\u201313055.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems (TNNLS)"},{"issue":"11","key":"6897_CR40","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"6897_CR41","first-page":"781","volume":"181","author":"V Vapnik","year":"1968","unstructured":"Vapnik, V. (1968). On the uniform convergence of relative frequencies of events to their probabilities. Doklady Akademii Nauk USSR, 181, 781\u2013787.","journal-title":"Doklady Akademii Nauk USSR"},{"issue":"2","key":"6897_CR42","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1093\/idpl\/ipx005","volume":"7","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., & Floridi, L. (2017). Why a right to explanation of automated decision-making does not exist in the general data protection regulation. International Data Privacy Law, 7(2), 76\u201399.","journal-title":"International Data Privacy Law"},{"issue":"3","key":"6897_CR43","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/3698590","volume":"57","author":"S Wang","year":"2025","unstructured":"Wang, S., Zhu, Y., Liu, H., Zheng, Z., Chen, C., & Li, J. (2025). Knowledge editing for large language models: A survey. ACM Computing Surveys (CSUR), 57(3), 59\u201315937.","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"6897_CR44","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/3603620","volume":"56","author":"H Xu","year":"2024","unstructured":"Xu, H., Zhu, T., Zhang, L., Zhou, W., & Yu, P. S. (2024). Machine unlearning: A survey. ACM Computing Surveys (CSUR), 56(1), 9\u20131936.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6897_CR45","doi-asserted-by":"crossref","unstructured":"Ye, J., Fu, Y., Song, J., Yang, X., Liu, S., Jin, X., Song, M., & Wang, X. (2022). Learning with recoverable forgetting. In: Proc. of European Conf. on Computer Vision (ECCV), 87\u2013103.","DOI":"10.1007\/978-3-031-20083-0_6"},{"key":"6897_CR46","unstructured":"Yeh, C., Kim, J.S., Yen, I.E., & Ravikumar, P. (2018). Representer point selection for explaining deep neural networks. In: Proc. of Conf. on Advances in Neural Information Processing Systems (NeurIPS), 9311\u20139321."},{"key":"6897_CR47","doi-asserted-by":"crossref","unstructured":"Yu, C., Jeoung, S., Kasi, A., Yu, P., & Ji, H. (2023). Unlearning bias in language models by partitioning gradients. In: Findings of the Association for Computational Linguistics: ACL, 6032\u20136048.","DOI":"10.18653\/v1\/2023.findings-acl.375"},{"key":"6897_CR48","unstructured":"Zhao, K., Kurmanji, M., Barbulescu, G., Triantafillou, E., & Triantafillou, P. (2024). What makes unlearning hard and what to do about it. In: Proc. of Conf. on Advances in Neural Information Processing Systems (NeurIPS)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06897-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-025-06897-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-025-06897-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T14:30:19Z","timestamp":1764685819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-025-06897-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":49,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["6897"],"URL":"https:\/\/doi.org\/10.1007\/s10994-025-06897-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"24 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2025","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Formatting corrected for link to repository containing algorithm code and experimental data","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"During the preparation of this work, the authors used AI-assisted technologies to correct typos and grammatical mistakes. After using this tool\/service, the authors reviewed and edited the content as needed and take full responsibility for the content of the published article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of generative AI and AI-assisted technologies in the writing process"}}],"article-number":"247"}}