{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T04:42:29Z","timestamp":1747370549411,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_22","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"308-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Self-adaptation via\u00a0Multi-objectivisation: An Empirical Study"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9720-3220","authenticated-orcid":false,"given":"Xiaoyu","family":"Qin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9521-1251","authenticated-orcid":false,"given":"Per Kristian","family":"Lehre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D Achlioptas","year":"2006","unstructured":"Achlioptas, D., Moore, C.: Random k-SAT: two moments suffice to cross a sharp threshold. SIAM J. Comput. 36(3), 740\u2013762 (2006)","journal-title":"SIAM J. Comput."},{"key":"22_CR2","unstructured":"Ans\u00f3tegui, C., Bacchus, F., J\u00e4rvisalo, M., Martins, R.: MaxSAT Evaluation 2017. SAT (2017)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Antipov, D., Doerr, B., Karavaev, V.: A Rigorous Runtime Analysis of the $$(1 + (\\lambda ,\\lambda ))$$ GA on Jump Functions. Algorithmica, January 2022","DOI":"10.1007\/s00453-021-00907-7"},{"key":"22_CR4","unstructured":"B\u00e4ck, T.: Self-adaptation in genetic algorithms. In: Self Adaptation in Genetic Algorithms, pp. 263\u2013271. MIT Press (1992)"},{"key":"22_CR5","unstructured":"Bartz-Beielstein, T., et al.: Benchmarking in Optimization: Best Practice and Open Issues. arXiv:2007.03488 [cs, math, stat], December 2020"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Buzdalov, M., Doerr, B.: Runtime analysis of the $$(1 + (\\lambda ,\\lambda ))$$ genetic algorithm on random satisfiable 3-CNF formulas. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1343\u20131350. ACM, Berlin Germany (Jul 2017)","DOI":"10.1145\/3071178.3071297"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Case, B., Lehre, P.K.: Self-adaptation in non-Elitist Evolutionary Algorithms on Discrete Problems with Unknown Structure. IEEE Trans. Evol. Comput., 1 (2020)","DOI":"10.1109\/TEVC.2020.2985450"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A.: The asymptotic k-SAT threshold. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 804\u2013813. ACM, New York, May 2014","DOI":"10.1145\/2591796.2591822"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Eremeev, A., Lehre, P.K.: Escaping local optima with non-elitist evolutionary algorithms. In: Proceedings of AAAI 2021. AAAI Press, Palo Alto, California USA (2020)","DOI":"10.1609\/aaai.v35i14.17457"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Eremeev, A., Lehre, P.K.: Non-elitist evolutionary algorithms excel in fitness landscapes with sparse deceptive regions and dense valleys. In: Proceedings of the Genetic and Evolutionary Computation Conference. ACM, Lille, France (2021)","DOI":"10.1145\/3449639.3459398"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Dang, D.C., Lehre, P.K.: Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII - FOGA 2015, pp. 62\u201368. ACM Press, Aberystwyth, United Kingdom (2015)","DOI":"10.1145\/2725494.2725508"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-3-319-45823-6_75","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"D-C Dang","year":"2016","unstructured":"Dang, D.-C., Lehre, P.K.: Self-adaptation of Mutation Rates in Non-elitist Populations. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 803\u2013813. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_75"},{"issue":"2","key":"22_CR13","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.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B.: Does Comma Selection Help to Cope with Local Optima? Algorithmica, January 2022","DOI":"10.1007\/s00453-021-00896-7"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2014.11.028","volume":"567","author":"B Doerr","year":"2015","unstructured":"Doerr, B., Doerr, C., Ebel, F.: From black-box complexity to designing new genetic algorithms. Theoret. Comput. Sci. 567, 87\u2013104 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 777\u2013784. ACM, Berlin Germany, July 2017","DOI":"10.1145\/3071178.3071301"},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1007\/s00453-020-00726-2","volume":"83","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Witt, C., Yang, J.: Runtime analysis for self-adaptive mutation rates. Algorithmica 83(4), 1012\u20131053 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00726-2","journal-title":"Algorithmica"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1007\/978-3-540-24854-5_107","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"S Droste","year":"2004","unstructured":"Droste, S.: Analysis of the (1 + 1) EA for a noisy OneMax. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3102, pp. 1088\u20131099. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24854-5_107"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Kotzing, T., Krejca, M.S., Sutton, A.M.: The compact genetic algorithm is efficient under extreme gaussian noise. IEEE Trans. Evol. Comput., 1 (2016)","DOI":"10.1109\/TEVC.2016.2613739"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Friedrich, T., K\u00f6tzing, T., Krejca, M.S., Sutton, A.M.: Robustness of ant colony optimization to noise. Evol. Comput. 24(2), 237\u2013254 (2016), publisher: MIT Press","DOI":"10.1162\/EVCO_a_00178"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s00453-015-0072-0","volume":"75","author":"C Gie\u00dfen","year":"2015","unstructured":"Gie\u00dfen, C., K\u00f6tzing, T.: Robustness of populations in stochastic environments. Algorithmica 75(3), 462\u2013489 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0072-0","journal-title":"Algorithmica"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Foundations of Genetic Algorithms, vol. 1, pp. 69\u201393. Elsevier (1991)","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J Gottlieb","year":"2002","unstructured":"Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary algorithms for the satisfiability problem. Evol. Comput. 10(1), 35\u201350 (2002)","journal-title":"Evol. Comput."},{"issue":"4","key":"22_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/4235.797971","volume":"3","author":"G Harik","year":"1999","unstructured":"Harik, G., Lobo, F., Goldberg, D.: The compact genetic algorithm. IEEE Trans. Evol. Comput. 3(4), 287\u2013297 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"22_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:NACO.0000023417.31393.c7","volume":"3","author":"J He","year":"2004","unstructured":"He, J., Yao, X.: A study of drift analysis for estimating computation time of evolutionary algorithms. Nat. Comput. 3(1), 21\u201335 (2004)","journal-title":"Nat. Comput."},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A., Sudholt, D.: Self-adjusting offspring population sizes outperform fixed parameters on the cliff function. In: Proceedings of the 16th ACM\/SIGEVO Conference on Foundations of Genetic Algorithms, pp. 1\u201315. ACM, Virtual Event Austria, September 2021","DOI":"10.1145\/3450218.3477306"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Hevia Fajardo, M.A.H., Sudholt, D.: Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1151\u20131159. ACM, Lille France, June 2021","DOI":"10.1145\/3449639.3459338"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Kauffman, S.A., Weinberger, E.D.: The NK model of rugged fitness landscapes and its application to maturation of the immune response. J. Theoretical Biol. 141(2), 211\u2013245 (1989)","DOI":"10.1016\/S0022-5193(89)80019-0"},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15844-5_25","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"PK Lehre","year":"2010","unstructured":"Lehre, P.K.: Negative drift in populations. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 244\u2013253. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_25"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Lehre, P.K.: Fitness-levels for non-elitist populations. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation - GECCO 2011, pp. 2075. ACM Press, Dublin, Ireland (2011)","DOI":"10.1145\/2001576.2001855"},{"issue":"10","key":"22_CR31","doi-asserted-by":"publisher","first-page":"3238","DOI":"10.1007\/s00453-021-00862-3","volume":"83","author":"PK Lehre","year":"2021","unstructured":"Lehre, P.K., Nguyen, P.T.H.: Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes. Algorithmica 83(10), 3238\u20133280 (2021). https:\/\/doi.org\/10.1007\/s00453-021-00862-3","journal-title":"Algorithmica"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Qin, X.: More precise runtime analyses of non-elitist EAs in uncertain environments. In: Proceedings of the Genetic and Evolutionary Computation Conference, p. 9. ACM, Lille, France (2021)","DOI":"10.1145\/3449639.3459312"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Lehre, P.K., Qin, X.: Self-adaptation to multi-objectivisation: a theoretical study. In: Proceedings of the Genetic and Evolutionary Computation Conference. ACM (2022)","DOI":"10.1145\/3512290.3528836"},{"issue":"2","key":"22_CR34","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2011.2112665","volume":"16","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Yao, X.: On the impact of mutation-selection balance on the runtime of evolutionary algorithms. IEEE Trans. Evol. Comput. 16(2), 225\u2013241 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver,. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"22_CR36","unstructured":"Meyer-Nieberg, S.: Self-adaptation in evolution strategies. Ph.D. thesis, Dortmund University of Technology (2007)"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-61723-X_982","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"H M\u00fchlenbein","year":"1996","unstructured":"M\u00fchlenbein, H., Paa\u00df, G.: From recombination of genes to the estimation of distributions I. Binary parameters. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 178\u2013187. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_982"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Chicano, F.: Local optima network analysis for MAX-SAT. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1430\u20131437. ACM, Prague Czech Republic, July 2019","DOI":"10.1145\/3319619.3326855"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Ochoa, G., Tomassini, M., V\u00e9rel, S., Darabos, C.: A study of NK landscapes\u2019 basins and local optima networks. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation - GECCO 2008, pp. 555. ACM Press, Atlanta, GA, USA (2008)","DOI":"10.1145\/1389095.1389204"},{"issue":"2","key":"22_CR40","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s00453-018-0488-4","volume":"81","author":"C Qian","year":"2019","unstructured":"Qian, C., Bian, C., Jiang, W., Tang, K.: Running time analysis of the (1+1)-EA for OneMax and LeadingOnes under bit-wise noise. Algorithmica 81(2), 749\u2013795 (2019)","journal-title":"Algorithmica"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Smith, J.E.: Self-adaptation in evolutionary algorithms for combinatorial optimisation. In: Adaptive and Multilevel Metaheuristics, pp. 31\u201357. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-79438-7_2"},{"issue":"3","key":"22_CR42","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"issue":"4","key":"22_CR43","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1007\/s00453-020-00671-0","volume":"83","author":"D Sudholt","year":"2020","unstructured":"Sudholt, D.: Analysing the robustness of evolutionary algorithms to noise: refined runtime bounds and an example where noise is beneficial. Algorithmica 83(4), 976\u20131011 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00671-0","journal-title":"Algorithmica"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Sudholt, D., Witt, C.: Update strength in EDAs and ACO: how to avoid genetic drift. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 61\u201368. ACM, Denver Colorado USA, July 2016","DOI":"10.1145\/2908812.2908867"},{"key":"22_CR45","doi-asserted-by":"crossref","unstructured":"Wilcoxon, F.: Individual comparisons by ranking methods. In: Breakthroughs in Statistics, pp. 196\u2013202. Springer, New York (1992)","DOI":"10.1007\/978-1-4612-4380-9_16"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:43:35Z","timestamp":1710261815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}