{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:59:54Z","timestamp":1792756794783,"version":"4.5.0"},"publisher-location":"Cham","reference-count":36,"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_9","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"114-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Distributed Cube and Conquer with Paracooba"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Heisinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1705-3083","authenticated-orcid":false,"given":"Mathias","family":"Fleury","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-9242","authenticated-orcid":false,"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-66263-3_14","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"G Audemard","year":"2017","unstructured":"Audemard, G., Lagniez, J.-M., Szczepanski, N., Tabary, S.: A distributed version of Syrup. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 215\u2013232. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66263-3_14"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-33558-7_11","volume-title":"Principles and Practice of Constraint Programming","author":"G Audemard","year":"2012","unstructured":"Audemard, G., Simon, L.: Refining restarts strategies for SAT and UNSAT. In: Milano, M. (ed.) CP 2012. LNCS, pp. 118\u2013126. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33558-7_11"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-24318-4_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"T Balyo","year":"2015","unstructured":"Balyo, T., Sanders, P., Sinz, C.: HordeSat: a massively parallel portfolio SAT solver. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 156\u2013172. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_12"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63516-3_1","volume-title":"Handbook of Parallel Constraint Reasoning","author":"T Balyo","year":"2018","unstructured":"Balyo, T., Sinz, C.: Parallel satisfiability. Handbook of Parallel Constraint Reasoning, pp. 3\u201329. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63516-3_1"},{"key":"9_CR5","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling and YalSAT entering the SAT Competition 2018. In: Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Competition 2018 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2018-1, pp. 13\u201314. University of Helsinki (2018)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-24318-4_29","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"A Biere","year":"2015","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL variable scoring schemes. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 405\u2013422. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_29"},{"key":"9_CR7","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL restart schemes. In: Berre, D.L., J\u00e4rvisalo, M. (eds.) POS 2015\/POS 2018. EPiC Series in Computing, vol. 59, pp. 1\u201317. EasyChair (2018). \nhttp:\/\/www.easychair.org\/publications\/paper\/RdBL"},{"key":"9_CR8","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"issue":"7","key":"9_CR9","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/S0167-8191(03)00068-1","volume":"29","author":"W Blochinger","year":"2003","unstructured":"Blochinger, W., Sinz, C., K\u00fcchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Comput. 29(7), 969\u2013994 (2003). \nhttps:\/\/doi.org\/10.1016\/S0167-8191(03)00068-1","journal-title":"Parallel Comput."},{"key":"9_CR10","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). \nhttps:\/\/doi.org\/10.1007\/11499107_5"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-24258-9_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"K Fazekas","year":"2019","unstructured":"Fazekas, K., Biere, A., Scholl, C.: Incremental inprocessing in SAT solving. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 136\u2013154. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-24258-9_9"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-03770-2_2","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"RL Graham","year":"2009","unstructured":"Graham, R.L.: The MPI 2.2 standard and the emerging MPI 3 standard. In: Ropo, M., Westerholm, J., Dongarra, J. (eds.) EuroPVM\/MPI 2009. LNCS, vol. 5759, p. 2. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03770-2_2"},{"issue":"4","key":"9_CR13","first-page":"245","volume":"6","author":"Y Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. JSAT 6(4), 245\u2013262 (2009)","journal-title":"JSAT"},{"key":"9_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63516-3","volume-title":"Handbook of Parallel Constraint Reasoning","year":"2018","unstructured":"Hamadi, Y., Sais, L. (eds.): Handbook of Parallel Constraint Reasoning. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63516-3"},{"key":"9_CR15","unstructured":"Heisinger, M.: \nhttps:\/\/github.com\/maximaximal\/Paracooba.git\n\n. Accessed Feb 2020"},{"key":"9_CR16","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-34188-5_8"},{"key":"9_CR17","unstructured":"Heule, M.J.H.: Schur number five. In: McIlraith, S.A., Weinberger, K.Q. (eds.) AAAI 2018, pp. 6598\u20136606. AAAI Press (2018). \nhttps:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/16952"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11527695_26","volume-title":"Theory and Applications of Satisfiability Testing","author":"M Heule","year":"2005","unstructured":"Heule, M., Dufour, M., van Zwieten, J., van Maaren, H.: March$$\\_$$eq: implementing additional reasoning into an efficient look-ahead SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 345\u2013359. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11527695_26"},{"key":"9_CR19","unstructured":"Heule, M.J.H., J\u00e4rvisalo, M., Suda, M., Iser, M., Balyo, T.: \nhttps:\/\/satcompetition.github.io\/2020\/track_cloud.html\n\n. Accessed Feb 2020"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-63516-3_2","volume-title":"Handbook of Parallel Constraint Reasoning","author":"MJH Heule","year":"2018","unstructured":"Heule, M.J.H., Kullmann, O., Biere, A.: Cube-and-conquer for satisfiability. Handbook of Parallel Constraint Reasoning, pp. 31\u201359. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63516-3_2"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving very hard problems: cube-and-conquer, a hybrid SAT solving method. In: Creignou, N., Berre, D.L. (eds.) IJCAI 2017. LNCS, vol. 9710, pp. 228\u2013245. IJCAI, August 2017. \nhttps:\/\/doi.org\/10.24963\/ijcai.2017\/683","DOI":"10.24963\/ijcai.2017\/683"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11814948_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"AEJ Hyv\u00e4rinen","year":"2006","unstructured":"Hyv\u00e4rinen, A.E.J., Junttila, T., Niemel\u00e4, I.: A distribution method for solving SAT in grids. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 430\u2013435. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11814948_39"},{"key":"9_CR23","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31365-3_28"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Kaufmann, D., Biere, A., Kauers, M.: Verifying large multipliers by combining SAT and computer algebra. In: Barrett, C.W., Yang, J. (eds.) FMCAD 2019, pp. 28\u201336. IEEE (2019). \nhttps:\/\/doi.org\/10.23919\/FMCAD.2019.8894250","DOI":"10.23919\/FMCAD.2019.8894250"},{"key":"9_CR25","unstructured":"Kaufmann, D., Kauers, M., Biere, A., Cok, D.: Arithmetic verification problems submitted to the SAT Race 2019. In: Heule, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proceedings of SAT Race 2019 - Solver and Benchmark Descriptions. Department of Computer Science Series of Publications B, vol. B-2019-1, p. 49. University of Helsinki (2019)"},{"key":"9_CR26","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). \nhttps:\/\/doi.org\/10.1016\/j.artint.2015.03.004","journal-title":"Artif. Intell."},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-17462-0_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Le Frioux","year":"2019","unstructured":"Le Frioux, L., Baarir, S., Sopena, J., Kordon, F.: Modular and efficient divide-and-conquer SAT solver on top of the painless framework. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 135\u2013151. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17462-0_8"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-40970-2_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"JH Liang","year":"2016","unstructured":"Liang, J.H., Ganesh, V., Poupart, P., Czarnecki, K.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 123\u2013140. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40970-2_9"},{"key":"9_CR29","unstructured":"Marques-Silva, J.P.: SAT: Disruption, demise & resurgence (2019). pOS\u20192019. \nhttp:\/\/www.pragmaticsofsat.org\/2019\/disruption.pdf"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC 2001, pp. 530\u2013535. ACM (2001). \nhttps:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-66263-3_16","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"S Nejati","year":"2017","unstructured":"Nejati, S., et al.: A propagation rate based splitting heuristic for divide-and-conquer solvers. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 251\u2013260. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66263-3_16"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-24318-4_23","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"C Oh","year":"2015","unstructured":"Oh, C.: Between SAT and UNSAT: the fundamental difference in CDCL SAT. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 307\u2013323. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-24318-4_23"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Silva, J.P.M., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 131\u2013153. IOS Press (2009). \nhttps:\/\/doi.org\/10.3233\/978-1-58603-929-5-131","DOI":"10.3233\/978-1-58603-929-5-131"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) ICCAD 1996, pp. 220\u2013227. IEEE Computer Society\/ACM (1996). \nhttps:\/\/doi.org\/10.1109\/ICCAD.1996.569607","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-02777-2_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M Soos","year":"2009","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244\u2013257. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02777-2_24"},{"issue":"4","key":"9_CR36","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symb. Comput. 21(4), 543\u2013560 (1996). \nhttps:\/\/doi.org\/10.1006\/jsco.1996.0030","journal-title":"J. Symb. Comput."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T19:06:58Z","timestamp":1596827218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_9","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"}]}}