{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:52:57Z","timestamp":1762325577047,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031308284"},{"type":"electronic","value":"9783031308291"}],"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,4,21]],"date-time":"2023-04-21T00:00:00Z","timestamp":1682035200000},"content-version":"vor","delay-in-days":110,"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>Behavioural distances measure the deviation between states in quantitative systems, such as probabilistic or weighted systems. There is growing interest in generic approaches to behavioural distances. In particular, coalgebraic methods capture variations in the system type (nondeterministic, probabilistic, game-based etc.), and the notion of <jats:italic>quantale<\/jats:italic> abstracts over the actual values distances take, thus covering, e.g., two-valued equivalences, (pseudo)metrics, and probabilistic (pseudo)metrics. Coalgebraic behavioural distances have been based either on <jats:italic>liftings<\/jats:italic> of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{Set}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:mi>Set<\/mml:mi>\n              <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-functors to categories of metric spaces, or on <jats:italic>lax extensions<\/jats:italic> of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{Set}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                <mml:mi>Set<\/mml:mi>\n              <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-functors to categories of quantitative relations. Every lax extension induces a functor lifting but not every lifting comes from a lax extension. It was shown recently that every lax extension is Kantorovich, i.e. induced by a suitable choice of monotone predicate liftings, implying via a quantitative coalgebraic Hennessy-Milner theorem that behavioural distances induced by lax extensions can be characterized by quantitative modal logics. Here, we essentially show the same in the more general setting of behavioural distances induced by functor liftings. In particular, we show that every functor lifting, and indeed every functor on (quantale-valued) metric spaces, that preserves isometries is Kantorovich, so that the induced behavioural distance (on systems of suitably restricted branching degree) can be characterized by a quantitative modal logic.<\/jats:p>","DOI":"10.1007\/978-3-031-30829-1_3","type":"book-chapter","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:56:19Z","timestamp":1682020579000},"page":"46-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Kantorovich Functors and Characteristic Logics for Behavioural Distances"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-8766","authenticated-orcid":false,"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1082-6135","authenticated-orcid":false,"given":"Dirk","family":"Hofmann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8581-0675","authenticated-orcid":false,"given":"Pedro","family":"Nora","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3146-5906","authenticated-orcid":false,"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9796-9675","authenticated-orcid":false,"given":"Paul","family":"Wild","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,21]]},"reference":[{"key":"3_CR1","unstructured":"Ad\u00e1mek, J., Herrlich, H., Strecker, G.E.: Abstract and concrete categories: The joy of cats. Pure and Applied Mathematics (New York), John Wiley & Sons Inc., New York (1990), http:\/\/tac.mta.ca\/tac\/reprints\/articles\/17\/tr17abs.html, republished in: Reprints in Theory and Applications of Categories, No. 17 (2006) pp.\u00a01\u2013507"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"de\u00a0Alfaro, L., Faella, M., Stoelinga, M.: Linear and Branching System Metrics. IEEE Transactions on Software Engineering 35(2), 258\u2013273 (mar 2009). https:\/\/doi.org\/10.1109\/TSE.2008.106","DOI":"10.1109\/TSE.2008.106"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Alsina, C., Frank, M.J., Schweizer, B.: Associative functions. Triangular norms and copulas. Hackensack, NJ: World Scientific (2006). https:\/\/doi.org\/10.1142\/9789812774200","DOI":"10.1142\/9789812774200"},{"key":"3_CR4","unstructured":"Awodey, S.: Category Theory. Oxford University Press, 2nd edn. (2010)"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Coalgebraic Behavioral Metrics. Log. Methods Comput. Sci. 14(3), 1860\u20135974 (2018). https:\/\/doi.org\/10.23638\/lmcs-14(3:20)2018","DOI":"10.23638\/lmcs-14(3:20)2018"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theoretical Computer Science 331(1), 115\u2013142 (feb 2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.09.035","DOI":"10.1016\/j.tcs.2004.09.035"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"C\u00eerstea, C., Kurz, A., Pattinson, D., Schr\u00f6der, L., Venema, Y.: Modal Logics are Coalgebraic. Computer Journal 54(1), 31\u201341 (2011). https:\/\/doi.org\/10.1093\/comjnl\/bxp004","DOI":"10.1093\/comjnl\/bxp004"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Clementino, M.M., Hofmann, D.: Exponentiation in $$V$$-categories. Topology and its Applications 153(16), 3113\u20133128 (Oct 2006). https:\/\/doi.org\/10.1016\/j.topol.2005.01.038","DOI":"10.1016\/j.topol.2005.01.038"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Clementino, M.M., Hofmann, D., Stubbe, I.: Exponentiable functors between quantaloid-enriched categories. Applied Categorical Structures 17(1), 91\u2013101 (Sep 2009). https:\/\/doi.org\/10.1007\/s10485-007-9104-5","DOI":"10.1007\/s10485-007-9104-5"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. Inf. Comput. 179(2), 163\u2013193 (2002). https:\/\/doi.org\/10.1006\/inco.2001.2962","DOI":"10.1006\/inco.2001.2962"},{"key":"3_CR11","unstructured":"Dimov, G.D., Tholen, W.: A characterization of representable dualities. In: Ad\u00e1mek, J., MacLane, S. (eds.) Categorical topology and its relation to analysis, algebra and combinatorics: Prague, Czechoslovakia, 22-27 August 1988, pp. 336\u2013357. World Scientific (1989)"},{"key":"3_CR12","unstructured":"Forster, J., Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: Quantitative Hennessy-Milner theorems via notions of density. In: Klin, B., Pimentel, E. (eds.) Computer Science Logic, CSL 2023. LIPIcs, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023), to appear. Preprint avaible on arXiv under https:\/\/doi.org\/10.48550\/arXiv.2207.09187"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Gavazzo, F.: Quantitative behavioural reasoning for higher-order effectful programs: Applicative distances. In: Dawar, A., Gr\u00e4del, E. (eds.) Logic in Computer Science, LICS 2018. pp. 452\u2013461. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209149","DOI":"10.1145\/3209108.3209149"},{"key":"3_CR14","unstructured":"Giacalone, A., Jou, C., Smolka, S.A.: Algebraic Reasoning for Probabilistic Concurrent Systems. In: Broy, M., Jones, C.B. (eds.) Programming concepts and methods: Proceedings of the IFIP Working Group 2.2, 2.3 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, 2-5 April, 1990. pp. 443\u2013458. North-Holland (1990)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. International statistical review 70(3), 419\u2013435 (2002)","DOI":"10.1111\/j.1751-5823.2002.tb00178.x"},{"key":"3_CR16","unstructured":"Goncharov, S., Hofmann, D., Nora, P., Schr\u00f6der, L., Wild, P.: A point-free perspective on lax extensions and predicate liftings. CoRR abs\/2112.12681 (2021), https:\/\/arxiv.org\/abs\/2112.12681"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Hansen, H.H., Kupke, C., Pacuit, E.: Neighbourhood structures: Bisimilarity and basic model theory. Log. Methods Comput. Sci. 5(2) (2009), http:\/\/arxiv.org\/abs\/0901.4430","DOI":"10.2168\/LMCS-5(2:2)2009"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Hofmann, D., Nora, P.: Hausdorff Coalgebras. Applied Categorical Structures 28(5), 773\u2013806 (Apr 2020). https:\/\/doi.org\/10.1007\/s10485-020-09597-8","DOI":"10.1007\/s10485-020-09597-8"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Katsumata, S.: A semantic formulation of tt-lifting and logical predicates for computational metalanguage. In: Ong, C.L. (ed.) Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03634, pp. 87\u2013102. Springer (2005). https:\/\/doi.org\/10.1007\/11538363_8, https:\/\/doi.org\/10.1007\/11538363_8","DOI":"10.1007\/11538363_8"},{"key":"3_CR20","unstructured":"Kelly, G.M.: Basic concepts of enriched category theory, London Mathematical Society Lecture Note Series, vol.\u00a064. Cambridge University Press, Cambridge (1982), Republished in: Reprints in Theory and Applications of Categories. No.\u00a010 (2005), 1\u2013136"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Hu, N., Klin, B., Hasuo, I.: Codensity Games for Bisimilarity. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785691","DOI":"10.1109\/LICS.2019.8785691"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Komorida, Y., Katsumata, S., Kupke, C., Rot, J., Hasuo, I.: Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, June 29 - July 2, 2021. pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470656","DOI":"10.1109\/LICS52264.2021.9470656"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, B., Mika-Michalski, C.: (metric) bisimulation games and real-valued modal logics for coalgebras. In: Schewe, S., Zhang, L. (eds.) 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. LIPIcs, vol.\u00a0118, pp. 37:1\u201337:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.37","DOI":"10.4230\/LIPIcs.CONCUR.2018.37"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Fahrenberg, U., Thrane, C.R.: Metrics for weighted transition systems: Axiomatization and complexity. Theor. Comput. Sci. 412(28), 3358\u20133369 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.04.003","DOI":"10.1016\/j.tcs.2011.04.003"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991). https:\/\/doi.org\/10.1016\/0890-5401(91)90030-6","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"3_CR26","doi-asserted-by":"publisher","unstructured":"Lawvere, F.W.: Metric spaces, generalized logic, and closed categories. Rendiconti del Seminario Matem\u00e0tico e Fisico di Milano 43(1), 135\u2013166 (Dec 1973). https:\/\/doi.org\/10.1007\/bf02924844, Republished in: Reprints in Theory and Applications of Categories, No. 1 (2002), 1\u201337","DOI":"10.1007\/bf02924844"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Marti, J., Venema, Y.: Lax extensions of coalgebra functors and their logic. Journal of Computer and System Sciences 81(5), 880\u2013900 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2014.12.006","DOI":"10.1016\/j.jcss.2014.12.006"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Pattinson, D.: Expressive logics for coalgebras via terminal sequence induction. Notre Dame J. Formal Log. 45(1), 19\u201333 (jan 2004). https:\/\/doi.org\/10.1305\/ndjfl\/1094155277","DOI":"10.1305\/ndjfl\/1094155277"},{"key":"3_CR29","unstructured":"Porst, H.E., Tholen, W.: Concrete dualities. In: Herrlich, H., Porst, H.E. (eds.) Category theory at work, Research and Exposition in Mathematics, vol.\u00a018, pp. 111\u2013136. Heldermann Verlag, Berlin (1991), http:\/\/www.heldermann.de\/R &E\/RAE18\/ctw07.pdf, with Cartoons by Marcel Ern\u00e9"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Prokhorov, Y.V.: Convergence of random processes and limit theorems in probability theory. Theory of Probability & Its Applications 1(2), 157\u2013214 (1956). https:\/\/doi.org\/10.1137\/1101016, https:\/\/doi.org\/10.1137\/1101016","DOI":"10.1137\/1101016"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Rosenthal, K.: Quantaloids, enriched categories and automata theory. Appl. Cat. Struct. 3, 279\u2013301 (1995). https:\/\/doi.org\/10.1007\/BF00878445","DOI":"10.1007\/BF00878445"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Rutten, J.: Relators and Metric Bisimulations. Electronic Notes in Theoretical Computer Science 11, 252\u2013258 (1998). https:\/\/doi.org\/10.1016\/S1571-0661(04)00063-5","DOI":"10.1016\/S1571-0661(04)00063-5"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3\u201380 (Oct 2000). https:\/\/doi.org\/10.1016\/s0304-3975(00)00056-6","DOI":"10.1016\/s0304-3975(00)00056-6"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Schr\u00f6der, L.: Expressivity of coalgebraic modal logic: The limits and beyond. Theor. Comput. Sci. 390(2-3), 230\u2013247 (jan 2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.023","DOI":"10.1016\/j.tcs.2007.09.023"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Sprunger, D., Katsumata, S., Dubut, J., Hasuo, I.: Fibrational bisimulations and quantitative reasoning: Extended version. J. Log. Comput. 31(6), 1526\u20131559 (2021). https:\/\/doi.org\/10.1093\/logcom\/exab051, https:\/\/doi.org\/10.1093\/logcom\/exab051","DOI":"10.1093\/logcom\/exab051"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Stubbe, I.: An introduction to quantaloid-enriched categories. Fuzzy Sets and Systems 256, 95\u2013116 (Dec 2014). https:\/\/doi.org\/10.1016\/j.fss.2013.08.009, special Issue on Enriched Category Theory and Related Topics (Selected papers from the 33rd Linz Seminar on Fuzzy Set Theory, 2012)","DOI":"10.1016\/j.fss.2013.08.009"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Tholen, W.: Ordered topological structures. Topology and its Applications 156(12), 2148\u20132157 (Jul 2009). https:\/\/doi.org\/10.1016\/j.topol.2009.03.038","DOI":"10.1016\/j.topol.2009.03.038"},{"key":"3_CR38","doi-asserted-by":"publisher","unstructured":"Wild, P., Schr\u00f6der, L.: Characteristic logics for behavioural metrics via fuzzy lax extensions. In: Konnov, I., Kov\u00e1cs, L. (eds.) Concurrency Theory, CONCUR 2020. LIPIcs, vol.\u00a0171, pp. 27:1\u201327:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.27, extended version in Log. Methods Comput. Sci. 18(2), 2022","DOI":"10.4230\/LIPIcs.CONCUR.2020.27"},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Wild, P., Schr\u00f6der, L.: A Quantified Coalgebraic van Benthem Theorem. In: Kiefer, S., Tasson, C. (eds.) Foundations of Software Science and Computation Structures, FOSSACS 2021. LNCS, vol. 12650, pp. 551\u2013571. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-71995-1_28","DOI":"10.1007\/978-3-030-71995-1_28"},{"key":"3_CR40","doi-asserted-by":"publisher","unstructured":"Worrell, J.: Coinduction for recursive data types: partial orders, metric spaces and $$\\varOmega $$-categories. In: Reichel, H. (ed.) Coalgebraic Methods in Computer Science, CMCS 2000, Berlin, Germany, March 25-26, 2000. Electronic Notes in Theoretical Computer Science, vol.\u00a033, pp. 337\u2013356. Elsevier (2000). https:\/\/doi.org\/10.1016\/S1571-0661(05)80356-1","DOI":"10.1016\/S1571-0661(05)80356-1"}],"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-30829-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T19:57:07Z","timestamp":1682020627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30829-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031308284","9783031308291"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30829-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 April 2023","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":"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":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/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":"85","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":"26","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":"31% - 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.1","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":"10","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)"}}]}}