{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T11:02:59Z","timestamp":1756810979493,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T00:00:00Z","timestamp":1706572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T00:00:00Z","timestamp":1706572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST108-2221-E008-074-MY3"],"award-info":[{"award-number":["MOST108-2221-E008-074-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["111-2221-E-008-097","112-2221-E-008-075"],"award-info":[{"award-number":["111-2221-E-008-097","112-2221-E-008-075"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Robot"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10514-024-10156-6","type":"journal-article","created":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T11:02:05Z","timestamp":1706612525000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Maximal coverage problems with routing constraints using cross-entropy Monte Carlo tree search"],"prefix":"10.1007","volume":"48","author":[{"given":"Pao-Te","family":"Lin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7818-5821","authenticated-orcid":false,"given":"Kuo-Shih","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,30]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Amigoni, F., & Gallo, A. (2005). A multi-objective exploration strategy for mobile robots. In IEEE international conference on robotics and automation (pp. 3850\u20133855).","key":"10156_CR1","DOI":"10.1109\/ROBOT.2005.1570708"},{"issue":"2","key":"10156_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2), 235\u2013256.","journal-title":"Machine Learning"},{"issue":"4","key":"10156_CR3","doi-asserted-by":"publisher","first-page":"3267","DOI":"10.1609\/aaai.v34i04.5726","volume":"34","author":"C Bian","year":"2020","unstructured":"Bian, C., Feng, C., Qian, C., & Yu, Y. (2020). An efficient evolutionary algorithm for subset selection with general cost constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 34(4), 3267\u20133274.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Bircher, A., Kamel, M., Alexis, K., Oleynikova, H., & Siegwart, R. (2016). Receding horizon \u201cnext-best-view\u201d planner for 3d exploration. In IEEE international conference on robotics and automation (ICRA) (pp. 1462\u20131468).","key":"10156_CR4","DOI":"10.1109\/ICRA.2016.7487281"},{"issue":"2","key":"10156_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10514-016-9610-0","volume":"42","author":"A Bircher","year":"2018","unstructured":"Bircher, A., Kamel, M., Alexis, K., Oleynikova, H., & Siegwart, R. (2018). Receding horizon path planning for 3d exploration and surface inspection. Autonomous Robots, 42(2), 291\u2013306.","journal-title":"Autonomous Robots"},{"doi-asserted-by":"crossref","unstructured":"Brock, O., Trinkle, J., & Ramos, F. (2009). Proofs and experiments in scalable, near-optimal search by multiple robots. Robotics: Science and Systems IV, pp. 206\u2013213.","key":"10156_CR6","DOI":"10.7551\/mitpress\/8344.003.0031"},{"issue":"2","key":"10156_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1002\/rob.4620050202","volume":"5","author":"ZL Cao","year":"1988","unstructured":"Cao, Z. L., Huang, Y., & Hall, E. L. (1988). Region filling operations with random obstacle avoidance for mobile robots. Journal of Robotic systems, 5(2), 87\u2013102.","journal-title":"Journal of Robotic systems"},{"issue":"1","key":"10156_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1609\/aiide.v4i1.18700","volume":"4","author":"G Chaslot","year":"2008","unstructured":"Chaslot, G., Bakkes, S., Szita, I., & Spronck, P. (2008). Monte-Carlo tree search: A new framework for game AI. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 4(1), 216\u2013217.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"doi-asserted-by":"crossref","unstructured":"Cheng, P. Keller, J., & Kumar, V. (2008). Time-optimal UAV trajectory planning for 3d urban structure coverage. In IEEE\/RSJ international conference on intelligent robots and systems (pp. 2750\u20132757).","key":"10156_CR9","DOI":"10.1109\/IROS.2008.4650988"},{"doi-asserted-by":"crossref","unstructured":"Cieslewski, T., Kaufmann, E., & Scaramuzza, D. (2017). Rapid exploration with multi-rotors: A frontier selection method for high speed flight. In IEEE\/RSJ international conference on intelligent robots and systems (IROS) (pp. 2135\u20132142).","key":"10156_CR10","DOI":"10.1109\/IROS.2017.8206030"},{"issue":"3","key":"10156_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., & Cornu\u00e9jols, G. (1984). Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Applied Mathematics, 7(3), 251\u2013274.","journal-title":"Discrete Applied Mathematics"},{"key":"10156_CR12","first-page":"432","volume":"2","author":"C Connolly","year":"1985","unstructured":"Connolly, C. (1985). The determination of next best views. IEEE International Conference on Robotics and Automation, 2, 432\u2013435.","journal-title":"IEEE International Conference on Robotics and Automation"},{"unstructured":"Coquelin, P. -A., & Munos, R. (2007). Bandit algorithms for tree search. arXiv:0703-062 [CS].","key":"10156_CR13"},{"issue":"2","key":"10156_CR14","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10514-018-9778-6","volume":"43","author":"M Corah","year":"2019","unstructured":"Corah, M., & Michael, N. (2019). Distributed matroid-constrained submodular maximization for multi-robot exploration: Theory and practice. Autonomous Robots, 43(2), 485\u2013501.","journal-title":"Autonomous Robots"},{"issue":"5","key":"10156_CR15","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2006.11.005","volume":"35","author":"A Costa","year":"2007","unstructured":"Costa, A., Jones, O. D., & Kroese, D. (2007). Convergence properties of the cross-entropy method for discrete optimization. Operations Research Letters, 35(5), 573\u2013580.","journal-title":"Operations Research Letters"},{"doi-asserted-by":"crossref","unstructured":"Coulom, R. (2006). Efficient selectivity and backup operators in Monte-Carlo tree search. In International conference on computers and games (pp. 72\u201383).","key":"10156_CR16","DOI":"10.1007\/978-3-540-75538-8_7"},{"issue":"1","key":"10156_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"P-T De Boer","year":"2005","unstructured":"De Boer, P.-T., Kroese, D. P., Mannor, S., & Rubinstein, R. Y. (2005). A tutorial on the cross-entropy method. Annals of Operations Research, 134(1), 19\u201367.","journal-title":"Annals of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Deng, D., Duan, R., Liu, J., Sheng, K., & Shimada, K. (2020). Robotic exploration of unknown 2d environment using a frontier-based automatic-differentiable information gain measure. In IEEE\/ASME international conference on advanced intelligent mechatronics (AIM) (pp. 1497\u20131503).","key":"10156_CR18","DOI":"10.1109\/AIM43001.2020.9158881"},{"unstructured":"Deng, D., Xu, Z., Zhao, W., & Shimada, K. (2020). Frontier-based automatic-differentiable information gain measure for robotic exploration of unknown 3d environments. arXiv:2011.05288.","key":"10156_CR19"},{"key":"10156_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1609\/icaps.v22i1.13529","volume":"22","author":"B Englot","year":"2012","unstructured":"Englot, B., & Hover, F. (2012). Sampling-based coverage path planning for inspection of complex structures. Proceedings of the International Conference on Automated Planning and Scheduling, 22, 29\u201337.","journal-title":"Proceedings of the International Conference on Automated Planning and Scheduling"},{"issue":"4","key":"10156_CR21","first-page":"634","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of Applied and Computational Mechanics (JACM), 45(4), 634\u2013652.","journal-title":"Journal of Applied and Computational Mechanics (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978). An analysis of approximations for maximizing submodular set functions\u2014II. Polyhedral Combinatorics (pp. 73\u201387).","key":"10156_CR22","DOI":"10.1007\/BFb0121195"},{"issue":"4","key":"10156_CR23","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1162\/EVCO_a_00159","volume":"23","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., & Neumann, F. (2015). Maximizing submodular functions under matroid constraints by evolutionary algorithms. Evolutionary Computation, 23(4), 543\u2013558.","journal-title":"Evolutionary Computation"},{"key":"10156_CR24","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2023","unstructured":"Galceran, E., & Carreras, M. (2023). A survey on coverage path planning for robotics. Robotics and Autonomous Systems, 61, 1258\u20131276.","journal-title":"Robotics and Autonomous Systems"},{"issue":"10\u201311","key":"10156_CR25","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1177\/0278364902021010834","volume":"21","author":"HH Gonz\u00e1lez-Banos","year":"2002","unstructured":"Gonz\u00e1lez-Banos, H. H., & Latombe, J.-C. (2002). Navigation strategies for exploring indoor environments. The International Journal of Robotics Research, 21(10\u201311), 829\u2013848.","journal-title":"The International Journal of Robotics Research"},{"issue":"1","key":"10156_CR26","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0377-2217(96)00161-0","volume":"101","author":"T Grossman","year":"1997","unstructured":"Grossman, T., & Wool, A. (1997). Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101(1), 81\u201392.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10156_CR27","first-page":"145","volume":"31","author":"M Guillaume","year":"2008","unstructured":"Guillaume, M., Winands, M. H., Szita, I., & van den Herik, H. J. (2008). Cross-entropy for Monte-Carlo tree search. International Computer Games Association, 31(3), 145\u2013156.","journal-title":"International Computer Games Association"},{"key":"10156_CR28","first-page":"3576","volume":"31","author":"S James","year":"2017","unstructured":"James, S., Konidaris, G., & Rosman, B. (2017). An analysis of Monte Carlo tree search. AAAI Conference on Artificial Intelligence, 31, 3576\u20133582.","journal-title":"AAAI Conference on Artificial Intelligence"},{"issue":"1","key":"10156_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., & Naor, J. S. (1999). The budgeted maximum coverage problem. Information Processing Letters, 70(1), 39\u201345.","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Kocsis, L., & Szepesv\u00e1ri, C. (2006). Bandit based Monte-Carlo planning. In European conference on machine learning (pp. 282\u2013293).","key":"10156_CR30","DOI":"10.1007\/11871842_29"},{"unstructured":"Krause, A., & Guestrin, C. (2005). A note on the budgeted maximization of submodular functions.","key":"10156_CR31"},{"key":"10156_CR32","first-page":"1650","volume":"7","author":"A Krause","year":"2007","unstructured":"Krause, A., & Guestrin, C. (2007). Near-optimal observation selection using submodular functions. Conference on Artificial Intelligence (AAAI) Nectar track, 7, 1650\u20131654.","journal-title":"Conference on Artificial Intelligence (AAAI) Nectar track"},{"doi-asserted-by":"crossref","unstructured":"Krause, A., Guestrin, C., Gupta, A., & Kleinberg, J. (2006). Near-optimal sensor placements: Maximizing information while minimizing communication cost. In Proceedings of the 5th international conference on Information processing in sensor networks (pp. 2\u201310).","key":"10156_CR33","DOI":"10.1109\/IPSN.2006.244031"},{"doi-asserted-by":"crossref","unstructured":"Lanillos, P., Besada-Portas, E., Pajares, G., & Ruz, J. J. (2012). Minimum time search for lost targets using cross entropy optimization. In IEEE\/RSJ international conference on intelligent robots and systems (pp. 602\u2013609).","key":"10156_CR34","DOI":"10.1109\/IROS.2012.6385510"},{"issue":"2","key":"10156_CR35","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., & Kernighan, B. W. (1973). An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498\u2013516.","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Lu, B. -X., & Tseng, K. -S. (2020). 3d map exploration via learning submodular functions in the Fourier domain. In International conference on unmanned aircraft systems (ICUAS) (pp. 1199\u20131205).","key":"10156_CR36","DOI":"10.1109\/ICUAS48674.2020.9213891"},{"key":"10156_CR37","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10846-021-01565-1","volume":"104","author":"B-X Lu","year":"2022","unstructured":"Lu, B.-X., & Tseng, K.-S. (2022). 3d map exploration using topological Fourier sparse set. Journal of Intelligent and Robotic Systems, 104, 75.","journal-title":"Journal of Intelligent and Robotic Systems"},{"key":"10156_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2020.103622","volume":"133","author":"M Luperto","year":"2020","unstructured":"Luperto, M., Antonazzi, M., Amigoni, F., & Borghese, N. A. (2020). Robot exploration of indoor environments using incomplete and inaccurate prior knowledge. Robotics and Autonomous Systems, 133, 103622.","journal-title":"Robotics and Autonomous Systems"},{"unstructured":"Moerland, T. M., Broekens, J., Plaat, A., & Jonker, C. M. (2020). The second type of uncertainty in Monte Carlo tree search. arXiv:2005.09645.","key":"10156_CR39"},{"issue":"1","key":"10156_CR40","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978). An analysis of approximations for maximizing submodular set functions\u2014I. Mathematical Programming, 14(1), 265\u2013294.","journal-title":"Mathematical Programming"},{"key":"10156_CR41","first-page":"2613","volume":"17","author":"C Qian","year":"2017","unstructured":"Qian, C., Shi, J.-C., Yu, Y., & Tang, K. (2017). On subset selection with general cost constraints. International Joint Conference on Artificial Intelligence, 17, 2613\u20132619.","journal-title":"International Joint Conference on Artificial Intelligence"},{"unstructured":"Qian, C., Yu, Y., & Zhou, Z.-H. (2015). Subset selection by pareto optimization. In Advances in neural information processing systems (pp. 1774\u20131782).","key":"10156_CR42"},{"issue":"01","key":"10156_CR43","doi-asserted-by":"publisher","first-page":"2354","DOI":"10.1609\/aaai.v33i01.33012354","volume":"33","author":"V Roostapour","year":"2019","unstructured":"Roostapour, V., Neumann, A., Neumann, F., & Friedrich, T. (2019). Pareto optimization for subset selection with dynamic cost constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 2354\u20132361.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"2","key":"10156_CR44","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1010091220143","volume":"1","author":"R Rubinstein","year":"1999","unstructured":"Rubinstein, R. (1999). The cross-entropy method for combinatorial and continuous optimization. Methodology and Computing in Applied Probability, 1(2), 127\u2013190.","journal-title":"Methodology and Computing in Applied Probability"},{"key":"10156_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.knosys.2011.08.008","volume":"34","author":"MP Schadd","year":"2012","unstructured":"Schadd, M. P., Winands, M. H., Tak, M. J., & Uiterwijk, J. W. (2012). Single-player Monte-Carlo tree search for SameGame. Knowledge-Based Systems, 34, 3\u201311.","journal-title":"Knowledge-Based Systems"},{"issue":"7587","key":"10156_CR46","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., Van Den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016). Mastering the game of go with deep neural networks and tree search. Nature, 529(7587), 484\u2013489.","journal-title":"Nature"},{"unstructured":"Singh, A., Krause, A., Guestrin, C., Kaiser, W. J., & Batalin, M. A. (2006). Efficient planning of informative paths for multiple robots. In International joint conference on artificial intelligence (IJCAI) (pp. 2204\u20132211).","key":"10156_CR47"},{"issue":"1","key":"10156_CR48","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M. (2004). A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1), 41\u201343.","journal-title":"Operations Research Letters"},{"issue":"4","key":"10156_CR49","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10514-021-09982-9","volume":"45","author":"K-S Tseng","year":"2021","unstructured":"Tseng, K.-S. (2021). Transfer learning of coverage functions via invariant properties in the Fourier domain. Autonomous Robots, 45(4), 519\u2013542.","journal-title":"Autonomous Robots"},{"issue":"1","key":"10156_CR50","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10514-015-9521-5","volume":"41","author":"K-S Tseng","year":"2017","unstructured":"Tseng, K.-S., & Mettler, B. (2017). Near-optimal probabilistic search via submodularity and sparse regression. Autonomous Robots, 41(1), 205\u2013229.","journal-title":"Autonomous Robots"},{"issue":"2","key":"10156_CR51","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10514-017-9616-2","volume":"42","author":"K-S Tseng","year":"2018","unstructured":"Tseng, K.-S., & Mettler, B. (2018). Near-optimal probabilistic search using spatial Fourier sparse set. Autonomous Robots, 42(2), 329\u2013351.","journal-title":"Autonomous Robots"},{"doi-asserted-by":"crossref","unstructured":"Umari, H., & Mukhopadhyay, S. (2017). Autonomous robotic exploration based on multiple rapidly-exploring randomized trees. In IEEE\/RSJ international conference on intelligent robots and systems (IROS) (pp. 1396\u20131402).","key":"10156_CR52","DOI":"10.1109\/IROS.2017.8202319"},{"key":"10156_CR53","first-page":"9520","volume":"32","author":"C Xiao","year":"2019","unstructured":"Xiao, C., Huang, R., Mei, J., Schuurmans, D., & M\u00fcller, M. (2019). Maximum entropy Monte-Carlo planning. Advances in Neural Information Processing Systems, 32, 9520\u20139528.","journal-title":"Advances in Neural Information Processing Systems"},{"doi-asserted-by":"crossref","unstructured":"Yamauchi, B. (1997). A frontier-based approach for autonomous exploration. In IEEE international symposium on computational intelligence in robotics and automation (CIRA) (pp. 146\u2013151).","key":"10156_CR54","DOI":"10.1109\/CIRA.1997.613851"},{"doi-asserted-by":"crossref","unstructured":"Yasutomi, F., Yamada, M., & Tsukamoto, K. (1988). Cleaning robot control. In Proceedings. IEEE international conference on robotics and automation (pp. 1839\u20131841).","key":"10156_CR55","DOI":"10.1109\/ROBOT.1988.12333"},{"issue":"1","key":"10156_CR56","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1609\/aaai.v30i1.10066","volume":"30","author":"H Zhang","year":"2016","unstructured":"Zhang, H., & Vorobeychik, Y. (2016). Submodular optimization with routing constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1), 819\u2013825.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"2","key":"10156_CR57","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1109\/LRA.2021.3051563","volume":"6","author":"B Zhou","year":"2021","unstructured":"Zhou, B., Zhang, Y., Chen, X., & Shen, S. (2021). Fuel: Fast UAV exploration using incremental frontier structure and hierarchical planning. IEEE Robotics and Automation Letters, 6(2), 779\u2013786.","journal-title":"IEEE Robotics and Automation Letters"}],"container-title":["Autonomous Robots"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-024-10156-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10514-024-10156-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10514-024-10156-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:05:39Z","timestamp":1710227139000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10514-024-10156-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,30]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["10156"],"URL":"https:\/\/doi.org\/10.1007\/s10514-024-10156-6","relation":{},"ISSN":["0929-5593","1573-7527"],"issn-type":[{"type":"print","value":"0929-5593"},{"type":"electronic","value":"1573-7527"}],"subject":[],"published":{"date-parts":[[2024,1,30]]},"assertion":[{"value":"24 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 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 research does not involve human participants, their data or biological material and it does not involve animals.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"3"}}