{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:09:39Z","timestamp":1776305379731,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377082","type":"print"},{"value":"9783031377099","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"vor","delay-in-days":197,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a specification language and a\u00a0fully automated tool named <jats:sc>AutoQ<\/jats:sc> for verifying quantum circuits symbolically. The tool implements the automata-based algorithm from\u00a0[14] and extends it with the capabilities for symbolic reasoning. The extension allows to specify <jats:italic>relational<\/jats:italic> properties, i.e., relationships between states before and after executing a circuit. We present a number of use cases where we used <jats:sc>AutoQ<\/jats:sc> to fully automatically verify crucial properties of several quantum circuits, which have, to the best of our knowledge, so far been proved only with human help.<\/jats:p>","DOI":"10.1007\/978-3-031-37709-9_7","type":"book-chapter","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:01:21Z","timestamp":1689501681000},"page":"139-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["AutoQ: An Automata-Based Quantum Circuit Verifier"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2872-0336","authenticated-orcid":false,"given":"Yu-Fang","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3356-369X","authenticated-orcid":false,"given":"Kai-Min","family":"Chung","sequence":"additional","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-0001-8560-2147","authenticated-orcid":false,"given":"Jyun-Ao","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5832-0867","authenticated-orcid":false,"given":"Wei-Lun","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"key":"7_CR1","unstructured":"Aws braket. https:\/\/aws.amazon.com\/braket\/"},{"key":"7_CR2","unstructured":"IBM quantum. https:\/\/quantum-computing.ibm.com"},{"key":"7_CR3","unstructured":"The Qcec repository: Issue #200 (ZX-Checker produces invalid result) (2022). https:\/\/github.com\/cda-tum\/qcec\/issues\/200"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.-F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When simulation meets antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 158\u2013174. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_14"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Amy, M.: Towards large-scale functional verification of universal quantum circuits. In: Quantum Physics and Logic (2018)","DOI":"10.4204\/EPTCS.287.1"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-40578-0_16","volume-title":"Reversible Computation","author":"L Anticoli","year":"2016","unstructured":"Anticoli, L., Piazza, C., Taglialegne, L., Zuliani, P.: Towards quantum programs verification: from quipper circuits to QPMC. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 213\u2013219. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_16"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019). https:\/\/doi.org\/10.1038\/s41586-019-1666-5, number: 7779 Publisher: Nature Publishing Group","DOI":"10.1038\/s41586-019-1666-5"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bernstein, E., Vazirani, U.V.: Quantum complexity theory. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16\u201318, 1993, San Diego, CA, USA, pp. 11\u201320. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167097","DOI":"10.1145\/167088.167097"},{"key":"7_CR9","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive theorem proving and program development: Coq\u2019Art: the calculus of inductive constructions. Springer Science & Business Media (2013)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-70844-5_7","volume-title":"Implementation and Applications of Automata","author":"A Bouajjani","year":"2008","unstructured":"Bouajjani, A., Habermehl, P., Hol\u00edk, L., Touili, T., Vojnar, T.: Antichain-based universality and inclusion testing over nondeterministic finite tree automata. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol. 5148, pp. 57\u201367. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70844-5_7"},{"issue":"9","key":"7_CR11","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":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-72019-3_6","volume-title":"Programming Languages and Systems","author":"C Chareton","year":"2021","unstructured":"Chareton, C., Bardin, S., Bobot, F., Perrelle, V., Valiron, B.: An automated deductive verification framework for circuit-building quantum programs. In: ESOP 2021. LNCS, vol. 12648, pp. 148\u2013177. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72019-3_6"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Chen, Y., Chung, K., Leng\u00e1l, O., Lin, J., Tsai, W.: AutoQ: an automata-based quantum circuit verifier (May 2023). https:\/\/doi.org\/10.5281\/zenodo.7966542","DOI":"10.5281\/zenodo.7966542"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chung, K., Leng\u00e1l, O., Lin, J., Tsai, W., Yen, D.: An automata-based framework for verification and bug hunting in quantum circuits. In: 44th ACM SIGPLAN Conference on Programming Language Design and Implementation\u2013PLDI\u201923. ACM (2023)","DOI":"10.1145\/3591270"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables: categorical algebra and diagrammatics. New J. Phys. 13(4), 043016 (2011). https:\/\/doi.org\/10.1088\/1367-2630\/13\/4\/043016","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring (2002). https:\/\/doi.org\/10.48550\/arxiv.quant-ph\/0201067","DOI":"10.48550\/arxiv.quant-ph\/0201067"},{"key":"7_CR17","unstructured":"Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language. arXiv preprint arXiv:1707.03429 (2017)"},{"key":"7_CR18","unstructured":"Dawson, C.M., Nielsen, M.A.: The Solovay-Kitaev algorithm. arXiv preprint quant-ph\/0505030 (2005)"},{"key":"7_CR19","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"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1017\/S0960129506005251","volume":"16","author":"E D\u2019Hondt","year":"2006","unstructured":"D\u2019Hondt, E., Panangaden, P.: Quantum weakest preconditions. Math. Struct. Comput. Sci. 16(3), 429\u2013451 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-19249-9_17","volume-title":"FM 2015: Formal Methods","author":"Y Feng","year":"2015","unstructured":"Feng, Y., Hahn, E.M., Turrini, A., Zhang, L.: QPMC: a model checker for quantum programs and protocols. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 265\u2013272. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19249-9_17"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3456877","volume":"2","author":"Y Feng","year":"2021","unstructured":"Feng, Y., Ying, M.: Quantum Hoare logic with classical variables. ACM Trans. Quantum Comput. 2(4), 1\u201343 (2021)","journal-title":"ACM Trans. Quantum Comput."},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Feng, Y., Yu, N., Ying, M.: Model checking quantum Markov chains. J. Comput. Syst. Sci. 79(7), 1181\u20131198 (2013). https:\/\/doi.org\/10.1016\/j.jcss.2013.04.002","DOI":"10.1016\/j.jcss.2013.04.002"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-37036-6_8","volume-title":"Programming Languages and Systems","author":"J-C Filli\u00e2tre","year":"2013","unstructured":"Filli\u00e2tre, J.-C., Paskevich, A.: Why3 \u2014 where programs meet provers. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 125\u2013128. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_8"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22\u201324, 1996, pp. 212\u2013219. ACM (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"7_CR26","unstructured":"Hietala, K., Rand, R., Hung, S.H., Wu, X., Hicks, M.: Verified optimization in a quantum intermediate representation. arXiv preprint arXiv:1904.06319 (2019)"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385\u2013394 (1976). https:\/\/doi.org\/10.1145\/360248.360252","DOI":"10.1145\/360248.360252"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-28756-5_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Leng\u00e1l","year":"2012","unstructured":"Leng\u00e1l, O., \u0160im\u00e1\u010dek, J., Vojnar, T.: VATA: a library for efficient manipulation of non-deterministic tree automata. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 79\u201394. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28756-5_7"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-25543-5_12","volume-title":"Computer Aided Verification","author":"J Liu","year":"2019","unstructured":"Liu, J., Zhan, B., Wang, S., Ying, S., Liu, T., Li, Y., Ying, M., Zhan, N.: Formal verification of quantum algorithms using quantum hoare logic. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11562, pp. 187\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25543-5_12"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Mateus, P., Ramos, J., Sernadas, A., Sernadas, C.: Temporal Logics for Reasoning about Quantum Systems, pp. 389\u2013413. Cambridge University Press (2009). https:\/\/doi.org\/10.1017\/CBO9781139193313.011","DOI":"10.1017\/CBO9781139193313.011"},{"key":"7_CR31","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, USA (2011)","edition":"10"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Perdrix, S.: Quantum entanglement analysis based on abstract interpretation. In: International Static Analysis Symposium, pp. 270\u2013282. Springer (2008)","DOI":"10.1007\/978-3-540-69166-2_18"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20\u201322 November 1994. pp. 124\u2013134. IEEE Computer Society (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Tsai, Y., Jiang, J.R., Jhang, C.: Bit-slicing the Hilbert space: Scaling up accurate quantum circuit simulation. In: 58th ACM\/IEEE Design Automation Conference, DAC 2021, San Francisco, CA, USA, December 5\u20139, 2021, pp. 439\u2013444. IEEE (2021). https:\/\/doi.org\/10.1109\/DAC18074.2021.9586191","DOI":"10.1109\/DAC18074.2021.9586191"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Quantum Hoare logic with ghost variables. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785779"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Veanes, M., Bj\u00f8rner, N.S.: Symbolic tree automata. Inf. Process. Lett. 115(3), 418\u2013424 (2015). https:\/\/doi.org\/10.1016\/j.ipl.2014.11.005","DOI":"10.1016\/j.ipl.2014.11.005"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-71067-7_7","volume-title":"Theorem Proving in Higher Order Logics","author":"M Wenzel","year":"2008","unstructured":"Wenzel, M., Paulson, L.C., Nipkow, T.: The isabelle framework. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 33\u201338. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7_7"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Xu, M., Fu, J., Mei, J., Deng, Y.: Model checking QCTL plus on quantum Markov chains. Theor. Comput. Sci. 913, 43\u201372 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.01.044","DOI":"10.1016\/j.tcs.2022.01.044"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Xu, M., et al.: Quartz: superoptimization of quantum circuits. In: Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 625\u2013640 (2022)","DOI":"10.1145\/3519939.3523433"},{"issue":"6","key":"7_CR40","first-page":"1","volume":"33","author":"M Ying","year":"2012","unstructured":"Ying, M.: Floyd-Hoare logic for quantum programs. ACM Trans. Programm. Lang. Syst. (TOPLAS) 33(6), 1\u201349 (2012)","journal-title":"ACM Trans. Programm. Lang. Syst. (TOPLAS)"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Ying, M.: Model checking for verification of quantum circuits. In: International Symposium on Formal Methods, pp. 23\u201339. Springer (2021)","DOI":"10.1007\/978-3-030-90870-6_2"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Ying, M., Feng, Y.: Model Checking Quantum Systems: Principles and Algorithms. Cambridge University Press (2021)","DOI":"10.1017\/9781108613323"},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Yu, N., Palsberg, J.: Quantum abstract interpretation. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, pp. 542\u2013558 (2021)","DOI":"10.1145\/3453483.3454061"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yu, N., Ying, M.: An applied quantum Hoare logic. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 1149\u20131162 (2019)","DOI":"10.1145\/3314221.3314584"},{"key":"7_CR45","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Hillmich, S., Wille, R.: How to efficiently handle complex values? implementing decision diagrams for quantum computing. In: Pan, D.Z. (ed.) Proceedings of the International Conference on Computer-Aided Design, ICCAD 2019, Westminster, CO, USA, November 4\u20137, 2019. pp. 1\u20137. ACM (2019). https:\/\/doi.org\/10.1109\/ICCAD45719.2019.8942057","DOI":"10.1109\/ICCAD45719.2019.8942057"},{"key":"7_CR46","doi-asserted-by":"publisher","unstructured":"Zulehner, A., Wille, R.: Advanced simulation of quantum computations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(5), 848\u2013859 (2019). https:\/\/doi.org\/10.1109\/TCAD.2018.2834427","DOI":"10.1109\/TCAD.2018.2834427"}],"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-37709-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:02:24Z","timestamp":1689501744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37709-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377082","9783031377099"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37709-9_7","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":"17 July 2023","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":"Paris","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.i-cav.org\/2023\/","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":"hotcrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"261","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":"67","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","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":"11","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)"}}]}}