{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:24:17Z","timestamp":1773797057031,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T00:00:00Z","timestamp":1720915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s13042-024-02276-3","type":"journal-article","created":{"date-parts":[[2024,7,14]],"date-time":"2024-07-14T19:01:15Z","timestamp":1720983675000},"page":"5745-5763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Privacy-preserving matrix factorization for recommendation systems using Gaussian mechanism and functional mechanism"],"prefix":"10.1007","volume":"15","author":[{"given":"Sohan Salahuddin","family":"Mugdho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2042-5941","authenticated-orcid":false,"given":"Hafiz","family":"Imtiaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,14]]},"reference":[{"issue":"1","key":"2276_CR1","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1038\/s41467-022-30714-9","volume":"13","author":"C Wu","year":"2022","unstructured":"Wu C, Wu F, Lyu L, Qi T, Huang Y, Xie X (2022) A federated graph neural network framework for privacy-preserving personalization. Nat Commun 13(1):3091","journal-title":"Nat Commun"},{"key":"2276_CR2","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425","author":"X Su","year":"2009","unstructured":"Su X, Khoshgoftaar TM (2009) A survey of collaborative filtering techniques. Adv Artif Intell. https:\/\/doi.org\/10.1155\/2009\/421425","journal-title":"Adv Artif Intell"},{"issue":"8","key":"2276_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30\u201337. https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"issue":"6","key":"2276_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9(6):717\u2013772. https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found Comput Math"},{"key":"2276_CR5","doi-asserted-by":"crossref","unstructured":"Bennett J, Lanning S (2007) The Netflix prize. In: Proceedings of KDD cup and workshop 2007, Association for Computing Machinery, New York, NY, USA, pp 3\u20136","DOI":"10.1145\/1345448.1345459"},{"key":"2276_CR6","unstructured":"Narayanan A, Shmatikov V (2006) How to break anonymity of the Netflix prize dataset. arXiv preprint. arXiv:cs\/0610105"},{"issue":"2","key":"2276_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TAC.2013.2283096","volume":"59","author":"J Le Ny","year":"2013","unstructured":"Le Ny J, Pappas GJ (2013) Differentially private filtering. IEEE Trans Autom Control 59(2):341\u2013354","journal-title":"IEEE Trans Autom Control"},{"issue":"9","key":"2276_CR8","first-page":"29","volume":"2015092903","author":"L Sweeney","year":"2015","unstructured":"Sweeney L (2015) Only you, your doctor, and many others may know. Technol Sci 2015092903(9):29","journal-title":"Technol Sci"},{"issue":"5","key":"2276_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10207-007-0049-3","volume":"7","author":"E A\u00efmeur","year":"2008","unstructured":"A\u00efmeur E, Brassard G, Fernandez J. M, & Mani Onana F. S (2008) Alambic: a privacy-preserving recommender system for electronic commerce. Int J Inf Secur 7(5):307\u2013334. https:\/\/doi.org\/10.1007\/s10207-007-0049-3","journal-title":"Int J Inf Secur"},{"key":"2276_CR10","doi-asserted-by":"publisher","unstructured":"Calandrino JA, Kilzer A, Narayanan A, Felten EW, Shmatikov V (2011) \u201cYou might also like\u201d: privacy risks of collaborative filtering. In: 2011 IEEE symposium on security and privacy. IEEE, pp 231\u2013246. https:\/\/doi.org\/10.1109\/SP.2011.40","DOI":"10.1109\/SP.2011.40"},{"key":"2276_CR11","doi-asserted-by":"publisher","unstructured":"McSherry F, Mironov I (2009) Differentially private recommender systems: building privacy into the Netflix prize contenders. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining. Association for Computing Machinery, pp 627\u2013636. https:\/\/doi.org\/10.1145\/1557019.1557090","DOI":"10.1145\/1557019.1557090"},{"issue":"3\u20134","key":"2276_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork C, Roth A (2014) The algorithmic foundations of differential privacy. Found Trends Theor Comput Sci 9(3\u20134):211\u2013407. https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found Trends Theor Comput Sci"},{"key":"2276_CR13","doi-asserted-by":"publisher","unstructured":"Dwork C, McSherry F, Nissim K, Smith A (2006) Calibrating noise to sensitivity in private data analysis. In: Theory of cryptography conference. Springer, Berlin, pp 265\u2013284. https:\/\/doi.org\/10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"2276_CR14","doi-asserted-by":"publisher","DOI":"10.3390\/e25050825","author":"N Tasnim","year":"2023","unstructured":"Tasnim N, Mohammadi J, Sarwate AD, Imtiaz H (2023) Approximating functions with approximate privacy for applications in signal estimation and learning. Entropy. https:\/\/doi.org\/10.3390\/e25050825","journal-title":"Entropy"},{"key":"2276_CR15","doi-asserted-by":"crossref","unstructured":"Machanavajjhala A, Korolova A, & Sarma AD (2011) Personalized social recommendations-accurate or private?. In: Proceedings of the VLDB Endowment, vol 4(7). Association for Computing Machinery, New York, NY, USA","DOI":"10.14778\/1988776.1988780"},{"key":"2276_CR16","doi-asserted-by":"publisher","unstructured":"McSherry F, Talwar K (2007) Mechanism design via differential privacy. In: 48th Annual IEEE symposium on foundations of computer science (FOCS\u201907). IEEE, pp 94\u2013103. https:\/\/doi.org\/10.1109\/FOCS.2007.66","DOI":"10.1109\/FOCS.2007.66"},{"issue":"5","key":"2276_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/MSP.2013.2259911","volume":"30","author":"AD Sarwate","year":"2013","unstructured":"Sarwate AD, Chaudhuri K (2013) Signal processing and machine learning with differential privacy: algorithms and challenges for continuous data. IEEE Signal Process Mag 30(5):86\u201394. https:\/\/doi.org\/10.1109\/MSP.2013.2259911","journal-title":"IEEE Signal Process Mag"},{"issue":"3","key":"2276_CR18","first-page":"1069","volume":"12","author":"K Chaudhuri","year":"2011","unstructured":"Chaudhuri K, Monteleoni C, Sarwate AD (2011) Differentially private empirical risk minimization. J Mach Learn Res 12(3):1069\u20131109","journal-title":"J Mach Learn Res"},{"key":"2276_CR19","doi-asserted-by":"crossref","unstructured":"Bassily R, Smith A, Thakurta A (2014) Private empirical risk minimization: efficient algorithms and tight error bounds. In: 2014 IEEE 55th annual symposium on foundations of computer science. IEEE, pp 464\u2013473","DOI":"10.1109\/FOCS.2014.56"},{"key":"2276_CR20","doi-asserted-by":"crossref","unstructured":"Nozari E, Tallapragada P, Cort\u00e9s J (2016) Differentially private distributed convex optimization via objective perturbation. In: 2016 American control conference (ACC). IEEE, New York, NY, USA, pp 2061\u20132066","DOI":"10.1109\/ACC.2016.7525222"},{"key":"2276_CR21","doi-asserted-by":"crossref","unstructured":"Song S, Chaudhuri K, Sarwate AD (2013) Stochastic gradient descent with differentially private updates. In: 2013 IEEE global conference on signal and information processing. IEEE, New York, NY, USA, pp 245\u2013248","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"key":"2276_CR22","doi-asserted-by":"publisher","unstructured":"Abadi M, Chu A, Goodfellow I, Brendan McMahan H, Mironov I, Talwar K, Zhang L (2016) Deep Learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security (CCS '16). Association for Computing Machinery, New York, NY, USA, pp 308\u2013318. https:\/\/doi.org\/10.1145\/2976749.2978318","DOI":"10.1145\/2976749.2978318"},{"key":"2276_CR23","doi-asserted-by":"publisher","unstructured":"Zhang J, Zhang Z, Xiao X, Yang Y, Winslett M (2012) Functional mechanism: regression analysis under differential privacy. In: Proceedings of the VLDB endowment, vol 5(11). Association for Computing Machinery, New York, NY, USA, pp 1364\u20131375. https:\/\/doi.org\/10.14778\/2350229.2350253","DOI":"10.14778\/2350229.2350253"},{"key":"2276_CR24","doi-asserted-by":"crossref","unstructured":"Jorgensen Z, Yu T, Cormode G (2015) Conservative or liberal? Personalized differential privacy. In: 2015 IEEE 31st international conference on data engineering. IEEE, New York, NY, USA, pp 1023\u20131034","DOI":"10.1109\/ICDE.2015.7113353"},{"key":"2276_CR25","doi-asserted-by":"crossref","unstructured":"Ding J, Zhang X, Li X, Wang J, Yu R, & Pan M (2020) Differentially private and fair classification via calibrated functional mechanism. In: Proceedings of the AAAI conference on artificial intelligence. Association for the Advancement of Artificial Intelligence, Washington, DC, USA, (Vol. 34, No. 01) pp 622\u2013629.","DOI":"10.1609\/aaai.v34i01.5402"},{"key":"2276_CR26","doi-asserted-by":"crossref","unstructured":"NhatHai Phan, Minh N Vu, Yang Liu, Ruoming Jin, Dejing Dou, Xintao Wu, and My T Thai (2019) Heterogeneous Gaussian mechanism: preserving differential privacy in deep learning with provable robustness. In: Proceedings of the 28th international joint conference on artificial intelligence (IJCAI'19). AAAI Press, Washington, DC, USA, pp 4753\u20134759","DOI":"10.24963\/ijcai.2019\/660"},{"key":"2276_CR27","doi-asserted-by":"publisher","unstructured":"Nikolaenko V, Ioannidis S, Weinsberg U, Joye M, Taft N, Boneh D (2013) Privacy-preserving matrix factorization. In: Proceedings of the 2013 ACM SIGSAC conference on computer and communications security. Association for Computing Machinery, pp 801\u2013812. https:\/\/doi.org\/10.1145\/2508859.2516751","DOI":"10.1145\/2508859.2516751"},{"key":"2276_CR28","first-page":"289","volume":"21","author":"K Chaudhuri","year":"2008","unstructured":"Chaudhuri K, Monteleoni C (2008) Privacy-preserving logistic regression. Adv Neural Inf Process Syst 21:289\u2013296","journal-title":"Adv Neural Inf Process Syst"},{"key":"2276_CR29","doi-asserted-by":"publisher","unstructured":"Dwork C, Talwar K, Thakurta A, Zhang L (2014) Analyze Gauss: optimal bounds for privacy-preserving principal component analysis. In: Proceedings of the forty-sixth annual ACM symposium on theory of computing. Association for Computing Machinery, pp 11\u201320. https:\/\/doi.org\/10.1145\/2591796.2591883","DOI":"10.1145\/2591796.2591883"},{"key":"2276_CR30","first-page":"2861","volume":"27","author":"M Hardt","year":"2014","unstructured":"Hardt M, Price E (2014) The noisy power method: a meta algorithm with applications. Adv Neural Inf Process Syst 27:2861\u20132869","journal-title":"Adv Neural Inf Process Syst"},{"key":"2276_CR31","first-page":"989","volume":"25","author":"K Chaudhuri","year":"2012","unstructured":"Chaudhuri K, Sarwate A, Sinha K (2012) Near-optimal differentially private principal components. Adv Neural Inf Process Syst 25:989\u2013997","journal-title":"Adv Neural Inf Process Syst"},{"issue":"1","key":"2276_CR32","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TAC.2016.2541298","volume":"62","author":"S Han","year":"2016","unstructured":"Han S, Topcu U, Pappas GJ (2016) Differentially private distributed constrained optimization. IEEE Trans Autom Control 62(1):50\u201364. https:\/\/doi.org\/10.1109\/TAC.2016.2541298","journal-title":"IEEE Trans Autom Control"},{"issue":"6","key":"2276_CR33","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1109\/JSTSP.2018.2877842","volume":"12","author":"H Imtiaz","year":"2018","unstructured":"Imtiaz H, Sarwate AD (2018) Distributed differentially private algorithms for matrix and tensor factorization. IEEE J Sel Top Signal Process 12(6):1449\u20131464. https:\/\/doi.org\/10.1109\/JSTSP.2018.2877842","journal-title":"IEEE J Sel Top Signal Process"},{"key":"2276_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.120406","volume":"665","author":"J Deng","year":"2024","unstructured":"Deng J, Wu Q, Wang S, Ye J, Wang P, Du M (2024) A novel joint neural collaborative filtering incorporating rating reliability. Inf Sci 665:120406. https:\/\/doi.org\/10.1016\/j.ins.2024.120406","journal-title":"Inf Sci"},{"key":"2276_CR35","doi-asserted-by":"publisher","unstructured":"Ali W, Ammad-ud-din M, Zhou X, Zhang Y, Shao J (2024) Communication-efficient federated neural collaborative filtering with multi-armed bandits. ACM Trans Recomm Syst. https:\/\/doi.org\/10.1145\/3651168 (Just accepted)","DOI":"10.1145\/3651168"},{"key":"2276_CR36","doi-asserted-by":"publisher","unstructured":"Liu Z, Wang Y-X, Smola A (2015) Fast differentially private matrix factorization. In: Proceedings of the 9th ACM conference on recommender systems. Association for Computing Machinery, pp 171\u2013178. https:\/\/doi.org\/10.1145\/2792838.2800191","DOI":"10.1145\/2792838.2800191"},{"key":"2276_CR37","unstructured":"Hua J, Xia C, Zhong S (2015) Differentially private matrix factorization. In: Proceedings of the twenty-fourth international joint conference on artificial intelligence (IJCAI 2015). AAAI Press, Washington, DC, USA, pp 1763\u20131770"},{"key":"2276_CR38","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.neucom.2022.01.079","volume":"483","author":"X Ran","year":"2022","unstructured":"Ran X, Wang Y, Zhang LY, Ma J (2022) A differentially private matrix factorization based on vector perturbation for recommender system. Neurocomputing 483:32\u201341","journal-title":"Neurocomputing"},{"issue":"1","key":"2276_CR39","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/TBDATA.2021.3139125","volume":"9","author":"H Zhou","year":"2021","unstructured":"Zhou H, Yang G, Xiang Y, Bai Y, Wang W (2021) A lightweight matrix factorization for recommendation with local differential privacy in big data. IEEE Trans Big Data 9(1):160\u2013173","journal-title":"IEEE Trans Big Data"},{"key":"2276_CR40","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ins.2022.01.050","volume":"592","author":"X Ran","year":"2022","unstructured":"Ran X, Wang Y, Zhang LY, Ma J (2022) A differentially private nonnegative matrix factorization for recommender system. Inf Sci 592:21\u201335","journal-title":"Inf Sci"},{"issue":"3","key":"2276_CR41","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1109\/TCSS.2022.3170691","volume":"10","author":"X Zheng","year":"2022","unstructured":"Zheng X, Guan M, Jia X, Guo L, Luo Y (2022) A matrix factorization recommendation system-based local differential privacy for protecting users\u2019 sensitive data. IEEE Trans Comput Soc Syst 10(3):1189\u20131198. https:\/\/doi.org\/10.1109\/TCSS.2022.3170691","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2276_CR42","doi-asserted-by":"crossref","unstructured":"Duchi JC, Jordan M.I, Wainwright M.J (2013) Local privacy and statistical minimax rates. In: 2013 IEEE 54th annual symposium on foundations of computer science. IEEE, New York, NY, USA, pp 429\u2013438","DOI":"10.1109\/FOCS.2013.53"},{"key":"2276_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119457","volume":"216","author":"Y Wang","year":"2023","unstructured":"Wang Y, Gao M, Ran X, Ma J, Zhang LY (2023) An improved matrix factorization with local differential privacy based on piecewise mechanism for recommendation systems. Expert Syst Appl 216:119457","journal-title":"Expert Syst Appl"},{"key":"2276_CR44","doi-asserted-by":"crossref","unstructured":"Wang N, Xiao X, Yang Y, Zhao J, Hui SC, Shin H, Shin J, Yu G (2019) Collecting and analyzing multidimensional data with local differential privacy. In: 2019 IEEE 35th international conference on data engineering (ICDE). IEEE, New York, NY, USA, pp 638\u2013649","DOI":"10.1109\/ICDE.2019.00063"},{"key":"2276_CR45","doi-asserted-by":"publisher","unstructured":"Berlioz A, Friedman A, Kaafar MA, Boreli R, Berkovsky S (2015) Applying Differential Privacy to Matrix Factorization. In: Proceedings of the 9th ACM Conference on Recommender Systems (RecSys '15). Association for Computing Machinery, New York, NY, USA, pp 107\u2013114. https:\/\/doi.org\/10.1145\/2792838.2800173","DOI":"10.1145\/2792838.2800173"},{"key":"2276_CR46","unstructured":"Rudin W (1964) Principles of mathematical analysis, vol 3. McGraw-hill, New York, NY, USA"},{"key":"2276_CR47","doi-asserted-by":"publisher","unstructured":"Mironov I (2017) R\u00e9nyi differential privacy. In: 2017 IEEE 30th computer security foundations symposium (CSF). IEEE, pp 263\u2013275. https:\/\/doi.org\/10.1109\/CSF.2017.11","DOI":"10.1109\/CSF.2017.11"},{"key":"2276_CR48","doi-asserted-by":"crossref","unstructured":"Imtiaz H, Mohammadi J, Sarwate A.D (2019) Distributed differentially private computation of functions with correlated noise. arXiv preprint. arXiv:1904.10059","DOI":"10.1109\/ICASSP.2019.8683252"},{"key":"2276_CR49","doi-asserted-by":"publisher","unstructured":"Dwork C (2008) Differential privacy: a survey of results. In: International conference on theory and applications of models of computation. Springer, Berlin, pp 1\u201319. https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1","DOI":"10.1007\/978-3-540-79228-4_1"},{"issue":"15","key":"2276_CR50","first-page":"510","volume":"7","author":"KB Petersen","year":"2008","unstructured":"Petersen KB, Pedersen MS (2008) The matrix cookbook. Tech Univ Denmark 7(15):510","journal-title":"The matrix cookbook. Tech Univ Denmark"},{"key":"2276_CR51","doi-asserted-by":"publisher","unstructured":"Gall F.L, & Urrutia F (2018) Improved rectangular matrix multiplication using powers of the coppersmith-winograd tensor. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1029-1046). Society for Industrial and Applied Mathematics. https:\/\/doi.org\/10.1137\/1.9781611975031.67","DOI":"10.1137\/1.9781611975031.67"},{"key":"2276_CR52","unstructured":"GroupLens: Movielens 1M Dataset. Online available. https:\/\/grouplens.org\/datasets\/movielens\/1m\/. Last Accessed 09 Aug 2022"},{"key":"2276_CR53","unstructured":"GroupLens: Movielens 10M Dataset. Online available. https:\/\/grouplens.org\/datasets\/movielens\/10m\/. Last Accessed 08 June 2023"},{"key":"2276_CR54","unstructured":"Netflix: Netflix Prize data. Online available. https:\/\/www.kaggle.com\/netflix-inc\/netflix-prize-data. Last Accessed 09 Aug 2022"},{"key":"2276_CR55","unstructured":"Yahoo: Yahoo Music Dataset. Online available. https:\/\/webscope.sandbox.yahoo.com\/catalog.php?datatype=r. Last Accessed 08 June 2023"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02276-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02276-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02276-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:26:29Z","timestamp":1730197589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02276-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,14]]},"references-count":55,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2276"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02276-3","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,14]]},"assertion":[{"value":"10 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}