{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T16:42:09Z","timestamp":1759941729242,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581145"},{"type":"electronic","value":"9783030581152"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_49","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"699-713","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Benchmarking a $$(\\mu +\\lambda )$$ Genetic Algorithm with Configurable Crossover Probability"],"prefix":"10.1007","author":[{"given":"Furong","family":"Ye","sequence":"first","affiliation":[]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40273-9_1","volume-title":"Space-Efficient Data Structures, Streams, and Algorithms","author":"P Afshani","year":"2013","unstructured":"Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K.G., Mehlhorn, K.: The query complexity of finding a hidden permutation. In: Brodnik, A., L\u00f3pez-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 1\u201311. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40273-9_1"},{"key":"49_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press Inc, Oxford (1996)"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15844-5_1","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S B\u00f6ttcher","year":"2010","unstructured":"B\u00f6ttcher, S., Doerr, B., Neumann, F.: Optimal fixed and adaptive mutation rates for the leadingones problem. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 1\u201310. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_1"},{"key":"49_CR4","unstructured":"Buskulic, N., Doerr, C.: Maximizing drift is not optimal for solving OneMax. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 425\u2013426. ACM (2019). http:\/\/arxiv.org\/abs\/1904.07818"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-319-99259-4_3","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"EC Pinto","year":"2018","unstructured":"Pinto, E.C., Doerr, C.: A simple proof for the usefulness of crossover in black-box optimization. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 29\u201341. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_3"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1162\/EVCO_a_00130","volume":"23","author":"F Chicano","year":"2015","unstructured":"Chicano, F., Sutton, A.M., Whitley, L.D., Alba, E.: Fitness probability distribution of bit-flip mutation. Evol. Comput. 23(2), 217\u2013248 (2015)","journal-title":"Evol. Comput."},{"issue":"5","key":"49_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TEVC.2017.2745715","volume":"22","author":"D Corus","year":"2018","unstructured":"Corus, D., Oliveto, P.S.: 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":"49_CR8","doi-asserted-by":"publisher","unstructured":"Corus, D., Oliveto, P.S.: On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms. Algorithmica 1\u201331 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00743-1","DOI":"10.1007\/s00453-020-00743-1"},{"key":"49_CR9","unstructured":"Haziza, D., Rapin, J.: HiPlot - high dimensional interactive plotting (2020). https:\/\/github.com\/facebookresearch\/hiplot"},{"issue":"3","key":"49_CR10","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"DC Dang","year":"2017","unstructured":"Dang, D.C., et al.: Escaping local optima using crossover with emergent diversity. IEEE Trans. Evol. Comput. 22(3), 484\u2013497 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"49_CR11","unstructured":"De Jong, K.A.: An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Ann Arbor, MI, USA (1975)"},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2018.09.024","volume":"773","author":"B Doerr","year":"2019","unstructured":"Doerr, B.: Analyzing randomized search heuristics via stochastic domination. Theoret. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR13","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":"49_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2010.10.035","volume":"425","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theoret. Comput. Sci. 425, 17\u201333 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.10.059","volume":"471","author":"B Doerr","year":"2013","unstructured":"Doerr, B., Johannsen, D., K\u00f6tzing, T., Neumann, F., Theile, M.: More effective crossover operators for the all-pairs shortest path problem. Theoret. Comput. Sci. 471, 12\u201326 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2017), pp. 777\u2013784. ACM (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"49_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-35533-2_18","volume-title":"Artificial Evolution","author":"B Doerr","year":"2012","unstructured":"Doerr, B., Winzen, C.: Black-box complexity: breaking the O(n logn) barrier of leadingOnes. In: Hao, J.-K., Legrand, P., Collet, P., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2011. LNCS, vol. 7401, pp. 205\u2013216. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35533-2_18"},{"key":"49_CR18","unstructured":"Doerr, C., Wang, H., Ye, F., van Rijn, S., B\u00e4ck, T.: IOHprofiler: a benchmarking and profiling tool for iterative optimization heuristics. arXiv e-prints:1810.05281, October 2018. https:\/\/arxiv.org\/abs\/1810.05281"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"106027","DOI":"10.1016\/j.asoc.2019.106027","volume":"88","author":"C Doerr","year":"2019","unstructured":"Doerr, C., Ye, F., Horesh, N., Wang, H., Shir, O.M., B\u00e4ck, T.: Benchmarking discrete optimization heuristics with IOHprofiler. Appl. Soft Comput. 88, 106027 (2019)","journal-title":"Appl. Soft Comput."},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Doerr, C., Ye, F., van Rijn, S., Wang, H., B\u00e4ck, T.: Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1 + $$\\lambda $$) EA variants on onemax and leadingones. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2018), pp. 951\u2013958. ACM (2018)","DOI":"10.1145\/3205455.3205621"},{"issue":"12","key":"49_CR21","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.cor.2011.03.003","volume":"38","author":"SM Elsayed","year":"2011","unstructured":"Elsayed, S.M., Sarker, R.A., Essam, D.L.: Multi-operator based evolutionary algorithms for solving constrained optimization problems. Comput. Oper. Res. 38(12), 1877\u20131896 (2011)","journal-title":"Comput. Oper. Res."},{"key":"49_CR22","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co. Inc, Boston (1989)","edition":"1"},{"issue":"2","key":"49_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/4235.996022","volume":"6","author":"HS Yoon","year":"2002","unstructured":"Yoon, H.S., Moon, B.R.: An empirical study on the synergy of multiple crossover operators. IEEE Trans. Evol. Comput. 6(2), 212\u2013223 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"49_CR24","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13, 413\u2013440 (2005)","journal-title":"Evol. Comput."},{"key":"49_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-002-0940-2","volume":"34","author":"T Jansen","year":"2002","unstructured":"Jansen, T., Wegener, I.: The analysis of evolutionary algorithms\u2013a proof that crossover really can help. Algorithmica 34, 47\u201366 (2002). https:\/\/doi.org\/10.1007\/s00453-002-0940-2","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"49_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.dam.2004.02.019","volume":"149","author":"T Jansen","year":"2005","unstructured":"Jansen, T., Wegener, I.: Real royal road functions-where crossover provably is essential. Discrete Appl. Math. 149(1\u20133), 111\u2013125 (2005)","journal-title":"Discrete Appl. Math."},{"key":"49_CR27","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., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"49_CR28","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Sudholt, D., Theile, M.: How crossover helps in pseudo-Boolean optimization. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 989\u2013996. ACM (2011)","DOI":"10.1145\/2001576.2001711"},{"key":"49_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00453-012-9616-8","volume":"64","author":"PK Lehre","year":"2012","unstructured":"Lehre, P.K., Witt, C.: Black-box search by unbiased variation. Algorithmica 64, 623\u2013642 (2012). https:\/\/doi.org\/10.1007\/s00453-012-9616-8","journal-title":"Algorithmica"},{"issue":"9","key":"49_CR30","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1007\/s00500-010-0610-2","volume":"15","author":"PK Lehre","year":"2011","unstructured":"Lehre, P.K., Yao, X.: Crossover can be constructive when computing unique input-output sequences. Soft. Comput. 15(9), 1675\u20131687 (2011). https:\/\/doi.org\/10.1007\/s00500-010-0610-2","journal-title":"Soft. Comput."},{"key":"49_CR31","doi-asserted-by":"crossref","unstructured":"Mironovich, V., Buzdalov, M.: Evaluation of heavy-tailed mutation operator on maximum flow test generation problem. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2017), Companion Material, pp. 1423\u20131426. ACM (2017)","DOI":"10.1145\/3067695.3082507"},{"key":"49_CR32","unstructured":"Mitchell, M., Holland, J.H., Forrest, S.: When will a genetic algorithm outperform hill climbing? In: Proceedings of Neural Information Processing Systems Conference (NIPS 1993). Advances in Neural Information Processing Systems, vol. 6, pp. 51\u201358. Morgan Kaufmann (1993)"},{"key":"49_CR33","unstructured":"Murata, T., Ishibuchi, H.: Positive and negative combination effects of crossover and mutation operators in sequencing problems. In: Proceedings of Conference on Evolutionary Computation, pp. 170\u2013175, May 1996"},{"key":"49_CR34","doi-asserted-by":"crossref","unstructured":"Neumann, F., Oliveto, P.S., Rudolph, G., Sudholt, D.: On the effectiveness of crossover for migration in parallel evolutionary algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2011), pp. 1587\u20131594. ACM (2011)","DOI":"10.1145\/2001576.2001790"},{"key":"49_CR35","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: Proceedings of National Conference on Artificial Intelligence, pp. 440\u2013446. AAAI (1992)"},{"key":"49_CR36","first-page":"221","volume-title":"Foundations of Genetic Algorithms","author":"WM Spears","year":"1993","unstructured":"Spears, W.M.: Crossover or mutation? In: Banzhaf, W. (ed.) Foundations of Genetic Algorithms, vol. 2, pp. 221\u2013237. Elsevier, Amsterdam (1993)"},{"key":"49_CR37","doi-asserted-by":"crossref","unstructured":"Sudholt, D.: Crossover is provably essential for the Ising model on trees. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2005), pp. 1161\u20131167. ACM Press (2005)","DOI":"10.1145\/1068009.1068202"},{"key":"49_CR38","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1109\/TEVC.2012.2202241","volume":"17","author":"D Sudholt","year":"2013","unstructured":"Sudholt, D.: A new method for lower bounds on the running time of evolutionary algorithms. IEEE Trans. Evol. Comput. 17, 418\u2013435 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"49_CR39","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1162\/EVCO_a_00171","volume":"25","author":"D Sudholt","year":"2017","unstructured":"Sudholt, D.: How crossover speeds up building block assembly in genetic algorithms. Evol. Comput. 25(2), 237\u2013274 (2017)","journal-title":"Evol. Comput."},{"key":"49_CR40","doi-asserted-by":"crossref","unstructured":"Varadarajan, S., Whitley, D.: The massively parallel mixing genetic algorithm for the traveling salesman problem. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 872\u2013879. ACM (2019)","DOI":"10.1145\/3321707.3321772"},{"key":"49_CR41","doi-asserted-by":"crossref","unstructured":"Watson, R.A., Jansen, T.: A building-block royal road where crossover is provably essential. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 1452\u20131459. ACM (2007)","DOI":"10.1145\/1276958.1277224"},{"key":"49_CR42","doi-asserted-by":"crossref","unstructured":"Weise, T., Wu, Z.: Difficult features of combinatorial optimization problems and the tunable w-model benchmark problem for simulating them. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2018, Companion Material), pp. 1769\u20131776. ACM (2018)","DOI":"10.1145\/3205651.3208240"},{"key":"49_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-99259-4_5","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"D Whitley","year":"2018","unstructured":"Whitley, D., Varadarajan, S., Hirsch, R., Mukhopadhyay, A.: Exploration and exploitation without mutation: solving the Jump function in $$\\theta (n)$$ time. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 55\u201366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_5"},{"key":"49_CR44","unstructured":"Ye, F., Wang, H., Doerr, C., B\u00e4ck, T.: Experimental data sets for the study benchmarking a $$(\\mu +\\lambda )$$ genetic algorithm with configurable crossover probability, April 2020. https:\/\/doi.org\/10.5281\/zenodo.3753086"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T12:39:34Z","timestamp":1617107974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","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":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"37% - 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","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":"2.2","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)"}}]}}