{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T05:47:47Z","timestamp":1775713667500,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":22,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1944678"],"award-info":[{"award-number":["1944678"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    To address optimization of computationally expensive black-box functions, we build upon the Data-Driven Spatial Branch-and-Bound (DDSBB) algorithm, which utilizes underestimators of sampled data, branching and pruning to locate global optima. A key challenge of DDSBB is the potential invalidity of data-driven underestimators, especially in limited sampling scenarios. In this work, we propose new formulations that incorporate Lipschitz continuity information, estimated directly from sampled data, to enhance the validity of the underestimators and overall algorithm performance. The new approaches improve the fraction of successfully solved benchmark problems by 10% across a set of 325 problems to global optimality, compared to previous DDSBB literature. Although convergence to an\n                    <jats:italic>\u03b5<\/jats:italic>\n                    -optimal solution increases sampling requirements, the proposed methods consistently identify near-optimal regions with fewer function evaluations. We further compare the proposed methods against eight widely used gradient-free optimizers and provide a formal convergence analysis for the case of black-box Lipschitz continuous problems. These results advance data-driven global optimization methods for expensive black-box problems, which are frequently encountered in engineering and scientific applications.\n                  <\/jats:p>","DOI":"10.1007\/s10898-025-01572-8","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T02:45:06Z","timestamp":1774233906000},"page":"593-634","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions"],"prefix":"10.1007","volume":"94","author":[{"given":"Suryateja","family":"Ravutla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0584-1517","authenticated-orcid":false,"given":"Fani","family":"Boukouvala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"1572_CR1","doi-asserted-by":"publisher","first-page":"100930","DOI":"10.1016\/j.pecs.2021.100930","volume":"91","author":"F Alobaid","year":"2022","unstructured":"Alobaid, F., et al.: Progress in CFD simulations of fluidized beds for chemical and energy process engineering. Prog. Energy Combust. Sci. 91, 100930\u2013100930 (2022)","journal-title":"Prog. Energy Combust. Sci."},{"key":"1572_CR2","doi-asserted-by":"crossref","unstructured":"Ghasem, N., Computer methods in chemical engineering. 2021: CRC Press.","DOI":"10.1201\/9781003167365"},{"key":"1572_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.coche.2019.02.009","volume":"23","author":"M Haghighatlari","year":"2019","unstructured":"Haghighatlari, M., Hachmann, J.: Advances of machine learning in molecular modeling and simulation. Curr. Opin. Chem. Eng. 23, 51\u201357 (2019)","journal-title":"Curr. Opin. Chem. Eng."},{"key":"1572_CR4","doi-asserted-by":"publisher","first-page":"106881","DOI":"10.1016\/j.compchemeng.2020.106881","volume":"140","author":"OJ Fisher","year":"2020","unstructured":"Fisher, O.J., et al.: Considerations, challenges and opportunities when developing data-driven models for process manufacturing systems. Comput. Chem. Eng. 140, 106881\u2013106881 (2020)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1572_CR5","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1002\/cite.201800091","volume":"91","author":"K McBride","year":"2019","unstructured":"McBride, K., Sundmacher, K.: Overview of surrogate modeling in chemical process engineering. Chem. Ing. Tech. 91(3), 228\u2013239 (2019)","journal-title":"Chem. Ing. Tech."},{"issue":"3","key":"1572_CR6","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"1572_CR7","doi-asserted-by":"publisher","first-page":"117135","DOI":"10.1016\/j.ces.2021.117135","volume":"248","author":"D van de Berg","year":"2022","unstructured":"van de Berg, D., et al.: Data-driven optimization for process systems engineering applications. Chem. Eng. Sci. 248, 117135\u2013117135 (2022)","journal-title":"Chem. Eng. Sci."},{"key":"1572_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-022-09740-5","author":"J Zhai","year":"2022","unstructured":"Zhai, J., Boukouvala, F.: Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization. Optim. Eng. (2022). https:\/\/doi.org\/10.1007\/s11081-022-09740-5","journal-title":"Optim. Eng."},{"issue":"1","key":"1572_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10898-021-01045-8","volume":"82","author":"J Zhai","year":"2022","unstructured":"Zhai, J., Boukouvala, F.: Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization. J. Glob. Optim. 82(1), 21\u201350 (2022)","journal-title":"J. Glob. Optim."},{"key":"1572_CR10","doi-asserted-by":"crossref","unstructured":"Conn, A.R., K. Scheinberg, and L.N. Vicente, Introduction to derivative-free optimization. 2009: SIAM.","DOI":"10.1137\/1.9780898718768"},{"issue":"1","key":"1572_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"1572_CR12","doi-asserted-by":"crossref","unstructured":"Audet, C. and W. Hare, Derivative-free and blackbox optimization. 2017.","DOI":"10.1007\/978-3-319-68913-5"},{"key":"1572_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer. 28, 287\u2013404 (2019)","journal-title":"Acta Numer."},{"key":"1572_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10288-014-0275-2","volume":"12","author":"S Amaran","year":"2014","unstructured":"Amaran, S., et al.: Simulation optimization: a review of algorithms and applications. 4OR 12, 301\u2013333 (2014)","journal-title":"4OR"},{"key":"1572_CR15","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4, 65\u201385 (1994)","journal-title":"Stat. Comput."},{"issue":"4598","key":"1572_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"1572_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves, C.R.: Genetic algorithms for the operations researcher. INFORMS J. Comput. 9(3), 231\u2013250 (1997)","journal-title":"INFORMS J. Comput."},{"key":"1572_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1023\/A:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Glob. Optim. 14, 331\u2013355 (1999)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1572_CR19","first-page":"431","volume":"1","author":"DR Jones","year":"2009","unstructured":"Jones, D.R.: DIRECT global optimization algorithm. Encycl. Optim. 1(1), 431\u2013440 (2009)","journal-title":"Encycl. Optim."},{"key":"1572_CR20","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79, 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"1572_CR21","doi-asserted-by":"publisher","first-page":"106567","DOI":"10.1016\/j.compchemeng.2019.106567","volume":"130","author":"SS Garud","year":"2019","unstructured":"Garud, S.S., Mariappan, N., Karimi, I.A.: Surrogate-based black-box optimisation via domain exploration and smart placement. Comput. Chem. Eng. 130, 106567\u2013106567 (2019)","journal-title":"Comput. Chem. Eng."},{"key":"1572_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10898-020-00912-0","volume":"81","author":"J M\u00fcller","year":"2021","unstructured":"M\u00fcller, J., et al.: Surrogate optimization of deep neural networks for groundwater predictions. J. Glob. Optim. 81, 203\u2013231 (2021)","journal-title":"J. Glob. Optim."},{"key":"1572_CR23","doi-asserted-by":"publisher","first-page":"107343","DOI":"10.1016\/j.compchemeng.2021.107343","volume":"151","author":"A Thebelt","year":"2021","unstructured":"Thebelt, A., et al.: ENTMOOT: a framework for optimization over ensemble tree models. Comput. Chem. Eng. 151, 107343\u2013107343 (2021)","journal-title":"Comput. Chem. Eng."},{"key":"1572_CR24","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.compchemeng.2017.09.017","volume":"108","author":"A Bhosekar","year":"2018","unstructured":"Bhosekar, A., Ierapetritou, M.: Advances in surrogate based modeling, feasibility analysis, and optimization: a review. Comput. Chem. Eng. 108, 250\u2013267 (2018)","journal-title":"Comput. Chem. Eng."},{"key":"1572_CR25","doi-asserted-by":"publisher","first-page":"106847","DOI":"10.1016\/j.compchemeng.2020.106847","volume":"140","author":"SH Kim","year":"2020","unstructured":"Kim, S.H., Boukouvala, F.: Surrogate-based optimization for mixed-integer nonlinear problems. Comput. Chem. Eng. 140, 106847\u2013106847 (2020)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1572_CR26","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s11590-019-01428-7","volume":"14","author":"SH Kim","year":"2020","unstructured":"Kim, S.H., Boukouvala, F.: Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques. Optim. Lett. 14(4), 989\u20131010 (2020)","journal-title":"Optim. Lett."},{"key":"1572_CR27","doi-asserted-by":"publisher","first-page":"109407","DOI":"10.1016\/j.automatica.2020.109407","volume":"125","author":"Z Li","year":"2021","unstructured":"Li, Z., et al.: Surrogate-based distributed optimisation for expensive black-box functions. Automatica 125, 109407\u2013109407 (2021)","journal-title":"Automatica"},{"issue":"3","key":"1572_CR28","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s12532-021-00204-y","volume":"13","author":"AM Schweidtmann","year":"2021","unstructured":"Schweidtmann, A.M., et al.: Deterministic global optimization with Gaussian processes embedded. Math. Program. Comput. 13(3), 553\u2013581 (2021)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1572_CR29","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s10957-018-1396-0","volume":"180","author":"AM Schweidtmann","year":"2019","unstructured":"Schweidtmann, A.M., Mitsos, A.: Deterministic global optimization with artificial neural networks embedded. J. Optim. Theory Appl. 180(3), 925\u2013948 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"18","key":"1572_CR30","doi-asserted-by":"publisher","first-page":"9228","DOI":"10.1021\/acs.iecr.4c03303","volume":"64","author":"S Ravutla","year":"2025","unstructured":"Ravutla, S., et al.: Effects of surrogate hybridization and adaptive sampling for simulation-based optimization. Ind. Eng. Chem. Res. 64(18), 9228\u20139251 (2025)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"8","key":"1572_CR31","doi-asserted-by":"publisher","first-page":"e16601","DOI":"10.1002\/aic.16601","volume":"65","author":"J Zhai","year":"2019","unstructured":"Zhai, J., Boukouvala, F.: Nonlinear variable selection algorithms for surrogate modeling. AIChE J. 65(8), e16601\u2013e16601 (2019)","journal-title":"AIChE J."},{"key":"1572_CR32","unstructured":"Zhai, J., S. Ravutla, and F. Boukouvala, PyDDSBB - Python Package for Data-driven Spatial Branch-and-bound Algorithm. GitHub repository, 2022."},{"key":"1572_CR33","doi-asserted-by":"publisher","first-page":"109890","DOI":"10.1016\/j.automatica.2021.109890","volume":"133","author":"L Sabug Jr","year":"2021","unstructured":"Sabug, L., Jr., Ruiz, F., Fagiano, L.: SMGO: a set membership approach to data-driven global optimization. Automatica 133, 109890\u2013109890 (2021)","journal-title":"Automatica"},{"key":"1572_CR34","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00211-002-0419-8","volume":"94","author":"DE Kvasov","year":"2003","unstructured":"Kvasov, D.E., Pizzuti, C., Sergeyev, Y.D.: Local tuning and partition strategies for diagonal GO methods. Numer. Math. 94, 93\u2013106 (2003)","journal-title":"Numer. Math."},{"key":"1572_CR35","doi-asserted-by":"crossref","unstructured":"Sergeyev, Y.D. and D.E. Kvasov, Deterministic global optimization: An introduction to the diagonal approach. 2017: Springer.","DOI":"10.1007\/978-1-4939-7199-2"},{"issue":"3","key":"1572_CR36","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1137\/040621132","volume":"16","author":"YD Sergeyev","year":"2006","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16(3), 910\u2013937 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1572_CR37","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10898-015-0283-6","volume":"63","author":"H Liu","year":"2015","unstructured":"Liu, H., et al.: Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces. J. Glob. Optim. 63(2), 229\u2013251 (2015)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1572_CR38","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00939912","volume":"75","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Lu, S.-H.: On using estimates of Lipschitz constants in global optimization. J. Optim. Theory Appl. 75(1), 195\u2013200 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1572_CR39","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1057\/palgrave.jors.2600358","volume":"48","author":"JD Pinter","year":"1997","unstructured":"Pinter, J.D.: Global optimization in action\u2014continuous and lipschitz optimization: algorithms, implementations and applications. J. Oper. Res. Soc. 48(4), 449\u2013449 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"1572_CR40","unstructured":"Baran, I., Adaptive algorithms for problems involving black-box lipschitz functions. 2004."},{"key":"1572_CR41","unstructured":"Ravutla, S. and F. Boukouvala, Hybrid Modeling and Multi-Fidelity Approaches for Data-Driven Branch-and-Bound Optimization. Computer Aided Chemical Engineering, 2023."},{"key":"1572_CR42","unstructured":"Horst, R. and P.M. Pardalos, Handbook of global optimization. Vol. 2. 2013: Springer Science & Business Media."},{"key":"1572_CR43","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01580583","volume":"34","author":"RH Mladineo","year":"1986","unstructured":"Mladineo, R.H.: An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34, 188\u2013200 (1986)","journal-title":"Math. Program."},{"issue":"4","key":"1572_CR44","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0041-5553(72)90115-2","volume":"12","author":"SA Piyavskii","year":"1972","unstructured":"Piyavskii, S.A.: An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12(4), 57\u201367 (1972)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"1572_CR45","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10898-017-0531-z","volume":"69","author":"R Kannan","year":"2017","unstructured":"Kannan, R., Barton, P.I.: The cluster problem in constrained global optimization. J. Glob. Optim. 69(3), 629\u2013676 (2017)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1572_CR46","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1007\/s10898-017-0532-y","volume":"71","author":"R Kannan","year":"2018","unstructured":"Kannan, R., Barton, P.I.: Convergence-order analysis of branch-and-bound algorithms for constrained problems J. . Glob. Optim. 71(4), 753\u2013813 (2018)","journal-title":". Glob. Optim."},{"issue":"1","key":"1572_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-011-9685-2","volume":"52","author":"A Bompadre","year":"2012","unstructured":"Bompadre, A., Mitsos, A.: Convergence rate of McCormick relaxations. J. Glob. Optim. 52(1), 1\u201328 (2012)","journal-title":"J. Glob. Optim."},{"key":"1572_CR48","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10898-012-9998-9","volume":"57","author":"A Bompadre","year":"2013","unstructured":"Bompadre, A., Mitsos, A., Chachuat, B.: Convergence analysis of Taylor models and McCormick-Taylor models. J. Glob. Optim. 57, 75\u2013114 (2013)","journal-title":"J. Glob. Optim."},{"key":"1572_CR49","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-016-0408-6","volume":"66","author":"J Najman","year":"2016","unstructured":"Najman, J., Mitsos, A.: Convergence analysis of multivariate McCormick relaxations. J. Glob. Optim. 66, 597\u2013628 (2016)","journal-title":"J. Glob. Optim."},{"key":"1572_CR50","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF00121749","volume":"9","author":"CS Adjiman","year":"1996","unstructured":"Adjiman, C.S., Floudas, C.A.: Rigorous convex underestimators for general twice-differentiable problems J. . Glob. Optim. 9, 23\u201340 (1996)","journal-title":". Glob. Optim."},{"key":"1572_CR51","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10994-019-05833-y","volume":"109","author":"MO Ahmed","year":"2020","unstructured":"Ahmed, M.O., Vaswani, S., Schmidt, M.: Combining Bayesian optimization and Lipschitz optimization. Mach. Learn. 109, 79\u2013102 (2020)","journal-title":"Mach. Learn."},{"key":"1572_CR52","unstructured":"Boyd, S.P. and J. Mattingley. Branch and Bound Methods. 2003."},{"key":"1572_CR53","unstructured":"The Optimization, F., NLP and MINLP Test Problems."},{"key":"1572_CR54","unstructured":"Blanke, S. Gradient-Free-Optimizers: Simple and reliable optimization with local, global, population-based and sequential techniques in numerical search spaces. 2020; Available from: https:\/\/github.com\/SimonBlanke\/Gradient-Free-Optimizers."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01572-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01572-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01572-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T04:52:44Z","timestamp":1775710364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01572-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1572"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01572-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"1 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}