{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:10:35Z","timestamp":1743016235732,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030851712"},{"type":"electronic","value":"9783030851729"}],"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:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85172-9_2","type":"book-chapter","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T23:04:46Z","timestamp":1629327886000},"page":"15-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6353-227X","authenticated-orcid":false,"given":"Michaela","family":"Klauck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2766-9615","authenticated-orcid":false,"given":"Holger","family":"Hermanns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,19]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aljazzar, H., Leue, S.: Generation of counterexamples for model checking of Markov decision processes. In: QEST 2009, Sixth International Conference on the Quantitative Evaluation of Systems, Budapest, Hungary, 13-16 September 2009. pp. 197\u2013206. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/QEST.2009.10, https:\/\/ieeexplore.ieee.org\/xpl\/conhome\/5290656\/proceeding","key":"2_CR1","DOI":"10.1109\/QEST.2009.10"},{"doi-asserted-by":"publisher","unstructured":"Ashok, P., Br\u00e1zdil, T., Kret\u00ednsk\u00fd, J., Sl\u00e1mecka, O.: Monte carlo tree search for verifying reachability in Markov decision processes. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation. Verification - 8th International Symposium, ISoLA 2018, Limassol, Cyprus, November 5-9, 2018, Proceedings, Part II. Lecture Notes in Computer Science, vol. 11245, pp. 322\u2013335. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03421-4_21","key":"2_CR2","DOI":"10.1007\/978-3-030-03421-4_21"},{"doi-asserted-by":"publisher","unstructured":"Ashok, P., Kret\u00ednsk\u00fd, J., Weininger, M.: PAC statistical model checking for Markov decision processes and stochastic games. In: Dillig and Tasiran [15], pp. 497\u2013519. https:\/\/doi.org\/10.1007\/978-3-030-25540-4_29","key":"2_CR3","DOI":"10.1007\/978-3-030-25540-4_29"},{"doi-asserted-by":"publisher","unstructured":"Barto, A.G., Bradtke, S.J., Singh, S.P.: Learning to act using real-time dynamic programming. Artif. Intell. 72(1-2), 81\u2013138 (1995). https:\/\/doi.org\/10.1016\/0004-3702(94)00011-O","key":"2_CR4","DOI":"10.1016\/0004-3702(94)00011-O"},{"doi-asserted-by":"crossref","unstructured":"Bellman, R.: A Markovian decision process. Journal of mathematics and mechanics 6(5), 679\u2013684 (1957)","key":"2_CR5","DOI":"10.1512\/iumj.1957.6.56038"},{"unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, Vol. 1. Athena Scientific (1995)","key":"2_CR6"},{"unstructured":"Bertsekas, D.P.: Dynamic Programming and Optimal Control, Vol. 2. Athena Scientific (1995)","key":"2_CR7"},{"unstructured":"Bonet, B., Geffner, H.: Labeled RTDP: improving the convergence of real-time dynamic programming. In: Giunchiglia, E., Muscettola, N., Nau, D.S. (eds.) Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), June 9-13, 2003, Trento, Italy. pp. 12\u201321. AAAI (2003), http:\/\/www.aaai.org\/Library\/ICAPS\/2003\/icaps03-002.php","key":"2_CR8"},{"unstructured":"Bonet, B., Geffner, H.: Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (eds.) Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10, 2006. pp. 142\u2013151. AAAI (2006), http:\/\/www.aaai.org\/Library\/ICAPS\/2006\/icaps06-015.php","key":"2_CR9"},{"doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kret\u00ednsk\u00fd, J., Kwiatkowska, M.Z., Parker, D., Ujma, M.: Verification of Markov decision processes using learning algorithms. In: Cassez, F., Raskin, J. (eds.) Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings. Lecture Notes in Computer Science, vol.\u00a08837, pp. 98\u2013114. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11936-6_8, https:\/\/doi.org\/10.1007\/978-3-319-11936-6","key":"2_CR10","DOI":"10.1007\/978-3-319-11936-6_8 10.1007\/978-3-319-11936-6"},{"doi-asserted-by":"publisher","unstructured":"Budde, C.E., D\u2019Argenio, P.R., Hartmanns, A., Sedwards, S.: An efficient statistical model checker for nondeterminism and rare events. Int. J. Softw. Tools Technol. Transf. 22(6), 759\u2013780 (2020). https:\/\/doi.org\/10.1007\/s10009-020-00563-2","key":"2_CR11","DOI":"10.1007\/s10009-020-00563-2"},{"doi-asserted-by":"publisher","unstructured":"Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: Quantitative model and tool interaction. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10206, pp. 151\u2013168 (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_9","key":"2_CR12","DOI":"10.1007\/978-3-662-54580-5_9"},{"doi-asserted-by":"publisher","unstructured":"Budde, C.E., Hartmanns, A., Klauck, M., Kretinsky, J., Parker, D., Quatmann, T., Turrini, A., Zhang, Z.: On Correctness, Precision, and Performance in Quantitative Verification (QComp 2020 Competition Report). In: Proceedings of the 9th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation. Software Verification Tools (2020). https:\/\/doi.org\/10.1007\/978-3-030-83723-5_15","key":"2_CR13","DOI":"10.1007\/978-3-030-83723-5_15"},{"doi-asserted-by":"publisher","unstructured":"Dehnert, C., Junges, S., Katoen, J., Volk, M.: A storm is coming: A modern probabilistic model checker. In: Majumdar, R., Kuncak, V. (eds.) Computer Aided Verification - 29th International Conference, CAV 2017, Heidelberg, Germany, July 24-28, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10427, pp. 592\u2013600. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_31","key":"2_CR14","DOI":"10.1007\/978-3-319-63390-9_31"},{"doi-asserted-by":"publisher","unstructured":"Dillig, I., Tasiran, S. (eds.): Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I, Lecture Notes in Computer Science, vol. 11561. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4","key":"2_CR15","DOI":"10.1007\/978-3-030-25540-4"},{"doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Hartmanns, A.: A comparison of time- and reward-bounded probabilistic model checking techniques. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) Dependable Software Engineering: Theories, Tools, and Applications - Second International Symposium, SETTA 2016, Beijing, China, November 9-11, 2016, Proceedings. Lecture Notes in Computer Science, vol.\u00a09984, pp. 85\u2013100 (2016). https:\/\/doi.org\/10.1007\/978-3-319-47677-3_6","key":"2_CR16","DOI":"10.1007\/978-3-319-47677-3_6"},{"unstructured":"Hahn, E.M., Hartmanns, A.: Efficient algorithms for time- and cost-bounded probabilistic model checking. CoRR abs\/1605.05551 (2016), http:\/\/arxiv.org\/abs\/1605.05551","key":"2_CR17"},{"doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Hartmanns, A., Hensel, C., Klauck, M., Klein, J., Kret\u00ednsk\u00fd, J., Parker, D., Quatmann, T., Ruijters, E., Steinmetz, M.: The 2019 comparison of tools for the analysis of quantitative formal models - (QComp 2019 competition report). In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of TACAS: TOOLympics, Held as Part of ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part III. Lecture Notes in Computer Science, vol. 11429, pp. 69\u201392. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_5","key":"2_CR18","DOI":"10.1007\/978-3-030-17502-3_5"},{"doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Hartmanns, A., Hermanns, H.: Reachability and reward checking for stochastic timed automata. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014). https:\/\/doi.org\/10.14279\/tuj.eceasst.70.968","key":"2_CR19","DOI":"10.14279\/tuj.eceasst.70.968"},{"doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Li, Y., Schewe, S., Turrini, A., Zhang, L.: iscasMc: A web-based probabilistic model checker. In: Jones, C.B., Pihlajasaari, P., Sun, J. (eds.) FM 2014: Formal Methods - 19th International Symposium, Singapore, May 12-16, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08442, pp. 312\u2013317. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-06410-9_22, https:\/\/doi.org\/10.1007\/978-3-319-06410-9","key":"2_CR20","DOI":"10.1007\/978-3-319-06410-9_22 10.1007\/978-3-319-06410-9"},{"doi-asserted-by":"publisher","unstructured":"Hansen, E.A., Zilberstein, S.: Lao$${}^{\\text{*}}$$: A heuristic search algorithm that finds solutions with loops. Artif. Intell. 129(1-2), 35\u201362 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(01)00106-0","key":"2_CR21","DOI":"10.1016\/S0004-3702(01)00106-0"},{"doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Hermanns, H.: The Modest Toolset: An integrated environment for quantitative modelling and verification. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08413, pp. 593\u2013598. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_51","key":"2_CR22","DOI":"10.1007\/978-3-642-54862-8_51"},{"doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Hermanns, H.: Explicit model checking of very large MDP using partitioning and secondary storage. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) Automated Technology for Verification and Analysis - 13th International Symposium, ATVA 2015, Shanghai, China, October 12-15, 2015, Proceedings. Lecture Notes in Computer Science, vol.\u00a09364, pp. 131\u2013147. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_10","key":"2_CR23","DOI":"10.1007\/978-3-319-24953-7_10"},{"doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The Quantitative Verification Benchmark Set. In: Vojnar, T., Zhang, L. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11427, pp. 344\u2013350. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_20","key":"2_CR24","DOI":"10.1007\/978-3-030-17462-0_20"},{"unstructured":"Hatefi-Ardakani, H.: Finite horizon analysis of Markov automata. Ph.D. thesis, Saarland University, Germany (2017), http:\/\/scidok.sulb.uni-saarland.de\/volltexte\/2017\/6743\/","key":"2_CR25"},{"unstructured":"Helmert, M.: The fast downward planning system. CoRR abs\/1109.6051 (2011), http:\/\/arxiv.org\/abs\/1109.6051","key":"2_CR26"},{"doi-asserted-by":"publisher","unstructured":"Izadi, M.T.: Sequential decision making under uncertainty. In: Zucker, J., Saitta, L. (eds.) Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings. Lecture Notes in Computer Science, vol.\u00a03607, pp. 360\u2013361. Springer (2005). https:\/\/doi.org\/10.1007\/11527862_33","key":"2_CR27","DOI":"10.1007\/11527862_33"},{"doi-asserted-by":"crossref","unstructured":"The JANI specification. http:\/\/www.jani-spec.org\/, accessed on 25\/06\/2021","key":"2_CR28","DOI":"10.1088\/1475-7516\/2021\/06\/044"},{"doi-asserted-by":"crossref","unstructured":"Klauck, M., Hermanns, H.: Artifact accompanying the paper \"A Modest Approach to Dynamic Heuristic Search in Probabilistic Model Checking\" (2021), available at http:\/\/doi.org\/10.5281\/zenodo.4922360","key":"2_CR29","DOI":"10.1007\/978-3-030-85172-9_2"},{"unstructured":"Kolobov, A.: Scalable methods and expressive models for planning under uncertainty. Ph.D. thesis, University of Washington (2013)","key":"2_CR30"},{"unstructured":"Kolobov, A., Mausam, Weld, D.S., Geffner, H.: Heuristic search for generalized stochastic shortest path mdps. In: Bacchus, F., Domshlak, C., Edelkamp, S., Helmert, M. (eds.) Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI (2011), http:\/\/aaai.org\/ocs\/index.php\/ICAPS\/ICAPS11\/paper\/view\/2682","key":"2_CR31"},{"doi-asserted-by":"publisher","unstructured":"Kret\u00ednsk\u00fd, J., Meggendorfer, T.: Efficient strategy iteration for mean payoff in Markov decision processes. In: D\u2019Souza, D., Kumar, K.N. (eds.) Automated Technology for Verification and Analysis - 15th International Symposium, ATVA 2017, Pune, India, October 3-6, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10482, pp. 380\u2013399. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_25, https:\/\/doi.org\/10.1007\/978-3-319-68167-2","key":"2_CR32","DOI":"10.1007\/978-3-319-68167-2_25 10.1007\/978-3-319-68167-2"},{"doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: Verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. Lecture Notes in Computer Science, vol.\u00a06806, pp. 585\u2013591. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47, https:\/\/doi.org\/10.1007\/978-3-642-22110-1","key":"2_CR33","DOI":"10.1007\/978-3-642-22110-1_47 10.1007\/978-3-642-22110-1"},{"doi-asserted-by":"publisher","unstructured":"Neupane, T., Myers, C.J., Madsen, C., Zheng, H., Zhang, Z.: STAMINA: stochastic approximate model-checker for infinite-state analysis. In: Dillig and Tasiran [15], pp. 540\u2013549. https:\/\/doi.org\/10.1007\/978-3-030-25540-4_31","key":"2_CR34","DOI":"10.1007\/978-3-030-25540-4_31"},{"doi-asserted-by":"publisher","unstructured":"Ruijters, E., Reijsbergen, D., de\u00a0Boer, P., Stoelinga, M.: Rare event simulation for dynamic fault trees. Reliab. Eng. Syst. Saf. 186, 220\u2013231 (2019). https:\/\/doi.org\/10.1016\/j.ress.2019.02.004","key":"2_CR35","DOI":"10.1016\/j.ress.2019.02.004"},{"doi-asserted-by":"publisher","unstructured":"Steinmetz, M., Hoffmann, J., Buffet, O.: Goal probability analysis in probabilistic planning: Exploring and enhancing the state of the art. J. Artif. Intell. Res. 57, 229\u2013271 (2016). https:\/\/doi.org\/10.1613\/jair.5153","key":"2_CR36","DOI":"10.1613\/jair.5153"},{"doi-asserted-by":"publisher","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972). https:\/\/doi.org\/10.1137\/0201010","key":"2_CR37","DOI":"10.1137\/0201010"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85172-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T18:10:40Z","timestamp":1634839840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85172-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030851712","9783030851729"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85172-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.qest.org\/","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":"47","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":"21","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":"2","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":"45% - 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.5","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-6","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":"1 keynote paper is also included.","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)"}}]}}