{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T16:59:47Z","timestamp":1758992387003,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"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_6","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"90-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search"],"prefix":"10.1007","author":[{"given":"Shaowei","family":"Cai","sequence":"first","affiliation":[]},{"given":"Xindi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artif. Intell. 196, 77\u2013105 (2013)","journal-title":"Artif. Intell."},{"key":"6_CR2","unstructured":"Ans\u00f3tegui, C., Didier, F., Gab\u00e0s, J.: Exploiting the structure of unsatisfiable cores in MaxSAT. In: Proceedings of IJCAI 2015, pp. 283\u2013289 (2015)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2017.05.003","volume":"250","author":"C Ans\u00f3tegui","year":"2017","unstructured":"Ans\u00f3tegui, C., Gab\u00e0s, J.: WPM3: an (in)complete algorithm for weighted partial MaxSAT. Artif. Intell. 250, 37\u201357 (2017)","journal-title":"Artif. Intell."},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-015-9300-7","volume":"22","author":"C Ans\u00f3tegui","year":"2016","unstructured":"Ans\u00f3tegui, C., Gab\u00e0s, J., Levy, J.: Exploiting subproblem optimization in SAT-based MaxSAT algorithms. J. Heuristics 22(1), 1\u201353 (2016). https:\/\/doi.org\/10.1007\/s10732-015-9300-7","journal-title":"J. Heuristics"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Benedetti, M., Mori, M.: On the use of Max-SAT and PDDL in RBAC maintenance. Cybersecurity 2(1) (2019). Article number: 19. https:\/\/doi.org\/10.1186\/s42400-019-0036-9","DOI":"10.1186\/s42400-019-0036-9"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-19212-9_3","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"J Berg","year":"2019","unstructured":"Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-boosted linear search for incomplete MaxSAT. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 39\u201356. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19212-9_3"},{"issue":"2\u20133","key":"6_CR7","first-page":"59","volume":"7","author":"DL Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The SAT4J library, release 2.2. JSAT 7(2\u20133), 59\u201364 (2010)","journal-title":"JSAT"},{"key":"6_CR8","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Proceedings of IJCAI 2015, pp. 747\u2013753 (2015)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1613\/jair.5443","volume":"59","author":"S Cai","year":"2017","unstructured":"Cai, S., Lin, J., Luo, C.: Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess. J. Artif. Intell. Res. 59, 463\u2013494 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Cai, S., Luo, C., Thornton, J., Su, K.: Tailoring local search for partial MaxSAT. In: Proceedings of AAAI 2014, pp. 2623\u20132629 (2014)","DOI":"10.1609\/aaai.v28i1.9109"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for Boolean Satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013)","journal-title":"Artif. Intell."},{"issue":"9\u201310","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2016.08.004","volume":"78","author":"E Demirovic","year":"2017","unstructured":"Demirovic, E., Musliu, N.: MaxSAT-based large neighborhood search for high school timetabling. Comput. OR 78, 172\u2013180 (2017)","journal-title":"Comput. OR"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-017-2693-y","volume":"275","author":"E Demirovic","year":"2019","unstructured":"Demirovic, E., Musliu, N., Winter, F.: Modeling and solving staff scheduling with partial weighted MaxSAT. Ann. OR 275(1), 79\u201399 (2019). https:\/\/doi.org\/10.1007\/s10479-017-2693-y","journal-title":"Ann. OR"},{"key":"6_CR15","unstructured":"Dickerson, J.P., Procaccia, A.D., Sandholm, T.: Optimizing kidney exchange with transplant chains: theory and reality. In: AAMAS 2012, pp. 711\u2013718 (2012)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1613\/jair.4953","volume":"55","author":"Z Fang","year":"2016","unstructured":"Fang, Z., Li, C., Xu, K.: An exact algorithm based on MaxSAT reasoning for the maximum weight clique problem. J. Artif. Intell. Res. 55, 799\u2013833 (2016)","journal-title":"J. Artif. Intell. Res."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252\u2013265. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_25"},{"key":"6_CR18","series-title":"Mathematical Programming Studies","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0120689","volume-title":"Approaches to Integer Programming","author":"DR Fulkerson","year":"1974","unstructured":"Fulkerson, D.R., Nemhauser, G.L., Trotter, L.: Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems. In: Balinski, M.L. (ed.) Approaches to Integer Programming. MATHPROGRAMM, vol. 2, pp. 72\u201381. Springer, Heidelberg (1974). https:\/\/doi.org\/10.1007\/BFb0120689"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gao, C., Weise, T., Li, J.: A weighting-based local search heuristic algorithm for the set covering problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2014, pp. 826\u2013831 (2014)","DOI":"10.1109\/CEC.2014.6900355"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-030-30048-7_14","volume-title":"Principles and Practice of Constraint Programming","author":"AP Guerreiro","year":"2019","unstructured":"Guerreiro, A.P., Terra-Neves, M., Lynce, I., Figueira, J.R., Manquinho, V.: Constraint-based techniques in stochastic local search MaxSAT solving. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 232\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_14"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Heras, F., Morgado, A., Marques-Silva, J.: Core-guided binary search algorithms for maximum satisfiability. In: Proceedings of AAAI 2011 (2011)","DOI":"10.1609\/aaai.v25i1.7822"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"134424","DOI":"10.1103\/PhysRevB.94.134424","volume":"94","author":"W Huang","year":"2016","unstructured":"Huang, W., et al.: Finding and proving the exact ground state of a generalized Ising model by convex optimization and MAX-SAT. Phys. Rev. B 94, 134424 (2016)","journal-title":"Phys. Rev. B"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, C., Liu, Y., Many\u00e0, F.: A two-stage MaxSAT reasoning approach for the maximum weight clique problem. In: Proceedings of AAAI 2018, pp. 1338\u20131346 (2018)","DOI":"10.1609\/aaai.v32i1.11527"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Katzmann, M., Komusiewicz, C.: Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem. In: Proceedings of AAAI 2017, pp. 846\u2013852 (2017)","DOI":"10.1609\/aaai.v31i1.10659"},{"key":"6_CR25","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc, J., Janezic, D.: An improved branch and bound algorithm for the maximum clique problem. Commun. Math. Comput. Chem. 58, 569\u2013590 (2007)","journal-title":"Commun. Math. Comput. Chem."},{"issue":"1\/2","key":"6_CR26","first-page":"95","volume":"8","author":"M Koshimura","year":"2012","unstructured":"Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: a partial Max-SAT solver. JSAT 8(1\/2), 95\u2013100 (2012)","journal-title":"JSAT"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial MaxSAT by dynamic local search for SAT. In: Proceedings of IJCAI 2018, pp. 1346\u20131352 (2018)","DOI":"10.24963\/ijcai.2018\/187"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/ijoc.2017.0770","volume":"30","author":"C Li","year":"2018","unstructured":"Li, C., Fang, Z., Jiang, H., Xu, K.: Incremental upper bound for the maximum clique problem. INFORMS J. Comput. 30(1), 137\u2013153 (2018)","journal-title":"INFORMS J. Comput."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Li, C., Fang, Z., Xu, K.: Combining MaxSAT reasoning and incremental upper bound for the maximum clique problem. In: ICTAI 2013, pp. 939\u2013946 (2013)","DOI":"10.1109\/ICTAI.2013.143"},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo, C., Cai, S., Su, K., Huang, W.: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif. Intell. 243, 26\u201344 (2017)","journal-title":"Artif. Intell."},{"issue":"7","key":"6_CR31","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Wu, W., Jie, Z., Su, K.: CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. Comput. 64(7), 1830\u20131843 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-09284-3_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"R Martins","year":"2014","unstructured":"Martins, R., Manquinho, V., Lynce, I.: Open-WBO: a modular MaxSAT solver,. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 438\u2013445. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_33"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-66158-2_14","volume-title":"Principles and Practice of Constraint Programming","author":"C McCreesh","year":"2017","unstructured":"McCreesh, C., Prosser, P., Simpson, K., Trimble, J.: On maximum weight clique algorithms, and how they are evaluated. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 206\u2013225. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_14"},{"issue":"11","key":"6_CR34","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. OR 24(11), 1097\u20131100 (1997)","journal-title":"Comput. OR"},{"issue":"4","key":"6_CR35","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10601-013-9146-2","volume":"18","author":"A Morgado","year":"2013","unstructured":"Morgado, A., Heras, F., Liffiton, M.H., Planes, J., Marques-Silva, J.: Iterative and core-guided MaxSAT solving: a survey and assessment. Constraints Int. J. 18(4), 478\u2013534 (2013). https:\/\/doi.org\/10.1007\/s10601-013-9146-2","journal-title":"Constraints Int. J."},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-31612-8_22","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A Morgado","year":"2012","unstructured":"Morgado, A., Heras, F., Marques-Silva, J.: Improvements to core-guided binary search for MaxSAT. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 284\u2013297. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_22"},{"key":"6_CR37","first-page":"129","volume":"9","author":"A Morgado","year":"2014","unstructured":"Morgado, A., Ignatiev, A., Marques-Silva, J.: MSCG: robust core-guided MaxSAT solving. JSAT 9, 129\u2013134 (2014)","journal-title":"JSAT"},{"key":"6_CR38","unstructured":"Nadel, A.: Tt-Open-WBO-Inc.: Tuning polarity and variable selection for anytime SAT-based optimizatio. In: Proceedings of MaxSAT Evaluation 2019: Solver and Benchmark Description, p. 29 (2019)"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: Proceedings of AAAI 2014, pp. 2717\u20132723 (2014)","DOI":"10.1609\/aaai.v28i1.9124"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S1571-0653(05)80045-9","volume":"3","author":"PRJ \u00d6sterg\u00e5rd","year":"1999","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A new algorithm for the maximum-weight clique problem. Electron. Notes Discrete Math. 3, 153\u2013156 (1999)","journal-title":"Electron. Notes Discrete Math."},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of AAAI 2015, pp. 4292\u20134293 (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"3","key":"6_CR42","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/s10489-016-0796-9","volume":"45","author":"PS Segundo","year":"2016","unstructured":"Segundo, P.S., Lopez, A., Batsyn, M., Nikolaev, A., Pardalos, P.M.: Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 45(3), 868\u2013880 (2016). https:\/\/doi.org\/10.1007\/s10489-016-0796-9","journal-title":"Appl. Intell."},{"issue":"2","key":"6_CR43","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"PS Segundo","year":"2011","unstructured":"Segundo, P.S., Rodr\u00edguez-Losada, D., Jim\u00e9nez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. OR 38(2), 571\u2013581 (2011)","journal-title":"Comput. OR"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Tomita, E., Sutani, Y., Higashi, T., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments. IEICE Trans. 96-D(6), 1286\u20131298 (2013)","DOI":"10.1587\/transinf.E96.D.1286"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Wagner, M., Friedrich, T., Lindauer, M.: Improving local search in a minimum vertex cover solver for classes of networks. In: IEEE Congress on Evolutionary Computation, CEC 2017, pp. 1704\u20131711 (2017)","DOI":"10.1109\/CEC.2017.7969507"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Wang, Y., Cai, S., Yin, M.: Two efficient local search algorithms for maximum weight clique problem. In: Proceedings of AAAI 2016, pp. 805\u2013811 (2016)","DOI":"10.1609\/aaai.v30i1.10067"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:49:41Z","timestamp":1668638981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_6","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)"}}]}}