{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:39:36Z","timestamp":1780673976551,"version":"3.54.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62073155"],"award-info":[{"award-number":["62073155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61973337"],"award-info":[{"award-number":["61973337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62002137"],"award-info":[{"award-number":["62002137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62106088"],"award-info":[{"award-number":["62106088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong Provincial Key Laboratory","award":["2020B121201001"],"award-info":[{"award-number":["2020B121201001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11047-022-09889-z","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T18:33:26Z","timestamp":1659119606000},"page":"287-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A general framework for enhancing relaxed Pareto dominance methods in evolutionary many-objective optimization"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8402-8446","authenticated-orcid":false,"given":"Shuwei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lihong","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erik","family":"Goodman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhichao","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"key":"9889_CR1","doi-asserted-by":"crossref","unstructured":"Batista LS, Campelo F, Guimar\u00e3es FG, Ram\u00edrez JA (2011) Pareto cone $$\\varepsilon$$-dominance: improving convergence and diversity in multiobjective evolutionary algorithms. In: Proceedings of international conference evolutionary multi-criterion optimization, pp 76\u201390","DOI":"10.1007\/978-3-642-19893-9_6"},{"issue":"2","key":"9889_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 24(2):123\u2013140","journal-title":"Mach Learn"},{"issue":"12","key":"9889_CR3","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TCYB.2018.2859171","volume":"49","author":"L Chen","year":"2019","unstructured":"Chen L, Liu HL, Tan KC, Cheung YM, Wang Y (2019) Evolutionary many-objective algorithm using decomposition-based dominance relationship. IEEE Trans Cybern 49(12):4129\u20134139","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"9889_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1162\/evco_a_00276","volume":"29","author":"L Chen","year":"2021","unstructured":"Chen L, Deb K, Liu HL, Zhang Q (2021) Effect of objective normalization and penalty parameter on penalty boundary intersection decomposition-based evolutionary many-objective optimization algorithms. Evol Comput 29(1):157\u2013186","journal-title":"Evol Comput"},{"issue":"5","key":"9889_CR5","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/TEVC.2016.2519378","volume":"20","author":"R Cheng","year":"2016","unstructured":"Cheng R, Jin Y, Olhofer M, Sendhoff B (2016) A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(5):773\u2013791","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9889_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng R, Li M, Tian Y, Zhang X, Yang S, Jin Y, Yao X (2017) A benchmark test suite for evolutionary many-objective optimization. Complex Intell Syst 3(1):67\u201381","journal-title":"Complex Intell Syst"},{"key":"9889_CR7","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3113923","author":"M Cui","year":"2021","unstructured":"Cui M, Li L, Zhou M, Abusorrah A (2021) Surrogate-assisted autoencoder-embedded evolutionary optimization algorithm to solve high-dimensional expensive problems. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3113923","journal-title":"IEEE Trans Evol Comput"},{"key":"9889_CR8","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105425","author":"M Cui","year":"2022","unstructured":"Cui M, Li L, Zhou M, Li J, Abusorrah A, Sedraoui K (2022) A bi-population cooperative optimization algorithm assisted by an autoencoder for medium-scale expensive problems. IEEE\/CAA J Automatica Sinica. https:\/\/doi.org\/10.1109\/JAS.2022.105425","journal-title":"IEEE\/CAA J Automatica Sinica"},{"issue":"3","key":"9889_CR9","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1007\/s00500-014-1570-8","volume":"20","author":"C Dai","year":"2016","unstructured":"Dai C, Wang Y, Hu L (2016) An improved $$\\alpha$$-dominance strategy for many-objective optimization problems. Soft Comput 20(3):1105\u20131111","journal-title":"Soft Comput"},{"issue":"4","key":"9889_CR10","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9889_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9889_CR12","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1162\/106365605774666895","volume":"13","author":"K Deb","year":"2005","unstructured":"Deb K, Mohan M, Mishra S (2005) Evaluating the $$\\varepsilon$$-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions. Evol Comput 13(4):501\u2013525","journal-title":"Evol Comput"},{"key":"9889_CR13","doi-asserted-by":"crossref","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005b) Scalable test problems for evolutionary multiobjective optimization. In: Evolutionary multiobjective optimization, Springer, pp 105\u2013145","DOI":"10.1007\/1-84628-137-7_6"},{"issue":"5","key":"9889_CR14","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1109\/TEVC.2019.2958921","volume":"24","author":"M Elarbi","year":"2020","unstructured":"Elarbi M, Bechikh S, Coello CAC, Makhlouf M, Said LB (2020) Approximating complex pareto fronts with pre-defined normal-boundary intersection directions. IEEE Trans Evol Comput 24(5):809\u2013823","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9889_CR15","doi-asserted-by":"publisher","first-page":"9681","DOI":"10.1109\/TEVC.2021.3061545","volume":"25","author":"JG Falc\u00f3n-Cardona","year":"2021","unstructured":"Falc\u00f3n-Cardona JG, Ishibuchi H, Coello CAC, Emmerich M (2021) On the effect of the cooperation of indicator-based multi-objective evolutionary algorithms. IEEE Trans Evol Comput 25(4):9681\u20138695","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9889_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1109\/TEVC.2016.2587749","volume":"21","author":"H Ishibuchi","year":"2017","unstructured":"Ishibuchi H, Setoguchi Y, Masuda H, Nojima Y (2017) Performance of decomposition-based many-objective algorithms strongly depends on pareto front shapes. IEEE Trans Evol Comput 21(2):169\u2013190","journal-title":"IEEE Trans Evol Comput"},{"key":"9889_CR17","doi-asserted-by":"crossref","unstructured":"Ishibuchi H, Matsumoto T, Masuyama N, Nojima Y (2020a) Effects of dominance resistant solutions on the performance of evolutionary multi-objective and many-objective algorithms. In: Proceedings of annual conference on genetic and evolutionary computation (GECCO), pp 507\u2013515","DOI":"10.1145\/3377930.3390166"},{"key":"9889_CR18","unstructured":"Ishibuchi H, Matsumoto T, Masuyama N, Nojima Y (2020b) Many-objective problems are not always difficult for pareto dominance-based evolutionary algorithms. In: Proceedings of 24th European conference on artificial intelligence (ECAI), pp 291\u2013298"},{"key":"9889_CR19","doi-asserted-by":"crossref","unstructured":"Ikeda K, Kobayashi S, Kita H(2001) Failure of pareto-based MOEAs: Does non-dominated really mean near to optimal? In: Proceedings of the 2001 congress on evolutionary computation, vol 2, pp 957\u2013962","DOI":"10.1109\/CEC.2001.934293"},{"issue":"6","key":"9889_CR20","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1109\/TEVC.2016.2549267","volume":"20","author":"B Li","year":"2016","unstructured":"Li B, Tang K, Li J, Yao X (2016) Stochastic ranking algorithm for many-objective optimization based on multiple indicators. IEEE Trans Evol Comput 20(6):924\u2013938","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"9889_CR21","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1109\/TEVC.2014.2373386","volume":"19","author":"K Li","year":"2015","unstructured":"Li K, Deb K, Zhang Q, Kwong S (2015) An evolutionary many-objective optimization algorithm based on dominance and decomposition. IEEE Trans Evol Comput 19(5):694\u2013716","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"9889_CR22","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TEVC.2017.2725902","volume":"22","author":"HL Liu","year":"2018","unstructured":"Liu HL, Chen L, Zhang Q, Deb K (2018) Adaptively allocating search effort in challenging many-objective optimization problems. IEEE Trans Evol Comput 22(3):433\u2013448","journal-title":"IEEE Trans Evol Comput"},{"issue":"03","key":"9889_CR23","doi-asserted-by":"publisher","first-page":"1959008","DOI":"10.1142\/S0218001419590080","volume":"33","author":"J Liu","year":"2019","unstructured":"Liu J, Wang Y, Wang X, Guo S, Sui X (2019) A new dominance method based on expanding dominated area for many-objective optimization. Int J Pattern Recognit Artif Intell 33(03):1959008","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"9889_CR24","doi-asserted-by":"crossref","unstructured":"Lu Z, Deb K, Goodman E, Banzhaf W, Boddeti VN (2020a) NSGANetV2: Evolutionary multi-objective surrogate-assisted neural architecture search. In: European conference on computer vision. Springer, pp 35\u201351","DOI":"10.1007\/978-3-030-58452-8_3"},{"key":"9889_CR25","doi-asserted-by":"crossref","unstructured":"Lu Z, Whalen I, Dhebar Y, Deb K, Goodman E, Banzhaf W, Boddeti VN (2020b) Multi-objective evolutionary design of deep convolutional neural networks for image classification. IEEE Trans Evol Comput 25(2):277\u2013291","DOI":"10.1109\/TEVC.2020.3024708"},{"issue":"9","key":"9889_CR26","doi-asserted-by":"publisher","first-page":"2971","DOI":"10.1109\/TPAMI.2021.3052758","volume":"43","author":"Z Lu","year":"2021","unstructured":"Lu Z, Sreekumar G, Goodman E, Banzhaf W, Deb K, Boddeti VN (2021) Neural architecture transfer. IEEE Trans Pattern Anal Mach Intell 43(9):2971\u20132989","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"9889_CR27","doi-asserted-by":"publisher","first-page":"5546","DOI":"10.1109\/TCYB.2020.2998038","volume":"51","author":"C Peng","year":"2021","unstructured":"Peng C, Liu HL, Goodman ED (2021) A cooperative evolutionary framework based on an improved version of directed weight vectors for constrained multiobjective optimization with deceptive constraints. IEEE Trans Cybern 51(11):5546\u20135558","journal-title":"IEEE Trans Cybern"},{"key":"9889_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107933","volume":"239","author":"C Peng","year":"2022","unstructured":"Peng C, Liu HL, Goodman ED, Tan KC (2022) A two-phase framework of locating the reference point for decomposition-based constrained multi-objective evolutionary algorithms. Knowl Based Syst 239:107933","journal-title":"Knowl Based Syst"},{"issue":"1","key":"9889_CR29","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TEVC.2016.2623770","volume":"22","author":"T Santos","year":"2018","unstructured":"Santos T, Takahashi RH (2018) On the performance degradation of dominance-based evolutionary algorithms in many-objective optimization. IEEE Trans Evol Comput 22(1):19\u201331","journal-title":"IEEE Trans Evol Comput"},{"key":"9889_CR30","doi-asserted-by":"crossref","unstructured":"Sato H, Aguirre HE, Tanaka K (2007) Controlling dominance area of solutions and its impact on the performance of MOEAs. In: Proceedings of international conference on evolutionary multi-criterion optimization (EMO 2007), ACM, pp 5\u201320","DOI":"10.1007\/978-3-540-70928-2_5"},{"key":"9889_CR31","doi-asserted-by":"crossref","unstructured":"Sato H, Aguirre H, Tanaka K (2010) Self-controlling dominance area of solutions in evolutionary many-objective optimization. Simul Evol Learn 455\u2013465","DOI":"10.1007\/978-3-642-17298-4_49"},{"issue":"5","key":"9889_CR32","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TEVC.2020.2964705","volume":"24","author":"K Shang","year":"2020","unstructured":"Shang K, Ishibuchi H (2020) A new hypervolume-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 24(5):839\u2013852","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"9889_CR33","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1109\/TEVC.2018.2883094","volume":"23","author":"HK Singh","year":"2019","unstructured":"Singh HK, Bhattacharjee KS, Ray T (2019) Distance-based subset selection for benchmarking in evolutionary multi\/many-objective optimization. IEEE Trans Evol Comput 23(5):904\u2013912","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9889_CR34","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/MCI.2017.2742868","volume":"12","author":"Y Tian","year":"2017","unstructured":"Tian Y, Cheng R, Zhang X, Jin Y (2017) PlatEMO: a MATLAB platform for evolutionary multi-objective optimization [educational forum]. IEEE Comput Intell Mag 12(4):73\u201387","journal-title":"IEEE Comput Intell Mag"},{"issue":"2","key":"9889_CR35","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","volume":"23","author":"Y Tian","year":"2019","unstructured":"Tian Y, Cheng R, Zhang X, Su Y, Jin Y (2019) A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization. IEEE Trans Evol Comput 23(2):331\u2013345","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9889_CR36","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TEVC.2016.2587808","volume":"21","author":"Y Xiang","year":"2016","unstructured":"Xiang Y, Zhou Y, Li M, Chen Z (2016) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evol Comput 21(1):131\u2013152","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9889_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2019.2909636","volume":"24","author":"Y Xiang","year":"2020","unstructured":"Xiang Y, Zhou Y, Yang X, Huang H (2020) A many-objective evolutionary algorithm with pareto-adaptive reference points. IEEE Trans Evol Comput 24(1):99\u2013113","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9889_CR38","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TEVC.2015.2420112","volume":"20","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Xu H, Wang B, Yao X (2016) A new dominance relation-based evolutionary algorithm for many-objective optimization. IEEE Trans Evol Comput 20(1):16\u201337","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"9889_CR39","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/JAS.2020.1003539","volume":"8","author":"Z Zhao","year":"2020","unstructured":"Zhao Z, Liu S, Zhou M, Abusorrah A (2020) Dual-objective mixed integer linear program and memetic algorithm for an industrial group scheduling problem. IEEE\/CAA J Automatica Sinica 8(6):1199\u20131209","journal-title":"IEEE\/CAA J Automatica Sinica"},{"key":"9889_CR40","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062994","author":"Z Zhao","year":"2021","unstructured":"Zhao Z, Zhou M, Liu S (2021) Iterated greedy algorithms for flow-shop scheduling problems: a tutorial. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2021.3062994","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"11","key":"9889_CR41","doi-asserted-by":"publisher","first-page":"3685","DOI":"10.1007\/s00500-017-2590-y","volume":"22","author":"Z Zhou","year":"2018","unstructured":"Zhou Z, Zhu S (2018) Kernel-based multiobjective clustering algorithm with automatic attribute weighting. Soft Comput 22(11):3685\u20133709","journal-title":"Soft Comput"},{"issue":"2","key":"9889_CR42","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1109\/TEVC.2015.2457245","volume":"20","author":"C Zhu","year":"2016","unstructured":"Zhu C, Xu L, Goodman ED (2016) Generalization of pareto-optimality for many-objective evolutionary optimization. IEEE Trans Evol Comput 20(2):299\u2013315","journal-title":"IEEE Trans Evol Comput"},{"issue":"105018","key":"9889_CR43","first-page":"1","volume":"188","author":"S Zhu","year":"2020","unstructured":"Zhu S, Xu L, Goodman ED (2020) Evolutionary multi-objective automatic clustering enhanced with quality metrics and ensemble strategy. Knowl Based Syst 188(105018):1\u201321","journal-title":"Knowl Based Syst"},{"key":"9889_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3081988","author":"S Zhu","year":"2021","unstructured":"Zhu S, Xu L, Goodman ED (2021) Hierarchical topology-based cluster representation for scalable evolutionary multiobjective clustering. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2021.3081988","journal-title":"IEEE Trans Cybern"},{"key":"9889_CR45","doi-asserted-by":"publisher","unstructured":"Zhu S, Xu L, Goodman ED, Lu Z (2022) A new many-objective evolutionary algorithm based on generalized pareto dominance. IEEE Trans Cybern. 52(8):7776\u20137790 \u00a0https:\/\/doi.org\/10.1109\/TCYB.2021.3051078","DOI":"10.1109\/TCYB.2021.3051078"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09889-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-022-09889-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09889-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T06:17:23Z","timestamp":1727677043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-022-09889-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9889"],"URL":"https:\/\/doi.org\/10.1007\/s11047-022-09889-z","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,27]]},"assertion":[{"value":"7 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}