{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:01:32Z","timestamp":1742943692540,"version":"3.40.3"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"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-58475-7_23","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"392-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visualizations to Summarize Search Behavior"],"prefix":"10.1007","author":[{"given":"Ian S.","family":"Howell","sequence":"first","affiliation":[]},{"given":"Berthe Y.","family":"Choueiry","sequence":"additional","affiliation":[]},{"given":"Hongfeng","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Balafrej, A., Bessiere, C., Bouyakhf, E., Trombettoni, G.: Adaptive singleton-based consistencies. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2601\u20132607 (2014)","DOI":"10.1609\/aaai.v28i1.9120"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-40627-0_14","volume-title":"Principles and Practice of Constraint Programming","author":"A Balafrej","year":"2013","unstructured":"Balafrej, A., Bessiere, C., Coletta, R., Bouyakhf, E.H.: Adaptive parameterized consistency. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 143\u2013158. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_14"},{"key":"23_CR3","unstructured":"Balafrej, A., Bessi\u00e8re, C., Paparrizou, A.: Multi-armed bandits for adaptive constraint propagation. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 290\u2013296 (2015)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-45578-7_39","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"H Bennaceur","year":"2001","unstructured":"Bennaceur, H., Affane, M.-S.: Partition-k-AC: an efficient filtering technique combining domain partition and arc consistency. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 560\u2013564. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_39"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-61551-2_66","volume-title":"Principles and Practice of Constraint Programming \u2014 CP96","author":"C Bessi\u00e8re","year":"1996","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.-C.: MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 61\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61551-2_66"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.artint.2007.10.016","volume":"172","author":"C Bessi\u00e8re","year":"2008","unstructured":"Bessi\u00e8re, C., Stergiou, K., Walsh, T.: Domain filtering consistencies for non-binary constraints. Artif. Intell. 172, 800\u2013822 (2008)","journal-title":"Artif. Intell."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bitner, J.R., Reingold, E.M.: Backtrack programming techniques. Commun. ACM 18(11), 651\u2013656 (1975). http:\/\/doi.acm.org\/10.1145\/361219.361224","DOI":"10.1145\/361219.361224"},{"key":"23_CR8","unstructured":"Bliek, C., Sam-Haroud, D.: Path consistency for triangulated constraint graphs. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 456\u2013461 (1999)"},{"key":"23_CR9","unstructured":"Borrett, J.E., Tsang, E.P., Walsh, N.R.: Adaptive constraint satisfaction: the quickest first principle. In: Proceedings of the Twelveth European Conference on Artificial Intelligence (ECAI 1996), pp. 160\u2013164 (1996)"},{"key":"23_CR10","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI 2006), pp. 146\u2013150 (2004)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/10722311_11","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"M Carro","year":"2000","unstructured":"Carro, M., Hermenegildo, M.: Tools for constraint visualisation: the VIFID\/TRIFID tool. In: Deransart, P., Hermenegildo, M.V., Ma\u0142uszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol. 1870, pp. 253\u2013272. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722311_11"},{"key":"23_CR12","unstructured":"Choco: An Open-Source Java Library for Constraint Programming. https:\/\/choco-solver.org"},{"key":"23_CR13","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 412\u2013417 (1997)"},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","volume":"20","author":"D Defays","year":"1977","unstructured":"Defays, D.: An efficient algorithm for a complete link method. Comput. J. 20(4), 364\u2013366 (1977)","journal-title":"Comput. J."},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61\u201375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_5"},{"key":"23_CR16","unstructured":"Epstein, S.L., Freuder, E.C., Wallace, R.M., Li, X.: Learning propagation policies. In: Working Notes of the Second International Workshop on Constraint Propagation and Implementation, Held in Conjunction with CP-05, pp. 1\u201315 (2005)"},{"key":"23_CR17","unstructured":"Freuder, E.C., Elfe, C.D.: Neighborhood inverse consistency preprocessing. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), pp. 202\u2013208 (1996)"},{"key":"23_CR18","unstructured":"Freuder, E.C., Wallace, R.J.: Selective relaxation for constraint satisfaction problems. In: Proceedings of the IEEE Third International Conference on Tools with Artificial Intelligence (ICTAI 1991), pp. 332\u2013339 (1991)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Ghoniem, M., Cambazard, H., Fekete, J.D., Jussien, N.: Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming. In: Proceedings of the 2005 ACM Symposium on Software Visualization (SoftVis 2005), pp. 27\u201336 (2005)","DOI":"10.1145\/1056018.1056022"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Hayes, P.J.: The second Naive physics manifesto. In: Readings in Qualitative Reasoning About Physical Systems, pp. 46\u201363. Morgan Kaufmann (1990)","DOI":"10.1016\/B978-1-4832-1447-4.50010-9"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-31365-3_28","volume-title":"Automated Reasoning","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Heule, M.J.H., Biere, A.: Inprocessing rules. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 355\u2013370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Karakashian, S., Woodward, R., Reeson, C., Choueiry, B.Y., Bessiere, C.: A first practical algorithm for high levels of relational consistency. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 101\u2013107 (2010)","DOI":"10.1609\/aaai.v24i1.7535"},{"key":"23_CR23","volume-title":"Qualitative Reasoning - Modeling and Simulation with Incomplete Knowledge","author":"B Kuipers","year":"1994","unstructured":"Kuipers, B.: Qualitative Reasoning - Modeling and Simulation with Incomplete Knowledge. MIT Press, Cambridge (1994)"},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-04244-7_42","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"MZ Lagerkvist","year":"2009","unstructured":"Lagerkvist, M.Z., Schulte, C.: Propagator groups. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 524\u2013538. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_42"},{"key":"23_CR26","unstructured":"Mackworth, A.K.: On reading sketch maps. In: Proceedings of the Fifth International Joint Conference on Artificial Intelligence (IJCAI 1977), pp. 598\u2013606 (1977)"},{"key":"23_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to Information Retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C.D., Raghavan, P., Sch\u00fctze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge (2008)"},{"key":"23_CR28","series-title":"Undergraduate Topics in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21903-5","volume-title":"Introduction to HPC with MPI for Data Science","author":"F Nielsen","year":"2016","unstructured":"Nielsen, F.: Introduction to HPC with MPI for Data Science. UTCS. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21903-5"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Paparrizou, A., Stergiou, K.: Evaluating simple fully automated heuristics for adaptive constraint propagation. In: Proceedings of the IEEE Twenty-Fourth International Conference on Tools with Artificial Intelligence (ICTAI 2012), pp. 880\u2013885 (2012)","DOI":"10.1109\/ICTAI.2012.123"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Paparrizou, A., Stergiou, K.: On neighborhood singleton consistencies. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017), pp. 736\u2013742 (2017)","DOI":"10.24963\/ijcai.2017\/102"},{"key":"23_CR31","unstructured":"Petit, T.: Personal communication (2020)"},{"key":"23_CR32","unstructured":"Phan, K.: Extending the Choco constraint-solver with high-level consistency with evaluation on the nonogram puzzle. Undergraduate thesis. Department of Computer Science and Engineering, University of Nebraska-Lincoln (2020)"},{"key":"23_CR33","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1613\/jair.1776","volume":"24","author":"N Samaras","year":"2005","unstructured":"Samaras, N., Stergiou, K.: Binary encodings of non-binary constraint satisfaction problems: algorithms and experimental results. JAIR 24, 641\u2013684 (2005)","journal-title":"JAIR"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-61756-6_108","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"C Schulte","year":"1996","unstructured":"Schulte, C.: Oz explorer: a visual constraint programming tool. In: Kuchen, H., Doaitse Swierstra, S. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 477\u2013478. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61756-6_108"},{"key":"23_CR35","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and Programming with Gecode (2015). http:\/\/www.gecode.org\/doc-latest\/MPG.pdf"},{"key":"23_CR36","unstructured":"SciPy.org: scipy.cluster.hierarchy.linkage. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/generated\/scipy.cluster.hierarchy.linkage.html. Accessed 26 May 2020"},{"issue":"1","key":"23_CR37","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10601-015-9202-1","volume":"21","author":"M Shishmarev","year":"2016","unstructured":"Shishmarev, M., Mears, C., Tack, G., de la Banda, M.G.: Visual search tree profiling. Constraints 21(1), 77\u201394 (2016)","journal-title":"Constraints"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/10722311_8","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"H Simonis","year":"2000","unstructured":"Simonis, H., Aggoun, A.: Search-tree visualisation. In: Deransart, P., Hermenegildo, M.V., Ma\u0142uszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol. 1870, pp. 191\u2013208. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722311_8"},{"key":"23_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-642-15396-9_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"H Simonis","year":"2010","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M.: A generic visualization platform for CP. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 460\u2013474. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_37"},{"key":"23_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-21311-3_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"H Simonis","year":"2011","unstructured":"Simonis, H., O\u2019Sullivan, B.: Almost square packing. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 196\u2013209. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_19"},{"key":"23_CR41","unstructured":"Stergiou, K.: Heuristics for dynamically adapting propagation. In: Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI 2008), pp. 485\u2013489 (2008)"},{"issue":"2","key":"23_CR42","doi-asserted-by":"publisher","first-page":"345","DOI":"10.3233\/AIC-140635","volume":"28","author":"RJ Wallace","year":"2015","unstructured":"Wallace, R.J.: SAC and neighbourhood SAC. AI Commun. 28(2), 345\u2013364 (2015)","journal-title":"AI Commun."},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"Woodward, R., Karakashian, S., Choueiry, B.Y., Bessiere, C.: Solving difficult CSPs with relational neighborhood inverse consistency. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 112\u2013119 (2011)","DOI":"10.1609\/aaai.v25i1.7825"},{"key":"23_CR44","unstructured":"Woodward, R.J.: Relational neighborhood inverse consistency for constraint satisfaction: a structure-based approach for adjusting consistency and managing propagation. Master\u2019s thesis, Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE, December 2011"},{"key":"23_CR45","unstructured":"Woodward, R.J.: Higher-level consistencies: where, when, and how much. Ph.D. thesis, University of Nebraska-Lincoln, December 2018"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"Woodward, R.J., Choueiry, B.Y., Bessiere, C.: A reactive strategy for high-level consistency during search. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 1390\u20131397 (2018)","DOI":"10.24963\/ijcai.2018\/193"},{"key":"23_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-642-33558-7_50","volume-title":"Principles and Practice of Constraint Programming","author":"RJ Woodward","year":"2012","unstructured":"Woodward, R.J., Karakashian, S., Choueiry, B.Y., Bessiere, C.: Revisiting neighborhood inverse consistency on binary CSPs. In: Milano, M. (ed.) CP 2012. LNCS, pp. 688\u2013703. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_50"},{"key":"23_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/978-3-319-10428-7_54","volume-title":"Principles and Practice of Constraint Programming","author":"RJ Woodward","year":"2014","unstructured":"Woodward, R.J., Schneider, A., Choueiry, B.Y., Bessiere, C.: Adaptive parameterized consistency for non-binary CSPs by counting supports. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 755\u2013764. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_54"},{"key":"23_CR49","unstructured":"Wotzlaw, A., van der Grinten, A., Speckenmeyer, E.: Effectiveness of pre- and inprocessing for CDCL-based SAT solving. Technical report, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln, Germany (2013). http:\/\/arxiv.org\/abs\/1310.4756"},{"key":"23_CR50","unstructured":"XCSP3: Benchmark Series in XCSP3 Format. http:\/\/xcsp.org\/series. Accessed 24 May 2020"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:55:00Z","timestamp":1668639300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_23","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":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","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":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"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.13","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":"3.47","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)"}}]}}