{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:21:06Z","timestamp":1776316866904,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572272","type":"print"},{"value":"9783031572289","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>In this paper, we extend diagrammatic reasoning in monoidal categories with algebraic operations and equations. We achieve this by considering monoidal categories that are enriched in the category of Eilenberg-Moore algebras for a monad. Under the condition that this monad is monoidal and there is an adjunction between the free algebra functor and the underlying category functor, we construct an adjunction between symmetric monoidal categories and symmetric monoidal categories enriched over algebras for the monad. This allows us to devise an extension, and its semantics, of the ZX-calculus with probabilistic choices by freely enriching over convex algebras, which are the algebras of the finite distribution monad. We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.<\/jats:p>","DOI":"10.1007\/978-3-031-57228-9_7","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T08:03:04Z","timestamp":1712217784000},"page":"121-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Enriching Diagrams with Algebraic Operations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0787-2568","authenticated-orcid":false,"given":"Alejandro","family":"Villoria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-8331","authenticated-orcid":false,"given":"Henning","family":"Basold","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2433-4174","authenticated-orcid":false,"given":"Alfons","family":"Laarman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"7_CR1","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols (Mar 2007), http:\/\/arxiv.org\/abs\/quant-ph\/0402130, arXiv:quant-ph\/0402130"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Banaschewski, B., Nelson, E.: Tensor products and bimorphisms. Canadian Mathematical Bulletin 19(4), 385\u2013402 (1976). https:\/\/doi.org\/10.4153\/CMB-1976-060-2","DOI":"10.4153\/CMB-1976-060-2"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories, vol.\u00a0278. Springer-Verlag New York (1985)","DOI":"10.1007\/978-1-4899-0021-0"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"de\u00a0Beaudrap, N., Horsman, D.: The ZX calculus is a language for surface code lattice surgery. Quantum 4, \u00a0218 (jan 2020). https:\/\/doi.org\/10.22331\/q-2020-01-09-218, https:\/\/doi.org\/10.22331%2Fq-2020-01-09-218","DOI":"10.22331\/q-2020-01-09-218"},{"key":"7_CR5","unstructured":"Bonchi, F., Di\u00a0Giorgio, A., Santamaria, A.: Deconstructing the Calculus of Relations with Tape Diagrams (Oct 2022), http:\/\/arxiv.org\/abs\/2210.09950, arXiv:2210.09950 [cs]"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Bonet-Monroig, X., Sagastizabal, R., Singh, M., O\u2019Brien, T.E.: Low-cost error mitigation by symmetry verification. Physical Review A 98(6), 062339 (Dec 2018). https:\/\/doi.org\/10.1103\/PhysRevA.98.062339, http:\/\/arxiv.org\/abs\/1807.10050, arXiv:1807.10050 [quant-ph]","DOI":"10.1103\/PhysRevA.98.062339"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Borceux, F.: Handbook of Categorical Algebra, Encyclopedia of Mathematics and its Applications, vol.\u00a02. Cambridge University Press (1994). https:\/\/doi.org\/10.1017\/CBO9780511525865","DOI":"10.1017\/CBO9780511525865"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Borceux, F.: Handbook of Categorical Algebra: Volume 1: Basic Category Theory, Encyclopedia of Mathematics and Its Applications, vol.\u00a01. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/CBO9780511525858","DOI":"10.1017\/CBO9780511525858"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Borgna, A., Perdrix, S., Valiron, B.: Hybrid quantum-classical circuit simplification with the ZX-calculus. vol. 13008, pp. 121\u2013139 (2021). https:\/\/doi.org\/10.1007\/978-3-030-89051-3_8, http:\/\/arxiv.org\/abs\/2109.06071, arXiv:2109.06071 [quant-ph]","DOI":"10.1007\/978-3-030-89051-3_8"},{"key":"7_CR10","unstructured":"Brandenburg, M.: Tensor categorical foundations of algebraic geometry (Oct 2014), http:\/\/arxiv.org\/abs\/1410.1716, arXiv:1410.1716 [math]"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Cai, Z., Babbush, R., Benjamin, S.C., Endo, S., Huggins, W.J., Li, Y., McClean, J.R., O\u2019Brien, T.E.: Quantum Error Mitigation (Jun 2023), http:\/\/arxiv.org\/abs\/2210.00921, arXiv:2210.00921 [quant-ph]","DOI":"10.1103\/RevModPhys.95.045005"},{"key":"7_CR12","unstructured":"Carette, T., Horsman, D., Perdrix, S.: SZX-calculus: Scalable Graphical Quantum Reasoning"},{"key":"7_CR13","unstructured":"Carette, T., Jeandel, E., Perdrix, S., Vilmart, R.: Completeness of Graphical Languages for Mixed States Quantum Mechanics (Feb 2019), http:\/\/arxiv.org\/abs\/1902.07143, arXiv:1902.07143 [quant-ph]"},{"key":"7_CR14","unstructured":"Chardonnet, K., de\u00a0Visme, M., Valiron, B., Vilmart, R.: The many-worlds calculus (2022)"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Coecke, B., Duncan, R.: Interacting Quantum Observables: Categorical Algebra and Diagrammatics. New Journal of Physics 13(4), 043016 (Apr 2011). https:\/\/doi.org\/10.1088\/1367-2630\/13\/4\/043016, http:\/\/arxiv.org\/abs\/0906.4725, arXiv:0906.4725 [quant-ph]","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"7_CR16","unstructured":"Comfort, C., Delpeuch, A., Hedges, J.: Sheet diagrams for bimonoidal categories (Dec 2020), http:\/\/arxiv.org\/abs\/2010.13361, arXiv:2010.13361 [math]"},{"key":"7_CR17","unstructured":"Cruttwell, G.: Normed spaces and the change of base for enriched categories (2008)"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Day, B., Street, R.: Monoidal Bicategories and Hopf Algebroids. Advances in Mathematics 129(1), 99\u2013157 (Jul 1997). https:\/\/doi.org\/10.1006\/aima.1997.1649, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0001870897916492","DOI":"10.1006\/aima.1997.1649"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"de Paiva, V.: Categorical Semantics of Linear Logic for All. In: Pereira, L.C., Haeusler, E.H., de Paiva, V. (eds.) Advances in Natural Deduction: A Celebration of Dag Prawitz\u2019s Work, pp. 181\u2013192. Trends in Logic, Springer Netherlands, Dordrecht (2014). https:\/\/doi.org\/10.1007\/978-94-007-7548-0_9","DOI":"10.1007\/978-94-007-7548-0_9"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Heunen, C., Vicary, J.: Categories for Quantum Theory: An Introduction. Oxford University Press (11 2019). https:\/\/doi.org\/10.1093\/oso\/9780198739623.001.0001, https:\/\/doi.org\/10.1093\/oso\/9780198739623.001.0001","DOI":"10.1093\/oso\/9780198739623.001.0001 10.1093\/oso\/9780198739623.001.0001"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Hyland, M., Power, J.: The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads. Electronic Notes in Theoretical Computer Science 172, 437\u2013458 (Apr 2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.019","DOI":"10.1016\/j.entcs.2007.02.019"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Convexity, duality and effects. In: Calude, C.S., Sassone, V. (eds.) Theoretical Computer Science. pp. 1\u201319. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15240-5_1"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic. Logical Methods in Computer Science Volume 11, Issue 3, \u00a01600 (Oct 2015). https:\/\/doi.org\/10.2168\/LMCS-11(3:24)2015, https:\/\/lmcs.episciences.org\/1600","DOI":"10.2168\/LMCS-11(3:24)2015"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Affine Monads and Side-Effect-Freeness. In: Hasuo, I. (ed.) Coalgebraic Methods in Computer Science. pp. 53\u201372. Springer International Publishing, Cham (2016)","DOI":"10.1007\/978-3-319-40370-0_5"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Jeandel, E., Perdrix, S., Veshchezerova, M.: Addition and Differentiation of ZX-diagrams (Mar 2023). https:\/\/doi.org\/10.48550\/arXiv.2202.11386, http:\/\/arxiv.org\/abs\/2202.11386, arXiv:2202.11386 [quant-ph]","DOI":"10.48550\/arXiv.2202.11386"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Kakkar, A., Larson, J., Galda, A., Shaydulin, R.: Characterizing error mitigation by symmetry verification in QAOA. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE (sep 2022). https:\/\/doi.org\/10.1109\/qce53715.2022.00086, https:\/\/doi.org\/10.1109%2Fqce53715.2022.00086","DOI":"10.1109\/qce53715.2022.00086"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Kelly, G.M., Street, R.: Review of the elements of 2-categories. In: Kelly, G.M. (ed.) Category Seminar. pp. 75\u2013103. Lecture Notes in Mathematics, Springer, Berlin, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0063101","DOI":"10.1007\/BFb0063101"},{"key":"7_CR28","unstructured":"Kelly, M.: Basic Concepts of Enriched Category Theory. No.\u00a064 in Lecture Notes in Mathematics, Cambridge University Press, reprints in theory and applications of categories, no. 10 (2005) edn. (1982), http:\/\/www.tac.mta.ca\/tac\/reprints\/articles\/10\/tr10abs.html"},{"key":"7_CR29","unstructured":"Kissinger, A.: Phase-free zx diagrams are css codes (...or how to graphically grok the surface code) (2022)"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Kissinger, A., van\u00a0de Wetering, J.: Reducing the number of non-clifford gates in quantum circuits. Physical Review A 102(2) (aug 2020). https:\/\/doi.org\/10.1103\/physreva.102.022406, https:\/\/doi.org\/10.1103%2Fphysreva.102.022406","DOI":"10.1103\/physreva.102.022406"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Kissinger, A., van\u00a0de Wetering, J.: Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions. Quantum Science and Technology 7(4), 044001 (jul 2022). https:\/\/doi.org\/10.1088\/2058-9565\/ac5d20, https:\/\/doi.org\/10.1088%2F2058-9565%2Fac5d20","DOI":"10.1088\/2058-9565\/ac5d20"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Kock, A.: Closed categories generated by commutative monads. Journal of the Australian Mathematical Society 12(4), 405\u2013424 (1971). https:\/\/doi.org\/10.1017\/S1446788700010272","DOI":"10.1017\/S1446788700010272"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Kong, L., Yuan, W., Zhang, Z.H., Zheng, H.: Enriched monoidal categories I: Centers (Apr 2021). https:\/\/doi.org\/10.48550\/arXiv.2104.03121, http:\/\/arxiv.org\/abs\/2104.03121","DOI":"10.48550\/arXiv.2104.03121"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Leinster, T.: Basic Category Theory. Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge (2014). https:\/\/doi.org\/10.1017\/CBO9781107360068","DOI":"10.1017\/CBO9781107360068"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Mac\u00a0Lane, S.: Categories for the Working Mathematician, Graduate Texts in Mathematics, vol.\u00a05. Springer, New York, NY (1978). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8, http:\/\/link.springer.com\/10.1007\/978-1-4757-4721-8","DOI":"10.1007\/978-1-4757-4721-8"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Manes, E.G.: Algebraic Theories, Graduate Texts in Mathematics, vol.\u00a026. Springer, New York, NY (1976). https:\/\/doi.org\/10.1007\/978-1-4612-9860-1","DOI":"10.1007\/978-1-4612-9860-1"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Notions of Computation and Monads. Information and Computation 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Morrison, S., Penneys, D.: Monoidal categories enriched in braided monoidal categories (Jan 2017), http:\/\/arxiv.org\/abs\/1701.00567, arXiv:1701.00567 [math]","DOI":"10.1093\/imrn\/rnx217"},{"key":"7_CR39","unstructured":"Muuss, G.: Linear combinations of ZX-diagrams for parameterized quantum circuits (Nov 2022), https:\/\/updownup.de\/masterthesis.pdf"},{"key":"7_CR40","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Peham, T., Burgholzer, L., Wille, R.: Equivalence checking of quantum circuits with the ZX-calculus. IEEE Journal on Emerging and Selected Topics in Circuits and Systems 12(3), 662\u2013675 (sep 2022). https:\/\/doi.org\/10.1109\/jetcas.2022.3202204, https:\/\/doi.org\/10.1109%2Fjetcas.2022.3202204","DOI":"10.1109\/jetcas.2022.3202204"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Peng, T., Harrow, A.W., Ozols, M., Wu, X.: Simulating large quantum circuits on a small quantum computer. Physical Review Letters 125(15) (oct 2020). https:\/\/doi.org\/10.1103\/physrevlett.125.150504, https:\/\/doi.org\/10.1103%2Fphysrevlett.125.150504","DOI":"10.1103\/physrevlett.125.150504"},{"key":"7_CR43","doi-asserted-by":"publisher","unstructured":"Plotkin, G.D., Power, J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) Proceedings of Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Lecture Notes in Computer Science, vol.\u00a02303, pp. 342\u2013356. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_24","DOI":"10.1007\/3-540-45931-6_24"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"P\u00e9rez-Salinas, A., Dra\u0161ki\u0107, R., Tura, J., Dunjko, V.: Reduce &chop: Shallow circuits for deeper problems (May 2023), http:\/\/arxiv.org\/abs\/2212.11862, arXiv:2212.11862 [quant-ph]","DOI":"10.1103\/PhysRevA.108.062423"},{"key":"7_CR45","unstructured":"Riehl, E.: Category Theory in Context. Aurora: Dover Modern Math Originals, Dover Publications (2016), http:\/\/www.math.jhu.edu\/~eriehl\/context\/"},{"key":"7_CR46","unstructured":"Seal, G.J.: Tensors, monads and actions (Jun 2013), http:\/\/arxiv.org\/abs\/1205.0101, arXiv:1205.0101 [math]"},{"key":"7_CR47","doi-asserted-by":"publisher","unstructured":"Selinger, P.: A Survey of Graphical Languages for Monoidal Categories. In: Coecke, B. (ed.) New Structures for Physics, pp. 289\u2013355. Lecture Notes in Physics, Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-12821-9_4","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"7_CR48","doi-asserted-by":"publisher","unstructured":"Selinger, P.: Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). Electronic Notes in Theoretical Computer Science 170, 139\u2013163 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2006.12.018, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571066107000606","DOI":"10.1016\/j.entcs.2006.12.018"},{"key":"7_CR49","doi-asserted-by":"publisher","unstructured":"Shaikh, R.A., Wang, Q., Yeung, R.: How to sum and exponentiate Hamiltonians in ZXW calculus (Dec 2022). https:\/\/doi.org\/10.48550\/arXiv.2212.04462, http:\/\/arxiv.org\/abs\/2212.04462, arXiv:2212.04462 [quant-ph]","DOI":"10.48550\/arXiv.2212.04462"},{"key":"7_CR50","unstructured":"Stollenwerk, T., Hadfield, S.: Diagrammatic Analysis for Parameterized Quantum Circuits (Apr 2022), http:\/\/arxiv.org\/abs\/2204.01307, arXiv:2204.01307 [quant-ph]"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Villoria, A., Basold, H., Laarman, A.: Enriching diagrams with algebraic operations (2023)","DOI":"10.1007\/978-3-031-57228-9_7"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Vilmart, R.: A Near-Optimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics (Dec 2018), http:\/\/arxiv.org\/abs\/1812.09114, arXiv:1812.09114 [quant-ph]","DOI":"10.1109\/LICS.2019.8785765"},{"key":"7_CR53","unstructured":"van\u00a0de Wetering, J.: ZX-calculus for the working quantum computer scientist (Dec 2020), http:\/\/arxiv.org\/abs\/2012.13966, arXiv:2012.13966 [quant-ph]"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57228-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T17:21:27Z","timestamp":1731691287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57228-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572272","9783031572289"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57228-9_7","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":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","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":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/fossacs\/","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":"79","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":"24","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":"30% - 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":"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)"}}]}}