{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:17:07Z","timestamp":1743052627657,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031098260"},{"type":"electronic","value":"9783031098277"}],"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-09827-7_2","type":"book-chapter","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T16:46:47Z","timestamp":1655830007000},"page":"11-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\textsc {Reach}$$ on Register Automata via History Independence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9730-9335","authenticated-orcid":false,"given":"Simon","family":"Dierl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-4459","authenticated-orcid":false,"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,22]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-16573-3_14","volume-title":"Testing Software and Systems","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., Uijen, J.: Generating models of infinite-state communication protocols using regular inference with abstraction. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol. 6435, pp. 188\u2013204. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16573-3_14"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., Vaandrager, F.: Inference and abstraction of the biometric passport. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 673\u2013686. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16558-0_54"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/362946.362970","volume":"12","author":"KA Bartlett","year":"1969","unstructured":"Bartlett, K.A., Scantlebury, R.A., Wilkinson, P.T.: A note on reliable full-duplex transmission over half-duplex links. Commun. ACM 12(5), 260\u2013261 (1969). https:\/\/doi.org\/10.1145\/362946.362970","journal-title":"Commun. ACM"},{"unstructured":"Boigelot, B.: Symbolic methods for exploring infinite state spaces. Ph.D. thesis, Universit\u00e9 de Li\u00e8ge, Li\u00e8ge, Belgium, May 1998. https:\/\/hdl.handle.net\/2268\/74874","key":"2_CR5"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(3:4)2014","volume":"10","author":"M Boja\u0144czyk","year":"2014","unstructured":"Boja\u0144czyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Log. Methods Comput. Sci. 10(4), 1\u201344 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(3:4)2014","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-53733-7_6","volume-title":"Language and Automata Theory and Applications","author":"B Br\u00fctsch","year":"2017","unstructured":"Br\u00fctsch, B., Landwehr, P., Thomas, W.: $$\\mathbb{N}$$-memory automata over the alphabet $$\\mathbb{N}$$. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 91\u2013102. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_6"},{"unstructured":"Cassel, S., Howar, F., Jonsson, B.: RALib: a LearnLib extension for inferring EFSMs. In: Proceedings of the 4th International Workshop on Design and Implementation of Formal Tools and Systems (2015). https:\/\/www.faculty.ece.vt.edu\/chaowang\/difts2015\/papers\/paper_5.pdf","key":"2_CR8"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-24372-1_26","volume-title":"Automated Technology for Verification and Analysis","author":"S Cassel","year":"2011","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 366\u2013380. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24372-1_26"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-33386-6_6","volume-title":"Automated Technology for Verification and Analysis","author":"S Cassel","year":"2012","unstructured":"Cassel, S., Jonsson, B., Howar, F., Steffen, B.: A succinct canonical register automaton model for data domains with binary relations. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 57\u201371. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33386-6_6"},{"doi-asserted-by":"publisher","unstructured":"Chen, Y.F., Leng\u00e1l, O., Tan, T., Wu, Z.: Register automata with linear arithmetic. In: 2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312. IEEE, June 2017. https:\/\/doi.org\/10.1109\/LICS.2017.8005111","key":"2_CR11","DOI":"10.1109\/LICS.2017.8005111"},{"unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: All-Pairs Shortest Paths, chap. 25, 3rd edn. pp. 684\u2013707. MIT Press, Cambridge, February 2009","key":"2_CR12"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-21500-6_16","volume-title":"Developments in Language Theory","author":"C Czyba","year":"2015","unstructured":"Czyba, C., Spinrath, C., Thomas, W.: Finite automata over infinite alphabets: two models with transitions for local change. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 203\u2013214. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_16"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-25540-4_1","volume-title":"Computer Aided Verification","author":"L D\u2019Antoni","year":"2019","unstructured":"D\u2019Antoni, L., Ferreira, T., Sammartino, M., Silva, A.: Symbolic register automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 3\u201321. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_1"},{"doi-asserted-by":"publisher","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3), 16:1\u201316:30 (2009). https:\/\/doi.org\/10.1145\/1507244.1507246","key":"2_CR15","DOI":"10.1145\/1507244.1507246"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-91384-7_10","volume-title":"Model Checking, Synthesis, and Learning","author":"S Dierl","year":"2021","unstructured":"Dierl, S., Howar, F.: A taxonomy and reductions for common register automata formalisms. In: Olderog, E.-R., Steffen, B., Yi, W. (eds.) Model Checking, Synthesis, and Learning. LNCS, vol. 13030, pp. 186\u2013218. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91384-7_10"},{"doi-asserted-by":"publisher","unstructured":"Dierl, S., Howar, F.: Reach on register automata via history independence - replication artifact (2022). https:\/\/doi.org\/10.5281\/zenodo.6367981","key":"2_CR17","DOI":"10.5281\/zenodo.6367981"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-63461-2_2","volume-title":"Integrated Formal Methods","author":"B Garhewal","year":"2020","unstructured":"Garhewal, B., Vaandrager, F., Howar, F., Schrijvers, T., Lenaerts, T., Smits, R.: Grey-box learning of register automata. In: Dongol, B., Troubitsyna, E. (eds.) IFM 2020. LNCS, vol. 12546, pp. 22\u201340. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63461-2_2"},{"doi-asserted-by":"publisher","unstructured":"Granas, A., Dugundji, J.: Elementary fixed point theorems, chap. 2, pp. 9\u201384. Springer, New York (2003). https:\/\/doi.org\/10.1007\/978-0-387-21593-8_2","key":"2_CR19","DOI":"10.1007\/978-0-387-21593-8_2"},{"issue":"10","key":"2_CR20","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-22348-9_19","volume-title":"Models, Mindsets, Meta: The What, the How, and the Why Not?","author":"F Howar","year":"2019","unstructured":"Howar, F., Jabbour, F., Mues, M.: JConstraints: a library for working with logic expressions in java. In: Margaria, T., Graf, S., Larsen, K.G. (eds.) Models, Mindsets, Meta: The What, the How, and the Why Not? LNCS, vol. 11200, pp. 310\u2013325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22348-9_19"},{"unstructured":"International Civil Aviation Organization: Machine readable travel documents. Doc 9303, International Civil Aviation Organization, Montr\u00e9al, Qu\u00e9bec, Canada (2021). https:\/\/www.icao.int\/publications\/pages\/publication.aspx?docnum=9303","key":"2_CR22"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-89963-3_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Iosif","year":"2018","unstructured":"Iosif, R., Xu, X.: Abstraction refinement for emptiness checking of alternating data automata. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 93\u2013111. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_6"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90242-9","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Madelaine, E., Qin, X., Zhang, M., Bliudze, S.: Using SMT engine to generate symbolic automata. Electron. Commun. EASST 76 (2019). https:\/\/doi.org\/10.14279\/tuj.eceasst.76.1103","key":"2_CR25","DOI":"10.14279\/tuj.eceasst.76.1103"},{"key":"2_CR26","volume-title":"Computation: Finite and infinite machines","author":"ML Minsky","year":"1972","unstructured":"Minsky, M.L.: Computation: Finite and infinite machines. Prentice-Hall International, London (1972)"},{"doi-asserted-by":"publisher","unstructured":"Moerman, J., Sammartino, M.: Residual nominal automata. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory. LIPIcs, vol. 171, pp. 44:1\u201344:21. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.44","key":"2_CR27","DOI":"10.4230\/LIPIcs.CONCUR.2020.44"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-662-44522-8_39","volume-title":"Mathematical Foundations of Computer Science 2014","author":"AS Murawski","year":"2014","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 464\u2013473. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_39"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jcss.2017.02.008","volume":"87","author":"AS Murawski","year":"2017","unstructured":"Murawski, A.S., Ramsay, S.J., Tzevelekos, N.: Reachability in pushdown register automata. J. Comput. Syst. Sci 87, 58\u201383 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2017.02.008","journal-title":"J. Comput. Syst. Sci"},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-22348-9_23","volume-title":"Models, Mindsets, Meta: The What, the How, and the Why Not?","author":"D Neider","year":"2019","unstructured":"Neider, D., Smetsers, R., Vaandrager, F., Kuppens, H.: Benchmarks for automata learning and conformance testing. In: Margaria, T., Graf, S., Larsen, K.G. (eds.) Models, Mindsets, Meta: The What, the How, and the Why Not? LNCS, vol. 11200, pp. 390\u2013416. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22348-9_23"},{"issue":"464","key":"2_CR32","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/3619658","volume":"73","author":"I Pressman","year":"1989","unstructured":"Pressman, I., Singmaster, D.: The jealous husbands and the missionaries and cannibals. Math. Gaz. 73(464), 73\u201381 (1989). https:\/\/doi.org\/10.2307\/3619658","journal-title":"Math. Gaz."},{"issue":"3","key":"2_CR33","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s00236-020-00367-6","volume":"57","author":"X Qin","year":"2020","unstructured":"Qin, X., Bliudze, S., Madelaine, E., Hou, Z., Deng, Y., Zhang, M.: SMT-based generation of symbolic automata. Acta Inform. 57(3), 627\u2013656 (2020). https:\/\/doi.org\/10.1007\/s00236-020-00367-6","journal-title":"Acta Inform."},{"doi-asserted-by":"publisher","unstructured":"Rosenberg, J., et al.: SIP: Session initiation protocol. RFC 3261, RFC Editor, June 2002. https:\/\/doi.org\/10.17487\/RFC3261","key":"2_CR34","DOI":"10.17487\/RFC3261"},{"doi-asserted-by":"publisher","unstructured":"Saint-Andre, P.: Extensible messaging and presence protocol (XMPP): Core. RFC 6120, RFC Editor, March 2011. https:\/\/doi.org\/10.17487\/RFC6120","key":"2_CR35","DOI":"10.17487\/RFC6120"},{"issue":"2","key":"2_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(99)00105-X","volume":"231","author":"H Sakamoto","year":"2000","unstructured":"Sakamoto, H., Ikeda, D.: Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231(2), 297\u2013308 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(99)00105-X","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09827-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T23:13:00Z","timestamp":1656025980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09827-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098260","9783031098277"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09827-7_2","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":"22 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tests and Proofs","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nantes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"4 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","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":"tap2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easychair.org\/smart-program\/TAP22\/index.html","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":"11","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":"6","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":"1","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":"55% - 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","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)"}}]}}