{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:45:03Z","timestamp":1742946303205,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_15","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"215-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Deciding S1S: Down the Rabbit Hole and Through the Looking Glass"],"prefix":"10.1007","author":[{"given":"Vojt\u011bch","family":"Havlena","sequence":"first","affiliation":[]},{"given":"Ond\u0159ej","family":"Leng\u00e1l","sequence":"additional","affiliation":[]},{"given":"Barbora","family":"\u0160mahl\u00edkov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"15_CR1","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the First Symposium on Logic in Computer Science, pp. 322\u2013331. IEEE (1986)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BFb0015772","volume-title":"Automata, Languages and Programming","author":"AP Sistla","year":"1985","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 465\u2013474. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/BFb0015772"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-319-08867-9_53","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2014","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Termination analysis by learning terminating programs. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 797\u2013813. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_53"},{"key":"15_CR4","unstructured":"Oei, R., Ma, D., Schulz, C., Hieronymi, P.: Pecan: an automated theorem prover for automatic sequences using b\u00fcchi automata. CoRR abs\/2102.01727 (2021)"},{"key":"15_CR5","unstructured":"Hieronymi, P., Ma, D., Oei, R., Schaeffer, L., Schulz, C., Shallit, J.O.: Decidability for Sturmian words. CoRR abs\/2102.08207 (2021)"},{"key":"15_CR6","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of International Congress on Logic, Method, and Philosophy of Science 1960, Stanford University Press, Stanford (1962)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-39724-3_10","volume-title":"Correct Hardware Design and Verification Methods","author":"S Gurumurthy","year":"2003","unstructured":"Gurumurthy, S., Kupferman, O., Somenzi, F., Vardi, M.Y.: On complementing nondeterministic B\u00fcchi automata. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol. 2860, pp. 96\u2013110. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39724-3_10"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-34175-6_23","volume-title":"Programming Languages and Systems","author":"Y-F Chen","year":"2019","unstructured":"Chen, Y.-F., Havlena, V., Leng\u00e1l, O.: Simulations in rank-based B\u00fcchi automata complementation. In: Lin, A.W. (ed.) APLAS 2019. LNCS, vol. 11893, pp. 447\u2013467. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_23"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Y., et al.: Advanced automata-based algorithms for program termination checking. In: Foster, J.S., Grossman, D. (eds.) Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2018, Philadelphia, PA, USA, 18\u201322 June 2018, pp. 135\u2013150. ACM (2018)","DOI":"10.1145\/3192366.3192405"},{"key":"15_CR10","unstructured":"Schewe, S.: B\u00fcchi complementation made tight. In: Albers, S., Marion, J. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26\u201328 February 2009, Freiburg, Germany, Proceedings. LIPIcs, vol. 3, pp. 661\u2013672. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Trans. Comput. Log. 2(3), 408\u2013429 (2001)","journal-title":"ACM Trans. Comput. Log."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Allred, J.D., Ultes-Nitsche, U.: A simple and optimal complementation algorithm for B\u00fcchi automata. In: Proceedings of the Thirty third Annual IEEE Symposium on Logic in Computer Science (LICS 2018), pp. 46\u201355. IEEE Computer Society Press (July 2018)","DOI":"10.1145\/3209108.3209138"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-030-53291-8_2","volume-title":"Computer Aided Verification","author":"F Blahoudek","year":"2020","unstructured":"Blahoudek, F., Duret-Lutz, A., Strej\u010dek, J.: Seminator 2 can complement generalized B\u00fcchi automata via improved semi-determinization. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 15\u201327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_2"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-18098-9_28","volume-title":"Implementation and Application of Automata","author":"M-H Tsai","year":"2011","unstructured":"Tsai, M.-H., Fogarty, S., Vardi, M.Y., Tsay, Y.-K.: State of B\u00fcchi complementation. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 261\u2013271. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18098-9_28"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Li, Y., Turrini, A., Zhang, L., Schewe, S.: Learning to complement B\u00fcchi automata. In: Dillig, I., Palsberg, J. (eds.) VMCAI 2018. LNCS, vol. 10747, pp. 313\u2013335. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_15","DOI":"10.1007\/978-3-319-73721-8_15"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y., Wilke, T., Kupferman, O., Fogarty, S.J.: Unifying B\u00fcchi complementation constructions. Log. Methods Comput. Sci. 9 (2013)","DOI":"10.2168\/LMCS-9(1:13)2013"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1007\/978-3-662-49674-9_49","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"F Blahoudek","year":"2016","unstructured":"Blahoudek, F., Heizmann, M., Schewe, S., Strej\u010dek, J., Tsai, M.-H.: Complementing semi-deterministic B\u00fcchi automata. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 770\u2013787. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_49"},{"issue":"2\u20133","key":"15_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"AP Sistla","year":"1987","unstructured":"Sistla, A.P., Vardi, M.Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoret. Comput. Sci. 49(2\u20133), 217\u2013237 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-00768-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Fogarty","year":"2009","unstructured":"Fogarty, S., Vardi, M.Y.: B\u00fcchi complementation and size-change termination. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 16\u201330. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_2"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-12002-2_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Fogarty","year":"2010","unstructured":"Fogarty, S., Vardi, M.Y.: Efficient B\u00fcchi universality checking. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 205\u2013220. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_17"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proceedings of LICS 2006, pp. 255\u2013264. IEEE (2006)","DOI":"10.2168\/LMCS-3(3:5)2007"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-540-70575-8_59","volume-title":"Automata, Languages and Programming","author":"D K\u00e4hler","year":"2008","unstructured":"K\u00e4hler, D., Wilke, T.: Complementation, disambiguation, and determinization of B\u00fcchi automata unified. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 724\u2013735. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_59"},{"key":"15_CR23","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1142\/S0129054106004145","volume":"17","author":"E Friedgut","year":"2006","unstructured":"Friedgut, E., Kupferman, O., Vardi, M.: B\u00fcchi complementation made tighter. Int. J. Found. Comput. Sci. 17, 851\u2013868 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-70918-3_2","volume-title":"STACS 2007","author":"MY Vardi","year":"2007","unstructured":"Vardi, M.Y.: The B\u00fcchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 12\u201322. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_2"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-28729-9_10","volume-title":"Foundations of Software Science and Computational Structures","author":"S Breuers","year":"2012","unstructured":"Breuers, S., L\u00f6ding, C., Olschewski, J.: Improved Ramsey-based B\u00fcchi complementation. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 150\u2013164. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_10"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Li, Y., Vardi, M.Y., Zhang, L.: On the power of unambiguity in B\u00fcchi complementation. In Raskin, J.F., Bresolin, D. (eds.) Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification, Brussels, Belgium, September 21\u201322, 2020. Electronic Proceedings in Theoretical Computer Science, vol. 326, pp. 182\u2013198. Open Publishing Association (2020)","DOI":"10.4204\/EPTCS.326.0"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0022-0000(87)90036-5","volume":"35","author":"RP Kurshan","year":"1987","unstructured":"Kurshan, R.P.: Complementing deterministic B\u00fcchi automata in polynomial time. J. Comput. Syst. Sci. 35(1), 59\u201371 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Havlena, V., Leng\u00e1l, O.: Reducing (To) the ranks: efficient rank-based B\u00fcchi automata complementation. In: Haddad, S., Varacca, D. (eds.) 32nd International Conference on Concurrency Theory (CONCUR 2021). (LIPIcs). vol. 203, pp. 2:1\u20132:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Germany (2021). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14379. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.2","DOI":"10.4230\/LIPIcs.CONCUR.2021.2"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-04761-9_18","volume-title":"Automated Technology for Verification and Analysis","author":"H Karmarkar","year":"2009","unstructured":"Karmarkar, H., Chakraborty, S.: On minimal odd rankings for B\u00fcchi complementation. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 228\u2013243. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04761-9_18"},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-23217-6_13","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"PA Abdulla","year":"2011","unstructured":"Abdulla, P.A., et al.: Advanced Ramsey-based B\u00fcchi automata inclusion testing. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 187\u2013202. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_13"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45694-5_10","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"K Etessami","year":"2002","unstructured":"Etessami, K.: A hierarchy of polynomial-time computable simulations for automata. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 131\u2013144. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_10"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/3-540-45657-0_51","volume-title":"Computer Aided Verification","author":"S Gurumurthy","year":"2002","unstructured":"Gurumurthy, S., Bloem, R., Somenzi, F.: Fair simulation minimization. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 610\u2013623. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_51"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D Bustan","year":"2000","unstructured":"Bustan, D., Grumberg, O.: Simulation based minimization. ACM Trans. Comput. Log. 4, 181\u2013206 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-33693-0_16","volume-title":"Integrated Formal Methods","author":"S Barth","year":"2016","unstructured":"Barth, S.: Deciding monadic second order logic over $$\\omega $$-words by specialized finite automata. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 245\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_16"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-46520-3_8","volume-title":"Automated Technology for Verification and Analysis","author":"A Duret-Lutz","year":"2016","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0\u2014a framework for LTL and $$\\omega $$-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8"},{"issue":"4","key":"15_CR36","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S012905410200128X","volume":"13","author":"N Klarlund","year":"2002","unstructured":"Klarlund, N., M\u00f8ller, A., Schwartzbach, M.I.: MONA implementation secrets. Int. J. Found. Comput. Sci. 13(4), 571\u2013586 (2002)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:05:00Z","timestamp":1638353100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"32","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":"15","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":"2","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":"47% - 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,84","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)"}}]}}