{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:19:03Z","timestamp":1768907943240,"version":"3.49.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030720124","type":"print"},{"value":"9783030720131","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":81,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recent advances have shown how decision trees are apt data structures for concisely representing strategies (or controllers) satisfying various objectives. Moreover, they also make the strategy more explainable. The recent tool had provided pipelines with tools supporting strategy synthesis for hybrid systems, such as and . We present , a new version with several fundamentally novel features. Most importantly, the user can now provide domain knowledge to be exploited in the decision tree learning process and can also interactively steer the process based on the dynamically provided information. To this end, we also provide a graphical user interface. It allows for inspection and re-computation of parts of the result, suggesting as well as receiving advice on predicates, and visual simulation of the decision-making process. Besides, we interface model checkers of probabilistic systems, namely and and provide dedicated support for categorical enumeration-type state variables. Consequently, the controllers are more explainable and smaller.<\/jats:p>","DOI":"10.1007\/978-3-030-72013-1_17","type":"book-chapter","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T18:03:10Z","timestamp":1616436190000},"page":"326-345","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1083-4741","authenticated-orcid":false,"given":"Pranav","family":"Ashok","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Jackermeier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8122-2881","authenticated-orcid":false,"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1600-4933","authenticated-orcid":false,"given":"Christoph","family":"Weinhuber","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0163-2152","authenticated-orcid":false,"given":"Maximilian","family":"Weininger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0302-8108","authenticated-orcid":false,"given":"Mayank","family":"Yadav","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"17_CR1","unstructured":"Flask web development: developing web applications with python. https:\/\/pypi.org\/project\/Flask\/, accessed: 14.10.2020"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: A survey on explainable artificial intelligence (XAI). IEEE Access 6, 52138\u201352160 (2018)","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Ashok, P., Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Lampert, C.H., Toman, V.: Strategy representation by decision trees with linear classifiers. In: QEST. Lecture Notes in Computer Science, vol. 11785, pp. 109\u2013128. Springer (2019)","DOI":"10.1007\/978-3-030-30281-8_7"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ashok, P., Jackermeier, M., Jagtap, P., K\u0159et\u00ednsk\u00fd, J., Weininger, M., Zamani, M.: dtcontrol: decision tree learning algorithms for controller representation. In: HSCC. pp. 17:1\u201317:7. ACM (2020)","DOI":"10.1145\/3365365.3382220"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Ashok, P., Jackermeier, M., K\u0159et\u00ednsk\u00fd, J., Weinhuber, C., Weininger, M., Yadav, M.: dtControl 2.0: Explainable strategy representation via decision tree learning steered by experts. CoRR abs\/2101.07202 (2021)","DOI":"10.1007\/978-3-030-72013-1_17"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Ashok, P., Jackermeier, M., K\u0159et\u00ednsk\u00fd, J., Weinhuber, C., Weininger, M., Yadav, M.: dtControl 2.0: Explainable strategy representation via decision tree learning steered by experts (TACAS 21 artifact) (Jan 2021). https:\/\/doi.org\/10.5281\/zenodo.4437169","DOI":"10.5281\/zenodo.4437169"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ashok, P., K\u0159et\u00ednsk\u00fd, J., Larsen, K.G., Co\u00ebnt, A.L., Taankvist, J.H., Weininger, M.: SOS: safe, optimal and small strategies for hybrid Markov decision processes. In: QEST. Lecture Notes in Computer Science, vol. 11785, pp. 147\u2013164. Springer (2019)","DOI":"10.1007\/978-3-030-30281-8_9"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. Formal Methods Syst. Des. 10(2\/3), 171\u2013206 (1997)","DOI":"10.1023\/A:1008699807402"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Bostock, M., Ogievetsky, V., Heer, J.: D$$^3$$ data-driven documents. IEEE transactions on visualization and computer graphics 17(12), 2301\u20132309 (2011)","DOI":"10.1109\/TVCG.2011.185"},{"key":"17_CR10","unstructured":"Boutilier, C., Dearden, R., Goldszmidt, M.: Exploiting structure in policy construction. In: IJCAI. pp. 1104\u20131113. Morgan Kaufmann (1995)."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmelik, M., Fellner, A., K\u0159et\u00ednsk\u00fd, J.: Counterexample explanation by learning small strategies in Markov decision processes. In: CAV (1). Lecture Notes in Computer Science, vol.\u00a09206, pp. 158\u2013177. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_10"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., K\u0159et\u00ednsk\u00fd, J., Toman, V.: Strategy representation by decision trees in reactive synthesis. In: TACAS (1). Lecture Notes in Computer Science, vol. 10805, pp. 385\u2013407. Springer (2018)","DOI":"10.1007\/978-3-319-89960-2_21"},{"key":"17_CR13","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth (1984)"},{"key":"17_CR14","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers 35(8), 677\u2013691 (1986)"},{"key":"17_CR15","unstructured":"Cimatti, A., Roveri, M., Traverso, P.: Automatic obdd-based generation of universal plans in non-deterministic domains. In: AAAI\/IAAI. pp. 875\u2013881. AAAI Press \/ The MIT Press (1998)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"David, A., Jensen, P.G., Larsen, K.G., Mikucionis, M., Taankvist, J.H.: Uppaal stratego. In: TACAS. Lecture Notes in Computer Science, vol.\u00a09035, pp. 206\u2013211. Springer (2015)","DOI":"10.1007\/978-3-662-46681-0_16"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Dehnert, C., Junges, S., Katoen, J., Volk, M.: A storm is coming: A modern probabilistic model checker. In: CAV (2). Lecture Notes in Computer Science, vol. 10427, pp. 592\u2013600. Springer (2017)","DOI":"10.1007\/978-3-319-63390-9_31"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Della\u00a0Penna, G., Intrigila, B., Lauri, N., Magazzeni, D.: Fast and compact encoding of numerical controllers using obdds. In: Cetto, J.A., Ferrier, J.L., Filipe, J. (eds.) Informatics in Control, Automation and Robotics: Selcted Papers from the International Conference on Informatics in Control, Automation and Robotics 2008, pp. 75\u201387. Springer Berlin Heidelberg, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00271-7_5"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Frehse, G., Guernic, C.L., Donz\u00e9, A., Cotton, S., Ray, R., Lebeltel, O., Ripado, R., Girard, A., Dang, T., Maler, O.: Spaceex: Scalable verification of hybrid systems. In: CAV. Lecture Notes in Computer Science, vol.\u00a06806, pp. 379\u2013395. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_30"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.: Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods Syst. Des. 10(2\/3), 149\u2013169 (1997)","DOI":"10.1023\/A:1008647823331"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Garg, P., Neider, D., Madhusudan, P., Roth, D.: Learning invariants using decision trees and implication counterexamples. In: POPL. pp. 499\u2013512. ACM (2016)","DOI":"10.1145\/2914770.2837664"},{"key":"17_CR22","unstructured":"Girard, A.: Low-complexity quantized switching controllers using approximate bisimulation. CoRR abs\/1209.4576 (2012)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Harris, C.R., Millman, K.J., van\u00a0der Walt, S., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N.J., Kern, R., Picus, M., Hoyer, S., van Kerkwijk, M.H., Brett, M., Haldane, A., del R\u00edo, J.F., Wiebe, M., Peterson, P., G\u00e9rard-Marchant, P., Sheppard, K., Reddy, T., Weckesser, W., Abbasi, H., Gohlke, C., Oliphant, T.E.: Array programming with numpy. CoRR abs\/2006.10256 (2020)","DOI":"10.1038\/s41586-020-2649-2"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The quantitative verification benchmark set. In: TACAS (1). Lecture Notes in Computer Science, vol. 11427, pp. 344\u2013350. Springer (2019)","DOI":"10.1007\/978-3-030-17462-0_20"},{"key":"17_CR25","unstructured":"Heath, D.G., Kasif, S., Salzberg, S.: Induction of oblique decision trees. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chamb\u00e9ry, France, August 28 - September 3, 1993. pp. 1002\u20131007 (1993)"},{"key":"17_CR26","unstructured":"Hoey, J., St-Aubin, R., Hu, A.J., Boutilier, C.: SPUDD: stochastic planning using decision diagrams. In: UAI. pp. 279\u2013288. Morgan Kaufmann (1999)"},{"key":"17_CR27","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5(1), 15\u201317 (1976)"},{"key":"17_CR28","unstructured":"Ittner, A., Schlosser, M.: Non-linear decision trees - NDT. In: ICML. pp. 252\u2013257. Morgan Kaufmann (1996)"},{"key":"17_CR29","unstructured":"Jackermeier, M.: dtControl: Decision Tree Learning for Explainable Controller Representation. Bachelor\u2019s thesis, Technische Universit\u00e4t M\u00fcnchen (2020)"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Jr., M.M., Davitian, A., Tabuada, P.: PESSOA: A tool for embedded controller synthesis. In: CAV. Lecture Notes in Computer Science, vol.\u00a06174, pp. 566\u2013569. Springer (2010)","DOI":"10.1007\/978-3-642-14295-6_49"},{"key":"17_CR31","unstructured":"Kiesbye, J.: Private Communication (2020)"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: Verification of probabilistic real-time systems. In: CAV. Lecture Notes in Computer Science, vol.\u00a06806, pp. 585\u2013591. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_47"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: QEST. pp. 203\u2013204. IEEE Computer Society (2012)","DOI":"10.1109\/QEST.2012.14"},{"key":"17_CR34","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Mikucionis, M., Taankvist, J.H.: Safe and optimal adaptive cruise control. In: Correct System Design. Lecture Notes in Computer Science, vol.\u00a09360, pp. 260\u2013277. Springer (2015)","DOI":"10.1007\/978-3-319-23506-6_17"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Luttenberger, M., Meyer, P.J., Sickert, S.: Practical synthesis of reactive systems from LTL specifications via parity games. Acta Informatica 57(1-2), 3\u201336 (2020)","DOI":"10.1007\/s00236-019-00349-3"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Wes McKinney: Data Structures for Statistical Computing in Python. In: St\u00e9fan van\u00a0der Walt, Jarrod Millman (eds.) Proceedings of the 9th Python in Science Conference. pp. 56 \u2013 61 (2010). https:\/\/doi.org\/10.25080\/Majora-92bf1922-00a","DOI":"10.25080\/Majora-92bf1922-00a"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Meurer, A., Smith, C.P., Paprocki, M., Cert\u00edk, O., Kirpichev, S.B., Rocklin, M., Kumar, A., Ivanov, S., Moore, J.K., Singh, S., Rathnayake, T., Vig, S., Granger, B.E., Muller, R.P., Bonazzi, F., Gupta, H., Vats, S., Johansson, F., Pedregosa, F., Curry, M.J., Terrel, A.R., Roucka, S., Saboo, A., Fernando, I., Kulal, S., Cimrman, R., Scopatz, A.M.: Sympy: symboliccomputing in python. PeerJ Comput. Sci. 3, e103 (2017)","DOI":"10.7717\/peerj-cs.103"},{"key":"17_CR38","unstructured":"Mitchell, T.M.: Machine learning. McGraw Hill series in computer science, McGraw-Hill (1997)"},{"key":"17_CR39","doi-asserted-by":"crossref","unstructured":"Murthy, S.K., Kasif, S., Salzberg, S., Beigel, R.: OC1: A randomized induction of oblique decision trees. In: AAAI. pp. 322\u2013327. AAAI Press \/ The MIT Press (1993)","DOI":"10.1613\/jair.63"},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Neider, D., Markgraf, O.: Learning-based synthesis of safety controllers. In: FMCAD. pp. 120\u2013128. IEEE (2019)","DOI":"10.23919\/FMCAD.2019.8894254"},{"key":"17_CR41","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: Machine learning in Python. Journal of Machine Learning Research 12, 2825\u20132830 (2011)"},{"key":"17_CR42","unstructured":"Pyeatt, L.D., Howe, A.E., et\u00a0al.: Decision tree function approximation in reinforcement learning. In: Proceedings of the third international symposium on adaptive systems: evolutionary computation and probabilistic graphical models. vol.\u00a02, pp. 70\u201377. Cuba (2001)"},{"key":"17_CR43","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)"},{"key":"17_CR44","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann (1993)"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Rungger, M., Zamani, M.: SCOTS: A tool for the synthesis of symbolic controllers. In: HSCC. pp. 99\u2013104. ACM (2016)","DOI":"10.1145\/2883817.2883834"},{"key":"17_CR46","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(4), 623\u2013656 (1948)"},{"key":"17_CR47","unstructured":"St-Aubin, R., Hoey, J., Boutilier, C.: APRICODD: approximate policy construction using decision diagrams. In: NIPS. pp. 1089\u20131095. MIT Press (2000)."},{"key":"17_CR48","doi-asserted-by":"crossref","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., van\u00a0der Walt, S., Brett, M., Wilson, J., Millman, K.J., Mayorov, N., Nelson, A.R.J., Jones, E., Kern, R., Larson, E., Carey, C.J., Polat, I., Feng, Y., Moore, E.W., VanderPlas, J., Laxalde, D., Perktold, J., Cimrman, R., Henriksen, I., Quintero, E.A., Harris, C.R., Archibald, A.M., Ribeiro, A.H., Pedregosa, F., van Mulbregt, P., SciPy: Scipy 1.0-fundamental algorithms for scientific computing in python. CoRR abs\/1907.10121 (2019)","DOI":"10.1038\/s41592-020-0772-5"},{"key":"17_CR49","doi-asserted-by":"publisher","unstructured":"Zapreev, I.S., Verdier, C., Jr., M.M.: Optimal symbolic controllers determinization for BDD storage. In: ADHS 2018. IFAC-PapersOnLine, vol.\u00a051, pp.\u00a01\u20136. Elsevier (2018). https:\/\/doi.org\/10.1016\/j.ifacol.2018.08.001","DOI":"10.1016\/j.ifacol.2018.08.001"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72013-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T00:08:51Z","timestamp":1619741331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72013-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720124","9783030720131"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72013-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"23 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","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":"tacas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/tacas","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":"141","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":"41","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":"21","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":"29% - 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":"12","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 changed to an online 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)"}}]}}