{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T07:38:53Z","timestamp":1776584333497,"version":"3.51.2"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T00:00:00Z","timestamp":1736208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62303013"],"award-info":[{"award-number":["62303013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276001"],"award-info":[{"award-number":["62276001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20512"],"award-info":[{"award-number":["U21A20512"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Sparse large-scale multiobjective optimization problems (sparse LSMOPs) are characterized by an enormous number of decision variables, and their Pareto optimal solutions consist of a majority of decision variables with zero values. This property of sparse LSMOPs presents a great challenge in terms of how to rapidly and precisely search for Pareto optimal solutions. To deal with this issue, this paper proposes an adjoint feature-selection-based evolutionary algorithm tailored for tackling sparse LSMOPs. The proposed optimization strategy combines two distinct feature selection approaches. Specifically, the paper introduces the sequential forward selection approach to investigate independent sparse distribution, denoting it as the best sequence of decision variables for generating a high-quality initial population. Furthermore, it introduces the Relief approach to determine the relative sparse distribution, identifying crucial decisive variables with dynamic updates to guide the population in a promising evolutionary direction. Experiments are conducted on eight benchmark problems and two real-world problems, and experimental results verify that the proposed algorithm outperforms the existing state-of-the-art evolutionary algorithms for solving sparse LSMOPs.<\/jats:p>","DOI":"10.1007\/s40747-024-01752-1","type":"journal-article","created":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T08:30:36Z","timestamp":1736238636000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3761-4386","authenticated-orcid":false,"given":"Panpan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Hang","family":"Yin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3487-5126","authenticated-orcid":false,"given":"Ye","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Xingyi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,7]]},"reference":[{"issue":"1","key":"1752_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.1597059","volume":"1","author":"CC Coello","year":"2006","unstructured":"Coello CC (2006) Evolutionary multi-objective optimization: a historical view of the field. IEEE Comput Intell Mag 1(1):28\u201336","journal-title":"IEEE Comput Intell Mag"},{"key":"1752_CR2","doi-asserted-by":"crossref","unstructured":"Tamssaouet K, Dauz$$\\acute{\\rm e}$$re-P$$\\acute{\\rm e}$$r$$\\grave{\\rm e}$$s S, Knopp S, Bitar A, Yugma C, (2022) Multiobjective optimization for complex flexible job-shop scheduling problems. Eur J Oper Res 296(1):87\u2013100","DOI":"10.1016\/j.ejor.2021.03.069"},{"key":"1752_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124557","volume":"255","author":"B Sun","year":"2024","unstructured":"Sun B, Gong L, Zhang H, Guo Y, Gong D (2024) Basis path coverage testing of MPI programs based on multi-task evolutionary optimization. Expert Syst Appl 255:124557","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1752_CR4","doi-asserted-by":"publisher","first-page":"4977","DOI":"10.1007\/s40747-023-00990-z","volume":"9","author":"C He","year":"2020","unstructured":"He C, Cheng R, Yazdani D (2020) Evolutionary multiobjective optimization via efficient sampling-based offspring generation. Complex Intell Syst 9(5):4977\u20134993","journal-title":"Complex Intell Syst"},{"issue":"1","key":"1752_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ejor.2021.03.068","volume":"296","author":"P Groetzner","year":"2022","unstructured":"Groetzner P, Werner R (2022) Multiobjective optimization under uncertainty: a multiobjective robust (relative) regret approach. Eur J Oper Res 296(1):101\u2013115","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1752_CR6","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.ejor.2023.08.023","volume":"313","author":"H Sun","year":"2024","unstructured":"Sun H, Wang C, Li X, Hu Z (2024) A decision variable classification strategy based on the degree of environmental change for dynamic multiobjective optimization. Eur J Oper Res 313(1):296\u2013311","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1752_CR7","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2013.10.028","volume":"234","author":"J Fliege","year":"2014","unstructured":"Fliege J, Werner R (2014) Robust multiobjective optimization and applications in portfolio optimization. Eur J Oper Res 234(2):422\u2013433","journal-title":"Eur J Oper Res"},{"key":"1752_CR8","doi-asserted-by":"crossref","unstructured":"Park H, Sim MK, Choi DG (2024) Twin-system recurrent reinforcement learning for optimizing portfolio strategy. Expert Syst Appl 253: 124193","DOI":"10.1016\/j.eswa.2024.124193"},{"issue":"1","key":"1752_CR9","first-page":"69","volume":"23","author":"H Wang","year":"2015","unstructured":"Wang H, Jiao L, Shang R, He S, Liu F (2015) A memetic optimization strategy based on dimension reduction in decision space. IEEE Trans Evol Comput 23(1):69\u2013100","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1752_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TEVC.2021.3099487","volume":"27","author":"S Liu","year":"2013","unstructured":"Liu S, Lin Q, Wong KC, Li Q, Tan KC (2013) Evolutionary large-Scale multiobjective optimization: benchmarks and algorithms. IEEE Trans Evol Comput 27(3):401\u2013415","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1752_CR11","doi-asserted-by":"publisher","first-page":"4629","DOI":"10.1007\/s40747-023-00967-y","volume":"9","author":"H Abo-Bakr","year":"2023","unstructured":"Abo-Bakr H, Mohamed SA (2023) Automatic multi-documents text summarization by a large-scale sparse multi-objective optimization algorithm. Complex Intell Syst 9(4):4629\u20134644","journal-title":"Complex Intell Syst"},{"key":"1752_CR12","unstructured":"Jin Y, Okabe T, Sendhoff B (2004) Neural network regularization and ensembling using multi-objective evolutionary algorithms. In: IEEE congress on evolutionary computation, pp 1\u20138"},{"issue":"5","key":"1752_CR13","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1109\/TNNLS.2017.2677973","volume":"29","author":"H Li","year":"2018","unstructured":"Li H, Zhang Q, Deng J, Xu ZB (2018) A preference-based multiobjective evolutionary approach for sparse optimization. IEEE Trans Neural Netw Learn Syst 29(5):1716\u20131731","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1752_CR14","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou M, Tahraoui MA, Kheddouci H (2018) The critical node detection problem in networks: a survey. Comput Sci Rev 28:92\u2013117","journal-title":"Comput Sci Rev"},{"issue":"3","key":"1752_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TEVC.2021.3118593","volume":"27","author":"X Yang","year":"2023","unstructured":"Yang X, Zou J, Yang S, Zheng J, Liu Y (2023) A fuzzy decision variables framework for large-scale multiobjective optimization. IEEE Trans Evol Comput 27(3):445\u2013459","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1752_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TEVC.2021.3099487","volume":"27","author":"S Liu","year":"2023","unstructured":"Liu S, Lin Q, Wong KC, Li Q, Tan KC (2023) Evolutionary large-scale multiobjective optimization: benchmarks and algorithms. IEEE Trans Evol Comput 27(3):401\u2013415","journal-title":"IEEE Trans Evol Comput"},{"key":"1752_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2024.101504","volume":"86","author":"K Qiao","year":"2024","unstructured":"Qiao K, Liang J, Yu K, Guo W, Yue C, Qu B, Suganthan PN (2024) Benchmark problems for large-scale constrained multi-objective optimization with baseline results. Swarm Evol Comput 86:101504","journal-title":"Swarm Evol Comput"},{"key":"1752_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.108194","volume":"133","author":"Y Zhang","year":"2024","unstructured":"Zhang Y, Wu C, Tian Y, Zhang X (2024) A co-evolutionary algorithm based on sparsity clustering for sparse large-scale multi-objective optimization. Eng Appl Artif Intell 133:108194","journal-title":"Eng Appl Artif Intell"},{"issue":"8","key":"1752_CR19","first-page":"1","volume":"54","author":"Y Tian","year":"2021","unstructured":"Tian Y, Si L, Zhang X, Cheng R, He C, Tan KC, Jin Y (2021) Evolutionary large-scale multi-objective optimization: a survey. ACM Comput Surv 54(8):1\u201334","journal-title":"ACM Comput Surv"},{"key":"1752_CR20","doi-asserted-by":"crossref","unstructured":"Antonio LM, Coello CAC (2013) Use of cooperative coevolution for solving large scale multiobjective optimization problems. In: IEEE congress on evolutionary computation, pp 2758\u20132765","DOI":"10.1109\/CEC.2013.6557903"},{"issue":"2","key":"1752_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TEVC.2017.2704782","volume":"22","author":"H Zille","year":"2018","unstructured":"Zille H, Ishibuchi H, Mostaghim S, Nojima Y (2018) A framework for large-scale multiobjective optimization based on problem transformation. IEEE Trans Evol Comput 22(2):260\u2013275","journal-title":"IEEE Trans Evol Comput"},{"key":"1752_CR22","doi-asserted-by":"crossref","unstructured":"Zille H, Ishibuchi H, Mostaghim S, Nojima Y (2016) Mutation operators based on variable grouping for multi-objective large scale optimization. In: IEEE symposium series on computational intelligence, pp 1-8","DOI":"10.1109\/SSCI.2016.7850214"},{"issue":"2","key":"1752_CR23","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1109\/TEVC.2019.2918140","volume":"24","author":"Y Tian","year":"2019","unstructured":"Tian Y, Zhang X, Wang C, Jin Y (2019) An evolutionary algorithm for large-scale sparse multiobjective optimization problems. IEEE Trans Evol Comput 24(2):380\u2013393","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"1752_CR24","first-page":"1","volume":"9","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Tian Y, Zhang X (2021) Improved SparseEA for sparse large-scale multi-objective optimization problems. Complex Intell Syst 9(5):1\u201316","journal-title":"Complex Intell Syst"},{"key":"1752_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101093","volume":"72","author":"J Jiang","year":"2022","unstructured":"Jiang J, Han F, Wang J, Ling Q, Han H, Wang Y (2022) A two-stage evolutionary algorithm for large-scale sparse multiobjective optimization problems. Swarm Evol Comput 72:101093","journal-title":"Swarm Evol Comput"},{"issue":"6","key":"1752_CR26","doi-asserted-by":"publisher","first-page":"3115","DOI":"10.1109\/TCYB.2020.2979930","volume":"51","author":"Y Tian","year":"2021","unstructured":"Tian Y, Lu C, Zhang X, Tan KC, Jin Y (2021) Solving large-scale multiobjective optimization problems with sparse optimal solutions via unsupervised neural networks. IEEE Trans Cybern 51(6):3115\u20133128","journal-title":"IEEE Trans Cybern"},{"issue":"7","key":"1752_CR27","doi-asserted-by":"publisher","first-page":"6784","DOI":"10.1109\/TCYB.2020.3041325","volume":"52","author":"Y Tian","year":"2022","unstructured":"Tian Y, Lu C, Zhang X, Cheng F, Jin Y (2022) A pattern mining based evolutionary algorithm for large-scale sparse multi-objective optimization problems. IEEE Trans Cybern 52(7):6784\u20136797","journal-title":"IEEE Trans Cybern"},{"key":"1752_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.neucom.2021.01.115","volume":"440","author":"Z Tan","year":"2021","unstructured":"Tan Z, Wang H, Liu S (2021) Multi-stage dimension reduction for expensive sparse multi-objective optimization problems. Neurocomputing 440:159\u2013174","journal-title":"Neurocomputing"},{"key":"1752_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101119","volume":"73","author":"Z Ding","year":"2022","unstructured":"Ding Z, Chen L, Sun D, Zhang X (2022) A multi-stage knowledge-guided evolutionary algorithm for large-scale sparse multi-objective optimization problems. Swarm Evol Comput 73:101119","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"1752_CR30","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/TEVC.2021.3111209","volume":"26","author":"X Wang","year":"2022","unstructured":"Wang X, Zhang K, Wang J, Jin Y (2022) An enhanced competitive swarm optimizer with strongly convex sparse operator for large-scale multiobjective optimization. IEEE Trans Evol Comput 26(5):859\u2013871","journal-title":"IEEE Trans Evol Comput"},{"issue":"8","key":"1752_CR31","first-page":"1","volume":"9","author":"J Ren","year":"2023","unstructured":"Ren J, Qiu F, Huizhen H (2023) Multiple sparse detection-based evolutionary algorithm for large-scale sparse multiobjective optimization problems. Complex Intell Syst 9(8):1\u201320","journal-title":"Complex Intell Syst"},{"issue":"1","key":"1752_CR32","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.compeleceng.2013.11.024","volume":"40","author":"MR Islam","year":"2014","unstructured":"Islam MR, Lima AA, Das SC, Mridha MF, Watanobe Prodeep ARY (2014) A survey on feature selection methods. Comput Electr Eng 40(1):16\u201328","journal-title":"Comput Electr Eng"},{"key":"1752_CR33","doi-asserted-by":"crossref","unstructured":"McKay MD, Beckman RJ, Conover WJ (2000) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 42(1):55\u201361","DOI":"10.1080\/00401706.2000.10485979"},{"issue":"3","key":"1752_CR34","doi-asserted-by":"publisher","first-page":"211","DOI":"10.6029\/smartcr.2014.03.007","volume":"4","author":"V Kumar","year":"2014","unstructured":"Kumar V, Minz S (2014) Feature selection: a literature review. SmartCR 4(3):211\u2013229","journal-title":"SmartCR"},{"issue":"6","key":"1752_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2017","unstructured":"Li J, Cheng K, Wang S, Morstatter F, Trevino RP, Tang J (2017) Feature selection: a data perspective. ACM Comput Surv (CSUR) 50(6):1\u201345","journal-title":"ACM Comput Surv (CSUR)"},{"key":"1752_CR36","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon I, Elisseeff A (2003) An introduction to variable and feature selection. J Mach Learn Res 3:1157\u20131182","journal-title":"J Mach Learn Res"},{"key":"1752_CR37","doi-asserted-by":"crossref","unstructured":"Jovi A, Brki K, Bogunovi N (2015) A review of feature selection methods with applications. In: International convention on information and communication technology electronics and microelectronics, pp 1200\u20131205","DOI":"10.1109\/MIPRO.2015.7160458"},{"issue":"3","key":"1752_CR38","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/IDA-1997-1302","volume":"1","author":"M Dash","year":"1997","unstructured":"Dash M, Liu H (1997) Feature selection for classification. Intell Data Anal 1(3):131\u2013156","journal-title":"Intell Data Anal"},{"key":"1752_CR39","doi-asserted-by":"crossref","unstructured":"Wang L, Shen C, Hartley R (2011) On the optimality of sequential forward feature selection using class separability measure. In: International conference on digital image computing: techniques and applications, pp 203\u2013208","DOI":"10.1109\/DICTA.2011.41"},{"key":"1752_CR40","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jbi.2018.07.014","volume":"85","author":"R Urbanowicz","year":"2018","unstructured":"Urbanowicz R, Melissa M, La C, Olson R, Moore J (2018) Relief-based feature selection: introduction and review. J Biomed Inform 85:189\u2013203","journal-title":"J Biomed Inform"},{"issue":"2","key":"1752_CR41","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":"2","key":"1752_CR42","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9(2):115\u2013148","journal-title":"Complex Syst"},{"key":"1752_CR43","first-page":"30","volume":"26","author":"K Deb","year":"1996","unstructured":"Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf Syst 26:30\u201345","journal-title":"Comput Sci Inf Syst"},{"issue":"4","key":"1752_CR44","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":"3","key":"1752_CR45","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TEVC.2012.2196800","volume":"17","author":"A Ponsich","year":"2013","unstructured":"Ponsich A, Jaimes AL, Coello CAC (2013) A survey on multiobjective evolutionary algorithms for the solution of the portfolio optimization problem and other finance and economics applications. IEEE Trans Evol Comput 17(3):321\u2013344","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1752_CR46","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PAN Bosman","year":"2003","unstructured":"Bosman PAN, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"1752_CR47","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01752-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01752-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01752-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T16:27:14Z","timestamp":1738945634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01752-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,7]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1752"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01752-1","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,7]]},"assertion":[{"value":"29 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","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 declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"127"}}