{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:06:22Z","timestamp":1767927982435,"version":"3.49.0"},"publisher-location":"Cham","reference-count":54,"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_10","type":"book-chapter","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:01:36Z","timestamp":1697605296000},"page":"199-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fast Equivalence Checking of\u00a0Quantum Circuits of\u00a0Clifford Gates"],"prefix":"10.1007","author":[{"given":"Dimitrios","family":"Thanos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Coopmans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfons","family":"Laarman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Gottesman, D.: Improved simulation of stabilizer circuits. Phys. Rev. A 70(5) (2004). https:\/\/doi.org\/10.1103%2Fphysreva.70.052328","DOI":"10.1103\/PhysRevA.70.052328"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"LM Adleman","year":"1997","unstructured":"Adleman, L.M., Demarrais, J., Huang, M.D.A.: Quantum computability. SIAM J. Comput. 26(5), 1524\u20131540 (1997)","journal-title":"SIAM J. Comput."},{"key":"10_CR3","unstructured":"Amy, M.: Personal communication (2023)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Amy, M.: Towards large-scale functional verification of universal quantum circuits. arXiv:1805.06908 (2018)","DOI":"10.4204\/EPTCS.287.1"},{"key":"10_CR5","unstructured":"Amy, M.: Formal methods in quantum circuit design. Ph.D. thesis (2019)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"10_CR7","unstructured":"Arunachalam, S., Bravyi, S., Nirkhe, C., O\u2019Gorman, B.: The parameterized complexity of quantum verification. arXiv:2202.08119 (2022)"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1088\/1367-2630\/7\/1\/170","volume":"7","author":"KMR Audenaert","year":"2005","unstructured":"Audenaert, K.M.R., Plenio, M.B.: Entanglement on mixed stabilizer states: normal forms and reduction procedures. New J. Phys. 7(1), 170 (2005)","journal-title":"New J. Phys."},{"key":"10_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-031-27481-7_12","volume-title":"Formal Methods","author":"F Bauer-Marquart","year":"2023","unstructured":"Bauer-Marquart, F., Leue, S., Schilling, C.: symQV: automated symbolic verification of quantum programs. In: Chechik, M., Katoen, J.P., Leucker, M. (eds.) FM 2023. LNCS, vol. 14000, pp. 181\u2013198. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_12"},{"key":"10_CR10","unstructured":"Berent, L., Burgholzer, L., Wille, R.: Towards a SAT encoding for quantum circuits: a journey from classical circuits to Clifford circuits and beyond. arXiv:2203.00698 (2022)"},{"key":"10_CR11","unstructured":"Bookatz, A.D.: QMA-complete problems. arXiv:1212.6312 (2012)"},{"key":"10_CR12","unstructured":"Brakerski, Z., Sharma, D., Weissenberg, G.: Unitary subgroup testing. arXiv:2104.03591 (2021)"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., Howard, M.: Simulation of quantum circuits by low-rank stabilizer decompositions. Quantum 3, 181 (2019). https:\/\/doi.org\/10.22331\/q-2019-09-02-181","DOI":"10.22331\/q-2019-09-02-181"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A 71, 022316 (2005). https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.71.022316","DOI":"10.1103\/PhysRevA.71.022316"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Briegel, H.J., Browne, D.E., D\u00fcr, W., Raussendorf, R., Van den Nest, M.: Measurement-based quantum computation. Nat. Phys. 5(1), 19\u201326 (2009). https:\/\/doi.org\/10.1038\/nphys1157","DOI":"10.1038\/nphys1157"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Kueng, R., Wille, R.: Random stimuli generation for the verification of quantum circuits. In: Proceedings of the 26th Asia and South Pacific Design Automation Conference, pp. 767\u2013772 (2021)","DOI":"10.1145\/3394885.3431590"},{"issue":"9","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1810","DOI":"10.1109\/TCAD.2020.3032630","volume":"40","author":"L Burgholzer","year":"2020","unstructured":"Burgholzer, L., Wille, R.: Advanced equivalence checking for quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 40(9), 1810\u20131824 (2020)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Wille, R.: Improved DD-based equivalence checking of quantum circuits. In: 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 127\u2013132 (2020)","DOI":"10.1109\/ASP-DAC47756.2020.9045153"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Chen, T.F., Jiang, J.H.R., Hsieh, M.H.: Partial equivalence checking of quantum circuits. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 594\u2013604. IEEE (2022)","DOI":"10.1109\/QCE53715.2022.00082"},{"key":"10_CR20","unstructured":"C\u00f3rcoles, A.D., et al.: Challenges and opportunities of near-term quantum computing systems. arXiv:1910.02894 (2019)"},{"key":"10_CR21","unstructured":"Dimitrios Thanos, T.C., Laarman, A.: CCEC (Clifford-circuit equivalence checking) (2023). https:\/\/github.com\/System-Verification-Lab\/CCEC"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Duncan, R., Kissinger, A., Perdrix, S., van de Wetering, J.: Graph-theoretic simplification of quantum circuits with the ZX-calculus. Quantum 4, 279 (2020). https:\/\/doi.org\/10.22331\/q-2020-06-04-279","DOI":"10.22331\/q-2020-06-04-279"},{"key":"10_CR23","unstructured":"Finigan, W., Cubeddu, M., Lively, T., Flick, J., Narang, P.: Qubit allocation for noisy intermediate-scale quantum computers. arXiv:1810.08291 (2018)"},{"key":"10_CR24","first-page":"683","volume":"14","author":"HJ Garc\u00eda","year":"2014","unstructured":"Garc\u00eda, H.J., Markov, I.L., Cross, A.W.: On the geometry of stabilizer states. Quantum Inf. Comput. 14, 683\u2013720 (2014)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Gidney, C.: Stim: a fast stabilizer circuit simulator. Quantum 5, 497 (2021). https:\/\/doi.org\/10.22331\/q-2021-07-06-497","DOI":"10.22331\/q-2021-07-06-497"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-24605-3_4","volume-title":"Theory and Applications of Satisfiability Testing","author":"E Goldberg","year":"2004","unstructured":"Goldberg, E., Novikov, Y.: How good can a resolution based SAT-solver\u00a0be? In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 37\u201352. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_4"},{"key":"10_CR27","unstructured":"Gottesman, D.: Stabilizer codes and quantum error correction. arXiv:quant-ph\/9705052 (1997)"},{"key":"10_CR28","unstructured":"Gottesman, D.: The Heisenberg representation of quantum computers. arXiv:quant-ph\/9807006v1 (1998)"},{"key":"10_CR29","unstructured":"Hein, M., D\u00fcr, W., Eisert, J., Raussendorf, R., Nest, M., Briegel, H.J.: Entanglement in graph states and its applications. arXiv:0602096 (2006)"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Hong, X., Ying, M., Feng, Y., Zhou, X., Li, S.: Approximate equivalence checking of noisy quantum circuits. In: 2021 58th ACM\/IEEE Design Automation Conference (DAC), pp. 637\u2013642 (2021)","DOI":"10.1109\/DAC18074.2021.9586214"},{"issue":"03","key":"10_CR31","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0219749905001067","volume":"3","author":"D Janzing","year":"2005","unstructured":"Janzing, D., Wocjan, P., Beth, T.: \u201cnon-identity-check\u2019\u2019 is QMA-complete. Int. J. Quantum Inf. 3(03), 463\u2013473 (2005)","journal-title":"Int. J. Quantum Inf."},{"key":"10_CR32","unstructured":"Ji, Z., Wu, X.: Non-identity check remains QMA-complete for short circuits. arXiv:0906.5416 (2009)"},{"issue":"5","key":"10_CR33","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0375-9601(03)00941-1","volume":"314","author":"G Kimura","year":"2003","unstructured":"Kimura, G.: The bloch vector for n-level systems. Phys. Lett. A 314(5), 339\u2013349 (2003)","journal-title":"Phys. Lett. A"},{"key":"10_CR34","unstructured":"Kuehlmann, A.: Dynamic transition relation simplification for bounded property checking. In: IEEE\/ACM International Conference on Computer Aided Design, ICCAD-2004, pp. 50\u201357 (2004)"},{"issue":"12","key":"10_CR35","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1109\/TCAD.2002.804386","volume":"21","author":"A Kuehlmann","year":"2002","unstructured":"Kuehlmann, A., Paruthi, V., Krohm, F., Ganai, M.: Robust boolean reasoning for equivalence checking and functional property verification. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 21(12), 1377\u20131394 (2002)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"10_CR36","doi-asserted-by":"publisher","first-page":"436","DOI":"10.22331\/q-2021-04-20-436","volume":"5","author":"N Linden","year":"2021","unstructured":"Linden, N., de Wolf, R.: Lightweight detection of a small number of large errors in a quantum circuit. Quantum 5, 436 (2021)","journal-title":"Quantum"},{"key":"10_CR37","unstructured":"Lucas Berent, L.B., Wille, R.: MQT QuSAT - a tool for utilizing sat in quantum computing (2022). https:\/\/github.com\/cda-tum\/qusat"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Montanaro, A.: Quantum algorithms: an overview. NPJ Quantum Inf. 2(1), 15023 (2016). https:\/\/doi.org\/10.1038\/npjqi.2015.23","DOI":"10.1038\/npjqi.2015.23"},{"key":"10_CR39","unstructured":"Montanaro, A., de Wolf, R.: A survey of quantum property testing. arXiv:1310.2035 (2013)"},{"key":"10_CR40","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Information and Quantum Computation, vol. 2, no. 8, p. 23. Cambridge University Press, Cambridge (2000)"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-319-08494-7_16","volume-title":"Reversible Computation","author":"P Niemann","year":"2014","unstructured":"Niemann, P., Wille, R., Drechsler, R.: Equivalence checking in multi-level quantum systems. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 201\u2013215. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08494-7_16"},{"issue":"3","key":"10_CR42","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/JETCAS.2022.3202204","volume":"12","author":"T Peham","year":"2022","unstructured":"Peham, T., Burgholzer, L., Wille, R.: Equivalence checking of quantum circuits with the ZX-calculus. IEEE J. Emerg. Sel. Top. Circuits Syst. 12(3), 662\u2013675 (2022)","journal-title":"IEEE J. Emerg. Sel. Top. Circuits Syst."},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"issue":"05","key":"10_CR44","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1142\/S0219749910006599","volume":"8","author":"Y Tanaka","year":"2010","unstructured":"Tanaka, Y.: Exact non-identity check is NQP-complete. Int. J. Quantum Inf. 8(05), 807\u2013819 (2010)","journal-title":"Int. J. Quantum Inf."},{"key":"10_CR45","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1103\/RevModPhys.87.307","volume":"87","author":"BM Terhal","year":"2015","unstructured":"Terhal, B.M.: Quantum error correction for quantum memories. Rev. Mod. Phys. 87, 307\u2013346 (2015). https:\/\/doi.org\/10.1103\/RevModPhys.87.307","journal-title":"Rev. Mod. Phys."},{"key":"10_CR46","doi-asserted-by":"crossref","unstructured":"Viamontes, G.F., Markov, I.L., Hayes, J.P.: Checking equivalence of quantum circuits and states. In: 2007 IEEE\/ACM International Conference on Computer-Aided Design, pp. 69\u201374 (2007)","DOI":"10.1109\/ICCAD.2007.4397246"},{"key":"10_CR47","doi-asserted-by":"crossref","unstructured":"Vinkhuijzen, L., Coopmans, T., Elkouss, D., Dunjko, V., Laarman, A.: LIMDD a decision diagram for simulation of quantum computing including stabilizer states. Quantum (2023, accepted for publication). https:\/\/arxiv.org\/abs\/2108.00931","DOI":"10.22331\/q-2023-09-11-1108"},{"key":"10_CR48","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-32157-3_1","volume-title":"Model Checking Software","author":"L Vinkhuijzen","year":"2023","unstructured":"Vinkhuijzen, L., Grurl, T., Hillmich, S., Brand, S., Wille, R., Laarman, A.: Efficient implementation of LIMDDs for quantum circuit simulation. In: Caltais, G., Schilling, C. (eds.) SPIN 2023. LNCS, vol. 13872, pp. 3\u201321. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32157-3_1"},{"issue":"2","key":"10_CR49","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1093\/ietfec\/e91-a.2.584","volume":"91","author":"SA Wang","year":"2008","unstructured":"Wang, S.A., Lu, C.Y., Tsai, I.M., Kuo, S.Y.: An XQDD-based verification method for quantum circuits. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(2), 584\u2013594 (2008)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"Wei, C.Y., Tsai, Y.H., Jhang, C.S., Jiang, J.H.R.: Accurate BDD-based unitary operator manipulation for scalable and robust quantum circuit verification. In: Proceedings of the 59th ACM\/IEEE Design Automation Conference, pp. 523\u2013528 (2022)","DOI":"10.1145\/3489517.3530481"},{"key":"10_CR51","unstructured":"van de Wetering, J.: ZX-calculus for the working quantum computer scientist. arxiv (2020). https:\/\/arxiv.org\/abs\/2012.13966"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Wille, R., Przigoda, N., Drechsler, R.: A compact and efficient sat encoding for quantum circuits. In: 2013 Africon, pp. 1\u20136. IEEE (2013)","DOI":"10.1109\/AFRCON.2013.6757630"},{"key":"10_CR53","doi-asserted-by":"crossref","unstructured":"Yamashita, S., Markov, I.L.: Fast equivalence-checking for quantum circuits. In: 2010 IEEE\/ACM International Symposium on Nanoscale Architectures, pp. 23\u201328. IEEE (2010)","DOI":"10.1109\/NANOARCH.2010.5510932"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Yamashita, S., Minato, S.I., Miller, D.M.: DDMF: an efficient decision diagram structure for design verification of quantum circuits under a practical restriction. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91(12), 3793\u20133802 (2008)","DOI":"10.1093\/ietfec\/e91-a.12.3793"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T05:03:26Z","timestamp":1697605406000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45332-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453311","9783031453328"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45332-8_10","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)"}}]}}