{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:51:41Z","timestamp":1743047501789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720681"},{"type":"electronic","value":"9783030720698"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72069-8_4","type":"book-chapter","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:02:55Z","timestamp":1627495375000},"page":"45-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rigorous Performance Analysis of Hyper-heuristics"],"prefix":"10.1007","author":[{"given":"Pietro S.","family":"Oliveto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"F.\u00a0Alanazi, P.K. Lehre, Runtime analysis of selection hyper-heuristics with classical learning mechanisms, in Proceedings of the IEEE Congress on Evolutionary Computation, CEC \u201814 (IEEE, 2014), pp. 2515\u20132523","DOI":"10.1109\/CEC.2014.6900602"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"S. B\u00f6ttcher, B. Doerr, F. Neumann, Optimal fixed and adaptive mutation rates for the leadingones problem, in Parallel Problem Solving from Nature, PPSN \u201810 (Springer, 2010), pp. 1\u201310","DOI":"10.1007\/978-3-642-15844-5_1"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TEVC.2015.2429314","volume":"20","author":"J Branke","year":"2016","unstructured":"J. Branke, S. Pickardt, M. Zhang, Automated design of production scheduling heuristics: a review. IEEE Trans. Evol. Comput. 20(1), 110\u2013124 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"4_CR4","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"E.K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, R. Qu, Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1162\/EVCO_a_00044","volume":"20","author":"EK Burke","year":"2012","unstructured":"E.K. Burke, M.R. Hyde, G. Kendall, J. Woodward, Automating the packing heuristic design process with genetic programming. Evol. Comput. 20(1), 63\u201389 (2012)","journal-title":"Evol. Comput."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"M.\u00a0Buzdalov, A.\u00a0Buzdalova, Can OneMax help optimizing LeadingOnes using the EA+RL method? in IEEE Congress on Evolutionary Computation, CEC \u201815 (IEEE, May 2015), pp. 1762\u20131768","DOI":"10.1109\/CEC.2015.7257100"},{"key":"4_CR7","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms (MIT Press, 2001)"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2017.2745715","volume":"22","author":"D Corus","year":"2018","unstructured":"D. Corus, P.S. Oliveto, Standard steady state genetic algorithms can hillclimb faster than mutation-only evolutionary algorithms. IEEE Trans. Evol. Comput. 22(5), 720\u2013732 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"D.\u00a0Corus, P.S. Oliveto, On the benefits of populations on the exploitation speed of standard steady-state genetic algorithms, in Proceedings of the 2019 Genetic and Evolutionary Computation Conference, GECCO \u201919 (ACM Press, 2019), pp. 1452\u20131460","DOI":"10.1145\/3321707.3321783"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"D.\u00a0Corus, P.S. Oliveto, D.\u00a0Yazdani, Fast artificial immune systems, in Proceedings of the international conference on parallel problem solving from nature, PPSN XV (2018), pp. 67\u201378","DOI":"10.1007\/978-3-319-99259-4_6"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.artint.2019.03.001","volume":"274","author":"D Corus","year":"2019","unstructured":"D. Corus, P.S. Oliveto, D. Yazdani, Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem. Artif. Intell. 274, 180\u2013196 (2019)","journal-title":"Artif. Intell."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2019.03.002","volume":"832","author":"D Corus","year":"2020","unstructured":"D. Corus, P.S. Oliveto, D. Yazdani, When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms. Theor. Comput. Sci. 832, 166\u2013185 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cowling, G.\u00a0Kendall, E.\u00a0Soubeiga, A hyperheuristic approach to scheduling a sales summit, in Practice and Theory of Automated Timetabling, PATAT \u201801 (Springer, 2001), pp. 176\u2013190","DOI":"10.1007\/3-540-44629-X_11"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"P.\u00a0Cowling, G.\u00a0Kendall, E.\u00a0Soubeiga, Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation, in Applications of Evolutionary Computing, EvoWorkshops \u201802 (Springer, 2002), pp. 1\u201310","DOI":"10.1007\/3-540-46004-7_1"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"D.-C. Dang, T.\u00a0Friedrich, T.\u00a0K\u00f6tzing, M.S. Krejca, P.K. Lehre, P.S. Oliveto, D.\u00a0Sudholt, A.M. Sutton, Escaping local optima with diversity mechanisms and crossover, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201916 (2016), pp. 645\u2013652","DOI":"10.1145\/2908812.2908956"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"D-C Dang","year":"2017","unstructured":"D.-C. Dang, T. Friedrich, T. K\u00f6tzing, M.S. Krejca, P.K. Lehre, P.S. Oliveto, D. Sudholt, A.M. Sutton, Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22, 484\u2013497 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"B.\u00a0Doerr, A tight runtime analysis for the cGA on jump functions: EDAs can cross fitness valleys at no extra cost, in Proceedings of the 2019 Genetic and Evolutionary Computation Conference, GECCO \u201919 (2019), pp. 1488\u20131496","DOI":"10.1145\/3321707.3321747"},{"key":"4_CR18","unstructured":"B.\u00a0Doerr, C.\u00a0Doerr, A tight runtime analysis of the (1+($$\\lambda $$, $$\\lambda $$)) genetic algorithm on OneMax, in Proceedings of the 2015 Genetic and Evolutionary Computation Conference, GECCO \u201915 (2015), pp. 1423\u20131430"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"B. Doerr, C. Doerr, Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices, in Theory of Evolutionary Computation - Recent Developments in Discrete Optimization, ed. by B. Doerr, F. Neumann (Springer, 2020), pp. 271\u2013321","DOI":"10.1007\/978-3-030-29414-4_6"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"B.\u00a0Doerr, C.\u00a0Doerr, J.\u00a0Yang, k-bit mutation with self-adjusting k outperforms standard bit mutation, in In Proceedings of the international conference on Parallel Problem Solving from Nature, PPSN \u201816 (Springer, 2016), pp. 824\u2013834","DOI":"10.1007\/978-3-319-45823-6_77"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"B.\u00a0Doerr, C.\u00a0Doerr, J.\u00a0Yang, Optimal parameter choices via precise black-box analysis, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201816 (ACM, 2016), pp. 1123\u20131130","DOI":"10.1145\/2908812.2908950"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"B.\u00a0Doerr, A.\u00a0Lissovoi, P.S. Oliveto, J.A. Warwicker, On the runtime analysis of selection hyper-heuristics with adaptive learning periods, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201918 (ACM, 2018), pp. 1015\u20131022","DOI":"10.1145\/3205455.3205611"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"B.\u00a0Doerr, D.\u00a0Sudholt, C.\u00a0Witt, When do evolutionary algorithms optimize separable functions in parallel? in Proceedings of the workshop on foundations of genetic algorithms, FOGA \u201913 (ACM, 2013), pp. 51\u201364","DOI":"10.1145\/2460239.2460245"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"C.\u00a0Doerr, M.\u00a0Wagner, Simple on-the-fly parameter selection mechanisms for two classical discrete black-box optimization benchmark problems, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201918 (ACM, 2018), pp. 943\u2013950","DOI":"10.1145\/3205455.3205560"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"J.H. Drake, E.\u00a0\u00d6zcan A.\u00a0Kheiri, E.K. Burke, Recent advances in selection hyper-heuristics (In press - Online). European Journal of Operational Research (2019)","DOI":"10.1016\/j.ejor.2019.07.073"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"S.\u00a0Droste, T.\u00a0Jansen, I.\u00a0Wegener, On the analysis of the (1+1) evolutionary algorithm, in Theoretical Computer Science (2002), pp. 51\u201381","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"O.\u00a0Giel, Evolutionary algorithms and the maximum matching problem, in Proceedings of 20th Annual Symposium on Theoretical Aspects of Computer Science, STACS \u201903 (2003), pp. 415\u2013426","DOI":"10.1007\/3-540-36494-3_37"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"G.T. Hall, P.S. Oliveto, D.\u00a0Sudholt, On the impact of the cutoff time on the performance of algorithm configurators, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201919 (ACM, 2019), pp. 907\u2013915","DOI":"10.1145\/3321707.3321879"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"G.T. Hall, P.S. Oliveto, D.\u00a0Sudholt, Analysis of the performance of algorithm configurators for search heuristics with global mutation operators, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u00a0\u201920) (ACM, 2020), pp. 823\u2013831","DOI":"10.1145\/3377930.3390218"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"G.T. Hall, P.S. Oliveto, D.\u00a0Sudholt, Fast perturbative algorithm configurators, in Parallel Problem Solving from Nature, PPSN \u201820 (2020). arXiv:2007.03336","DOI":"10.1007\/978-3-030-58112-1_2"},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"F. Hutter, H.H. Hoos, K. Leyton-Brown, ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"J.\u00a0J\u00e4gersk\u00fcpper, T.\u00a0Storch, When the plus strategy outperforms the comma strategy and when not, in Proceedings of the International Symposium on Foundations of Computational Intelligence, FOCI \u201907 (IEEE, 2007), pp. 25\u201332","DOI":"10.1109\/FOCI.2007.372143"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"R.\u00a0Kleinberg, K.\u00a0Leyton-Brown, B.\u00a0Lucier, Efficiency through procrastination: approximately optimal algorithm configuration with runtime guarantees, in Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI \u201917 (AAAI Press, 2017), pp. 2023\u20132031","DOI":"10.24963\/ijcai.2017\/281"},{"issue":"3","key":"4_CR34","first-page":"48","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"L. Kotthoff, Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"P.K. Lehre, E.\u00a0\u00d6zcan, A runtime analysis of simple hyper-heuristics: to mix or not to mix operators, in Proceedings of the Workshop on Foundations of Genetic Algorithms, FOGA \u201813 (ACM, 2013), pp. 97\u2013104","DOI":"10.1145\/2460239.2460249"},{"issue":"4","key":"4_CR36","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"P.K. Lehre, C. Witt, Black-box search by unbiased variation. Algorithmica 64(4), 623\u2013642 (2012)","journal-title":"Algorithmica"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lissovoi, P.S. Oliveto, J.A. Warwicker, On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation, in Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201917 (ACM, 2017), pp. 849\u2013856","DOI":"10.1145\/3071178.3071288"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lissovoi, P.S. Oliveto, J.A. Warwicker, On the time complexity of algorithm selection hyper-heuristics for multimodal optimisation, in Proceedings of the thirty-third international AAAI conference on artificial Intelligence, AAAI-19 (AAAI Press, 2019), pp. 2322\u20132329","DOI":"10.1609\/aaai.v33i01.33012322"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"A.\u00a0Lissovoi, P.S. Oliveto, J.A. Warwicker, How the duration of the learning period affects the performance of random gradient selection hyper-heuristics, in Proceedings of the thirty-fourth international AAAI conference on artificial Intelligence, AAAI-20 (AAAI Press, 2020), pp. 2376\u20132383","DOI":"10.1609\/aaai.v34i03.5617"},{"key":"4_CR40","doi-asserted-by":"crossref","unstructured":"A. Lissovoi, P.S. Oliveto, J.A. Warwicker, Simple hyper-heuristics can control the neighbourhood size of randomized local search optimally for leading ones. Evolutionary Computation 28(3), 437\u2013461 (2020)","DOI":"10.1162\/evco_a_00258"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez, J. Dubois-Lacoste, L. P\u00e9rez C\u00e1ceres, M. Birattari, T. St\u00fctzle, The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"4_CR42","unstructured":"I.\u00a0Maden, S.\u00a0Uyar, E.\u00a0\u00d6zcan, Landscape analysis of simple perturbative hyper-heuristics, in Proceedings of the 15th International Conference on Soft Computing, MENDEL 2009 (2009), pp. 16\u201322"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"N.\u00a0Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, E.\u00a0Teller, Equation of state calculations by fast computing machines, in Journal of Chemical Physics (1953), pp. 1087\u20131092","DOI":"10.1063\/1.1699114"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"A. Nareyek, Choosing search heuristics by non-stationary reinforcement learning, in Metaheuristics: Computer Decision-Making, ed. by M.G.C. Resende, J.P. de Sousa (Kluwer, 2003), pp. 523\u2013544","DOI":"10.1007\/978-1-4757-4137-7_25"},{"key":"4_CR45","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"F. Neumann, I. Wegener, Randomized local search, evolutionary algorithms and the minimum spanning tree problem. Theor. Comput. Sci. 378, 32\u201340 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR46","doi-asserted-by":"crossref","unstructured":"G.\u00a0Ochoa, M.\u00a0Hyde, T.\u00a0Curtois, J.A. Vazquez-Rodriguez, J.\u00a0Walker, M.\u00a0Gendreau, G.\u00a0Kendall, B.\u00a0McCollum, A.J. Parkes, S.\u00a0Petrovic, E.K. Burke, Hyflex: a benchmark framework for cross-domain heuristic search. European conference on evolutionary computation in combinatorial optimization, in Proceedings of the European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP \u201912 (2012), pp. 136\u2013147","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"4_CR47","doi-asserted-by":"crossref","unstructured":"G.\u00a0Ochoa, R.\u00a0Qu, E.K. Burke, Analyzing the landscape of a graph based hyper-heuristic for timetabling problems, in Proceedings of the 2009 Genetic and Evolutionary Computation Conference (GECCO \u201909) (2009), pp. 341\u2013348","DOI":"10.1145\/1569901.1569949"},{"key":"4_CR48","unstructured":"G.\u00a0Ochoa, J.A. Vazquez-Rodriguez, S.\u00a0Petrovic, E.K. Burke, Landscape analysis of simple perturbative hyper-heuristics, in Proceedings of the 2009 IEEE Congress on Evolutionary Computation, CEC \u201909 (2009), pp. 1873\u20131880"},{"key":"4_CR49","doi-asserted-by":"crossref","unstructured":"P.S. Oliveto, P.K. Lehre, F.\u00a0Neumann, Theoretical analysis of rank-based mutation - combining exploration and exploitation, in Proceedings of the 2009 IEEE Congress on Evolutionary Computation, CEC \u201909 (2009), pp. 1455\u20131462","DOI":"10.1109\/CEC.2009.4983114"},{"issue":"1","key":"4_CR50","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1057\/jors.2011.12","volume":"63","author":"N Pillay","year":"2012","unstructured":"N. Pillay, Evolving hyper-heuristics for the uncapacitated examination timetabling problem. J. Oper. Res. Soc. 63(1), 47\u201358 (2012)","journal-title":"J. Oper. Res. Soc."},{"key":"4_CR51","doi-asserted-by":"crossref","unstructured":"N. Pillay, R. Qu, Hyper-heuristics: theory and applications, Natural Computing Series (Springer Nature, 2018)","DOI":"10.1007\/978-3-319-96514-7"},{"key":"4_CR52","doi-asserted-by":"crossref","unstructured":"C.\u00a0Qian, K.\u00a0Tang, Z.\u00a0Zhou, Selection hyper-heuristics can provably be helpful in evolutionary multi-objective optimization, in Proceedings of Parallel Problem Solving from Nature, PPSN \u201916 (2016), pp. 835\u2013846","DOI":"10.1007\/978-3-319-45823-6_78"},{"issue":"3","key":"4_CR53","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.ejor.2017.01.042","volume":"260","author":"JA Soria-Alcaraz","year":"2017","unstructured":"J.A. Soria-Alcaraz, G. Ochoa, M.A. Sotelo-Figeroa, E.K. Burke, A methodology for determining an effective subset of heuristics in selection hyper-heuristics. Eur. J. Oper. Res. 260(3), 972\u2013983 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR54","doi-asserted-by":"crossref","unstructured":"T. St\u00fctzle, M. L\u00f3pez-Ib\u00e1\u00f1ez, Automated design of metaheuristic algorithms, Handbook of Metaheuristics, vol. 272, International Series in Operations Research & Management Science (Springer, 2019), pp. 541\u2013579","DOI":"10.1007\/978-3-319-91086-4_17"},{"key":"4_CR55","doi-asserted-by":"crossref","unstructured":"A.M.\u00a0Sutton, V.\u00a0Hasen\u00f6hrl. On the runtime dynamics of the compact genetic algorithm on jump functions, in Proceedings of the 2018 Genetic and Evolutionary Computation Conference, GECCO \u201918 (2018), pp. 967\u2013974","DOI":"10.1145\/3205455.3205608"},{"key":"4_CR56","unstructured":"G.\u00a0Weisz, A.\u00a0Gyorgy, C.\u00a0Szepesvari, LeapsAndBounds: a method for approximately optimal algorithm configuration, in International Conference on Machine Learning, ICML \u201918 (2018), pp. 5254\u20135262"},{"key":"4_CR57","unstructured":"G.\u00a0Weisz, A.\u00a0Gyorgy, C.\u00a0Szepesv\u00e1ri, CapsAndRuns: an improved method for approximately optimal algorithm configuration, in International Conference on Machine Learning, ICML \u201919 (2019), pp. 6707\u20136715"}],"container-title":["Natural Computing Series","Automated Design of Machine Learning and Search Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72069-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:04:02Z","timestamp":1627495442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72069-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720681","9783030720698"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72069-8_4","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}