{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T00:01:45Z","timestamp":1776816105595,"version":"3.51.2"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"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-14721-0_37","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"526-541","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Runtime Analysis of\u00a0Simple Evolutionary Algorithms for\u00a0the\u00a0Chance-Constrained Makespan Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1415-0515","authenticated-orcid":false,"given":"Feng","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2309-8034","authenticated-orcid":false,"given":"Xiankun","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"issue":"1","key":"37_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J., Kan, A.: Scheduling subject to resource constraints: classification and complexity. Discret. Appl. Math. 5(1), 11\u201324 (1983)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"37_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrained programming. Manage. Sci. 6(1), 73\u201379 (1959)","journal-title":"Manage. Sci."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Corus, D., Lehre, P.K., Neumann, F.: The generalized minimum spanning tree problem: a parameterized complexity analysis of bi-level optimisation. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 519\u2013526. ACM (2013)","DOI":"10.1145\/2463372.2463442"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Analyses of simple hybrid algorithms for the vertex cover problem. Evol. Comput. 17(1), 3\u201319 (2009)","journal-title":"Evol. Comput."},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1162\/EVCO_a_00003","volume":"18","author":"T Friedrich","year":"2010","unstructured":"Friedrich, T., He, J., Hebbinghaus, N., Neumann, F., Witt, C.: Approximating covering problems by randomized search heuristics using multi-objective models. Evol. Comput. 18(4), 617\u2013633 (2010)","journal-title":"Evol. Comput."},{"issue":"9","key":"37_CR6","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Gunia, C.: On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 571\u2013578. ACM (2005)","DOI":"10.1145\/1068009.1068106"},{"issue":"2","key":"37_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1511\/2002.2.113","volume":"90","author":"B Hayes","year":"2002","unstructured":"Hayes, B.: Computing science: the easiest hard problem. Am. Sci. 90(2), 113\u2013117 (2002)","journal-title":"Am. Sci."},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"He, J., Mitavskiy, B., Zhou, Y.: A theoretical assessment of solution quality in evolutionary algorithms for the knapsack problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp. 141\u2013148. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900442"},{"key":"37_CR10","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, 21\u201335 (2004)","journal-title":"Nat. Comput."},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"2","key":"37_CR12","first-page":"409","volume":"17","author":"K Iwamura","year":"1996","unstructured":"Iwamura, K., Liu, B.: A genetic algorithm for chance constrained programming. J. Inf. Optim. Sci. 17(2), 409\u2013422 (1996)","journal-title":"J. Inf. Optim. Sci."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, T., Oliveto, P.S., Zarges, C.: Approximating vertex cover using edge-based representations. In: Proceedings of the Workshop on Foundations of Genetic Algorithms (FOGA), pp. 87\u201396. ACM (2013)","DOI":"10.1145\/2460239.2460248"},{"key":"37_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-15844-5_21","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"S Kratsch","year":"2010","unstructured":"Kratsch, S., Lehre, P.K., Neumann, F., Oliveto, P.S.: Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6238, pp. 204\u2013213. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15844-5_21"},{"issue":"4","key":"37_CR15","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1007\/s00453-012-9660-4","volume":"65","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Neumann, F.: Fixed-parameter evolutionary algorithms and the vertex cover problem. Algorithmica 65(4), 754\u2013771 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-016-0262-4","volume":"78","author":"A Lissovoi","year":"2017","unstructured":"Lissovoi, A., Witt, C.: A runtime analysis of parallel evolutionary algorithms in dynamic optimization. Algorithmica 78(2), 641\u2013659 (2017)","journal-title":"Algorithmica"},{"issue":"6","key":"37_CR17","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1287\/opre.13.6.930","volume":"13","author":"BL Miller","year":"1965","unstructured":"Miller, B.L., Wagner, H.M.: Chance constrained programming with joint constraints. Oper. Res. 13(6), 930\u2013945 (1965)","journal-title":"Oper. Res."},{"key":"37_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-58112-1_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"A Neumann","year":"2020","unstructured":"Neumann, A., Neumann, F.: Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 404\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28"},{"key":"37_CR19","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-29414-4_7","volume-title":"Theory of Evolutionary Computation","author":"F Neumann","year":"2020","unstructured":"Neumann, F., Pourhassan, M., Roostapour, V.: Analysis of evolutionary algorithms in dynamic and stochastic environments. In: Theory of Evolutionary Computation. NCS, pp. 323\u2013357. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_7"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Neumann, F., Sutton, A.M.: Runtime analysis of the (1+1) evolutionary algorithm for the chance-constrained knapsack problem. In: Proceedings of the Workshop on on Foundations of Genetic Algorithms (FOGA), pp. 147\u2013153. ACM (2019)","DOI":"10.1145\/3299904.3340315"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s11047-006-9004-x","volume":"5","author":"F Neumann","year":"2006","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. 5, 305\u2013319 (2006)","journal-title":"Nat. Comput."},{"issue":"1","key":"37_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2006.11.002","volume":"378","author":"F Neumann","year":"2007","unstructured":"Neumann, F., Wegener, I.: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoret. Comput. Sci. 378(1), 32\u201340 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR23","unstructured":"Neumann, F., Witt, C.: On the runtime of randomized local search and simple evolutionary algorithms for dynamic makespan scheduling. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 3742\u20133748 (2015)"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of population-based evolutionary algorithms for the vertex cover problem. In: Proceedings of the IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 1563\u20131570. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631000"},{"issue":"5","key":"37_CR25","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TEVC.2009.2014362","volume":"13","author":"PS Oliveto","year":"2009","unstructured":"Oliveto, P.S., He, J., Yao, X.: Analysis of the (1+1) EA for finding approximate solutions to vertex cover problems. IEEE Trans. Evol. Comput. 13(5), 1006\u20131029 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"37_CR26","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1016\/j.ejor.2006.06.045","volume":"185","author":"CA Poojari","year":"2008","unstructured":"Poojari, C.A., Varghese, B.: Genetic algorithm based technique for solving chance constrained problems. Eur. J. Oper. Res. 185(3), 1128\u20131154 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Friedrich, T., Neumann, F.: On the use of the dual formulation for minimum weighted vertex cover in evolutionary algorithms. In: Proceedings of the Workshop on Foundations of Genetic Algorithms (FOGA), pp. 37\u201344. ACM (2017)","DOI":"10.1145\/3040718.3040726"},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"Pourhassan, M., Gao, W., Neumann, F.: Maintaining 2-approximations for the dynamic vertex cover problem using evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 513\u2013518. ACM (2015)","DOI":"10.1145\/2739480.2754700"},{"key":"37_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-319-45823-6_68","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"M Pourhassan","year":"2016","unstructured":"Pourhassan, M., Shi, F., Neumann, F.: Parameterized analysis of multi-objective evolutionary algorithms and the weighted vertex cover problem. 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. 729\u2013739. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45823-6_68"},{"key":"37_CR30","doi-asserted-by":"publisher","first-page":"103597","DOI":"10.1016\/j.artint.2021.103597","volume":"302","author":"V Roostapour","year":"2022","unstructured":"Roostapour, V., Neumann, A., Neumann, F., Friedrich, T.: Pareto optimization for subset selection with dynamic cost constraints. Artif. Intell. 302, 103597 (2022)","journal-title":"Artif. Intell."},{"issue":"1","key":"37_CR31","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni, S.K.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"37_CR32","doi-asserted-by":"publisher","first-page":"906","DOI":"10.1007\/s00453-019-00662-w","volume":"83","author":"F Shi","year":"2021","unstructured":"Shi, F., Neumann, F., Wang, J.: Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem. Algorithmica 83(4), 906\u2013939 (2021)","journal-title":"Algorithmica"},{"issue":"2","key":"37_CR33","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1007\/s00453-018-0451-4","volume":"81","author":"F Shi","year":"2019","unstructured":"Shi, F., Schirneck, M., Friedrich, T., K\u00f6tzing, T., Neumann, F.: Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints. Algorithmica 81(2), 828\u2013857 (2019)","journal-title":"Algorithmica"},{"key":"37_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-32937-1_6","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"AM Sutton","year":"2012","unstructured":"Sutton, A.M., Neumann, F.: A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7491, pp. 52\u201361. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32937-1_6"},{"key":"37_CR35","doi-asserted-by":"crossref","unstructured":"Roostapour, V., Bossek, J., Neumann, F.: Runtime analysis of evolutionary algorithms with biased mutation for the multi-objective minimum spanning tree problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 551\u2013559. ACM (2020)","DOI":"10.1145\/3377930.3390168"},{"key":"37_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-31856-9_4","volume-title":"STACS 2005","author":"C Witt","year":"2005","unstructured":"Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44\u201356. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31856-9_4"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Witt, C.: Revised analysis of the (1+1) EA for the minimum spanning tree problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 509\u2013516. ACM (2014)","DOI":"10.1145\/2576768.2598237"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"Xie, Y., Harper, O., Assimi, H., Neumann, A., Neumann, F.: Evolutionary algorithms for the chance-constrained knapsack problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 338\u2013346. ACM (2019)","DOI":"10.1145\/3321707.3321869"},{"key":"37_CR39","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F., Sutton, A.M.: Runtime analysis of RLS and the (1+ 1) EA for the chance-constrained knapsack problem with correlated uniform weights. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 1187\u20131194. ACM (2021)","DOI":"10.1145\/3449639.3459381"},{"key":"37_CR40","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2012.01.001","volume":"180","author":"Y Yu","year":"2012","unstructured":"Yu, Y., Yao, X., Zhou, Z.H.: On the approximation ability of evolutionary optimization with application to minimum set cover. Artif. Intell. 180, 20\u201333 (2012)","journal-title":"Artif. Intell."}],"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-14721-0_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:02:39Z","timestamp":1710259359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 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)"}}]}}