{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:23Z","timestamp":1780994483440,"version":"3.54.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030550882","type":"print"},{"value":"9783030550899","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-55089-9_3","type":"book-chapter","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T17:08:28Z","timestamp":1596215308000},"page":"44-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Weakest Preexpectation Semantics for Bayesian Inference"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7706-0376","authenticated-orcid":false,"given":"Marcin","family":"Szymczak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 3, pp. 1\u2013168. Oxford University Press, Inc. (1994). http:\/\/dl.acm.org\/citation.cfm?id=218742.218744","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1215\/ijm\/1255631584","volume":"5","author":"RJ Aumann","year":"1961","unstructured":"Aumann, R.J.: Borel structures for function spaces. Illinois J. Math. 5(4), 614\u2013630 (1961). http:\/\/projecteuclid.org\/euclid.ijm\/1255631584","journal-title":"Illinois J. Math."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-89884-1_6","volume-title":"Programming Languages and Systems","author":"B Bichsel","year":"2018","unstructured":"Bichsel, B., Gehr, T., Vechev, M.: Fine-grained semantics for probabilistic programs. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 145\u2013185. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_6"},{"key":"3_CR4","volume-title":"Probability and Measure","author":"P Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, New York (1995)","edition":"3"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Borgstr\u00f6m, J., Dal Lago, U., Gordon, A.D., Szymczak, M.: A lambda-calculus foundation for universal probabilistic programming. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, 18\u201322 September 2016, pp. 33\u201346. ACM (2016). https:\/\/doi.org\/10.1145\/2951913.2951942","DOI":"10.1145\/2951913.2951942"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(3:11)201","volume":"9","author":"J Borgstr\u00f6m","year":"2013","unstructured":"Borgstr\u00f6m, J., Gordon, A.D., Greenberg, M., Margetson, J., Gael, J.V.: Measure transformer semantics for Bayesian machine learning. Log. Meth. Comput. Sci. 9(3), 1\u201339 (2013). https:\/\/doi.org\/10.2168\/LMCS-9(3:11)201","journal-title":"Log. Meth. Comput. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Novotn\u00fd, P., Zikelic, D.: Stochastic invariants for probabilistic termination. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18\u201320, 2017, pp. 145\u2013160. ACM (2017). http:\/\/dl.acm.org\/citation.cfm?id=3009873","DOI":"10.1145\/3009837.3009873"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-662-54434-1_14","volume-title":"Programming Languages and Systems","author":"R Culpepper","year":"2017","unstructured":"Culpepper, R., Cobb, A.: Contextual equivalence for probabilistic programs with continuous random variables and scoring. In: Yang, H. (ed.) ESOP 2017. LNCS, vol. 10201, pp. 368\u2013392. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54434-1_14"},{"issue":"POPL","key":"3_CR9","doi-asserted-by":"publisher","first-page":"57:1","DOI":"10.1145\/3371125","volume":"4","author":"F Dahlqvist","year":"2020","unstructured":"Dahlqvist, F., Kozen, D.: Semantics of higher-order probabilistic programs with conditioning. Proc. ACM Program. Lang. 4(POPL), 57:1\u201357:29 (2020). https:\/\/doi.org\/10.1145\/3371125","journal-title":"Proc. ACM Program. Lang."},{"key":"3_CR10","unstructured":"Goodman, N.D., Mansinghka, V.K., Roy, D.M., Bonawitz, K., Tenenbaum, J.B.: Church: a language for generative models. In: McAllester, D.A., Myllym\u00e4ki, P. (eds.) UAI 2008, Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, Helsinki, Finland, July 9\u201312, 2008, pp. 220\u2013229. AUAI Press (2008), https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1346&proceeding_id=24"},{"key":"3_CR11","unstructured":"Goodman, N.D., Stuhlm\u00fcller, A.: The design and implementation of probabilistic programming languages (2014). http:\/\/dippl.org"},{"key":"3_CR12","unstructured":"Goodman, N.D., Tenenbaum, J.B., Contributors, T.P.: Probabilistic Models of Cognition (2016). http:\/\/probmods.org\/v2"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.peva.2013.11.004","volume":"73","author":"F Gretz","year":"2014","unstructured":"Gretz, F., Katoen, J., McIver, A.: Operational versus weakest pre-expectation semantics for the probabilistic guarded command language. Perform. Eval. 73, 110\u2013132 (2014). https:\/\/doi.org\/10.1016\/j.peva.2013.11.004","journal-title":"Perform. Eval."},{"issue":"1","key":"3_CR14","first-page":"1","volume":"14","author":"E Habil","year":"2006","unstructured":"Habil, E.: Double sequences and double series. IUG J. Nat. Stud. 14(1), 1\u201332 (2006)","journal-title":"IUG J. Nat. Stud."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Heunen, C., Kammar, O., Staton, S., Yang, H.: A convenient category for higher-order probability theory. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20\u201323, 2017, pp. 1\u201312. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005137","DOI":"10.1109\/LICS.2017.8005137"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-49498-1_14","volume-title":"Programming Languages and Systems","author":"D Huang","year":"2016","unstructured":"Huang, D., Morrisett, G.: An application of computable distributions to the semantics of probabilistic programming languages. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 337\u2013363. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_14"},{"key":"3_CR17","unstructured":"Hutton, G.: Introduction to Domain Theory (1994). lecture notes http:\/\/www.cs.nott.ac.uk\/~pszgmh\/domains.html"},{"key":"3_CR18","unstructured":"Icard, T.: Beyond almost-sure termination. In: Gunzelmann, G., Howes, A., Tenbrink, T., Davelaar, E.J. (eds.) Proceedings of the 39th Annual Meeting of the Cognitive Science Society, CogSci 2017, London, UK, 16\u201329 July 2017. cognitivesciencesociety.org (2017). https:\/\/mindmodeling.org\/cogsci2017\/papers\/0430\/index.html"},{"issue":"453","key":"3_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1198\/016214501750332758","volume":"96","author":"H Ishwaran","year":"2001","unstructured":"Ishwaran, H., James, L.F.: Gibbs sampling methods for stick-breaking priors. J. Am. Stat. Assoc. 96(453), 161\u2013173 (2001). http:\/\/www.jstor.org\/stable\/2670356","journal-title":"J. Am. Stat. Assoc."},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Jansen, N., Kaminski, B.L., Katoen, J., Olmedo, F., Gretz, F., McIver, A.: Conditioning in probabilistic programming. In: Ghica, D.R. (ed.) The 31st Conference on the Mathematical Foundations of Programming Semantics, MFPS 2015, Nijmegen, The Netherlands, 22\u201325 June 2015. Electronic Notes in Theoretical Computer Science, vol. 319, pp. 199\u2013216. Elsevier (2015). https:\/\/doi.org\/10.1016\/j.entcs.2015.12.013","DOI":"10.1016\/j.entcs.2015.12.013"},{"key":"3_CR21","unstructured":"Kaminski, B.L.: Advanced Weakest Precondition Calculi for Probabilistic Programs. Ph.D. thesis, RWTH Aachen University, February 2019"},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"30:1","DOI":"10.1145\/3208102","volume":"65","author":"BL Kaminski","year":"2018","unstructured":"Kaminski, B.L., Katoen, J., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected runtimes of randomized algorithms. J. ACM 65(5), 30:1\u201330:68 (2018). https:\/\/doi.org\/10.1145\/3208102","journal-title":"J. ACM"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Katoen, J.: The probabilistic model checking landscape. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, NY, USA, 5\u20138 July 2016, pp. 31\u201345. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2934574","DOI":"10.1145\/2933575.2934574"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(81)90036-2","volume":"22","author":"D Kozen","year":"1981","unstructured":"Kozen, D.: Semantics of probabilistic programs. J. Comput. Syst. Sci. 22(3), 328\u2013350 (1981). https:\/\/doi.org\/10.1016\/0022-0000(81)90036-2","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR25","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b138392","volume-title":"Abstraction, Refinement and Proof for Probabilistic Systems","author":"A McIver","year":"2005","unstructured":"McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, New York (2005). https:\/\/doi.org\/10.1007\/b138392"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0020-0190(96)00093-2","volume":"59","author":"C Morgan","year":"1996","unstructured":"Morgan, C., McIver, A.: Unifying WP and WLP. Inf. Process. Lett. 59(3), 159\u2013163 (1996). https:\/\/doi.org\/10.1016\/0020-0190(96)00093-2","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K.: Probabilistic predicate transformers. ACM Trans. Program. Lang. Syst. 18(3), 325\u2013353 (1996). https:\/\/doi.org\/10.1145\/229542.229547","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Nori, A.V., Hur, C., Rajamani, S.K., Samuel, S.: R2: an efficient MCMC sampler for probabilistic programs. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Qu\u00e9bec, Canada, 27\u201331 July 2014, pp. 2476\u20132482. AAAI Press (2014). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI14\/paper\/view\/8192","DOI":"10.1609\/aaai.v28i1.9060"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/3156018","volume":"40","author":"F Olmedo","year":"2018","unstructured":"Olmedo, F., Gretz, F., Jansen, N., Kaminski, B.L., Katoen, J., McIver, A.: Conditioning in probabilistic programming. ACM Trans. Program. Lang. Syst. 40(1), 41\u2013450 (2018). https:\/\/doi.org\/10.1145\/3156018","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Olmedo, F., Kaminski, B.L., Katoen, J., Matheja, C.: Reasoning about recursive probabilistic programs. In: Grohe, M., Koskinen, E., Shankar, N. (eds.) Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, New York, NY, USA, 5\u20138 July 2016, pp. 672\u2013681. ACM (2016). https:\/\/doi.org\/10.1145\/2933575.2935317","DOI":"10.1145\/2933575.2935317"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Park, S., Pfenning, F., Thrun, S.: A probabilistic language based on sampling functions. ACM Trans. Program. Lang. Syst. 31(1) (2008). https:\/\/doi.org\/10.1145\/1452044.1452048","DOI":"10.1145\/1452044.1452048"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-08921-7_92","volume-title":"Mathematical Foundations of Computer Science 1978","author":"N Saheb-Djahromi","year":"1978","unstructured":"Saheb-Djahromi, N.: Probabilistic LCF. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 442\u2013451. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/3-540-08921-7_92"},{"issue":"ICFP","key":"3_CR33","doi-asserted-by":"publisher","first-page":"83:1","DOI":"10.1145\/3236778","volume":"2","author":"A \u015acibior","year":"2018","unstructured":"\u015acibior, A., Kammar, O., Ghahramani, Z.: Functional programming for modular Bayesian inference. Proc. ACM Program. Lang. 2(ICFP), 83:1\u201383:29 (2018). https:\/\/doi.org\/10.1145\/3236778","journal-title":"Proc. ACM Program. Lang."},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Solovay, R.M.: A model of set-theory in which every set of reals is Lebesgue measurable. Ann. Math. 92(1), 1\u201356 (1970). http:\/\/www.jstor.org\/stable\/1970696","DOI":"10.2307\/1970696"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Staton, S., Yang, H., Wood, F., Heunen, C., Kammar, O.: Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2016, pp. 525\u2013534. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2933575.2935313","DOI":"10.1145\/2933575.2935313"},{"key":"3_CR36","unstructured":"Szymczak, M.: Programming Language Semantics as a Foundation for Bayesian Inference. Ph.D. thesis, University of Edinburgh (2018). https:\/\/www.era.lib.ed.ac.uk\/handle\/1842\/28993"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-662-46669-8_3","volume-title":"Programming Languages and Systems","author":"N Toronto","year":"2015","unstructured":"Toronto, N., McCarthy, J., Van Horn, D.: Running probabilistic programs backwards. In: Vitek, J. (ed.) ESOP 2015. LNCS, vol. 9032, pp. 53\u201379. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46669-8_3"},{"issue":"POPL","key":"3_CR38","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/3290349","volume":"3","author":"M V\u00e1k\u00e1r","year":"2019","unstructured":"V\u00e1k\u00e1r, M., Kammar, O., Staton, S.: A domain theory for statistical probabilistic programming. Proc. ACM Program. Lang. 3(POPL), 36:1\u201336:29 (2019). https:\/\/doi.org\/10.1145\/3290349","journal-title":"Proc. ACM Program. Lang."},{"issue":"ICFP","key":"3_CR39","doi-asserted-by":"publisher","first-page":"87:1","DOI":"10.1145\/3236782","volume":"2","author":"M Wand","year":"2018","unstructured":"Wand, M., Culpepper, R., Giannakopoulos, T., Cobb, A.: Contextual equivalence for a probabilistic language with continuous random variables and recursion. Proc. ACM Program. Lang. 2(ICFP), 87:1\u201387:30 (2018). https:\/\/doi.org\/10.1145\/3236782","journal-title":"Proc. ACM Program. Lang."}],"container-title":["Lecture Notes in Computer Science","Engineering Trustworthy Software Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-55089-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:00:32Z","timestamp":1757095232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-55089-9_3"}},"subtitle":["Conditioning, Continuous Distributions and Divergence"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030550882","9783030550899"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-55089-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Summer School on Engineering Trustworthy Software Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chongqing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setss2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.swu-rise.net.cn\/SETSS2019\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"5","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":"5","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":"100% - 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":"1.4","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":"1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}