{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T01:01:21Z","timestamp":1784682081393,"version":"3.55.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031107351","type":"print"},{"value":"9783031107368","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-10736-8_6","type":"book-chapter","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T13:09:53Z","timestamp":1658495393000},"page":"110-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algebraic Presentation of\u00a0Semifree Monads"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7841-2318","authenticated-orcid":false,"given":"Alo\u00efs","family":"Rosset","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7061-1219","authenticated-orcid":false,"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Endrullis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,23]]},"reference":[{"issue":"1\u20133","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00728-4","volume":"300","author":"P Aczel","year":"2003","unstructured":"Aczel, P., Ad\u00e1mek, J., Milius, S., Velebil, J.: Infinite trees and completely iterative theories: a coalgebraic view. Theoret. Comput. Sci. 300(1\u20133), 1\u201345 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00728-4","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Adamek, J., Rosicky, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/CBO9780511600579","DOI":"10.1017\/CBO9780511600579"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Ad\u00e1mek, J., Milius, S., Bowler, N.J., Levy, P.B.: Coproducts of monads on set. In: Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, 25\u201328 June 2012, pp. 45\u201354. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/LICS.2012.16","DOI":"10.1109\/LICS.2012.16"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Awodey, S.: Category Theory. Oxford Logic Guides. Ebsco Publishing (2006)","DOI":"10.1093\/acprof:oso\/9780198568612.001.0001"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Comprehensive Studies in Mathematics. Springer, New York (1985)","DOI":"10.1007\/978-1-4899-0021-0"},{"key":"6_CR6","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0083084","volume-title":"Seminar on Triples and Categorical Homology Theory","author":"J Beck","year":"1969","unstructured":"Beck, J.: Distributive laws. In: Eckmann, B. (ed.) Seminar on Triples and Categorical Homology Theory. LNM, vol. 80, pp. 119\u2013140. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0083084"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-030-71995-1_6","volume-title":"Foundations of Software Science and Computation Structures","author":"F Bonchi","year":"2021","unstructured":"Bonchi, F., Santamaria, A.: Combining semilattices and semimodules. In: FOSSACS 2021. LNCS, vol. 12650, pp. 102\u2013123. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_6"},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Sokolova, A., Vignudelli, V.: The theory of traces for systems with nondeterminism and probability. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, pp. 1\u201314. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785673","DOI":"10.1109\/LICS.2019.8785673"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"B\u00f6hm, G.: The weak theory of monads. Adv. Math. 225, 1\u201332 (2010). https:\/\/doi.org\/10.1016\/j.aim.2010.02.015","DOI":"10.1016\/j.aim.2010.02.015"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-1-4613-8177-8_7","volume":"16","author":"CC Elgot","year":"1978","unstructured":"Elgot, C.C., Bloom, S.L., Tindell, R.: On the algebraic structure of rooted trees. J. Comput. Syst. Sci. 16, 361\u2013399 (1978). https:\/\/doi.org\/10.1007\/978-1-4613-8177-8_7","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10485-019-09582-w","volume":"28","author":"R Garner","year":"2019","unstructured":"Garner, R.: The vietoris monad and weak distributive laws. Appl. Categ. Struct. 28(2), 339\u2013354 (2019). https:\/\/doi.org\/10.1007\/s10485-019-09582-w","journal-title":"Appl. Categ. Struct."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Ghani, N., Uustalu, T.: Coproducts of ideal monads. RAIRO Theor. Inform. Appl. 38(4), 321\u2013342 (2004). https:\/\/doi.org\/10.1051\/ita:2004016","DOI":"10.1051\/ita:2004016"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Goy, A., Petrisan, D.: Combining probabilistic and non-deterministic choice via weak distributive laws. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS 2020: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 454\u2013464. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394795","DOI":"10.1145\/3373718.3394795"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-57201-3_5","volume-title":"Coalgebraic Methods in Computer Science","author":"G van Heerdt","year":"2020","unstructured":"van Heerdt, G., Sammartino, M., Silva, A.: Learning automata with side-effects. In: Petri\u015fan, D., Rot, J. (eds.) CMCS 2020. LNCS, vol. 12094, pp. 68\u201389. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57201-3_5"},{"issue":"1\u20133","key":"6_CR15","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2006.03.013","volume":"357","author":"M Hyland","year":"2006","unstructured":"Hyland, M., Plotkin, G.D., Power, J.: Combining effects: sum and tensor. Theoret. Comput. Sci. 357(1\u20133), 70\u201399 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.03.013","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Hyland, M., Tasson, C.: The linear-non-linear substitution 2-monad. In: Spivak, D.I., Vicary, J. (eds.) Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, ACT 2020. EPTCS, vol. 333, pp. 215\u2013229 (2020). https:\/\/doi.org\/10.4204\/EPTCS.333.15","DOI":"10.4204\/EPTCS.333.15"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(94)90020-5","volume":"69","author":"B Jacobs","year":"1994","unstructured":"Jacobs, B.: Semantics of weakening and contraction. Ann. Pure Appl. Logic 69(1), 73\u2013106 (1994). https:\/\/doi.org\/10.1016\/0168-0072(94)90020-5","journal-title":"Ann. Pure Appl. Logic"},{"key":"6_CR18","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15240-5_1","volume-title":"Theoretical Computer Science","author":"B Jacobs","year":"2010","unstructured":"Jacobs, B.: Convexity, duality and effects. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IAICT, vol. 323, pp. 1\u201319. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15240-5_1"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2014.12.005","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-00590-9_6","volume-title":"Programming Languages and Systems","author":"M Jaskelioff","year":"2009","unstructured":"Jaskelioff, M.: Modular monad transformers. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 64\u201379. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00590-9_6"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Rivas, E., Uustalu, T.: Interaction laws of monads and comonads. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS 2020: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 604\u2013618. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394808","DOI":"10.1145\/3373718.3394808"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Klin, B., Salamanca, J.: Iterated covariant powerset is not a monad. In: Staton, S. (ed.) Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2018. Electronic Notes in Theoretical Computer Science, vol. 341, pp. 261\u2013276. Elsevier (2018). https:\/\/doi.org\/10.1016\/j.entcs.2018.11.013","DOI":"10.1016\/j.entcs.2018.11.013"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 199\u2013213. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_14"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Liang, S., Hudak, P., Jones, M.P.: Monad transformers and modular interpreters. In: Cytron, R.K., Lee, P. (eds.) Conference Record of POPL 1995: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, USA, 23\u201325 January 1995, pp. 333\u2013343. ACM Press (1995). https:\/\/doi.org\/10.1145\/199448.199528","DOI":"10.1145\/199448.199528"},{"key":"6_CR25","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S MacLane","year":"1971","unstructured":"MacLane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, vol. 5. Springer, New York (1971)"},{"key":"6_CR26","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9860-1","volume-title":"Algebraic Theories","author":"E Manes","year":"1976","unstructured":"Manes, E.: Algebraic Theories. Graduate Texts in Mathematics, vol. 26. Springer, New York (1976). https:\/\/doi.org\/10.1007\/978-1-4612-9860-1"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"M\u00e9tayer, F.: State monads and their algebras. arXiv:math\/0407251, Category Theory (2004). https:\/\/doi.org\/10.48550\/arXiv.math\/0407251","DOI":"10.48550\/arXiv.math\/0407251"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Milius, S., Pattinson, D., Schr\u00f6der, L.: Generic trace semantics and graded monads. In: Moss, L.S., Sobocinski, P. (eds.) 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015. LIPIcs, vol. 35, pp. 253\u2013269. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.253","DOI":"10.4230\/LIPIcs.CALCO.2015.253"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Mio, M., Sarkis, R., Vignudelli, V.: Combining nondeterminism, probability, and termination: equational and metric reasoning. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470717","DOI":"10.1109\/LICS52264.2021.9470717"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Mio, M., Vignudelli, V.: Monads and quantitative equational theories for nondeterminism and probability. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory, CONCUR 2020. LIPIcs, vol. 171, pp. 28:1\u201328:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.28","DOI":"10.4230\/LIPIcs.CONCUR.2020.28"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90052-4. Selections from 1989 IEEE Symposium on Logic in Computer Science","DOI":"10.1016\/0890-5401(91)90052-4"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Petrisan, D., Sarkis, R.: Semialgebras and weak distributive laws. In: Sokolova, A. (ed.) Proceedings 37th Conference on Mathematical Foundations of Programming Semantics, MFPS 2021. EPTCS, vol. 351, pp. 218\u2013241 (2021). https:\/\/doi.org\/10.4204\/EPTCS.351.14","DOI":"10.4204\/EPTCS.351.14"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_247","volume-title":"Foundations of Software Science and Computation Structures","author":"GD Plotkin","year":"2002","unstructured":"Plotkin, G.D., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) Foundations of Software Science and Computation Structures, vol. 2303, pp. 342\u2013356. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_247"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11548133_22","volume-title":"Algebra and Coalgebra in Computer Science","author":"J Power","year":"2005","unstructured":"Power, J.: Discrete Lawvere theories. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 348\u2013363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11548133_22"},{"key":"6_CR35","unstructured":"Riehl, E.: Category Theory in Context. Dover Modern Math Originals, Dover Publications, Aurora (2017)"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Rosset, A., Hansen, H.H., Endrullis, J.: Algebraic presentation of semifree monads. arXiv:cs.LO (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.05392","DOI":"10.48550\/ARXIV.2205.05392"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Street, R.: Weak distributive laws. Theory Appl. Categories 22, 313\u2013320 (2009)","DOI":"10.70930\/tac\/a34ll7g4"},{"key":"6_CR38","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0960129505005074","volume":"16","author":"D Varacca","year":"2006","unstructured":"Varacca, D., Winskel, G.: Distributing probabililty over nondeterminism. Math. Struct. Comput. Sci. 16, 87\u2013113 (2006). https:\/\/doi.org\/10.1017\/S0960129505005074","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Wadler, P.: The essence of functional programming. In: Sethi, R. (ed.) Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 1\u201314. ACM Press (1992). https:\/\/doi.org\/10.1145\/143165.143169","DOI":"10.1145\/143165.143169"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Zwart, M., Marsden, D.: No-go theorems for distributive laws. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785707","DOI":"10.1109\/LICS.2019.8785707"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10736-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:03:26Z","timestamp":1784678606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10736-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107351","9783031107368"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10736-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs22\/","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":"12","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":"9","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":"75% - 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":"2","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}