{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:16:59Z","timestamp":1760203019995,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031131875"},{"type":"electronic","value":"9783031131882"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T00:00:00Z","timestamp":1659744000000},"content-version":"vor","delay-in-days":217,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present the tool<jats:sc>Ranker<\/jats:sc>for complementing B\u00fcchi automata (BAs).<jats:sc>Ranker<\/jats:sc>builds on our previous optimizations of rank-based BA complementation and pushes them even further using numerous heuristics to produce even smaller automata. Moreover, it contains novel optimizations of specialized constructions for complementing (i)\u00a0inherently weak automata and (ii)\u00a0semi-deterministic automata, all delivered in a\u00a0robust tool. The optimizations significantly improve the usability of<jats:sc>Ranker<\/jats:sc>, as shown in an extensive experimental evaluation with real-world benchmarks, where<jats:sc>Ranker<\/jats:sc>produced in the majority of cases a\u00a0strictly smaller complement than other state-of-the-art tools.<\/jats:p>","DOI":"10.1007\/978-3-031-13188-2_10","type":"book-chapter","created":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T08:16:57Z","timestamp":1659687417000},"page":"188-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Complementing B\u00fcchi Automata with\u00a0Ranker"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4375-7954","authenticated-orcid":false,"given":"Vojt\u011bch","family":"Havlena","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3038-5875","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Leng\u00e1l","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1184-4669","authenticated-orcid":false,"given":"Barbora","family":"\u0160mahl\u00edkov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,6]]},"reference":[{"unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the International Congress on Logic, Method, and Philosophy of Science 1960. Stanford University Press, Stanford (1962)","key":"10_CR1"},{"doi-asserted-by":"publisher","unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Deciding S1S: down the rabbit hole and through the looking glass. In: Echihabi, K., Meyer, R. (eds.) NETYS 2021. LNCS, vol. 12754, pp. 215\u2013222. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91014-3_15","key":"10_CR2","DOI":"10.1007\/978-3-030-91014-3_15"},{"issue":"2\u20133","key":"10_CR3","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. Theor. Comput. Sci. 49(2\u20133), 217\u2013237 (1987)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Oei, R., Ma, D., Schulz, C., Hieronymi, P.: Pecan: an automated theorem prover for automatic sequences using B\u00fcchi automata. arXiv preprint arXiv:2102.01727 (2021)","key":"10_CR4"},{"doi-asserted-by":"publisher","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":"10_CR5","DOI":"10.1007\/978-3-642-00768-2_2"},{"doi-asserted-by":"publisher","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":"10_CR6","DOI":"10.1007\/978-3-319-08867-9_53"},{"doi-asserted-by":"crossref","unstructured":"Chen, Y., et al.: Advanced automata-based algorithms for program termination checking. In: Proceedings of PLDI\u201918, pp. 135\u2013150. ACM (2018)","key":"10_CR7","DOI":"10.1145\/3296979.3192405"},{"unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of LICS\u201986, pp. 332\u2013344. IEEE (1986)","key":"10_CR8"},{"unstructured":"Safra, S.: On the complexity of $$\\omega $$-automata. In: Proceedings of FOCS\u201988, pp. 319\u2013327. IEEE (1988)","key":"10_CR9"},{"doi-asserted-by":"crossref","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proceedings of LICS\u201906, pp. 255\u2013264. IEEE (2006)","key":"10_CR10","DOI":"10.2168\/LMCS-3(3:5)2007"},{"issue":"3\u20134","key":"10_CR11","doi-asserted-by":"publisher","first-page":"393","DOI":"10.3233\/FI-2012-744","volume":"119","author":"RR Redziejowski","year":"2012","unstructured":"Redziejowski, R.R.: An improved construction of deterministic omega-automaton using derivatives. Fundam. Informat. 119(3\u20134), 393\u2013406 (2012)","journal-title":"Fundam. Informat."},{"issue":"3","key":"10_CR12","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":"10_CR13","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."},{"unstructured":"Schewe, S.: B\u00fcchi complementation made tight. In: Albers, S., Marion, J., (eds.) Proceedings of STACS\u201909. Volume 3 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, pp. 661\u2013672 (2009)","key":"10_CR14"},{"doi-asserted-by":"publisher","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":"10_CR15","DOI":"10.1007\/978-3-642-28729-9_10"},{"doi-asserted-by":"crossref","unstructured":"Allred, J.D., Ultes-Nitsche, U.: A simple and optimal complementation algorithm for B\u00fcchi automata. In: Proceedings of LICS\u201918, pp. 46\u201355. IEEE (2018)","key":"10_CR16","DOI":"10.1145\/3209108.3209138"},{"doi-asserted-by":"crossref","unstructured":"Yan, Q.: Lower bounds for complementation of $$\\omega $$-automata via the full automata technique. In: Proceedings of ICALP\u201906, pp. 589\u2013600. Springer, Heidelberg (2006)","key":"10_CR17","DOI":"10.1007\/11787006_50"},{"unstructured":"Havlena, V., Leng\u00e1l, O.: Reducing (to) the ranks: efficient rank-based B\u00fcchi automata complementation. In: Proceedings of CONCUR\u201921. Volume 203 of LIPIcs, pp. 2:1\u20132:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)","key":"10_CR18"},{"doi-asserted-by":"publisher","unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Sky is not the limit: tighter rank bounds for elevator automata in B\u00fcchi automata complementation. In: Proceedings of TACAS\u201922, vol. 13244, LNCS, pp. 118\u2013136. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_7","key":"10_CR19","DOI":"10.1007\/978-3-030-99527-0_7"},{"key":"10_CR20","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":"10_CR21","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":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on $$\\omega $$-words. Theor. Comput. Sci. 32(3), 321\u2013330 (1984)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: On the use of weak automata for deciding linear arithmetic with integer and real variables. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 611\u2013625. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_50","key":"10_CR23","DOI":"10.1007\/3-540-45744-5_50"},{"unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Ranker (2022). https:\/\/github.com\/vhavlena\/ranker","key":"10_CR24"},{"doi-asserted-by":"publisher","unstructured":"Babiak, T., et al.: The Hanoi omega-automata format. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 479\u2013486. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_31","key":"10_CR25","DOI":"10.1007\/978-3-319-21690-4_31"},{"doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., et al.: Simulation subsumption in Ramsey-based B\u00fcchi automata Universality and inclusion testing. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 132\u2013147. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_14","key":"10_CR26","DOI":"10.1007\/978-3-642-14295-6_14"},{"doi-asserted-by":"crossref","unstructured":"Mayr, R., Clemente, L.: Advanced automata minimization. In: Proceedings of POPL\u201913, pp. 63\u201374 (2013)","key":"10_CR27","DOI":"10.1145\/2480359.2429079"},{"doi-asserted-by":"crossref","unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Complementing B\u00fcchi automata with Ranker (technical report). arXiv preprint arXiv:2206.01946 (2021)","key":"10_CR28","DOI":"10.1007\/978-3-031-13188-2_10"},{"doi-asserted-by":"publisher","unstructured":"van Glabbeek, R., Ploeger, B.: Five determinisation algorithms. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 161\u2013170. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70844-5_17","key":"10_CR29","DOI":"10.1007\/978-3-540-70844-5_17"},{"doi-asserted-by":"publisher","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":"10_CR30","DOI":"10.1007\/3-540-45694-5_10"},{"doi-asserted-by":"publisher","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0 \u2014 A 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","key":"10_CR31","DOI":"10.1007\/978-3-319-46520-3_8"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-030-31784-3_18","volume-title":"Automated Technology for Verification and Analysis","author":"C L\u00f6ding","year":"2019","unstructured":"L\u00f6ding, C., Pirogov, A.: New optimizations and heuristics for determinization of B\u00fcchi automata. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 317\u2013333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_18"},{"doi-asserted-by":"publisher","unstructured":"Tsai, M.-H., Tsay, Y.-K., Hwang, Y.-S.: GOAL for games, omega-automata, and logics. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 883\u2013889. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_62","key":"10_CR33","DOI":"10.1007\/978-3-642-39799-8_62"},{"key":"10_CR34","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"},{"doi-asserted-by":"publisher","unstructured":"Klein, J., Baier, C.: On-the-fly stuttering in the construction of deterministic $$\\omega $$-automata. In: Proceedings of CIAA\u201907, vol. 4783, LNCS, pp. 51\u201361. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76336-9_7","key":"10_CR35","DOI":"10.1007\/978-3-540-76336-9_7"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-17462-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Li","year":"2019","unstructured":"Li, Y., Sun, X., Turrini, A., Chen, Y.-F., Xu, J.: ROLL 1.0: $$\\omega $$-regular language learning library. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 365\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_23"},{"unstructured":"Havlena, V., Leng\u00e1l, O., \u0160mahl\u00edkov\u00e1, B.: Artifact for the CAV\u201922 submission \u201cComplementing B\u00fcchi Automata with Ranker\u201d (2022). https:\/\/doi.org\/10.5281\/zenodo.6558229","key":"10_CR37"},{"key":"10_CR38","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"},{"doi-asserted-by":"publisher","unstructured":"Tabakov, D., Vardi, M.Y.: Experimental evaluation of classical automata constructions. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 396\u2013411. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11591191_28","key":"10_CR39","DOI":"10.1007\/11591191_28"},{"unstructured":"Leng\u00e1l, O.: Automata Benchmarks Repository (2022). https:\/\/github.com\/ondrik\/automata-benchmarks\/tree\/master\/omega","key":"10_CR40"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13188-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T19:24:40Z","timestamp":1676316280000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13188-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031131875","9783031131882"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13188-2_10","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":"6 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","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":"7 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2022\/","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":"209","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":"40","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":"11","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":"19% - 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.9","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":"9.7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}