{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:42:59Z","timestamp":1780674179184,"version":"3.54.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"19","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076172"],"award-info":[{"award-number":["62076172"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Key Research and Development Project of Sichuan","award":["2019YFG0494"],"award-info":[{"award-number":["2019YFG0494"]}]},{"name":"the Key Research and Development Project of Sichuan","award":["2021YFG0027"],"award-info":[{"award-number":["2021YFG0027"]}]},{"name":"the National Key Research and Development Project of China","award":["2017YFB0202403"],"award-info":[{"award-number":["2017YFB0202403"]}]},{"name":"the State Key Program of National Science Foundation of China","award":["61836006"],"award-info":[{"award-number":["61836006"]}]},{"name":"the National Natural Science Fund for Distinguished Young Scholar","award":["61625204"],"award-info":[{"award-number":["61625204"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, many studies have been carried out on model compression to handle the high computational cost and high memory footprint brought by the implementation of deep neural networks. In this paper, model compression of convolutional neural networks is constructed as a multiobjective optimization problem with two conflicting objectives, reducing the model size and improving the performance. A novel structured pruning method called Conventional-based and Evolutionary Approaches Guided Multiobjective Pruning (CEA-MOP) is proposed to address this problem, where the power of conventional pruning methods is effectively exploited for the evolutionary process. A delicate balance in pruning rate and model accuracy has been automated achieved by a multiobjective optimization evolutionary model. First, an ensemble framework integrates pruning metrics to establish a codebook for further evolutionary operations. Then, an efficient coding method is developed to shorten the length of chromosome, thus ensuring its superior scalability. Finally, sensitivity analysis is automatically carried out to determine the upper bound of pruning rate for each layer. Notably, on CIFAR-10, CEA-MOP reduces more than 50% FLOPs on ResNet-110 and improves the relative accuracy. Moreover, on ImageNet, CEA-MOP reduces more than 50% FLOPs on ResNet-101 with negligible top-1 accuracy drop.<\/jats:p>","DOI":"10.1007\/s00521-022-07161-0","type":"journal-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T17:05:54Z","timestamp":1654794354000},"page":"16493-16514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Compression of deep neural networks: bridging the gap between conventional-based pruning and evolutionary approach"],"prefix":"10.1007","volume":"34","author":[{"given":"Yidan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guangjin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taibo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianfeng","family":"Pang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhenan","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiancheng","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"7161_CR1","doi-asserted-by":"crossref","unstructured":"Bau D, Zhou B, Khosla A, Oliva A, Torralba A (2017) Network dissection: quantifying interpretability of deep visual representations. In: CVPR","DOI":"10.1109\/CVPR.2017.354"},{"key":"7161_CR2","unstructured":"B\u00e8ack T (1998) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming. Genetic Algorithms\/T, B\u00e4ck"},{"key":"7161_CR3","unstructured":"Cheng Y, Wang D, Zhou P, Zhang T (2017) A survey of model compression and acceleration for deep neural networks. arXiv:171009282"},{"issue":"6","key":"7161_CR4","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1109\/TEVC.2016.2564158","volume":"20","author":"W Chiu","year":"2016","unstructured":"Chiu W, Yen GG, Juan T (2016) Minimum Manhattan distance approach to multiple criteria decision making in multiobjective optimization problems. IEEE Trans Evol Comput 20(6):972\u2013985","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"7161_CR5","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"},{"key":"7161_CR6","doi-asserted-by":"crossref","unstructured":"Fletcher PT, Venkatasubramanian S, Joshi SC (2008) Robust statistics on Riemannian manifolds via the geometric median. In: CVPR","DOI":"10.1109\/CVPR.2008.4587747"},{"key":"7161_CR7","doi-asserted-by":"crossref","unstructured":"Graves A, Mohamed A, Hinton GE (2013) Speech recognition with deep recurrent neural networks. In: ICASSP","DOI":"10.1109\/ICASSP.2013.6638947"},{"key":"7161_CR8","unstructured":"Han S, Pool J, Tran J, Dally WJ (2015) Learning both weights and connections for efficient neural network. In: NIPS"},{"key":"7161_CR9","unstructured":"Hassibi B, Stork DG (1992) Second order derivatives for network pruning: optimal brain surgeon. In: NIPS"},{"key":"7161_CR10","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: CVPR","DOI":"10.1109\/CVPR.2016.90"},{"key":"7161_CR11","doi-asserted-by":"crossref","unstructured":"He Y, Zhang X, Sun J (2017) Channel pruning for accelerating very deep neural networks. In: ICCV","DOI":"10.1109\/ICCV.2017.155"},{"key":"7161_CR12","doi-asserted-by":"crossref","unstructured":"He Y, Kang G, Dong X, Fu Y, Yang Y (2018) Soft filter pruning for accelerating deep convolutional neural networks. In: IJCAI","DOI":"10.24963\/ijcai.2018\/309"},{"key":"7161_CR13","doi-asserted-by":"crossref","unstructured":"He Y, Liu P, Wang Z, Hu Z, Yang Y (2019) Filter pruning via geometric median for deep convolutional neural networks acceleration. In: CVPR","DOI":"10.1109\/CVPR.2019.00447"},{"key":"7161_CR14","unstructured":"Hinton GE, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. arXiv:150302531"},{"key":"7161_CR15","unstructured":"Howard AG, Zhu M, Chen B, Kalenichenko D, Wang W, Weyand T, Andreetto M, Adam H (2017) Mobilenets: efficient convolutional neural networks for mobile vision applications. arXiv:170404861"},{"key":"7161_CR16","unstructured":"Hu H, Peng R, Tai Y, Tang C (2016) Network trimming: a data-driven neuron pruning approach towards efficient deep architectures. arXiv preprint, 160703250"},{"key":"7161_CR17","doi-asserted-by":"crossref","unstructured":"Huang G, Liu Z, van\u00a0der Maaten L, Weinberger KQ (2017) Densely connected convolutional networks. In: CVPR","DOI":"10.1109\/CVPR.2017.243"},{"key":"7161_CR18","doi-asserted-by":"crossref","unstructured":"Huang Z, Wang N (2018) Data-driven sparse structure selection for deep neural networks. In: ECCV","DOI":"10.1007\/978-3-030-01270-0_19"},{"key":"7161_CR19","doi-asserted-by":"crossref","unstructured":"Jacob B, Kligys S, Chen B, Zhu M, Tang M, Howard AG, Adam H, Kalenichenko D (2018) Quantization and training of neural networks for efficient integer-arithmetic-only inference. In: CVPR","DOI":"10.1109\/CVPR.2018.00286"},{"key":"7161_CR20","doi-asserted-by":"crossref","unstructured":"Jia K, Tao D, Gao S, Xu X (2017) Improving training of deep neural networks via singular value bounding. In: CVPR","DOI":"10.1109\/CVPR.2017.425"},{"key":"7161_CR21","unstructured":"Krizhevsky A, Hinton G et al (2009) Learning multiple layers of features from tiny images. Citesee"},{"key":"7161_CR22","unstructured":"LeCun Y, Denker JS, Solla SA (1989) Optimal brain damage. In: NIPS"},{"key":"7161_CR23","unstructured":"Lee N, Ajanthan T, Gould S, Torr PHS (2020) A signal propagation perspective for pruning neural networks at initialization. In: ICLR"},{"key":"7161_CR24","doi-asserted-by":"crossref","unstructured":"Li C, Yuan X, Lin C, Guo M, Wu W, Yan J, Ouyang W (2019) AM-LFS: automl for loss function search. In: ICCV","DOI":"10.1109\/ICCV.2019.00850"},{"key":"7161_CR25","unstructured":"Li H, Kadav A, Durdanovic I, Samet H, Graf HP (2017) Pruning filters for efficient convnets. In: ICLR"},{"key":"7161_CR26","doi-asserted-by":"crossref","unstructured":"Li Y, Lin S, Liu J, Ye Q, Wang M, Chao F, Yang F, Ma J, Tian Q, Ji R (2021) Towards compact cnns via collaborative compression. In: CVPR","DOI":"10.1109\/CVPR46437.2021.00637"},{"key":"7161_CR27","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Wang Y, Zhang Y, Zhang B, Tian Y, Shao L (2020) Hrank: Filter pruning using high-rank feature map. In: CVPR","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"7161_CR28","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Zhang Y, Zhang B, Wu Y, Tian Y (2020) Channel pruning via automatic structure search. In: IJCAI","DOI":"10.24963\/ijcai.2020\/94"},{"key":"7161_CR29","doi-asserted-by":"crossref","unstructured":"Lin S, Ji R, Yan C, Zhang B, Cao L, Ye Q, Huang F, Doermann DS (2019) Towards optimal structured CNN pruning via generative adversarial learning. In: CVPR","DOI":"10.1109\/CVPR.2019.00290"},{"key":"7161_CR30","unstructured":"Liu Z, Sun M, Zhou T, Huang G, Darrell T (2019) Rethinking the value of network pruning. In: ICLR"},{"key":"7161_CR31","unstructured":"Louizos C, Welling M, Kingma DP (2018) Learning sparse neural networks through l\\_0 regularization. In: ICLR"},{"key":"7161_CR32","doi-asserted-by":"crossref","unstructured":"Luo JH, Wu J, Lin W (2017) Thinet: A filter level pruning method for deep neural network compression. In: ICCV","DOI":"10.1109\/ICCV.2017.541"},{"key":"7161_CR33","unstructured":"Molchanov P, Tyree S, Karras T, Aila T, Kautz J (2017) Pruning convolutional neural networks for resource efficient inference. In: ICLR"},{"issue":"1","key":"7161_CR34","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TEVC.2013.2290086","volume":"18","author":"A Mukhopadhyay","year":"2014","unstructured":"Mukhopadhyay A, Maulik U, Bandyopadhyay S, Coello CAC (2014) A survey of multiobjective evolutionary algorithms for data mining: part I. IEEE Trans Evol Comput 18(1):4\u201319","journal-title":"IEEE Trans Evol Comput"},{"key":"7161_CR35","unstructured":"Paszke A, Gross S, Chintala S, Chanan G, Yang E, Devito Z, Lin Z, Desmaison A, Antiga L, Lerer A (2017) Automatic differentiation in pytorch. In: NIPS-W"},{"key":"7161_CR36","unstructured":"Peng H, Wu J, Chen S, Huang J (2019) Collaborative channel pruning for deep networks. In: ICML"},{"key":"7161_CR37","doi-asserted-by":"crossref","unstructured":"Persand K, Anderson A, Gregg D (2020) Composition of saliency metrics for channel pruning with a myopic oracle. arXiv:200403376","DOI":"10.1109\/SSCI47803.2020.9308157"},{"issue":"7","key":"7161_CR38","doi-asserted-by":"publisher","first-page":"4625","DOI":"10.1109\/TIM.2020.2983531","volume":"69","author":"R Precup","year":"2020","unstructured":"Precup R, Teban T, Albu A, Borlea A, Zamfirache IA, Petriu EM (2020) Evolving fuzzy models for prosthetic hand myoelectric-based control. IEEE Trans Instrum Meas 69(7):4625\u20134636","journal-title":"IEEE Trans Instrum Meas"},{"key":"7161_CR39","unstructured":"Qian X, Klabjan D (2021) A probabilistic approach to neural network pruning. In: ICML"},{"issue":"6","key":"7161_CR40","first-page":"120","volume":"12","author":"GP Rangaiah","year":"2008","unstructured":"Rangaiah GP (2008) Multi-objective optimization. IEEE Microw Mag 12(6):120\u2013133","journal-title":"IEEE Microw Mag"},{"key":"7161_CR41","unstructured":"Real E, Moore S, Selle A, Saxena S, Suematsu YL, Tan J, Le QV, Kurakin A (2017) Large-scale evolution of image classifiers. In: ICML"},{"key":"7161_CR42","unstructured":"Real E, Moore S, Selle A, Saxena S, Suematsu YL, Tan J, Le QV, Kurakin A (2017) Large-scale evolution of image classifiers. In: ICML"},{"issue":"3","key":"7161_CR43","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11263-015-0816-y","volume":"115","author":"O Russakovsky","year":"2015","unstructured":"Russakovsky O, Deng J, Su H, Krause J, Satheesh S, Ma S, Huang Z, Karpathy A, Khosla A, Bernstein MS, Berg AC, Li F (2015) Imagenet large scale visual recognition challenge. Int J Comput Vis 115(3):211\u2013252","journal-title":"Int J Comput Vis"},{"key":"7161_CR44","unstructured":"Song H, Mao H, Dally WJ (2016) Deep compression: compressing deep neural networks with pruning, trained quantization and huffman coding. In: ICLR"},{"issue":"1","key":"7161_CR45","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/TEVC.2018.2808689","volume":"23","author":"Y Sun","year":"2019","unstructured":"Sun Y, Yen GG, Yi Z (2019) Evolving unsupervised deep neural networks for learning meaningful representations. IEEE Trans Evol Comput 23(1):89\u2013103","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"7161_CR46","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1109\/TNNLS.2019.2919608","volume":"31","author":"Y Sun","year":"2020","unstructured":"Sun Y, Xue B, Zhang M, Yen GG (2020) Completely automated CNN architecture design based on blocks. IEEE Trans Neural Netw Learn Syst 31(4):1242\u20131254","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"2","key":"7161_CR47","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1109\/TEVC.2019.2916183","volume":"24","author":"Y Sun","year":"2020","unstructured":"Sun Y, Xue B, Zhang M, Yen GG (2020) Evolving deep convolutional neural networks for image classification. IEEE Trans Evol Comput 24(2):394\u2013407","journal-title":"IEEE Trans Evol Comput"},{"key":"7161_CR48","unstructured":"Wang D, Zhou L, Zhang X, Bai X, Zhou J (2018) Exploring linear relationship in feature map subspace for convnets compression. arXiv:180305729"},{"key":"7161_CR49","doi-asserted-by":"crossref","unstructured":"Wang Y, Xu C, Qiu J, Xu C, Tao D (2018) Towards evolutionary compression. In: KDD","DOI":"10.1145\/3219819.3219970"},{"key":"7161_CR50","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhang X, Xie L, Zhou J, Su H, Zhang B, Hu X (2020) Pruning from scratch. In: AAAI","DOI":"10.1609\/aaai.v34i07.6910"},{"key":"7161_CR51","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.neucom.2020.03.082","volume":"404","author":"Z Wang","year":"2020","unstructured":"Wang Z, Li F, Shi G, Xie X, Wang F (2020) Network pruning using sparse learning and genetic algorithm. Neurocomputing 404:247\u2013256","journal-title":"Neurocomputing"},{"key":"7161_CR52","doi-asserted-by":"crossref","unstructured":"Wen W, Xu C, Wu C, Wang Y, Chen Y, Li H (2017) Coordinating filters for faster deep neural networks. In: ICCV","DOI":"10.1109\/ICCV.2017.78"},{"key":"7161_CR53","unstructured":"Wu Y, Schuster M, Chen Z, Le QV, Norouzi M, Macherey W, Krikun M, Cao Y, Gao Q, Macherey K, Klingner J, Shah A, Johnson M, Liu X, \u0141ukasz Kaiser, Gouws S, Kato Y, Kudo T, Kazawa H, Stevens K, Kurian G, Patil N, Wang W, Young C, Smith J, Riesa J, Rudnick A, Vinyals O, Corrado G, Hughes M, Dean J (2016) Google\u2019s neural machine translation system: bridging the gap between human and machine translation. arXiv:160908144"},{"key":"7161_CR54","doi-asserted-by":"crossref","unstructured":"Xie L, Yuille A (2017) Genetic cnn. In: ICCV","DOI":"10.1109\/ICCV.2017.154"},{"key":"7161_CR55","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.neucom.2021.04.022","volume":"451","author":"K Xu","year":"2021","unstructured":"Xu K, Zhang D, An J, Liu L, Liu L, Wang D (2021) Genexp: multi-objective pruning for deep neural network based on genetic algorithm. Neurocomputing 451:81\u201394","journal-title":"Neurocomputing"},{"key":"7161_CR56","doi-asserted-by":"crossref","unstructured":"Yang Z, Wang Y, Chen X, Shi B, Xu C, Xu C, Tian Q, Xu C (2019) CARS: continuous evolution for efficient neural architecture search. arXiv:p190904977","DOI":"10.1109\/CVPR42600.2020.00190"},{"key":"7161_CR57","unstructured":"Zagoruyko S, Komodakis N (2017) Paying more attention to attention: improving the performance of convolutional neural networks via attention transfer. In: ICLR"},{"issue":"2","key":"7161_CR58","first-page":"23","volume":"17","author":"R Zall","year":"2019","unstructured":"Zall R, Kangavari MR (2019) On the construction of multi-relational classifier based on canonical correlation analysis. Int J Artif Intell 17(2):23\u201343","journal-title":"Int J Artif Intell"},{"issue":"6","key":"7161_CR59","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2008","unstructured":"Zhang Q, Hui L (2008) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"7161_CR60","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.knosys.2018.03.005","volume":"149","author":"X Zhang","year":"2018","unstructured":"Zhang X, Zhao Z, Zhang H, Wang S, Li Z (2018) Unsupervised geographically discriminative feature learning for landmark tagging. Knowl Based Syst 149:143\u2013154","journal-title":"Knowl Based Syst"},{"key":"7161_CR61","doi-asserted-by":"crossref","unstructured":"Zhang X, Zhou X, Lin M, Sun J (2018) Shufflenet: An extremely efficient convolutional neural network for mobile devices. In: CVPR","DOI":"10.1109\/CVPR.2018.00716"},{"key":"7161_CR62","first-page":"1","volume":"99","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Yen GG, Yi Z (2019) A knee-guided evolutionary algorithm for compressing deep neural networks. IEEE Trans Cybern 99:1\u201313","journal-title":"IEEE Trans Cybern"},{"key":"7161_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TNNLS.2019.2911236","volume":"99","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Yi Z, Yen GG (2019) Evolutionary compression of deep neural networks for biomedical image segmentation. IEEE Trans Neural Netw Learn Syst 99:1\u201314","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"7161_CR64","unstructured":"Zhuang L, Li J, Shen Z, Gao H, Zhang C (2017) Learning efficient convolutional networks through network slimming. In: ICCV"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07161-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07161-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07161-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T13:59:13Z","timestamp":1663855153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07161-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":64,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["7161"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07161-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"18 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2022","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}