{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:14Z","timestamp":1740123554370,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"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":["J Electron Test"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s10836-023-06089-0","type":"journal-article","created":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T06:02:33Z","timestamp":1704780153000},"page":"631-657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Effective Software Mutation-Test Using Program Instructions Classification"],"prefix":"10.1007","volume":"39","author":[{"given":"Zeinab","family":"Asghari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5202-6315","authenticated-orcid":false,"given":"Bahman","family":"Arasteh","sequence":"additional","affiliation":[]},{"given":"Abbas","family":"Koochari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,9]]},"reference":[{"key":"6089_CR1","doi-asserted-by":"crossref","unstructured":"Acree A, Budd T, DeMillo R, Lipton R, Sayward F (1980) Mutation Analysis, School of Information and Computer Science. Georgia Inst Technol","DOI":"10.21236\/ADA076575"},{"issue":"3","key":"6089_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.6025\/jnt\/2018\/9\/3\/94-101","volume":"9","author":"B Arasteh","year":"2018","unstructured":"Arasteh B (2018) Software Fault-Prediction using Combination of Neural Network and Naive Bayes Algorithm. J Netw Technol 9(3):94\u2013101. https:\/\/doi.org\/10.6025\/jnt\/2018\/9\/3\/94-101","journal-title":"J Netw Technol"},{"key":"6089_CR3","doi-asserted-by":"crossref","unstructured":"Arasteh B (2019) ReDup: A software-based method for detecting soft-error using data analysis. In Comput Electr Eng 78(9):89\u2013107","DOI":"10.1016\/j.compeleceng.2019.07.006"},{"issue":"1","key":"6089_CR4","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1002\/smr.2408","volume":"34","author":"B Arasteh","year":"2022","unstructured":"Arasteh B, Fatolahzadeh A, Kiani F (2022) Savalan: Multi objective and homogeneous method for software modules clustering. J Softw Evol 34(1):2022. https:\/\/doi.org\/10.1002\/smr.2408","journal-title":"J Softw Evol"},{"issue":"9","key":"6089_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10836-014-5438-8","volume":"30","author":"B Arasteh","year":"2014","unstructured":"Arasteh B, Miremadi SG, Rahmani AM (2014) Developing Inherently Resilient Software Against Soft-Errors Based on Algorithm Level Inherent Features. J Electron Test 30(9):193\u2013212. https:\/\/doi.org\/10.1007\/s10836-014-5438-8","journal-title":"J Electron Test"},{"issue":"2014","key":"6089_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.sbspro.2014.07.519","volume":"143","author":"B Arasteh","year":"2014","unstructured":"Arasteh B, Pirahesh S, Zakeri A, Arasteh B (2014) Highly Available and Dependable E-learning Services Using Grid System. Procedia Soc Behav Sci 143(2014):471\u2013476. https:\/\/doi.org\/10.1016\/j.sbspro.2014.07.519","journal-title":"Procedia Soc Behav Sci"},{"issue":"4","key":"6089_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.3233\/idt-200070","volume":"14","author":"B Arasteh","year":"2020","unstructured":"Arasteh B, Razieh S, Keyvan A (2020) ARAZ: A software modules clustering method using the combination of particle swarm optimization and genetic algorithms. Intell Decis Technol 14(4):449\u2013462. https:\/\/doi.org\/10.3233\/idt-200070","journal-title":"Intell Decis Technol"},{"issue":"2","key":"6089_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/stvr.226","volume":"11","author":"EF Barbosa","year":"2001","unstructured":"Barbosa EF, Maldonado JC, Vincenzi AMR (2001) Toward the determination of sufficient mutant operators for C. Softw Test Verif Reliab 11(2):113\u2013136","journal-title":"Softw Test Verif Reliab"},{"key":"6089_CR9","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-319-61845-6_49","volume":"10387","author":"MR Binu Rajan","year":"2017","unstructured":"Binu Rajan MR, Vinod Chandra SS (2017) ABC Metaheuristic Based Optimized Adaptation Planning Logic for Decision Making Intelligent Agents in Self Adaptive Software System. Lect Notes Comput Sci 10387:496\u2013504","journal-title":"Lect Notes Comput Sci"},{"key":"6089_CR10","unstructured":"Bishop CM (1995) Neural networks for pattern recognition. Clarendon Press, Oxford, England. Oxford University Press, Inc. New York, NY, USA \u00a91995 ISBN: 0198538642. Available at: http:\/\/cs.du.edu\/~mitchell\/mario_books\/Neural_Networks_for_Pattern_Recognition_-_Christopher_Bishop.pdf"},{"issue":"1","key":"6089_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"6089_CR12","unstructured":"Budd TA (1980) Yale University, Mutation Analysis of Program Test Data"},{"key":"6089_CR13","volume-title":"A new hybrid model using case-based reasoning and decision tree methods for improving speedup and accuracy","author":"A Bouyer","year":"2007","unstructured":"Bouyer A, Arasteh B, Movaghar A (2007) A new hybrid model using case-based reasoning and decision tree methods for improving speedup and accuracy. IADIS International conference of applied computing"},{"issue":"6","key":"6089_CR14","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10836-022-06033-8","volume":"38","author":"SV Chandra","year":"2022","unstructured":"Chandra SV, Sankar SS, Anand HS (2022) Smell detection agent optimization approach to path generation in automated software testing. J Electron Test 38(6):623\u2013636. https:\/\/doi.org\/10.1007\/s10836-022-06033-8","journal-title":"J Electron Test"},{"key":"6089_CR15","doi-asserted-by":"crossref","unstructured":"Dang X, Gong D, Yao X, Tian T, Liu H (2022) Enhancement of Mutation Testing via Fuzzy Clustering and Multi-Population Genetic Algorithm. IEEE Trans Softw Eng 48(6):2141\u20132156","DOI":"10.1109\/TSE.2021.3052987"},{"issue":"2018","key":"6089_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.infsof.2018.07.011","volume":"104","author":"P Delgado-P\u00e9rez","year":"2018","unstructured":"Delgado-P\u00e9rez P, Medina-Bulo I (2018) Search-based mutant selection for efficient test suite improvement: Evaluation and results. Inf Softw Technol 104(2018):130\u2013143","journal-title":"Inf Softw Technol"},{"key":"6089_CR17","unstructured":"DeMillo RA, Spafford EH (1986) The Mothra software testing environment, presented at The 11th NASA Softw Eng Lab Workshop Goddard Space Center"},{"key":"6089_CR18","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.infsof.2016.04.012","volume":"81","author":"L Deng","year":"2017","unstructured":"Deng L, Offutt J, Ammann P, Mirzaei N (2017) Mutation operators for testing Android apps. Inf Softw Technol 81:154\u2013168","journal-title":"Inf Softw Technol"},{"issue":"5","key":"6089_CR19","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29(5):1189\u20131232","journal-title":"Ann Stat"},{"issue":"4","key":"6089_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"JH Friedman","year":"2002","unstructured":"Friedman JH (2002) Stochastic gradient boosting. Comput Stat Data Anal 38(4):367\u2013378","journal-title":"Comput Stat Data Anal"},{"key":"6089_CR21","doi-asserted-by":"publisher","unstructured":"Ghaemi A, Arasteh B (2020) SFLA-based heuristic method to generate software structural test data. J Softw Evol Proc 32:e2228. https:\/\/doi.org\/10.1002\/smr.2228","DOI":"10.1002\/smr.2228"},{"key":"6089_CR22","doi-asserted-by":"crossref","unstructured":"Gheyi R, Ribeiro M, Souza B, Guimar\u00e3es M, Fernandes L, d\u2019Amorim M, Alves V, Teixeira L, Fonseca B (2021) Identifying method-level mutation subsumption relations using Z3. Inf Softw Technol 132:106496","DOI":"10.1016\/j.infsof.2020.106496"},{"key":"6089_CR23","doi-asserted-by":"publisher","unstructured":"Good IJ (1951) Probability and the Weighing of Evidence, Philosophy Volume 26, Issue 97, 1951. Published by Charles Griffin and Company, London 1950. Copyright \u00a9 The Royal Institute of Philosophy 1951, pp. 163\u2013164. https:\/\/doi.org\/10.1017\/S0031819100026863. Available at Royal Institute of Philosophy website: https:\/\/www.cambridge.org\/core\/journals\/philosophy\/article\/probability-and-the-weighing-of-evidence-by-goodi-j-london-charles-griffin-and-company-1950-pp-viii-119-price-16s\/7D911224F3713FDCFD1451BBB2982442","DOI":"10.1017\/S0031819100026863"},{"issue":"1","key":"6089_CR24","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1108\/DTA-03-2020-0073","volume":"55","author":"S Hosseini","year":"2021","unstructured":"Hosseini S, Arasteh B, Isazadeh A, Mohsenzadeh M, Mirzarezaee M (2021) An error-propagation aware method to reduce the software mutation cost using genetic algorithm. Data Technologies and Applications 55(1):118\u2013148. https:\/\/doi.org\/10.1108\/DTA-03-2020-0073","journal-title":"Data Technologies and Applications"},{"issue":"4","key":"6089_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TSE.1982.235571","volume":"8","author":"WE Howden","year":"1982","unstructured":"Howden WE (1982) \u201cWeak mutation testing and completeness of test sets.\u201d IEEE Trans Softw Eng 8(4):371\u2013379","journal-title":"IEEE Trans Softw Eng"},{"key":"6089_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/taic.part.2007.38","volume-title":"Proceedings of the Test: Acad Ind Proc Pract Res Tech - MUTAT (TAICPART-MUTATION \u201907)","author":"SA Irvine","year":"2007","unstructured":"Irvine SA, Pavlinic T, Trigg L, Cleary JG, Inglis S, Utting M (2007) Jumble Java byte code to measure the effectiveness of unit tests. Proceedings of the Test: Acad Ind Proc Pract Res Tech - MUTAT (TAICPART-MUTATION \u201907). IEEE Computer Society, USA, pp 169\u2013175. https:\/\/doi.org\/10.1109\/taic.part.2007.38"},{"key":"6089_CR27","doi-asserted-by":"crossref","unstructured":"King KN, Offutt AJ (1991) A Fortran language system for mutation-based software testing. Softw: Pract Exper 21(7):685\u2013718","DOI":"10.1002\/spe.4380210704"},{"key":"6089_CR28","doi-asserted-by":"crossref","unstructured":"Kintis M, Papadakis M, Malevris N (2010) Evaluating mutation testing alternatives: a collateral experiment. Proc 17th Asia-Pacific Softw Eng Proc (APSEC)","DOI":"10.1109\/APSEC.2010.42"},{"key":"6089_CR29","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Delamaro M, Offutt J, Deng L (2014) Mutant subsumption graphs. 2014 IEEE Seventh Int Proc Softw Test Verif Valid Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2014.20"},{"key":"6089_CR30","doi-asserted-by":"crossref","unstructured":"Kurtz B, Ammann P, Offutt J (2015) Static analysis of mutant subsumption. IEEE Eighth Int Proc Softw Test Verif Valid Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2015.7107454"},{"key":"6089_CR31","doi-asserted-by":"crossref","unstructured":"Ma YS, Offutt J, Kwon YR (2006) MuJava: A Mutation System for Java. In 28th Int Proc Softw Eng (ICSE \u201906)","DOI":"10.1145\/1134285.1134425"},{"issue":"8","key":"6089_CR32","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.infsof.2005.07.006","volume":"48","author":"N Malevris","year":"2006","unstructured":"Malevris N, Yates D (2006) The collateral coverage of data flow criteria when branch testing. Inf Softw Technol 48(8):676\u2013686","journal-title":"Inf Softw Technol"},{"issue":"4","key":"6089_CR33","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"WS McCulloch","year":"1943","unstructured":"McCulloch WS, Pitts W (1943) A logical calculus of the ideas immanent in nervous activity. Bull Math Biophys 5(4):115\u2013133","journal-title":"Bull Math Biophys"},{"key":"6089_CR34","unstructured":"Moore I (2001) Jester - a JUnit test tester"},{"issue":"4","key":"6089_CR35","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1099-1689(199912)9:4<205::AID-STVR186>3.0.CO;2-X","volume":"9","author":"ES Mresa","year":"1999","unstructured":"Mresa ES, Bottaci L (1999) Efficiency of mutation operators and selective mutation strategies: an empirical study. Softw Test Verif Reliabil 9(4):205\u2013232","journal-title":"Softw Test Verif Reliabil"},{"key":"6089_CR36","doi-asserted-by":"publisher","unstructured":"Nilsson NJ (1965) Learning machines. New York: McGraw-Hill.Published in:\u00a0J IEEE Trans Inf Theory 12(3):407, 1966.\u00a0Inf Theory 12(3), 1966. https:\/\/doi.org\/10.1109\/TIT.1966.1053912. Available at ACM digital library website:\u00a0http:\/\/dl.acm.org\/citation.cfm?id=2267404","DOI":"10.1109\/TIT.1966.1053912"},{"issue":"5","key":"6089_CR37","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/32.286422","volume":"20","author":"AJ Offutt","year":"1994","unstructured":"Offutt AJ, Lee SD (1994) An empirical evaluation of weak mutation. IEEE Trans Softw Eng 20(5):337\u2013344","journal-title":"IEEE Trans Softw Eng"},{"key":"6089_CR38","unstructured":"Offutt AJ, Rothermel G, Zapf C (1993) An experimental evaluation of selective mutation. Proceedings of the 15th Int Proc Softw Eng, ICSE \u201993, IEEE Computer Society Press, Los Alamitos, CA"},{"key":"6089_CR39","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1145\/227607.227610","volume":"5","author":"J Offutt","year":"1996","unstructured":"Offutt J, Lee A, Rothermel G, Untch RH, Zapf C (1996) An Experimental Determination of Sufficient Mutant Operators. ACM Trans Softw Eng Methodol 5:99\u2013118","journal-title":"ACM Trans Softw Eng Methodol"},{"key":"6089_CR40","first-page":"97","volume":"15","author":"J Offutt","year":"2006","unstructured":"Offutt J, Ma Y-S, Kwon YR (2006) MuJava: an automated class mutation system. Softw Test Verif Reliab 15:97\u2013133","journal-title":"Softw Test Verif Reliab"},{"issue":"3","key":"6089_CR41","doi-asserted-by":"publisher","first-page":"128","DOI":"10.14445\/22312803\/IJCTT-V48P126","volume":"48","author":"FY Osisanwo","year":"2017","unstructured":"Osisanwo FY, Akinsola JET, Awodele O, Hinmikaiye JO, Olakanmi O, Akinjobi J (2017) Supervised machine learning algorithms: classification and comparison. Int J Comput Trends Technol (IJCTT) 48(3):128\u2013138","journal-title":"Int J Comput Trends Technol (IJCTT)"},{"key":"6089_CR42","doi-asserted-by":"crossref","unstructured":"Papadakis M, Malevris N (2010) An empirical evaluation of the first and second order mutation testing strategies. Third Int Proc Softw Test Verif Valid Workshops (ICSTW)","DOI":"10.1109\/ICSTW.2010.50"},{"issue":"1","key":"6089_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"issue":"6088","key":"6089_CR44","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back propagating errors. Nature 323(6088):533","journal-title":"Nature"},{"key":"6089_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27172-4_73","volume-title":"Lecture notes in computer science","author":"B Sharma","year":"2011","unstructured":"Sharma B, Girdhar I, Taneja M, Basia P, Vadla S, Srivastava PR (2011) Software coverage: A testing approach through ant colony optimization. Lecture notes in computer science, vol 7076. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-27172-4_73"},{"key":"6089_CR46","volume-title":"Software engineering","author":"I Sommerville","year":"2018","unstructured":"Sommerville I (2018) Software engineering, 10th edn. Pearson India (ISBN: 9332582696)","edition":"10"},{"key":"6089_CR47","doi-asserted-by":"crossref","unstructured":"Sridharan M, Siami-Namin A (2010) Prioritizing mutation operators based on importance sampling. In: Proceedings of the IEEE 21th Int Sympo- sium Softw Reliab Eng (ISSRE). IEEE, San Jose, CA, USA, pp. 378\u2013387","DOI":"10.1109\/ISSRE.2010.16"},{"key":"6089_CR48","unstructured":"Taiwo OA (2010) Types of Machine Learning Algorithms, New Advances in Machine Learning, Yagang Zhang (Ed.), ISBN: 978-953-307-034-6, InTech, University of Portsmouth United Kingdom. Pp 3 \u2013 31. Available at InTech open website: http:\/\/www.intechopen.com\/books\/new-advances-inmachine-learning\/types-of-machine-learning-algorithms"},{"issue":"1","key":"6089_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12911-019-1004-8","volume":"19","author":"S Uddin","year":"2019","unstructured":"Uddin S, Khan A, Hossain ME, Moni MA (2019) Comparing different supervised machine learning algorithms for disease prediction. BMC Med Inform Decis Mak 19(1):1\u201316. https:\/\/doi.org\/10.1186\/s12911-019-1004-8","journal-title":"BMC Med Inform Decis Mak"},{"key":"6089_CR50","unstructured":"Varga A (2001) Discrete event simulation system. In Proc Eur Simul Multiconference (ESM\u20192001) (pp. 1\u20137)"},{"key":"6089_CR51","doi-asserted-by":"crossref","unstructured":"Wei C, Yao X, Gong D, Liu H (2021) Spectral clustering based mutant reduction for mutation testing. Inf Softw Technol 132:106502","DOI":"10.1016\/j.infsof.2020.106502"},{"key":"6089_CR52","unstructured":"Wong WE (1993) On mutation and data flow. Ph.D. dissertation, Purdue University"},{"key":"6089_CR53","unstructured":"Woodward M, Halewood K (1998) From weak to strong, dead or alive? An analysis of some mutation testing issues. Proc Second Workshop Softw Test Verif Anal"},{"key":"6089_CR54","doi-asserted-by":"crossref","unstructured":"Yao X, Zhang G, Pan F, Gong D, Wei C (2022) Orderly Generation of Test Data via Sorting Mutant Branches Based on Their Dominance Degrees for Weak Mutation Testing. In IEEE Trans Softw Eng 48(4):1169\u20131184","DOI":"10.1109\/TSE.2020.3014960"},{"issue":"2011","key":"6089_CR55","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.sbspro.2011.11.037","volume":"28","author":"M Zadahmad","year":"2011","unstructured":"Zadahmad M, Arasteh B, YousefzadehFard P (2011) A pattern-oriented and web-based architecture to support mobile learning software development. Procedia Soc Behav Sci 28(2011):194\u2013199. https:\/\/doi.org\/10.1016\/j.sbspro.2011.11.037","journal-title":"Procedia Soc Behav Sci"},{"key":"6089_CR56","doi-asserted-by":"crossref","unstructured":"Zhang L, Gligoric M, Marinov D, Khurshid S (2013) Operator-based and random mutant selection: better together. Autom Softw Eng (ASE),. IEEE\/ACM 28th International Proc","DOI":"10.1109\/ASE.2013.6693070"},{"key":"6089_CR57","doi-asserted-by":"crossref","unstructured":"Zhang L, Hou S-S, Hu J-J, Xie T, Mei H (2010) Is operator-based mutant selection superior to random mutant selection? Proceedings of the 32nd ACM\/IEEE Int Proc Softw Eng, 2010","DOI":"10.1145\/1806799.1806863"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-023-06089-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10836-023-06089-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10836-023-06089-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T05:07:14Z","timestamp":1705900034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10836-023-06089-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12]]},"references-count":57,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["6089"],"URL":"https:\/\/doi.org\/10.1007\/s10836-023-06089-0","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[2023,12]]},"assertion":[{"value":"20 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial conflict interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}