{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:33Z","timestamp":1759638273283,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030642754"},{"type":"electronic","value":"9783030642761"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64276-1_12","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"221-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Analysis of Bayesian Networks via Prob-Solvable Loops"],"prefix":"10.1007","author":[{"given":"Ezio","family":"Bartocci","sequence":"first","affiliation":[]},{"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Stankovi\u010d","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ai, J., et al: HackPPL: a universal probabilistic programming language. In: Proceeding of MAPL@PLDI, pp. 20\u201328 (2019)","DOI":"10.1145\/3315508.3329974"},{"key":"12_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-41528-4_3","volume-title":"Computer Aided Verification","author":"G Barthe","year":"2016","unstructured":"Barthe, G., Espitau, T., Ferrer Fioriti, L.M., Hsu, J.: Synthesizing probabilistic invariants via doob\u2019s decomposition. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 43\u201361. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_3"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-31784-3_15","volume-title":"Automated Technology for Verification and Analysis","author":"E Bartocci","year":"2019","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Automatic generation of moment-based invariants for prob-solvable loops. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 255\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_15"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Analysis of bayesian networks via prob-solvable loops. arXiv preprint arXiv:2007.09450 (2020)","DOI":"10.1007\/978-3-030-64276-1_12"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-030-45190-5_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Bartocci","year":"2020","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Mora - automatic generation of moment-based invariants. TACAS 2020. LNCS, vol. 12078, pp. 492\u2013498. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45190-5_28"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-89884-1_7","volume-title":"Programming Languages and Systems","author":"K Batz","year":"2018","unstructured":"Batz, K., Kaminski, B.L., Katoen, J.-P., Matheja, C.: How long, O Bayesian network, will I sample thee? In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 186\u2013213. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_7"},{"key":"12_CR8","first-page":"1","volume":"20","author":"E Bingham","year":"2019","unstructured":"Bingham, E., et al.: Pyro: deep universal probabilistic programming. J. Mach. Learn. Res. 20, 1\u20136 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.jcss.2014.06.005","volume":"81","author":"T Br\u00e1zdil","year":"2015","unstructured":"Br\u00e1zdil, T., Kiefer, S., Kucera, A., Varekov\u00e1, I.H.: Runtime analysis of probabilistic programs with unbounded recursion. J. Comput. Syst. Sci. 81(1), 288\u2013310 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11526841_9","volume-title":"FM 2005: Formal Methods","author":"O Celiku","year":"2005","unstructured":"Celiku, O., McIver, A.: Compositional specification and analysis of cost-based properties in probabilistic programs. In: Fitzgerald, J., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 107\u2013122. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11526841_9"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/978-3-319-21690-4_44","volume-title":"Computer Aided Verification","author":"Y-F Chen","year":"2015","unstructured":"Chen, Y.-F., Hong, C.-D., Wang, B.-Y., Zhang, L.: Counterexample-guided polynomial loop invariant generation by lagrange interpolation. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 658\u2013674. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_44"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.knosys.2012.07.008","volume":"36","author":"AC Constantinou","year":"2012","unstructured":"Constantinou, A.C., Fenton, N.E., Neil, M.: pi-Football: a Bayesian network model for forecasting association football match outcomes. Knowl. Based Syst. 36, 322\u2013339 (2012)","journal-title":"Knowl. Based Syst."},{"issue":"2\u20133","key":"12_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","volume":"42","author":"GF Cooper","year":"1990","unstructured":"Cooper, G.F.: The computational complexity of probabilistic inference using bayesian belief networks. Artif. Intell. 42(2\u20133), 393\u2013405 (1990)","journal-title":"Artif. Intell."},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","volume":"60","author":"P Dagum","year":"1993","unstructured":"Dagum, P., Luby, M.: Approximating probabilistic inference in bayesian belief networks is NP-hard. Artif. Intell. 60(1), 141\u2013153 (1993)","journal-title":"Artif. Intell."},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-319-63390-9_31","volume-title":"Computer Aided Verification","author":"C Dehnert","year":"2017","unstructured":"Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 592\u2013600. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_31"},{"issue":"8","key":"12_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975)","journal-title":"Commun. ACM"},{"key":"12_CR17","volume-title":"Introduction to Graphical Modelling","author":"D Edwards","year":"2012","unstructured":"Edwards, D.: Introduction to Graphical Modelling. Springer Science & Business Media, New York (2012)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-319-68167-2_26","volume-title":"Automated Technology for Verification and Analysis","author":"Y Feng","year":"2017","unstructured":"Feng, Y., Zhang, L., Jansen, D.N., Zhan, N., Xia, B.: Finding polynomial loop invariants for probabilistic programs. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 400\u2013416. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_26"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Fioriti, L.M.F., Hermanns, H.: Probabilistic termination: soundness, completeness, and compositionality. In: Proceedings of POPL, pp. 489\u2013501 (2015)","DOI":"10.1145\/2775051.2677001"},{"issue":"3\u20134","key":"12_CR20","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1089\/106652700750050961","volume":"7","author":"N Friedman","year":"2000","unstructured":"Friedman, N., Linial, M., Nachman, I., Pe\u2019er, D.: Using Bayesian networks to analyze expression data. J. Comput. Biol. 7(3\u20134), 601\u2013620 (2000)","journal-title":"J. Comput. Biol."},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1038\/nature14541","volume":"521","author":"Z Ghahramani","year":"2015","unstructured":"Ghahramani, Z.: Probabilistic machine learning and artificial intelligence. Nature 521, 452\u2013459 (2015)","journal-title":"Nature"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Heckerman, D.: A tutorial on learning wihtbayesian networks. In: Innovations in Bayesian Networks: Theory and Applications, Studies in Computational Intelligence, vol. 156, pp.33\u201382. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-85066-3_3","DOI":"10.1007\/978-3-540-85066-3_3"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00165-010-0157-0","volume":"23","author":"E Hehner","year":"2011","unstructured":"Hehner, E.: A probability perspective. Formal Aspects Comput. 23(4), 391\u2013419 (2011). 10.1007\/s00165-010-0157-0","journal-title":"Formal Aspects Comput."},{"issue":"4","key":"12_CR24","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1136\/jamia.2009.000356","volume":"17","author":"X Jiang","year":"2010","unstructured":"Jiang, X., Cooper, G.: A Bayesian spatio-temporal method for disease outbreak detection. J. Am. Med. Inform. Assoc. 17(4), 462\u2013471 (2010)","journal-title":"J. Am. Med. Inform. Assoc."},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-49498-1_15","volume-title":"Programming Languages and Systems","author":"BL Kaminski","year":"2016","unstructured":"Kaminski, B.L., Katoen, J.-P., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run\u2013times of probabilistic programs. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 364\u2013389. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_15"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-15769-1_24","volume-title":"Static Analysis","author":"J-P Katoen","year":"2010","unstructured":"Katoen, J.-P., McIver, A.K., Meinicke, L.A., Morgan, C.C.: Linear-invariant generation for probabilistic programs: automated support for proof-based methods. In: Cousot, R., Martel, M. (eds.) SAS 2010. LNCS, vol. 6337, pp. 390\u2013406. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15769-1_24"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.peva.2010.04.001","volume":"68","author":"J Katoen","year":"2011","unstructured":"Katoen, J., Zapreev, I.S., Hahn, E.M., Hermanns, H., Jansen, D.N.: The ins and outs of the probabilistic model checker MRMC. Perform. Eval. 68(2), 90\u2013104 (2011)","journal-title":"Perform. Eval."},{"key":"12_CR28","volume-title":"Probabilistic Graphical Models - Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N.: Probabilistic Graphical Models - Principles and Techniques. MIT Press, Cambridge (2009)"},{"key":"12_CR29","doi-asserted-by":"publisher","DOI":"10.1201\/b10391","volume-title":"Bayesian Artificial Intelligence","author":"K Korb","year":"2010","unstructured":"Korb, K., Nicholson, A.: Bayesian Artificial Intelligence, 2nd edn. Chapman and Hall, Boca Raton (2010)","edition":"2"},{"issue":"3","key":"12_CR30","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"12_CR31","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0022-0000(85)90012-1","volume":"30","author":"D Kozen","year":"1985","unstructured":"Kozen, D.: A probabilistic PDL. J. Comput. Syst. Sci. 30(2), 162\u2013178 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-17465-1_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Kura","year":"2019","unstructured":"Kura, S., Urabe, N., Hasuo, I.: Tail probabilities for randomized program runtimes via martingales for higher moments. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 135\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_8"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"issue":"2","key":"12_CR34","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"SL Lauritzen","year":"1988","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computation with probabilities on graphical structures and their application to expert systems (with discussion). Roy. Stat. Soc. B (Stat. Methodol.) 50(2), 157\u2013224 (1988)","journal-title":"Roy. Stat. Soc. B (Stat. Methodol.)"},{"key":"12_CR35","volume-title":"Characterizations of Distributions via Moments","author":"GL Lin","year":"1992","unstructured":"Lin, G.L.: Characterizations of Distributions via Moments. Indian Statistical Institute, Kolkata (1992)"},{"key":"12_CR36","unstructured":"Mardia, K.V., Kent, J.T., Bibby, J.M.: Multivariate Analysis. Academic Press, Cambridge (1979)"},{"key":"12_CR37","series-title":"Monographs in Computer Science","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)"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-47764-0_7","volume-title":"Static Analysis","author":"D Monniaux","year":"2001","unstructured":"Monniaux, D.: An abstract analysis of the probabilistic termination of programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 111\u2013126. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47764-0_7"},{"key":"12_CR39","volume-title":"Probabilistic Methods for Financial and Marketing Informatics","author":"R Neapolitan","year":"2010","unstructured":"Neapolitan, R., Jiang, X.: Probabilistic Methods for Financial and Marketing Informatics. Morgan Kaufmann, San Francisco (2010)"},{"key":"12_CR40","unstructured":"Pearl, J.: Bayesian Networks: A model of self-activated memory for evidential reasoning. In: Proceedings of Cognitive Science Society, pp. 329\u2013334 (1985)"},{"key":"12_CR41","volume-title":"Artificial Intelligence - A Modern Approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach. Pearson Education, London (2010)"},{"key":"12_CR42","unstructured":"Tran, D., Hoffman, M.D., Saurous, R.A., Brevdo, E., Murphy, K., Blei, D.M.: Deep Probabilistic Programming. CoRR abs\/1701.03757 (2017)"},{"issue":"9","key":"12_CR43","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.mcm.2005.05.020","volume":"43","author":"C Yuan","year":"2006","unstructured":"Yuan, C., Druzdzel, M.J.: Importance sampling algorithms for bayesian networks: principles and performance. Math. Comput. Model. 43(9), 1189\u20131207 (2006)","journal-title":"Math. Comput. Model."},{"key":"12_CR44","unstructured":"Zweig, G., Russell, S.J.: Speech recognition with dynamic bayesian networks. In: Proceedings of AAAI, pp. 173\u2013180 (1998)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64276-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T23:00:12Z","timestamp":1723935612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64276-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030642754","9783030642761"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64276-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2020.github.io\/","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":"40","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":"15","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":"38% - 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":"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":"5","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":"The conference was planned to take place in Macau, China, and changed to a virtual format due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}