{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:15:12Z","timestamp":1742933712270,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"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_34","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T22:02:51Z","timestamp":1598997771000},"page":"485-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hybridizing the 1\/5-th Success Rule with Q-Learning for Controlling the Mutation Rate of an Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Arina","family":"Buzdalova","sequence":"first","affiliation":[]},{"given":"Carola","family":"Doerr","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Rodionova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aleti, A., Moser, I.: Entropy-based adaptive range parameter control for evolutionary algorithms. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 1501\u20131508 (2013)","DOI":"10.1145\/2463372.2463560"},{"key":"34_CR2","unstructured":"B\u00e4ck, T.: The interaction of mutation rate, selection, and self-adaptation within a genetic algorithm. In: Proceedings of Parallel Problem Solving from Nature (PPSN 1992), pp. 87\u201396. Elsevier (1992)"},{"key":"34_CR3","unstructured":"Bartz-Beielstein, T., Flasch, O., Koch, P., Konen, W.: SPOT: a toolbox for interactive and automatic tuning in the R environment. In: Proceedings of the 20th Workshop on Computational Intelligence, pp. 264\u2013273. Universit\u00e4tsverlag Karlsruhe (2010)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Belkhir, N., Dr\u00e9o, J., Sav\u00e9ant, P., Schoenauer, M.: Per instance algorithm configuration of CMA-ES with limited budget. In: Proceedings of Genetic and Evolutionary Conference (GECCO 2017), pp. 681\u2013688. ACM (2017)","DOI":"10.1145\/3071178.3071343"},{"key":"34_CR5","unstructured":"Buzdalova, A., Doerr, C., Rodionova, A.: Hybridizing the 1\/5-th success rule with Q-learning for controlling the mutation rate of an evolutionary algorithm (2020). http:\/\/arxiv.org\/abs\/2006.11026"},{"key":"34_CR6","unstructured":"Carvalho Pinto, E., Doerr, C.: Towards a more practice-aware runtime analysis of evolutionary algorithms (2018). https:\/\/arxiv.org\/abs\/1812.00493"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Costa, L.D., Fialho, \u00c1., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 913\u2013920. ACM (2008)","DOI":"10.1145\/1389095.1389272"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garcia, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"34_CR9","unstructured":"Devroye, L.: The compound random search. Ph.D. dissertation, Purdue University, West Lafayette, IN (1972)"},{"key":"34_CR10","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-29414-4_6","volume-title":"Theory of Evolutionary Computation","author":"B Doerr","year":"2020","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. Theory of Evolutionary Computation. NCS, pp. 271\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_6 . Also available online at https:\/\/arxiv.org\/abs\/1804.05650"},{"key":"34_CR11","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. Theor. Comput. Sci. 773, 115\u2013137 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Lengler, J.: Self-adjusting mutation rates with provably optimal success rules. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2019). ACM (2019)","DOI":"10.1145\/3321707.3321733"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1007\/978-3-319-45823-6_77","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"B Doerr","year":"2016","unstructured":"Doerr, B., Doerr, C., Yang, J.: k-bit mutation with self-adjusting k outperforms standard bit mutation. 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. 824\u2013834. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_77"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Yang, J.: Optimal parameter choices via precise black-box analysis. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2016), pp. 1123\u20131130. ACM (2016)","DOI":"10.1145\/2908812.2908950"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00453-018-0502-x","volume":"81","author":"B Doerr","year":"2019","unstructured":"Doerr, B., Gie\u00dfen, C., Witt, C., Yang, J.: The $$(1+\\lambda )$$ evolutionary algorithm with self-adjusting mutation rate. Algorithmica 81, 593\u2013631 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0502-x","journal-title":"Algorithmica"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, C., Wagner, M.: On the effectiveness of simple success-based parameter selection mechanisms for two classical discrete black-box optimization benchmark problems. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2018), pp. 943\u2013950. ACM (2018)","DOI":"10.1145\/3205455.3205560"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"106027","DOI":"10.1016\/j.asoc.2019.106027","volume":"88","author":"C Doerr","year":"2020","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 (2020)","journal-title":"Appl. Soft Comput."},{"key":"34_CR18","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"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(01)00182-7","volume":"276","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276, 51\u201381 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., Horvath, M., Kowalczyk, W., Schut, M.C.: Reinforcement learning for online control of evolutionary algorithms. In: Proceedings of the 4th International Conference on Engineering Self-Organising Systems, pp. 151\u2013160 (2006)","DOI":"10.1007\/978-3-540-69868-5_10"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"34_CR22","unstructured":"Falkner, S., Klein, A., Hutter, F.: BOHB: robust and efficient hyperparameter optimization at scale. In: Proceedings of International Conference on Machine Learning (ICML 2018), pp. 1436\u20131445 (2018)"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","volume":"60","author":"\u00c1 Fialho","year":"2010","unstructured":"Fialho, \u00c1., Costa, L.D., Schoenauer, M., Sebag, M.: Analyzing bandit-based adaptive operator selection mechanisms. Ann. Math. Artif. Intell. 60, 25\u201364 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"34_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Karafotias, G., Eiben, \u00c1.E., Hoogendoorn, M.: Generic parameter control with reinforcement learning. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2014), pp. 1319\u20131326 (2014)","DOI":"10.1145\/2576768.2598360"},{"key":"34_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-319-16549-3_54","volume-title":"Applications of Evolutionary Computation","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.E.: Evaluating reward definitions for parameter control. In: Mora, A.M., Squillero, G. (eds.) EvoApplications 2015. LNCS, vol. 9028, pp. 667\u2013680. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16549-3_54"},{"key":"34_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2015","unstructured":"Karafotias, G., Hoogendoorn, M., Eiben, A.: Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans. Evol. Comput. 19, 167\u2013187 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"34_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/B:NACO.0000023416.59689.4e","volume":"3","author":"S Kern","year":"2004","unstructured":"Kern, S., M\u00fcller, S.D., Hansen, N., B\u00fcche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms - a comparative review. Nat. Comput. 3, 77\u2013112 (2004)","journal-title":"Nat. Comput."},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"L\u00e4ssig, J., Sudholt, D.: Adaptive population models for offspring populations and parallel evolutionary algorithms. In: Proceedings of Foundations of Genetic Algorithms (FOGA 2011), pp. 181\u2013192. ACM (2011)","DOI":"10.1145\/1967654.1967671"},{"key":"34_CR30","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: a novel bandit-based approach to hyperparameter optimization. arXiv preprint arXiv:1603.06560 (2016)"},{"key":"34_CR31","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter Setting in Evolutionary Algorithms","year":"2007","unstructured":"Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol. 54. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69432-8"},{"key":"34_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., St\u00fctzle, T., Birattari, M.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"34_CR33","doi-asserted-by":"crossref","unstructured":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., Rudolph, G.: Exploratory landscape analysis. In: Proceedings of Genetic and Evolutionary Conference (GECCO 2011), pp. 829\u2013836. ACM (2011)","DOI":"10.1145\/2001576.2001690"},{"key":"34_CR34","doi-asserted-by":"crossref","unstructured":"M\u00fcller, S.D., Schraudolph, N.N., Koumoutsakos, P.D.: Step size adaptation in evolution strategies using reinforcement learning. In: Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), pp. 151\u2013156 (2002)","DOI":"10.1109\/CEC.2002.1006225"},{"key":"34_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-99259-4_22","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XV","author":"Y Pushak","year":"2018","unstructured":"Pushak, Y., Hoos, H.: Algorithm configuration landscapes: more benign than expected? In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11102, pp. 271\u2013283. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99259-4_22"},{"key":"34_CR36","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I.: Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Fromman-Holzboorg Verlag, Stuttgart (1973)"},{"key":"34_CR37","doi-asserted-by":"crossref","unstructured":"Rodionova, A., Antonov, K., Buzdalova, A., Doerr, C.: Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2019), pp. 855\u2013863. ACM (2019)","DOI":"10.1145\/3321707.3321827"},{"key":"34_CR38","doi-asserted-by":"crossref","unstructured":"Rost, A., Petrova, I., Buzdalova, A.: Adaptive parameter selection in evolutionary algorithms by reinforcement learning with dynamic discretization of parameter range. In: Proceedings of Genetic and Evolutionary Computation Conference Companion (GECCO 2016), pp. 141\u2013142 (2016)","DOI":"10.1145\/2908961.2908998"},{"key":"34_CR39","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1109\/TAC.1968.1098903","volume":"13","author":"MA Schumer","year":"1968","unstructured":"Schumer, M.A., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13, 270\u2013276 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"key":"34_CR40","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"key":"34_CR41","unstructured":"V\u00e9rel, S.: Apport \u00e0 l\u2019analyse des paysages de fitness pour l\u2019optimisation mono-objective et multiobjective: Science des syst\u00e8mes complexes pour l\u2019optimisation par m\u00e9thodes stochastiques. (Contributions to fitness landscapes analysis for single- and multi-objective optimization: Science of complex systems for optimization with stochastic methods) (2016). https:\/\/tel.archives-ouvertes.fr\/tel-01425127"},{"key":"34_CR42","doi-asserted-by":"crossref","unstructured":"Wang, H., Emmerich, M., B\u00e4ck, T.: Cooling strategies for the moment-generating function in Bayesian global optimization. In: Proceedings of Congress on Evolutionary Computation (CEC 2018), pp. 1\u20138 (2018)","DOI":"10.1109\/CEC.2018.8477956"},{"key":"34_CR43","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: Proceeding of Genetic and Evolutionary Computation Conference Companion (GECCO 2018), pp. 1769\u20131776 (2018)","DOI":"10.1145\/3205651.3208240"}],"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_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T00:46:00Z","timestamp":1723509960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_34","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)"}}]}}