{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:18:35Z","timestamp":1771474715025,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00500-020-05030-3","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:03:31Z","timestamp":1591873411000},"page":"17715-17735","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Safe global optimization of expensive noisy black-box functions in the $$\\delta $$-Lipschitz framework"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1429-069X","authenticated-orcid":false,"given":"Yaroslav D.","family":"Sergeyev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1431-576X","authenticated-orcid":false,"given":"Antonio","family":"Candelieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5067-4383","authenticated-orcid":false,"given":"Dmitri E.","family":"Kvasov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0117-2237","authenticated-orcid":false,"given":"Riccardo","family":"Perego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"issue":"2","key":"5030_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01876141","volume":"1","author":"F Archetti","year":"1984","unstructured":"Archetti F, Schoen F (1984) A survey on the global optimization problem: general theory and computational approaches. Ann Oper Res 1(2):87\u2013110","journal-title":"Ann Oper Res"},{"issue":"1","key":"5030_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-016-0411-y","volume":"66","author":"KA Barkalov","year":"2016","unstructured":"Barkalov KA, Gergel VP (2016) Parallel global optimization on GPU. J Glob Optim 66(1):3\u201320","journal-title":"J Glob Optim"},{"issue":"1","key":"5030_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10898-017-0555-4","volume":"71","author":"KA Barkalov","year":"2018","unstructured":"Barkalov KA, Strongin RG (2018) Solving a set of global optimization problems by the parallel technique with uniform convergence. J Glob Optim 71(1):21\u201336","journal-title":"J Glob Optim"},{"key":"5030_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"key":"5030_CR5","doi-asserted-by":"publisher","unstructured":"Berkenkamp F, Schoellig AP, Krause A (2016) Safe controller optimization for quadrotors with Gaussian processes. In: 2016 IEEE International Conference on Robotics and Automation (ICRA). IEEE, pp 491\u2013496. https:\/\/doi.org\/10.1109\/icra.2016.7487170","DOI":"10.1109\/icra.2016.7487170"},{"issue":"2","key":"5030_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1004699313526","volume":"106","author":"JM Calvin","year":"2000","unstructured":"Calvin JM, \u017dilinskas A (2000) One-dimensional P-algorithm with convergence rate $$\\cal{O}(n-3+\\delta )$$ for smooth functions. J Optim Theory Appl 106(2):297\u2013307","journal-title":"J Optim Theory Appl"},{"issue":"1\u20132","key":"5030_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.camwa.2004.12.014","volume":"50","author":"JM Calvin","year":"2005","unstructured":"Calvin JM, \u017dilinskas A (2005) One-dimensional global optimization for observations with noise. Comput Math Appl 50(1\u20132):157\u2013169","journal-title":"Comput Math Appl"},{"issue":"2","key":"5030_CR8","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/s10957-012-0060-3","volume":"155","author":"JM Calvin","year":"2012","unstructured":"Calvin JM, Chen Y, \u017dilinskas A (2012) An adaptive univariate global optimization algorithm and its convergence rate for twice continuously differentiable functions. J Optim Theory Appl 155(2):628\u2013636","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"5030_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827599357590","volume":"24","author":"L Casado","year":"2003","unstructured":"Casado L, Garc\u00eda I, Sergeyev YD (2003) Interval algorithms for finding the minimal root in a set of multiextremal one-dimensional nondifferentiable functions. SIAM J Sci Comput 24(2):359\u2013376","journal-title":"SIAM J Sci Comput"},{"key":"5030_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00853-3","author":"R Cavoretto","year":"2019","unstructured":"Cavoretto R, De Rossi A, Mukhametzhanov MS, Sergeyev YD (2019) On the search of the shape parameter in radial basis functions using univariate global optimization methods. J Glob Optim. https:\/\/doi.org\/10.1007\/s10898-019-00853-3","journal-title":"J Glob Optim"},{"issue":"1","key":"5030_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0263-2241(96)00059-0","volume":"19","author":"P Daponte","year":"1996","unstructured":"Daponte P, Grimaldi D, Molinaro A, Sergeyev YD (1996) Fast detection of the first zero-crossing in a measurement signal set. Measurement 19(1):29\u201339","journal-title":"Measurement"},{"key":"5030_CR12","doi-asserted-by":"publisher","unstructured":"Fiducioso M, Curi S, Schumacher B, Gwerder M, Krause A (2019) Safe contextual Bayesian optimization for sustainable room temperature PID control tuning. In: Proceedings of the twenty-eighth international joint conference on artificial intelligence. IJCAI, pp 5850\u20135856. https:\/\/doi.org\/10.24963\/ijcai.2019\/811","DOI":"10.24963\/ijcai.2019\/811"},{"key":"5030_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-3437-8","volume-title":"State of the art in global optimization","author":"CA Floudas","year":"1996","unstructured":"Floudas CA, Pardalos PM (1996) State of the art in global optimization. Kluwer Academic Publishers, Dordrecht"},{"key":"5030_CR14","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1613\/jair.3761","volume":"45","author":"J Garc\u00eda","year":"2012","unstructured":"Garc\u00eda J, Fern\u00e1ndez F (2012) Safe exploration of state and action spaces in reinforcement learning. J Artif Intell Res 45:515\u2013564","journal-title":"J Artif Intell Res"},{"key":"#cr-split#-5030_CR15.1","doi-asserted-by":"crossref","unstructured":"Gergel VP, Sidorov SV (2015) A two-level parallel global search algorithm for solution of computationally intensive multiextremal optimization problems. In: Malyshkin V","DOI":"10.1007\/978-3-319-21909-7_49"},{"key":"#cr-split#-5030_CR15.2","unstructured":"(ed) Parallel computing technologies (PaCT 2015), LNCS, vol 9251. Springer, Cham, pp 505-515"},{"key":"5030_CR16","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.procs.2015.05.216","volume":"51","author":"VP Gergel","year":"2015","unstructured":"Gergel VP, Grishagin VA, Israfilov RA (2015) Local tuning in nested scheme of global optimization. Procedia Comput Sci 51:865\u2013874","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"5030_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.4310\/SII.2017.v10.n1.a6","volume":"10","author":"JW Gillard","year":"2016","unstructured":"Gillard JW, Kvasov DE (2016) Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations. Stat Interface 10(1):59\u201370","journal-title":"Stat Interface"},{"key":"5030_CR18","first-page":"270","volume":"318","author":"VA Grishagin","year":"2018","unstructured":"Grishagin VA, Israfilov RA, Sergeyev YD (2018) Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes. Appl Math Comput 318:270\u2013280","journal-title":"Appl Math Comput"},{"issue":"1\u20133","key":"5030_CR19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF01581203","volume":"55","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B, Lu SH (1992) Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. Math Program 55(1\u20133):273\u2013292","journal-title":"Math Program"},{"key":"5030_CR20","volume-title":"Handbook of global optimization","year":"1995","unstructured":"Horst R, Pardalos PM (eds) (1995) Handbook of global optimization, vol 1. Kluwer Academic Publishers, Dordrecht"},{"issue":"4","key":"5030_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black-box functions. J Glob Optim 13(4):455\u2013492","journal-title":"J Glob Optim"},{"key":"5030_CR22","first-page":"245","volume":"318","author":"DE Kvasov","year":"2018","unstructured":"Kvasov DE, Mukhametzhanov MS (2018) Metaheuristic vs. deterministic global optimization algorithms: the univariate case. Appl Math Comput 318:245\u2013259","journal-title":"Appl Math Comput"},{"issue":"1","key":"5030_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.3934\/naco.2012.2.69","volume":"2","author":"DE Kvasov","year":"2012","unstructured":"Kvasov DE, Sergeyev YD (2012) Univariate geometric Lipschitz global optimization algorithms. Numer Algebra Control Optim 2(1):69\u201390","journal-title":"Numer Algebra Control Optim"},{"issue":"9","key":"5030_CR24","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1134\/S0005117913090014","volume":"74","author":"DE Kvasov","year":"2013","unstructured":"Kvasov DE, Sergeyev YD (2013) Lipschitz global optimization methods in control problems. Autom Remote Control 74(9):1435\u20131448","journal-title":"Autom Remote Control"},{"key":"5030_CR25","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.advengsoft.2014.09.014","volume":"80","author":"DE Kvasov","year":"2015","unstructured":"Kvasov DE, Sergeyev YD (2015) Deterministic approaches for solving practical black-box global optimization problems. Adv Eng Softw 80:58\u201366","journal-title":"Adv Eng Softw"},{"key":"5030_CR26","doi-asserted-by":"crossref","unstructured":"Kvasov DE, Mukhametzhanov MS, Nasso MC, Sergeyev YD (2020) On acceleration of derivative-free univariate Lipschitz global optimization methods. In: Sergeyev Y., Kvasov D. (eds) Numerical computations: theory and algorithms. NUMTA 2019. Lecture notes in computer science, vol 11974. Springer, Cham, pp 413\u2013421","DOI":"10.1007\/978-3-030-40616-5_38"},{"key":"5030_CR27","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.apnum.2009.10.004","volume":"60","author":"D Lera","year":"2010","unstructured":"Lera D, Sergeyev YD (2010) Lipschitz and H\u00f6lder global optimization using space-filling curves. Appl Numer Math 60:115\u2013129","journal-title":"Appl Numer Math"},{"issue":"1","key":"5030_CR28","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1137\/110859129","volume":"23","author":"D Lera","year":"2013","unstructured":"Lera D, Sergeyev YD (2013) Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives. SIAM J Optim 23(1):508\u2013529","journal-title":"SIAM J Optim"},{"issue":"3","key":"5030_CR29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0263-2241(01)00002-1","volume":"30","author":"A Molinaro","year":"2001","unstructured":"Molinaro A, Sergeyev YD (2001a) An efficient algorithm for the zero-crossing detection in digitized measurement signal. Measurement 30(3):187\u2013196","journal-title":"Measurement"},{"issue":"1\u20134","key":"5030_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1014063303984","volume":"28","author":"A Molinaro","year":"2001","unstructured":"Molinaro A, Sergeyev YD (2001b) Finding the minimal root of an equation with the multiextremal and nondifferentiable left-hand part. Numer Algorithms 28(1\u20134):255\u2013272","journal-title":"Numer Algorithms"},{"issue":"2\u20133","key":"5030_CR31","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10898-014-0180-4","volume":"59","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius R, Sergeyev YD, Kvasov DE, \u017dilinskas J (2014) Globally-biased DISIMPL algorithm for expensive global optimization. J Glob Optim 59(2\u20133):545\u2013567","journal-title":"J Glob Optim"},{"key":"5030_CR32","doi-asserted-by":"crossref","first-page":"113052","DOI":"10.1016\/j.eswa.2019.113052","volume":"144","author":"R Paulavi\u010dius","year":"2020","unstructured":"Paulavi\u010dius R, Sergeyev YD, Kvasov DE, \u017dilinskas J (2020) Globally-biased BIRECT algorithm with local accelerators for expensive global optimization. Expert Syst Appl 144:113052","journal-title":"Expert Syst Appl"},{"key":"5030_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2502-5","volume-title":"Global optimization in action (continuous and Lipschitz optimization: algorithms, implementations and applications)","author":"JD Pint\u00e9r","year":"1996","unstructured":"Pint\u00e9r JD (1996) Global optimization in action (continuous and Lipschitz optimization: algorithms, implementations and applications). Kluwer Academic Publishers, Dordrecht"},{"issue":"4","key":"5030_CR34","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0041-5553(72)90115-2","volume":"12","author":"SA Piyavskij","year":"1972","unstructured":"Piyavskij SA (1972) An algorithm for finding the absolute extremum of a function. USSR Comput Math Math Phys 12(4):57\u201367 (In Russian: Zh. Vychisl. Mat. Mat. Fiz., 12(4) (1972), pp 888\u2013896)","journal-title":"USSR Comput Math Math Phys"},{"issue":"1","key":"5030_CR35","doi-asserted-by":"crossref","first-page":"5967","DOI":"10.1016\/j.ifacol.2017.08.1258","volume":"50","author":"M Schillinger","year":"2017","unstructured":"Schillinger M, Hartmann B, Skalecki P, Meister M, Nguyen-Tuong D, Nelles O (2017) Safe active learning and safe Bayesian optimization for tuning a PI-controller. IFAC-PapersOnLine 50(1):5967\u20135972 20th IFAC World Congress","journal-title":"IFAC-PapersOnLine"},{"issue":"5","key":"5030_CR36","first-page":"553","volume":"35","author":"YD Sergeyev","year":"1995","unstructured":"Sergeyev YD (1995) A one-dimensional deterministic global minimization algorithm. Comput Math Math Phys 35(5):553\u2013562","journal-title":"Comput Math Math Phys"},{"issue":"2","key":"5030_CR37","first-page":"123","volume":"3","author":"YD Sergeyev","year":"2001","unstructured":"Sergeyev YD, Grishagin VA (2001) Parallel asynchronous global search and the nested optimization scheme. J Comput Anal Appl 3(2):123\u2013145","journal-title":"J Comput Anal Appl"},{"key":"5030_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-7199-2","volume-title":"Deterministic global optimization: an introduction to the diagonal approach","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev YD, Kvasov DE (2017) Deterministic global optimization: an introduction to the diagonal approach. Springer, New York"},{"issue":"1","key":"5030_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623496312393","volume":"10","author":"YD Sergeyev","year":"1999","unstructured":"Sergeyev YD, Daponte P, Grimaldi D, Molinaro A (1999) Two methods for solving optimization problems arising in electronic measurements and electrical engineering. SIAM J Optim 10(1):1\u201321","journal-title":"SIAM J Optim"},{"issue":"3","key":"5030_CR40","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1023\/A:1012391611462","volume":"21","author":"YD Sergeyev","year":"2001","unstructured":"Sergeyev YD, Famularo D, Pugliese P (2001) Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. J Glob Optim 21(3):317\u2013341","journal-title":"J Glob Optim"},{"key":"5030_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-8042-6","volume-title":"Introduction to global optimization exploiting space-filling curves","author":"YD Sergeyev","year":"2013","unstructured":"Sergeyev YD, Strongin RG, Lera D (2013) Introduction to global optimization exploiting space-filling curves. Springer, New York"},{"issue":"1","key":"5030_CR42","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/s10957-016-0947-5","volume":"171","author":"YD Sergeyev","year":"2016","unstructured":"Sergeyev YD, Mukhametzhanov MS, Kvasov DE, Lera D (2016) Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization. J Optim Theory Appl 171(1):186\u2013208","journal-title":"J Optim Theory Appl"},{"key":"5030_CR43","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.matcom.2016.05.006","volume":"141","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2017) Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms. Math Comput Simul 141:96\u2013109","journal-title":"Math Comput Simul"},{"key":"5030_CR44","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.cnsns.2017.11.013","volume":"59","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2018a) On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales. Commun Nonlinear Sci Numer Simul 59:319\u2013330","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"5030_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-017-18940-4","volume":"8","author":"YD Sergeyev","year":"2018","unstructured":"Sergeyev YD, Kvasov DE, Mukhametzhanov MS (2018b) On the efficiency of nature-inspired metaheuristics in expensive global optimization with limited budget. Sci Rep 8:1\u20139","journal-title":"Sci Rep"},{"key":"5030_CR46","doi-asserted-by":"crossref","unstructured":"Sergeyev YD, Nasso MC, Mukhametzhanov MS, Kvasov DE (2020) Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives. J Comput Appl Math (submitted)","DOI":"10.1016\/j.cam.2020.113134"},{"key":"5030_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4677-1","volume-title":"Global optimization with non-convex constraints: sequential and parallel algorithms","author":"RG Strongin","year":"2000","unstructured":"Strongin RG, Sergeyev YD (2000) Global optimization with non-convex constraints: sequential and parallel algorithms. Kluwer Academic Publishers, Dordrecht"},{"key":"5030_CR48","unstructured":"Sui Y, Gotovos A, Burdick JW, Krause A (2015) Safe exploration for optimization with Gaussian processes. In: Bach F, Blei D (eds) Proceedings of the 32nd international conference on machine learning, PMLR, vol\u00a037. Lille, France, pp 997\u20131005"},{"issue":"2","key":"5030_CR49","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1023\/A:1008395413111","volume":"14","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei RJ (1999) Extension of Piyavskii\u2019s algorithm to continuous global optimization. J Glob Optim 14(2):205\u2013216","journal-title":"J Glob Optim"},{"issue":"2","key":"5030_CR50","doi-asserted-by":"crossref","first-page":"229","DOI":"10.15388\/Informatica.2016.83","volume":"27","author":"A \u017dilinskas","year":"2016","unstructured":"\u017dilinskas A, Zhigljavsky A (2016) Stochastic global optimization: a review on the occasion of 25 years of Informatica. Informatica 27(2):229\u2013256","journal-title":"Informatica"},{"issue":"1","key":"5030_CR51","doi-asserted-by":"crossref","first-page":"149","DOI":"10.15388\/Informatica.2010.279","volume":"21","author":"A \u017dilinskas","year":"2010","unstructured":"\u017dilinskas A, \u017dilinskas J (2010) Interval arithmetic based optimization in nonlinear regression. Informatica 21(1):149\u2013158","journal-title":"Informatica"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05030-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05030-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05030-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:01:15Z","timestamp":1623369675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05030-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":52,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["5030"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05030-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"11 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}