{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:05:10Z","timestamp":1768255510446,"version":"3.49.0"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031453311","type":"print"},{"value":"9783031453328","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45332-8_4","type":"book-chapter","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:01:36Z","timestamp":1697605296000},"page":"72-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Predicting Memory Demands of\u00a0BDD Operations Using Maximum Graph Cuts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0963-6569","authenticated-orcid":false,"given":"Steffan Christ","family":"S\u00f8lvsten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4305-0625","authenticated-orcid":false,"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"issue":"9","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). https:\/\/doi.org\/10.1145\/48529.48535","journal-title":"Commun. ACM"},{"key":"4_CR2","unstructured":"Amar\u00fa, L., Gaillardon, P.E., De Micheli, G.: The EPFL combinational benchmark suite. In: 24th International Workshop on Logic & Synthesis (2015)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"e823","DOI":"10.7717\/peerj-cs.823","volume":"8","author":"EG Amparore","year":"2022","unstructured":"Amparore, E.G., Donatelli, S., Gall\u00e0, F.: starMC: an automata based CTL* model checker. PeerJ Comput. Sci. 8, e823 (2022)","journal-title":"PeerJ Comput. Sci."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0015411","volume-title":"Algorithms and Computations","author":"L Arge","year":"1995","unstructured":"Arge, L.: The I\/O-complexity of ordered binary-decision diagram manipulation. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 82\u201391. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015411"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Arge, L.: The I\/O-complexity of ordered binary-decision diagram. In: BRICS RS preprint series, vol. 29. Department of Computer Science, University of Aarhus (1996). https:\/\/doi.org\/10.7146\/brics.v3i29.20010","DOI":"10.7146\/brics.v3i29.20010"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Ashar, P., Cheong, M.: Efficient breadth-first manipulation of binary decision diagrams. In: IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 622\u2013627. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/ICCAD.1994.629886","DOI":"10.1109\/ICCAD.1994.629886"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient implementation of a BDD package. In: 27th Design Automation Conference (DAC), pp. 40\u201345. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1109\/DAC.1990.114826","DOI":"10.1109\/DAC.1990.114826"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676819","DOI":"10.1109\/TC.1986.1676819"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-030-99524-9_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2022","unstructured":"Bryant, R.E., Biere, A., Heule, M.J.H.: Clausal proofs for pseudo-Boolean reasoning. In: TACAS 2022. LNCS, vol. 13243, pp. 443\u2013461. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_25"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-030-79876-5_25","volume-title":"Automated Deduction \u2013 CADE 28","author":"RE Bryant","year":"2021","unstructured":"Bryant, R.E., Heule, M.J.H.: Dual proof generation for quantified Boolean formulas with a BDD-based solver. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 433\u2013449. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_25"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-030-72016-2_5","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2021","unstructured":"Bryant, R.E., Heule, M.J.H.: Generating extended resolution proofs with a BDD-based SAT solver. In: TACAS 2021. LNCS, vol. 12651, pp. 76\u201393. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_5"},{"key":"4_CR12","unstructured":"Chen, J., Revels, J.: Robust benchmarking in noisy environments. arXiv (2016). https:\/\/arxiv.org\/abs\/1608.04295"},{"key":"4_CR13","unstructured":"Chiang, Y.J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 139\u2013149. SODA 1995, Society for Industrial and Applied Mathematics (1995)"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1530873.1530885","volume":"36","author":"G Ciardo","year":"2009","unstructured":"Ciardo, G., Miner, A.S., Wan, M.: Advanced features in SMART: the stochastic model checking analyzer for reliability and timing. SIGMETRICS Perform. Evaluation Rev. 36(4), 58\u201363 (2009)","journal-title":"SIGMETRICS Perform. Evaluation Rev."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A Cimatti","year":"2000","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NuSMV: a new symbolic model checker. Int. J. Softw. Tools Technol. Transfer 2, 410\u2013425 (2000). https:\/\/doi.org\/10.1007\/s100090050046","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10009-016-0433-2","volume":"19","author":"T Van Dijk","year":"2016","unstructured":"Van Dijk, T., Van de Pol, J.: Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transfer 19, 675\u2013696 (2016). https:\/\/doi.org\/10.1007\/s10009-016-0433-2","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-27813-9_41","volume-title":"Computer Aided Verification","author":"P Gammie","year":"2004","unstructured":"Gammie, P., van der Meyden, R.: MCK: model checking the logic of knowledge. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 479\u2013483. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_41"},{"key":"4_CR18","unstructured":"He, L., Liu, G.: Petri net based symbolic model checking for computation tree logic of knowledge. arXiv (2020). https:\/\/arxiv.org\/abs\/2012.10126"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Hellings, J., Fletcher, G.H., Haverkort, H.: Efficient external-memory bisimulation on DAGs. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 553\u2013564. SIGMOD 2012, Association for Computing Machinery (2012). https:\/\/doi.org\/10.1145\/2213836.2213899, https:\/\/doi.org\/10.1145\/2213836.2213899","DOI":"10.1145\/2213836.2213899"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/978-3-662-46681-0_61","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Kant","year":"2015","unstructured":"Kant, G., Laarman, A., Meijer, J., van de Pol, J., Blom, S., van Dijk, T.: LTSmin: high-performance language-independent model checking. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 692\u2013707. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_61"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Kunkle, D., Slavici, V., Cooperman, G.: Parallel disk-based computation for large, monolithic binary decision diagrams. In: 4th International Workshop on Parallel Symbolic Computation (PASCO), pp. 63\u201372 (2010). https:\/\/doi.org\/10.1145\/1837210.1837222","DOI":"10.1145\/1837210.1837222"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Lampis, M., Kaouri, G., Mitsou, V.: On the algorithmic effectiveness of digraph decompositions and complexity measures. Discrete Optim. 8(1), 129\u2013138 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2010.03.010. parameterized Complexity of Discrete Optimization","DOI":"10.1016\/j.disopt.2010.03.010"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10009-015-0378-x","volume":"19","author":"A Lomuscio","year":"2015","unstructured":"Lomuscio, A., Qu, H., Raimondi, F.: MCMAS: an open-source model checker for the verification of multi-agent systems. Int. J. Softw. Tools Technol. Transfer 19(1), 9\u201330 (2015). https:\/\/doi.org\/10.1007\/s10009-015-0378-x","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.: Algorithms for Memory Hierarchies: Advanced Lectures. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36574-5","DOI":"10.1007\/3-540-36574-5"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-49519-3_32","volume-title":"Formal Methods in Computer-Aided Design","author":"K Milvang-Jensen","year":"1998","unstructured":"Milvang-Jensen, K., Hu, A.J.: BDDNOW: a parallel BDD package. In: Gopalakrishnan, G., Windley, P. (eds.) FMCAD 1998. LNCS, vol. 1522, pp. 501\u2013507. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49519-3_32"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Minato, S.I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th Design Automation Conference (DAC), pp. 272\u2013277. Association for Computing Machinery (1993). https:\/\/doi.org\/10.1145\/157485.164890","DOI":"10.1145\/157485.164890"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Minato, S.I., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient Boolean function manipulation. In: 27th Design Automation Conference (DAC), pp. 52\u201357. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1145\/123186.123225","DOI":"10.1145\/123186.123225"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"M\u00f8lhave, T.: Using TPIE for processing massive data sets in C++. Duke University, Durham, NC, Technical report (2012)","DOI":"10.1145\/2367574.2367579"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Ochi, H., Yasuoka, K., Yajima, S.: Breadth-first manipulation of very large binary-decision diagrams. In: International Conference on Computer Aided Design (ICCAD), pp. 48\u201355. IEEE Computer Society Press (1993). https:\/\/doi.org\/10.1109\/ICCAD.1993.580030","DOI":"10.1109\/ICCAD.1993.580030"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991). https:\/\/doi.org\/10.1016\/0022-0000(91)90023-X","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR31","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":"4_CR32","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C.: BDD Benchmark. Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.7040263","DOI":"10.5281\/zenodo.7040263"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Adiar 1.0.1 : Experiment data (11 2021). https:\/\/doi.org\/10.5281\/zenodo.5638551","DOI":"10.5281\/zenodo.5638551"},{"key":"4_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-031-33170-1_28","volume-title":"NASA Formal Methods","author":"SC S\u00f8lvsten","year":"2023","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Adiar 1.1: zero-suppressed decision diagrams in external memory. In: Rozier, K.Y., Chaudhuri, S. (eds.) NFM 2023. LNCS, vol. 13903, pp. 464\u2013471. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33170-1_28"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Adiar 1.1.0 : experiment data (2023). https:\/\/doi.org\/10.5281\/zenodo.7709134","DOI":"10.5281\/zenodo.7709134"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Adiar 1.2.0 : experiment data (2023). https:\/\/doi.org\/10.5281\/zenodo.8124120","DOI":"10.5281\/zenodo.8124120"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"S\u00f8lvsten, S.C., van de Pol, J.: Predicting memory demands of BDD operations using maximum graph cuts (extended paper) (2023)","DOI":"10.1007\/978-3-031-45332-8_4"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-030-99527-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SC S\u00f8lvsten","year":"2022","unstructured":"S\u00f8lvsten, S.C., de Pol, J., Jakobsen, A.B., Thomasen, M.W.B.: Adiar binary decision diagrams in external memory. In: TACAS 2022. LNCS, vol. 13244, pp. 295\u2013313. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_16"},{"key":"4_CR39","unstructured":"Somenzi, F.: CUDD: CU decision diagram package, 3.0. Technical report, University of Colorado at Boulder (2015)"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Stornetta, T., Brewer, F.: Implementation of an efficient parallel BDD package. In: Design Automation Conference Proceedings, vol. 33, pp. 641\u2013644 (1996). https:\/\/doi.org\/10.1109\/DAC.1996.545653","DOI":"10.1109\/DAC.1996.545653"},{"key":"4_CR41","unstructured":"Vengroff, D.E.: A transparent parallel I\/O environment. In: In Proceedings of 1994 DAGS Symposium on Parallel Computation, pp. 117\u2013134 (1994)"},{"issue":"7","key":"4_CR42","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/263767.263784","volume":"32","author":"B Yang","year":"1997","unstructured":"Yang, B., O\u2019Hallaron, D.R.: Parallel breadth-first BDD construction. SIGPLAN Not. 32(7), 145\u2013156 (1997). https:\/\/doi.org\/10.1145\/263767.263784","journal-title":"SIGPLAN Not."}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45332-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T03:03:58Z","timestamp":1703387038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45332-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453311","9783031453328"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45332-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","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":"115","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":"30","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":"26% - 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.05","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","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)"}},{"value":"7 tool papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}