{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:05:44Z","timestamp":1767211544257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030532871"},{"type":"electronic","value":"9783030532888"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"content-version":"vor","delay-in-days":195,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53288-8_20","type":"book-chapter","created":{"date-parts":[[2020,7,15]],"date-time":"2020-07-15T19:03:27Z","timestamp":1594839807000},"page":"415-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Nonlinear Craig Interpolant Generation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4880-5129","authenticated-orcid":false,"given":"Ting","family":"Gan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2570-2338","authenticated-orcid":false,"given":"Bican","family":"Xia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9717-846X","authenticated-orcid":false,"given":"Bai","family":"Xue","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3298-3817","authenticated-orcid":false,"given":"Naijun","family":"Zhan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2615-9381","authenticated-orcid":false,"given":"Liyun","family":"Dai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Handbook of Constraint Programming. Foundations of Artificial Intelligence, vol. 2, pp. 571\u2013603 (2006)","DOI":"10.1016\/S1574-6526(06)80020-9"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02699126","volume":"67","author":"E Bierstone","year":"1988","unstructured":"Bierstone, E., Milman, P.D.: Semianalytic and subanalytic sets. Publications Mathematiques de l\u2019IH\u00c9S 67, 5\u201342 (1988)","journal-title":"Publications Mathematiques de l\u2019IH\u00c9S"},{"key":"20_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03718-8","volume-title":"Real Algebraic Geometry","author":"J Bochnak","year":"1998","unstructured":"Bochnak, J., Coste, M., Roy, M.: Real Algebraic Geometry. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/978-3-662-03718-8"},{"key":"20_CR4","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Methods Softw. 11(1\u20134), 613\u2013623 (1999). http:\/\/projects.coin-or.org\/csdp\/"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-030-29436-6_11","volume-title":"Automated Deduction \u2013 CADE 27","author":"M Chen","year":"2019","unstructured":"Chen, M., Wang, J., An, J., Zhan, B., Kapur, D., Zhan, N.: NIL: learning nonlinear interpolants. In: Fontaine, P. (ed.) CADE 2019. LNCS (LNAI), vol. 11716, pp. 178\u2013196. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_11"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78800-3_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2008","unstructured":"Cimatti, A., Griggio, A., Sebastiani, R.: Efficient interpolant generation in satisfiability modulo theories. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 397\u2013412. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_30"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-39799-8_25","volume-title":"Computer Aided Verification","author":"L Dai","year":"2013","unstructured":"Dai, L., Xia, B., Zhan, N.: Generating non-linear interpolants by semidefinite programming. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 364\u2013380. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_25"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: REDLOG: computer algebra meets computer logic. ACM SIGSAM Bull. 31(2), 2\u20139 (1997)","journal-title":"ACM SIGSAM Bull."},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-11319-2_12","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"V D\u2019Silva","year":"2010","unstructured":"D\u2019Silva, V., Kroening, D., Purandare, M., Weissenbacher, G.: Interpolant strength. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 129\u2013145. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11319-2_12"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-40229-1_14","volume-title":"Automated Reasoning","author":"T Gan","year":"2016","unstructured":"Gan, T., Dai, L., Xia, B., Zhan, N., Kapur, D., Chen, M.: Interpolant synthesis for quadratic polynomial inequalities and combination with EUF. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016. LNCS (LNAI), vol. 9706, pp. 195\u2013212. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1_14"},{"key":"20_CR11","unstructured":"Gan, T., Xia, B., Xue, B., Zhan, N.: Nonlinear Craig interpolant generation. CoRR, abs\/1903.01297 (2019)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Gao, S., Kong, S., Clarke, E.: Proof generation from delta-decisions. In: SYNASC 2014, pp. 156\u2013163 (2014)","DOI":"10.1109\/SYNASC.2014.29"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-662-49674-9_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Gao","year":"2016","unstructured":"Gao, S., Zufferey, D.: Interpolants in nonlinear theories over the reals. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 625\u2013641. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_41"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S Graf","year":"1997","unstructured":"Graf, S., Saidi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 72\u201383. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63166-6_10"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Henrion, D., Naldi, S., Safey El Din, M.: Exact algorithms for semidefinite programs with degenerate feasible set. In: ISSAC 2018, pp. 191\u2013198 (2018)","DOI":"10.1145\/3208976.3209022"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Henzinger, T., Jhala, R., Majumdar, R., McMillan, K.: Abstractions from proofs. In: POPL 2004, pp. 232\u2013244 (2004)","DOI":"10.1145\/982962.964021"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-19835-9_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Jung","year":"2011","unstructured":"Jung, Y., Lee, W., Wang, B.-Y., Yi, K.: Predicate generation for learning-based quantifier-free loop invariant inference. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 205\u2013219. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_17"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Kapur, D., Majumdar, R., Zarba, C.: Interpolation for data structures. In: FSE 2006, pp. 105\u2013116 (2006)","DOI":"10.1145\/1181775.1181789"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-02959-2_17","volume-title":"Automated Deduction \u2013 CADE-22","author":"L Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs, L., Voronkov, A.: Interpolation and symbol elimination. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 199\u2013213. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02959-2_17"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.2307\/2275541","volume":"62","author":"J Kraj\u00ed\u010dek","year":"1997","unstructured":"Kraj\u00ed\u010dek, J.: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. J. Symbol. Logic 62(2), 457\u2013486 (1997)","journal-title":"J. Symbol. Logic"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-24310-3_17","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S Kupferschmid","year":"2011","unstructured":"Kupferschmid, S., Becker, B.: Craig interpolation in the presence of non-linear constraints. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol. 6919, pp. 240\u2013255. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24310-3_17"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Lin, S., Sun, J., Xiao, H., San\u00e1n, D., Hansen, H.: FiB: squeezing loop invariants by interpolation between forward\/backward predicate transformers. In: ASE 2017, pp. 793\u2013803 (2017)","DOI":"10.1109\/ASE.2017.8115690"},{"key":"20_CR23","unstructured":"Lofberg., J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: CACSD 2004, pp. 284\u2013289. IEEE (2004)"},{"key":"20_CR24","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/146","volume-title":"Positive Polynomials and Sums of Squares","author":"M Marshall","year":"2008","unstructured":"Marshall, M.: Positive Polynomials and Sums of Squares. American Mathematical Society, Providence (2008)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"issue":"1","key":"20_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2005.07.003","volume":"345","author":"K McMillan","year":"2005","unstructured":"McMillan, K.: An interpolating theorem prover. Theoret. Comput. Sci. 345(1), 101\u2013121 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-78800-3_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"KL McMillan","year":"2008","unstructured":"McMillan, K.L.: Quantified invariant generation using an interpolating saturation prover. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 413\u2013427. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_31"},{"key":"20_CR28","unstructured":"Mosek, A.: The MOSEK optimization toolbox for MATLAB manual. Version 7.1 (Revision 28), p. 17 (2015)"},{"issue":"2","key":"20_CR29","first-page":"245","volume":"3","author":"T Mostowski","year":"1976","unstructured":"Mostowski, T.: Some properties of the ring of nash functions. Annali della Scuola Normale Superiore di Pisa 3(2), 245\u2013266 (1976)","journal-title":"Annali della Scuola Normale Superiore di Pisa"},{"issue":"3","key":"20_CR30","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u01cek","year":"1997","unstructured":"Pudl\u01cek, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbol. Logic 62(3), 981\u2013998 (1997)","journal-title":"J. Symbol. Logic"},{"issue":"3","key":"20_CR31","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969\u2013984 (1993)","journal-title":"Indiana Univ. Math. J."},{"issue":"2","key":"20_CR32","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s10703-017-0302-y","volume":"53","author":"P Roux","year":"2017","unstructured":"Roux, P., Voronin, Y.-L., Sankaranarayanan, S.: Validating numerical semidefinite programming solvers for polynomial invariants. Formal Methods Syst. Des. 53(2), 286\u2013312 (2017). https:\/\/doi.org\/10.1007\/s10703-017-0302-y","journal-title":"Formal Methods Syst. Des."},{"issue":"11","key":"20_CR33","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.jsc.2010.06.005","volume":"45","author":"A Rybalchenko","year":"2010","unstructured":"Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. J. Symb. Comput. 45(11), 1212\u20131233 (2010)","journal-title":"J. Symb. Comput."},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Sofronie-Stokkermans, V.: Interpolation in local theory extensions. In: Logical Methods in Computer Science, vol. 4, no. 4 (2008)","DOI":"10.2168\/LMCS-4(4:1)2008"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Srikanth, A., Sahin, B., Harris, W.: Complexity verification using guided theorem enumeration. In: POPL 2017, pp. 639\u2013652 (2017)","DOI":"10.1145\/3093333.3009864"},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01362149","volume":"207","author":"G Stengle","year":"1974","unstructured":"Stengle, G.: A nullstellensatz and a positivstellensatz in semialgebraic geometry. Ann. Math. 207, 87\u201397 (1974)","journal-title":"Ann. Math."},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/11532231_26","volume-title":"Automated Deduction \u2013 CADE-20","author":"G Yorsh","year":"2005","unstructured":"Yorsh, G., Musuvathi, M.: A combination method for generating interpolants. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 353\u2013368. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11532231_26"},{"key":"20_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47016-0","volume-title":"Formal Verification of Simulink\/Stateflow Diagrams","author":"N Zhan","year":"2017","unstructured":"Zhan, N., Wang, S., Zhao, H.: Formal Verification of Simulink\/Stateflow Diagrams. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-47016-0"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-642-32759-9_38","volume-title":"FM 2012: Formal Methods","author":"H Zhao","year":"2012","unstructured":"Zhao, H., Zhan, N., Kapur, D., Larsen, K.G.: A \u201chybrid\u201d approach for synthesizing optimal controllers of hybrid systems: a case study of the oil pump industrial example. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 471\u2013485. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_38"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53288-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T22:00:52Z","timestamp":1667426452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53288-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030532871","9783030532888"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53288-8_20","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":"14 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2020\/","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.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"240","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":"43","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":"22","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":"18% - 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":"4","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":"11","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)"}}]}}