{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:10:51Z","timestamp":1776373851445,"version":"3.51.2"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030518240","type":"print"},{"value":"9783030518257","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":"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-51825-7_35","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"501-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["SAT-Based Encodings for Optimal Decision Trees with Explicit Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3487-784X","authenticated-orcid":false,"given":"Mikol\u00e1\u0161","family":"Janota","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5295-1321","authenticated-orcid":false,"given":"Ant\u00f3nio","family":"Morgado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"issue":"7","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106(7), 1039\u20131082 (2017). \n                  https:\/\/doi.org\/10.1007\/s10994-017-5633-9","journal-title":"Mach. Learn."},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-04244-7_16","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Bessiere","year":"2009","unstructured":"Bessiere, C., Hebrard, E., O\u2019Sullivan, B.: Minimising decision tree size as combinatorial optimisation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 173\u2013187. Springer, Heidelberg (2009). \n                  https:\/\/doi.org\/10.1007\/978-3-642-04244-7_16"},{"key":"35_CR3","unstructured":"Biere, A.: CaDiCaL, Lingeling, PLingeling, Treengeling and YalSAT entering the SAT competition 2017. In: Balyo,T., Heule, M., J\u00e4rvisalo, M. (eds.) SAT Competition 2017: Solver and Benchmark Descriptions, pp. 14\u201315. University of Helsinki (2017)"},{"key":"35_CR4","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, p. 980. IOS Press, Amsterdam (2009)"},{"issue":"1","key":"35_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). \n                  https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"key":"35_CR6","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"issue":"4","key":"35_CR7","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electron. Notes Theor. Comput. Sci. 89(4), 543\u2013560 (2003). \n                  https:\/\/doi.org\/10.1016\/S1571-0661(05)82542-3","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-1-4899-7687-1_66","volume-title":"Encyclopedia of Machine Learning and Data Mining","author":"J F\u00fcrnkranz","year":"2017","unstructured":"F\u00fcrnkranz, J.: Decision tree. In: Sammut, C., Webb, G.I. (eds.) Encyclopedia of Machine Learning and Data Mining, pp. 330\u2013335. Springer, Boston (2017). \n                  https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_66"},{"key":"35_CR9","doi-asserted-by":"publisher","unstructured":"Haaswijk, W., Mishchenko, A., Soeken, M., Micheli, G.D.: SAT based exact synthesis using DAG topology families. In: Proceedings of the 55th Annual Design Automation Conference, DAC, pp. 53:1\u201353:6 (2018). \n                  https:\/\/doi.org\/10.1145\/3195970.3196111","DOI":"10.1145\/3195970.3196111"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1006\/inco.1996.0040","volume":"126","author":"TR Hancock","year":"1996","unstructured":"Hancock, T.R., Jiang, T., Li, M., Tromp, J.: Lower bounds on learning decision lists and trees. Inf. Comput. 126(2), 114\u2013122 (1996). \n                  https:\/\/doi.org\/10.1006\/inco.1996.0040","journal-title":"Inf. Comput."},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"MJH Heule","year":"2012","unstructured":"Heule, M.J.H., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: guiding CDCL SAT solvers by lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol. 7261, pp. 50\u201365. Springer, Heidelberg (2012). \n                  https:\/\/doi.org\/10.1007\/978-3-642-34188-5_8"},{"issue":"4","key":"35_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s11786-019-00397-5","volume":"13","author":"MJH Heule","year":"2019","unstructured":"Heule, M.J.H.: Optimal symmetry breaking for graph problems. Math. Comput. Sci. 13(4), 533\u2013548 (2019). \n                  https:\/\/doi.org\/10.1007\/s11786-019-00397-5","journal-title":"Math. Comput. Sci."},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-40970-2_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"MJH Heule","year":"2016","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the boolean pythagorean triples problem via cube-and-conquer. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 228\u2013245. Springer, Cham (2016). \n                  https:\/\/doi.org\/10.1007\/978-3-319-40970-2_15"},{"key":"35_CR14","unstructured":"Hu, X., Rudin, C., Seltzer, M.: Optimal sparse decision trees. In: Neural Information Processing Systems NeurIPS (2019). \n                  http:\/\/papers.nips.cc\/paper\/8947-optimal-sparse-decision-trees"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. 36, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is NP-complete. Inf. Process. Lett. 5(1), 15\u201317 (1976). \n                  https:\/\/doi.org\/10.1016\/0020-0190(76)90095-8","journal-title":"Inf. Process. Lett."},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-16242-8_27","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"AEJ Hyv\u00e4rinen","year":"2010","unstructured":"Hyv\u00e4rinen, A.E.J., Junttila, T., Niemel\u00e4, I.: Partitioning SAT instances for distributed solving. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 372\u2013386. Springer, Heidelberg (2010). \n                  https:\/\/doi.org\/10.1007\/978-3-642-16242-8_27"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-319-94205-6_41","volume-title":"Automated Reasoning","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Pereira, F., Narodytska, N., Marques-Silva, J.: A SAT-based approach to learn explainable decision sets. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 627\u2013645. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-94205-6_41"},{"key":"35_CR20","unstructured":"Janota, M., Morgado, A.: (2020). \n                  http:\/\/sat.inesc-id.pt\/%7Emikolas\/dectrees"},{"key":"35_CR21","doi-asserted-by":"publisher","unstructured":"Kolb, S., Teso, S., Passerini, A., Raedt, L.D.: Learning SMT(LRA) constraints using SMT solvers. In: Lang [24]. \n                  https:\/\/doi.org\/10.24963\/ijcai.2018\/323\n                  \n                , \n                  http:\/\/www.ijcai.org\/proceedings\/2018\/","DOI":"10.24963\/ijcai.2018\/323"},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.artint.2015.03.004","volume":"224","author":"B Konev","year":"2015","unstructured":"Konev, B., Lisitsa, A.: Computer-aided proof of Erd\u0151s discrepancy properties. Artif. Intell. 224, 103\u2013118 (2015). \n                  https:\/\/doi.org\/10.1016\/j.artint.2015.03.004","journal-title":"Artif. Intell."},{"key":"35_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-39071-5_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"J-M Lagniez","year":"2013","unstructured":"Lagniez, J.-M., Biere, A.: Factoring out assumptions to speed up MUS extraction. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 276\u2013292. Springer, Heidelberg (2013). \n                  https:\/\/doi.org\/10.1007\/978-3-642-39071-5_21"},{"key":"35_CR24","unstructured":"Lang, J. (ed.): Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018), Stockholm, Sweden, 13\u201319 July 2018. ijcai.org (2018). \n                  http:\/\/www.ijcai.org\/proceedings\/2018\/"},{"key":"35_CR25","doi-asserted-by":"publisher","unstructured":"Manquinho, V.M., Flores, P.F., Silva, J.P.M., Oliveira, A.L.: Prime implicant computation using satisfiability algorithms. In: 9th International Conference on Tools with Artificial Intelligence ICTAI, pp. 232\u2013239 (1997). \n                  https:\/\/doi.org\/10.1109\/TAI.1997.632261","DOI":"10.1109\/TAI.1997.632261"},{"key":"35_CR26","first-page":"129","volume":"9","author":"A Morgado","year":"2015","unstructured":"Morgado, A., Ignatiev, A., Marques-Silva, J.: MSCG: robust core-guided MaxSAT solving. JSAT 9, 129\u2013134 (2015)","journal-title":"JSAT"},{"key":"35_CR27","doi-asserted-by":"publisher","unstructured":"Narodytska, N., Ignatiev, A., Pereira, F., Marques-Silva, J.: Learning optimal decision trees with SAT. In: Lang [24], pp. 1362\u20131368. \n                  https:\/\/doi.org\/10.24963\/ijcai.2018\/189\n                  \n                , \n                  http:\/\/www.ijcai.org\/proceedings\/2018\/","DOI":"10.24963\/ijcai.2018\/189"},{"key":"35_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-24258-9_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"N Narodytska","year":"2019","unstructured":"Narodytska, N., Shrotri, A., Meel, K.S., Ignatiev, A., Marques-Silva, J.: Assessing heuristic machine learning explanations with model counting. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 267\u2013278. Springer, Cham (2019). \n                  https:\/\/doi.org\/10.1007\/978-3-030-24258-9_19"},{"issue":"1","key":"35_CR29","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1186\/s13040-017-0154-4","volume":"10","author":"RS Olson","year":"2017","unstructured":"Olson, R.S., Cava, W.G.L., Orzechowski, P., Urbanowicz, R.J., Moore, J.H.: PMLB: a large benchmark suite for machine learning evaluation and comparison. BioData Min. 10(1), 36:1\u201336:13 (2017). \n                  https:\/\/doi.org\/10.1186\/s13040-017-0154-4","journal-title":"BioData Min."},{"key":"35_CR30","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011). https:\/\/scikit-learn.org\/","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"35_CR31","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293\u2013304 (1986)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"35_CR32","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"key":"35_CR33","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)"},{"key":"35_CR34","doi-asserted-by":"publisher","first-page":"695","DOI":"10.3233\/978-1-58603-929-5-695","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","author":"O Roussel","year":"2009","unstructured":"Roussel, O., Manquinho, V.M.: Pseudo-boolean and cardinality constraints. In: Biere, A., et al. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 695\u2013733. IOS Press, Amsterdam (2009). \n                  https:\/\/doi.org\/10.3233\/978-1-58603-929-5-695"},{"key":"35_CR35","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Upper Saddle River (2010)"},{"key":"35_CR36","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/978-1-58603-929-5-131","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","author":"JPM Silva","year":"2009","unstructured":"Silva, J.P.M., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., et al. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 131\u2013153. IOS Press, Amsterdam (2009). \n                  https:\/\/doi.org\/10.3233\/978-1-58603-929-5-131"},{"key":"35_CR37","unstructured":"Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C., Schaus, P.: Learning optimal decision trees using constraint programming. In: 31st Benelux Conference on Artificial Intelligence (BNAIC) (2019). \n                  http:\/\/ceur-ws.org\/Vol-2491\/abstract109.pdf"},{"key":"35_CR38","doi-asserted-by":"publisher","unstructured":"Verwer, S., Zhang, Y.: Learning optimal classification trees using a binary linear program formulation. In: The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), pp. 1625\u20131632. AAAI Press (2019). \n                  https:\/\/doi.org\/10.1609\/aaai.v33i01.33011624\n                  \n                , \n                  https:\/\/www.aaai.org\/Library\/AAAI\/aaai19contents.php","DOI":"10.1609\/aaai.v33i01.33011624"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51825-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T23:09:21Z","timestamp":1596841761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_35","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":"26 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alghero","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"3 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2020.idea-researchlab.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":"69","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":"25","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":"9","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":"36% - 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":"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":"The conference was held virtually 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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}