{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:14:05Z","timestamp":1784837645594,"version":"3.55.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572555","type":"print"},{"value":"9783031572562","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Decision diagrams<\/jats:italic> (DDs) are an important data structure in computer science with applications ranging from circuit design and verification to machine learning. Most prominently, <jats:italic>binary DDs<\/jats:italic> are commonly used to succinctly represent Boolean functions. Due to the practical importance of DDs, there is an ongoing quest for high-performance software libraries supporting the construction and manipulation of DDs. With OxiDD, we present a new framework for DDs that focuses on <jats:italic>safety<\/jats:italic>, <jats:italic>concurrency<\/jats:italic>, and <jats:italic>modularity<\/jats:italic>. Following a highly <jats:italic>modular design<\/jats:italic> we implement OxiDD in Rust, which facilitates the integration of various kinds of DDs such as MTBDDs, ZBDDs, and TDDs, all within safe code also in a concurrent setting. Already in its initial release, OxiDD does not compromise <jats:italic>performance<\/jats:italic>, which we show to be on par with or even better than established highly optimized DD libraries.<\/jats:p>","DOI":"10.1007\/978-3-031-57256-2_13","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T08:03:04Z","timestamp":1712217784000},"page":"255-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["OxiDD"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4375-3753","authenticated-orcid":false,"given":"Nils","family":"Husung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5718-8276","authenticated-orcid":false,"given":"Clemens","family":"Dubslaff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2766-9615","authenticated-orcid":false,"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2551-2814","authenticated-orcid":false,"given":"Maximilian A.","family":"K\u00f6hl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Transactions Computers 27(6), 509\u2013516 (Jun 1978). https:\/\/doi.org\/10.1109\/TC.1978.1675141","DOI":"10.1109\/TC.1978.1675141"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: MINCE: A static global variable-ordering heuristic for SAT search and BDD manipulation. Journal of Universal Computer Science 10(12), 1562\u20131596 (2004). https:\/\/doi.org\/10.3217\/jucs-010-12-1562","DOI":"10.3217\/jucs-010-12-1562"},{"key":"13_CR3","unstructured":"Amar\u00fa, L., Gaillardon, P.E., De\u00a0Micheli, G.: The EPFL combinational benchmark suite. In: Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS) (2015), https:\/\/infoscience.epfl.ch\/record\/207551"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. In: Proceedings of the 1993 IEEE\/ACM International Conference on Computer-Aided Design. pp. 188\u2013191. ICCAD \u201993, IEEE Computer Society Press, Washington, DC, USA (1993). https:\/\/doi.org\/10.1109\/ICCAD.1993.580054","DOI":"10.1109\/ICCAD.1993.580054"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M., Ryan, M.: Symbolic model checking for probabilistic processes. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) Automata, Languages and Programming. pp. 430\u2013440. Springer Berlin Heidelberg, Berlin, Heidelberg (1997)","DOI":"10.1007\/3-540-63165-8_199"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Benes, N., Brim, L., Kadlecaj, J., Pastva, S., Safr\u00e1nek, D.: AEON: attractor bifurcation analysis of parametrised boolean networks. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I. Lecture Notes in Computer Science, vol. 12224, pp. 569\u2013581. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_28","DOI":"10.1007\/978-3-030-53288-8_28"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Beyer, D., Friedberger, K., Holzner, S.: PJBDD: A BDD library for Java and multi-threading. In: Hou, Z., Ganesh, V. (eds.) Automated Technology for Verification and Analysis - 19th International Symposium, ATVA 2021, Gold Coast, QLD, Australia, October 18-22, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12971, pp. 144\u2013149. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_10","DOI":"10.1007\/978-3-030-88885-5_10"},{"key":"13_CR8","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press, Amsterdam, The Netherlands (2009)"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Blom, S., van\u00a0de Pol, J.: Symbolic reachability for process algebras with recursive data types. In: Fitzgerald, J.S., Haxthausen, A.E., Yenig\u00fcn, H. (eds.) Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings. Lecture Notes in Computer Science, vol.\u00a05160, pp. 81\u201395. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-85762-4_6","DOI":"10.1007\/978-3-540-85762-4_6"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers 45(9), 993\u20131002 (1996). https:\/\/doi.org\/10.1109\/12.537122","DOI":"10.1109\/12.537122"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Brace, K., Rudell, R., Bryant, R.: Efficient implementation of a BDD package. In: 27th ACM\/IEEE Design Automation Conference. pp. 40\u201345 (1990). https:\/\/doi.org\/10.1109\/DAC.1990.114826","DOI":"10.1109\/DAC.1990.114826"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys 24(3), 293\u2013318 (Sep 1992). https:\/\/doi.org\/10.1145\/136035.136043","DOI":"10.1145\/136035.136043"},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Bryant, R.E.: Chain reduction for binary and zero-suppressed decision diagrams. Journal of Automated Reasoning 64(7), 1361\u20131391 (2020). https:\/\/doi.org\/10.1007\/s10817-020-09569-6","DOI":"10.1007\/s10817-020-09569-6"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10$$^{20}$$ states and beyond. Inform. and Comp. 98(2), 142\u2013170 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90017-A","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Cimatti, R., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, O.: NuSMV 2: An opensource tool for symbolic model checking. In: Proceedings of the 14th Conference on Computer Aided Verification (CAV). vol. LNCS:2404, pp. 359\u2013364. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-45657-0_29","DOI":"10.1007\/3-540-45657-0_29"},{"key":"13_CR17","unstructured":"Clarke, E.M., Fujita, M., McGeers, P.C., McMillan, K.L., Yang, J.C., Zhao, X.: Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In: Proc. International Workshop on Logic & Synthesis (1993)"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"van Dijk, T., van\u00a0de Pol, J.: Sylvan: multi-core framework for decision diagrams. International Journal on Software Tools for Technology Transfer 19(6), 675\u2013696 (2017). https:\/\/doi.org\/10.1007\/s10009-016-0433-2","DOI":"10.1007\/s10009-016-0433-2"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"van Dijk, T., Wille, R., Meolic, R.: Tagged BDDs: Combining reduction rules from different decision diagram types. In: Stewart, D., Weissenbacher, G. (eds.) 2017 Formal Methods in Computer Aided Design, FMCAD 2017, Vienna, Austria, October 2-6, 2017. pp. 108\u2013115. IEEE (2017). https:\/\/doi.org\/10.23919\/FMCAD.2017.8102248","DOI":"10.23919\/FMCAD.2017.8102248"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Drechsler, R., Becker, B.: Binary Decision Diagrams - Theory and Implementation. Springer (1998). https:\/\/doi.org\/10.1007\/978-1-4757-2892-7","DOI":"10.1007\/978-1-4757-2892-7"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Fortune, S., Hopcroft, J., Schmidt, E.M.: The complexity of equivalence and containment for free single variable program schemes. In: Ausiello, G., B\u00f6hm, C. (eds.) Automata, Languages and Programming. pp. 227\u2013240. Springer Berlin Heidelberg, Berlin, Heidelberg (1978). https:\/\/doi.org\/10.1007\/3-540-08860-1_17","DOI":"10.1007\/3-540-08860-1_17"},{"key":"13_CR22","unstructured":"Goregaokar, M.: Designing a GC in Rust (2015), http:\/\/web.archive.org\/web\/20230714074109\/https:\/\/manishearth.github.io\/blog\/2015\/09\/01\/designing-a-gc-in-rust\/"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Harder, H., Jantsch, S., Baier, C., Dubslaff, C.: A unifying formal approach to importance values in Boolean functions. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China. pp. 2728\u20132737. ijcai.org (2023). https:\/\/doi.org\/10.24963\/ijcai.2023\/304","DOI":"10.24963\/ijcai.2023\/304"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Husung, N., Dubslaff, C., Hermanns, H., K\u00f6hl, M.A.: OxiDD: Artifact (2024). https:\/\/doi.org\/10.5281\/zenodo.10578461","DOI":"10.5281\/zenodo.10578461"},{"key":"13_CR25","unstructured":"Kam, T., Villa, T., Brayton, R.K.: Multi-valued decision diagrams: theory and applications (1998), https:\/\/api.semanticscholar.org\/CorpusID:53828281"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Lai, Y.T., Sastry, S., Pedram, M.: Boolean matching using binary decision diagrams with applications to logic synthesis and verification. In: Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors. pp. 452\u2013458 (1992). https:\/\/doi.org\/10.1109\/ICCD.1992.276313","DOI":"10.1109\/ICCD.1992.276313"},{"key":"13_CR27","unstructured":"Lind-Nielsen, J.: BuDDy: A binary decision diagram package, version 2.4 (2004), https:\/\/buddy.sourceforge.net\/manual\/"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Lovato, A., Macedonio, D., Spoto, F.: A thread-safe library for binary decision diagrams. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) Software Engineering and Formal Methods. pp. 35\u201349. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_4","DOI":"10.1007\/978-3-319-10431-7_4"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Maier, T., Sanders, P., Dementiev, R.: Concurrent hash tables: Fast and general(?)! ACM Trans. Parallel Comput. 5(4), 16:1\u201316:32 (2019). https:\/\/doi.org\/10.1145\/3309206","DOI":"10.1145\/3309206"},{"key":"13_CR30","unstructured":"Matsakis, N., Stone, J.: Rayon (2023), https:\/\/docs.rs\/rayon\/1.8.0\/rayon\/"},{"key":"13_CR31","doi-asserted-by":"publisher","unstructured":"Meolic, R.: The Biddy BDD package. Journal of Open Source Software 4(34), \u00a01189 (2019). https:\/\/doi.org\/10.21105\/joss.01189","DOI":"10.21105\/joss.01189"},{"key":"13_CR32","doi-asserted-by":"publisher","unstructured":"Minato, S.i.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th International Design Automation Conference. pp. 272\u2013277. DAC \u201993, Association for Computing Machinery, New York, NY, USA (1993). https:\/\/doi.org\/10.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"13_CR33","doi-asserted-by":"publisher","unstructured":"Ranjan, R., Gosti, W., Brayton, R., Sangiovanni-Vincenteili, A.: Dynamic reordering in a breadth-first manipulation based bdd package: challenges and solutions. In: Proceedings International Conference on Computer Design VLSI in Computers and Processors. pp. 344\u2013351 (1997). https:\/\/doi.org\/10.1109\/ICCD.1997.628893","DOI":"10.1109\/ICCD.1997.628893"},{"key":"13_CR34","unstructured":"Rice, M., Kulhari, S.: A survey of static variable ordering heuristics for efficient bdd\/mdd construction. University of California, Tech. Rep p.\u00a0130 (2008)"},{"key":"13_CR35","doi-asserted-by":"publisher","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of 1993 International Conference on Computer Aided Design (ICCAD). pp. 42\u201347 (1993). https:\/\/doi.org\/10.1109\/ICCAD.1993.580029","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"13_CR36","unstructured":"Rust Foundation: The Rustonomicon (2023), http:\/\/web.archive.org\/web\/20230918045612\/https:\/\/doc.rust-lang.org\/nomicon\/intro.html"},{"key":"13_CR37","doi-asserted-by":"publisher","unstructured":"Sanghavi, J.V., Ranjan, R.K., Brayton, R.K., Sangiovanni-Vincentelli, A.: High performance BDD package by exploiting memory hierarchy. In: 33rd Design Automation Conference (DAC). pp. 635\u2013640. Association for Computing Machinery (1996). https:\/\/doi.org\/10.1145\/240518.240638","DOI":"10.1145\/240518.240638"},{"key":"13_CR38","doi-asserted-by":"publisher","unstructured":"Sasao, T.: Ternary decision diagrams: Survey. In: 27th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1997, Antigonish, Nova Scotia, Canada, May 28-30, 1997, Proceedings. pp. 241\u2013252. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/ISMVL.1997.601404","DOI":"10.1109\/ISMVL.1997.601404"},{"key":"13_CR39","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., van\u00a0de Pol, J.: Adiar 1.1 - zero-suppressed decision diagrams in external memory. In: Rozier, K.Y., Chaudhuri, S. (eds.) NASA Formal Methods - 15th International Symposium, NFM 2023, Houston, TX, USA, May 16-18, 2023, Proceedings. Lecture Notes in Computer Science, vol. 13903, pp. 464\u2013471. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-33170-1_28","DOI":"10.1007\/978-3-031-33170-1_28"},{"key":"13_CR40","unstructured":"Somenzi, F.: CUDD: CU decision diagram package. Tech. rep., University of Colorado at Boulder (2015)"},{"key":"13_CR41","unstructured":"Vahidi, A.: JDD: A pure Java BDD and Z-BDD library (2003), https:\/\/bitbucket.org\/vahidi\/jdd"},{"key":"13_CR42","doi-asserted-by":"publisher","unstructured":"Yanovski, J., Dang, H., Jung, R., Dreyer, D.: GhostCell: separating permissions from data in Rust. Proc. ACM Program. Lang. 5(ICFP), 1\u201330 (2021). https:\/\/doi.org\/10.1145\/3473597","DOI":"10.1145\/3473597"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57256-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T08:07:55Z","timestamp":1712218075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57256-2_13"}},"subtitle":["A Safe, Concurrent, Modular, and Performant Decision Diagram Framework in Rust"],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572555","9783031572562"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57256-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/tacas\/","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":"159","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":"53","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":"16","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":"33% - 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":"10","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)"}}]}}