{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:22:25Z","timestamp":1751098945353,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031080104"},{"type":"electronic","value":"9783031080111"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-08011-1_5","type":"book-chapter","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T16:16:42Z","timestamp":1654791402000},"page":"44-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Coupling Different Integer Encodings for\u00a0SAT"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6766-5435","authenticated-orcid":false,"given":"Hendrik","family":"Bierlee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1354-431X","authenticated-orcid":false,"given":"Graeme","family":"Gange","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3357-6498","authenticated-orcid":false,"given":"Guido","family":"Tack","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0053-6724","authenticated-orcid":false,"given":"Jip J.","family":"Dekker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-33954-2_1","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"I Ab\u00edo","year":"2016","unstructured":"Ab\u00edo, I., Gange, G., Mayer-Eichberger, V., Stuckey, P.J.: On CNF encodings of decision diagrams. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 1\u201317. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_1"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-40627-0_9","volume-title":"Principles and Practice of Constraint Programming","author":"I Ab\u00edo","year":"2013","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 80\u201396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_9"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo, I., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E., Mayer-Eichberger, V.: A new look at BDDs for pseudo-Boolean constraints. J. Artif. Intell. Res. 45, 443\u2013480 (2012). https:\/\/doi.org\/10.1613\/jair.3653","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-30048-7_2","volume-title":"Principles and Practice of Constraint Programming","author":"C Ans\u00f3tegui","year":"2019","unstructured":"Ans\u00f3tegui, C., et al.: Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-Boolean Constraints. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 20\u201336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_2"},{"key":"5_CR5","unstructured":"Barahona, P., H\u00f6lldobler, S., Nguyen, V.: Efficient sat-encoding of linear CSP constraints. In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2014, Fort Lauderdale, FL, USA, 6\u20138 January 2014 (2014). http:\/\/www.cs.uic.edu\/pub\/Isaim2014\/WebPreferences\/ISAIM2014_Barahona _etal.pdf"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11941439_9","volume-title":"AI 2006: Advances in Artificial Intelligence","author":"CW Choi","year":"2006","unstructured":"Choi, C.W., Harvey, W., Lee, J.H.M., Stuckey, P.J.: Finite domain bounds consistency revisited. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 49\u201358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941439_9"},{"key":"5_CR7","unstructured":"Chu, G.: Improving combinatorial optimization. Ph.D. thesis, University of Melbourne, Australia (2011). http:\/\/hdl.handle.net\/11343\/36679"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy, T., Stuckey, P.J.: Lazy clause generation reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352\u2013366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_29"},{"key":"5_CR9","unstructured":"Frisch, A.M., Peugniez, T.J.: Solving non-Boolean satisfiability problems with stochastic local search. In: Nebel, B. (ed.) Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, 4\u201310 August 2001, pp. 282\u2013290. Morgan Kaufmann (2001)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-030-58942-4_14","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"G Gange","year":"2020","unstructured":"Gange, G., Berg, J., Demirovi\u0107, E., Stuckey, P.J.: Core-guided and core-boosted search for CP. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 205\u2013221. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_14"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gorjiara, H., Xu, G.H., Demsky, B.: Satune: synthesizing efficient SAT encoders. In: Proceedings of the ACM Programming Languages 4(OOPSLA), pp.146:1\u2013146:32 (2020)","DOI":"10.1145\/3428214"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-85958-1_10","volume-title":"Principles and Practice of Constraint Programming","author":"J Huang","year":"2008","unstructured":"Huang, J.: Universal Booleanization of constraint models. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 144\u2013158. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_10"},{"key":"5_CR13","unstructured":"Huang, J.: Search strategy simulation in constraint booleanization. In: Thirteenth International Conference on the Principles of Knowledge Representation and Reasoning (2012)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-319-07046-9_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Hurley","year":"2014","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: a hierarchical portfolio of solvers and transformations. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 301\u2013317. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_22"},{"key":"5_CR15","unstructured":"Ignatiev, A., Marques-Silva, J., Morgado, A.: A python library for prototyping with sat oracles (2021). https:\/\/pypi.org\/project\/python-sat\/"},{"key":"5_CR16","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":"5_CR17","doi-asserted-by":"publisher","unstructured":"Metodi, A., Codish, M., Stuckey, P.J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems. J. Artif. Intell. Res. 46, 303\u2013341 (2013). https:\/\/doi.org\/10.1613\/jair.3809, http:\/\/www.jair.org\/papers\/paper3809.html","DOI":"10.1613\/jair.3809"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Nguyen, V., Mai, S.T.: A new method to encode the at-most-one constraint into SAT. In: Thang, H.Q., et al. (eds.) Proceedings of the Sixth International Symposium on Information and Communication Technology, Hue City, Vietnam, 3\u20134 December 2015. pp. 46\u201353. ACM (2015). https:\/\/doi.org\/10.1145\/2833258.2833293","DOI":"10.1145\/2833258.2833293"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Nguyen, V., Velev, M.N., Barahona, P.: Application of hierarchical hybrid encodings to efficient translation of CSPS to SAT. In: 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, 4\u20136 November 2013, pp. 1028\u20131035. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICTAI.2013.154","DOI":"10.1109\/ICTAI.2013.154"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-23219-5_23","volume-title":"Principles and Practice of Constraint Programming","author":"P Nightingale","year":"2015","unstructured":"Nightingale, P., Spracklen, P., Miguel, I.: Automatically improving SAT encoding of constraint problems through common subexpression elimination in Savile row. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 330\u2013340. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_23"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints Int. J. 14(3), 357\u2013391 (2009). https:\/\/doi.org\/10.1007\/s10601-008-9064-x","journal-title":"Constraints Int. J."},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-24318-4_2","volume-title":"Theory and applications of satisfiability testing \u2013 SAT 2015","author":"T Philipp","year":"2015","unstructured":"Philipp, T., Steinke, P.: PBLib \u2013 A Library for Encoding Pseudo-Boolean Constraints into CNF. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 9\u201316. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_2"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Prestwich, S.: Finding Large Cliques using SAT Local Search, chap. 15, pp. 269\u2013274. John Wiley, Hoboken (2007)","DOI":"10.1002\/9780470612309.ch15"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11754602_9","volume-title":"Recent Advances in Constraints","author":"C Schulte","year":"2006","unstructured":"Schulte, C., Tack, G.: Views and iterators for generic constraint implementations. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) Recent Advances in Constraints, pp. 118\u2013132. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11754602_9"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of Boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Soh, T., Banbara, M., Tamura, N.: A hybrid encoding of CSP to SAT integrating order and log encodings. In: 27th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2015, Vietri sul Mare, Italy, 9\u201311 November 2015, pp. 421\u2013428. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/ICTAI.2015.70","DOI":"10.1109\/ICTAI.2015.70"},{"key":"5_CR28","unstructured":"Tamura, N., Banbara, M.: Sugar: a CSP to SAT translator based on order encoding. In: Proceedings of the Second International CSP Solver Competition, pp. 65\u201369 (2008)"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Tamura, N., Banbara, M., Soh, T.: Compiling pseudo-boolean constraints to SAT with order encoding. In: 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, 4\u20136 November 2013, pp. 1020\u20131027. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/ICTAI.2013.153","DOI":"10.1109\/ICTAI.2013.153"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-21581-0_36","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"T Tanjo","year":"2011","unstructured":"Tanjo, T., Tamura, N., Banbara, M.: A compact and efficient SAT-encoding of finite domain CSP. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol. 6695, pp. 375\u2013376. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21581-0_36"},{"key":"5_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-030-58475-7_34","volume-title":"Principles and Practice of Constraint Programming","author":"N-F Zhou","year":"2020","unstructured":"Zhou, N.-F.: In pursuit of an efficient SAT encoding for the Hamiltonian cycle problem. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 585\u2013602. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_34"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-28228-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"N-F Zhou","year":"2016","unstructured":"Zhou, N.-F., Kjellerstrand, H.: The Picat-SAT compiler. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 48\u201362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28228-2_4"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-319-66158-2_43","volume-title":"Principles and Practice of Constraint Programming","author":"N-F Zhou","year":"2017","unstructured":"Zhou, N.-F., Kjellerstrand, H.: Optimizing SAT encodings for arithmetic constraints. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 671\u2013686. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_43"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08011-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T13:03:24Z","timestamp":1667912604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08011-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031080104","9783031080111"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08011-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/usc.edu\/cpaior-2022\/","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":"60","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":"28","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":"47% - 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":"4","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)"}}]}}