{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:12:51Z","timestamp":1767237171597,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_32","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T23:02:35Z","timestamp":1561244555000},"page":"533-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Algorithmic Approach to the Existence of Ideal Objects in Commutative Algebra"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Powell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franziskus","family":"Wiesnet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"32_CR1","unstructured":"Aschieri, F., Berardi, S.: Interactive learning-based realizability for Heyting arithmetic with EM1. Log. Methods Comput. Sci. 6(3), 1\u201322 (2010)"},{"key":"32_CR2","volume-title":"Introduction to Commutative Algebra","author":"M Atiyah","year":"1969","unstructured":"Atiyah, M., Macdonald, I.: Introduction to Commutative Algebra. Addison-Wesley Publishing Co., Boston (1969)"},{"issue":"1:6","key":"32_CR3","first-page":"1","volume":"11","author":"U Berger","year":"2015","unstructured":"Berger, U., Lawrence, A., Forsberg, F., Seisenberger, M.: Extracting verified decision procedures: DPLL and resolution. Log. Methods Comput. Sci. 11(1:6), 1\u201318 (2015)","journal-title":"Log. Methods Comput. Sci."},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-22944-2_29","volume-title":"Algebra and Coalgebra in Computer Science","author":"U Berger","year":"2011","unstructured":"Berger, U., Miyamoto, K., Schwichtenberg, H., Seisenberger, M.: Minlog - a tool for program extraction supporting algebras and coalgebras. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 393\u2013399. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_29"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Cederquist, J., Coquand, T.: Entailment relations and distributive lattices. In: Buss, S.R., H\u00e1jek, P., Pudl\u00e1k, P. (eds.) Logic Colloquium 1998, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic. Lect. Notes Logic, Prague, Czech Republic, 9\u201315 August 1998, vol. 13, pp. 127\u2013139. A. K. Peters, Natick (2000)","DOI":"10.1017\/9781316756140.011"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-61780-9_62","volume-title":"Types for Proofs and Programs","author":"J Cederquist","year":"1996","unstructured":"Cederquist, J., Negri, S.: A constructive proof of the Heine-Borel covering theorem for formal reals. In: Berardi, S., Coppo, M. (eds.) TYPES 1995. LNCS, vol. 1158, pp. 62\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61780-9_62"},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0168-0072(01)00026-4","volume":"111","author":"M Coste","year":"2001","unstructured":"Coste, M., Lombardi, H., Roy, M.F.: Dynamical method in algebra: Effective Nullstellens\u00e4tze. Ann. Pure Appl. Logic 111(3), 203\u2013256 (2001)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"3-4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","volume":"12","author":"Von Kurt G\u00f6del","year":"1958","unstructured":"G\u00f6del, K.: \u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes. Dialectica 12, 280\u2013287 (1958)","journal-title":"Dialectica"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y Gurevich","year":"2000","unstructured":"Gurevich, Y.: Sequential abstract-state machines capture sequential algorithms. ACM Trans. Comput. Log. (TOCL) 1, 77\u2013111 (2000)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.2307\/2586791","volume":"64","author":"U Kohlenbach","year":"1999","unstructured":"Kohlenbach, U.: On the no-counterexample interpretation. J. Symb. Log. 64, 1491\u20131511 (1999)","journal-title":"J. Symb. Log."},{"issue":"5","key":"32_CR11","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1016\/j.na.2005.01.075","volume":"61","author":"U Kohlenbach","year":"2005","unstructured":"Kohlenbach, U.: Some computational aspects of metric fixed point theory. Nonlinear Anal. 61(5), 823\u2013837 (2005)","journal-title":"Nonlinear Anal."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1090\/S0002-9947-04-03515-9","volume":"357","author":"U Kohlenbach","year":"2005","unstructured":"Kohlenbach, U.: Some logical metatheorems with applications in functional analysis. Trans. Amer. Math. Soc. 357, 89\u2013128 (2005)","journal-title":"Trans. Amer. Math. Soc."},{"key":"32_CR13","series-title":"Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77533-1","volume-title":"Applied Proof Theory: Proof Interpretations and their Use in Mathematics","author":"U Kohlenbach","year":"2008","unstructured":"Kohlenbach, U.: Applied Proof Theory: Proof Interpretations and their Use in Mathematics. Monographs in Mathematics. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77533-1"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Kohlenbach, U.: Proof-theoretic methods in nonlinear analysis. In: Proceedings of the ICM 2018, vol. 2, pp. 79\u2013100. World Scientific (2019)","DOI":"10.1142\/9789813272880_0045"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1016\/j.jmaa.2014.10.035","volume":"423","author":"U Kohlenbach","year":"2015","unstructured":"Kohlenbach, U., Koutsoukou-Argyraki, A.: Rates of convergence and metastability for abstract Cauchy problems generated by accretive operators. J. Math. Anal. Appl. 423, 1089\u20131112 (2015)","journal-title":"J. Math. Anal. Appl."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1016\/j.aim.2012.06.028","volume":"321","author":"U Kohlenbach","year":"2012","unstructured":"Kohlenbach, U., Leu\u015ftean, L.: Effective metastability of Halpern iterates in CAT(0) spaces. Adv. Math. 321, 2526\u20132556 (2012)","journal-title":"Adv. Math."},{"key":"32_CR17","first-page":"241","volume":"16","author":"G Kreisel","year":"1951","unstructured":"Kreisel, G.: On the interpretation of non-finitist proofs. Part I. J. Symb. Log. 16, 241\u2013267 (1951)","journal-title":"J. Symb. Log."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/2267457","volume":"17","author":"G Kreisel","year":"1952","unstructured":"Kreisel, G.: On the interpretation of non-finitist proofs, Part II: interpretation of number theory. J. Symb. Log. 17, 43\u201358 (1952)","journal-title":"J. Symb. Log."},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/2964396","volume":"23","author":"G Kreisel","year":"1958","unstructured":"Kreisel, G.: Mathematical significance of consistency proofs. J. Symb. Log. 23(2), 155\u2013182 (1958)","journal-title":"J. Symb. Log."},{"key":"32_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-9944-7","volume-title":"Commutative Algebra: Constructive Methods: Finite Projective Modules","author":"H Lombardi","year":"2015","unstructured":"Lombardi, H., Quitt\u00e9, C.: Commutative Algebra: Constructive Methods: Finite Projective Modules. Springer, Dordrecht (2015). https:\/\/doi.org\/10.1007\/978-94-017-9944-7"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0001-8708(91)90082-I","volume":"89","author":"C Mulvey","year":"1991","unstructured":"Mulvey, C., Wick-Pelletier, J.: A globalization of the Hahn-Banach theorem. Adv. Math. 89, 1\u201359 (1991)","journal-title":"Adv. Math."},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00153-003-0209-8","volume":"43","author":"S Negri","year":"2004","unstructured":"Negri, S., von Plato, J., Coquand, T.: Proof-theoretical analysis of order relations. Arch. Math. Logic 43, 297\u2013309 (2004)","journal-title":"Arch. Math. Logic"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-319-10103-3_18","volume-title":"Gentzen\u2019s Centenary","author":"P Oliva","year":"2015","unstructured":"Oliva, P., Powell, T.: A game-theoretic computational interpretation of proofs in classical analysis. In: Kahle, R., Rathjen, M. (eds.) Gentzen\u2019s Centenary, pp. 501\u2013531. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-10103-3_18"},{"issue":"5","key":"32_CR24","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.apal.2016.11.003","volume":"168","author":"P Oliva","year":"2017","unstructured":"Oliva, P., Powell, T.: Spector bar recursion over finite partial functions. Ann. Pure Appl. Log. 168(5), 887\u2013921 (2017)","journal-title":"Ann. Pure Appl. Log."},{"key":"32_CR25","unstructured":"Persson, H.: An application of the constructive spectrum of a ring. In: Type Theory and the Integrated Logic of Programs. Chalmers University and University of G\u00f6teborg (1999). Ph.D. thesis"},{"key":"32_CR26","unstructured":"Powell, T.: On bar recursive interpretations of analysis. Ph.D. thesis, Queen Mary University of London (2013)"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Powell, T.: G\u00f6del\u2019s functional interpretation and the concept of learning. In: Proceedings of Logic in Computer Science (LICS 2016), pp. 136\u2013145. ACM (2016)","DOI":"10.1145\/2933575.2933605"},{"key":"32_CR28","unstructured":"Powell, T.: Sequential algorithms and the computational content of classical proofs (2018). https:\/\/arxiv.org\/abs\/1812.11003"},{"issue":"4","key":"32_CR29","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1090\/S0002-9939-1988-0954974-5","volume":"103","author":"F Richman","year":"1988","unstructured":"Richman, F.: Nontrivial uses of trivial rings. Proc. Am. Math. Soc. 103(4), 1012\u20131014 (1988)","journal-title":"Proc. Am. Math. Soc."},{"key":"32_CR30","doi-asserted-by":"publisher","first-page":"3207","DOI":"10.1016\/j.jpaa.2016.02.011","volume":"220","author":"D Rinaldi","year":"2016","unstructured":"Rinaldi, D., Schuster, P.: A universal Krull-Lindenbaum theorem. J. Pure Appl. Algebra 220, 3207\u20133232 (2016)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"32_CR31","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1017\/bsl.2017.13","volume":"23","author":"D Rinaldi","year":"2017","unstructured":"Rinaldi, D., Schuster, P., Wessel, D.: Eliminating disjunctions by disjunction elimination. Bull. Symb. Logic 23(2), 181\u2013200 (2017)","journal-title":"Bull. Symb. Logic"},{"issue":"1","key":"32_CR32","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.indag.2017.09.011","volume":"29","author":"D Rinaldi","year":"2018","unstructured":"Rinaldi, D., Schuster, P., Wessel, D.: Eliminating disjunctions by disjunction elimination. Indag. Math. (N.S.) 29(1), 226\u2013259 (2018)","journal-title":"Indag. Math. (N.S.)"},{"issue":"5-6","key":"32_CR33","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00153-018-0653-0","volume":"58","author":"Davide Rinaldi","year":"2018","unstructured":"Rinaldi, D., Wessel, D.: Cut elimination for entailment relations. Arch. Math. Log. (2018). https:\/\/doi.org\/10.1007\/s00153-018-0653-0","journal-title":"Archive for Mathematical Logic"},{"issue":"4:8","key":"32_CR34","first-page":"1","volume":"14","author":"D Rinaldi","year":"2018","unstructured":"Rinaldi, D., Wessel, D.: Extension by conservation. Sikorski\u2019s theorem. Log. Methods Comput. Sci. 14(4:8), 1\u201317 (2018)","journal-title":"Log. Methods Comput. Sci."},{"key":"32_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-72056-2_19","volume-title":"Logical Foundations of Computer Science","author":"S Sanders","year":"2018","unstructured":"Sanders, S.: Metastability and higher-order computability. In: Artemov, S., Nerode, A. (eds.) LFCS 2018. LNCS, vol. 10703, pp. 309\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-72056-2_19"},{"key":"32_CR36","unstructured":"Schlagbauer, K., Schuster, P., Wessel, D.: Der Satz von Hahn-Banach im Rahmen einer allgemeinen Idealtheorie. Confluentes Math, forthcoming"},{"key":"32_CR37","doi-asserted-by":"crossref","unstructured":"Schuster, P.: Induction in algebra: a first case study. In: 2012 27th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 581\u2013585. IEEE Computer Society Publications (2012). Proceedings, LICS 2012, Dubrovnik, Croatia","DOI":"10.1109\/LICS.2012.68"},{"issue":"3","key":"32_CR38","doi-asserted-by":"publisher","first-page":"20","DOI":"10.2168\/LMCS-9(3:20)2013","volume":"9","author":"P Schuster","year":"2013","unstructured":"Schuster, P.: Induction in algebra: a first case study. Log. Methods Comput. Sci. 9(3), 20 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"32_CR39","first-page":"79","volume":"53","author":"P Schuster","year":"2018","unstructured":"Schuster, P., Wessel, D.: A general extension theorem for directed-complete partial orders. Rep. Math. Logic 53, 79\u201396 (2018)","journal-title":"Rep. Math. Logic"},{"key":"32_CR40","series-title":"Progress in Computer Science and Applied Logic","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-29198-7_11","volume-title":"Advances in Proof Theory","author":"H Schwichtenberg","year":"2016","unstructured":"Schwichtenberg, H., Seisenberger, M., Wiesnet, F.: Higman\u2019s lemma and its computational content. In: Kahle, R., Strahm, T., Studer, T. (eds.) Advances in Proof Theory. PCSAL, vol. 28, pp. 353\u2013375. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29198-7_11"},{"key":"32_CR41","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59971-2","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"1999","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic. Springer, Berlin (1999)"},{"key":"32_CR42","doi-asserted-by":"crossref","unstructured":"Spector, C.: Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles in current intuitionistic mathematics. In: Dekker, F.D.E. (ed.) Recursive Function Theory: Proceedings of the Symposia in Pure Mathematics, vol. 5, pp. 1\u201327. American Mathematical Society, Providence, Rhode Island (1962)","DOI":"10.1090\/pspum\/005\/0154801"},{"key":"32_CR43","unstructured":"Tao, T.: Soft analysis, hard analysis, and the finite convergence principle. Essay, published as Chap. 1.3 of T. Tao, Structure and Randomness: Pages from Year 1 of a Mathematical Blog, Amer. Math. Soc (2008). Original version available online at http:\/\/terrytao.wordpress.com\/2007\/05\/23\/soft-analysis-hard-analysis-and-the-finite-convergence-principle\/"},{"key":"32_CR44","unstructured":"Wessel, D.: Ordering groups constructively. Commun. Algebra, forthcoming"},{"key":"32_CR45","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.tcs.2007.10.011","volume":"392","author":"I Yengui","year":"2008","unstructured":"Yengui, I.: Making the use of maximal ideals constructive. Theor. Comput. Sci. 392, 174\u2013178 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR46","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19494-3","volume-title":"Constructive Commutative Algebra","author":"I Yengui","year":"2015","unstructured":"Yengui, I.: Constructive Commutative Algebra. LNM, vol. 2138. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19494-3"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T17:03:55Z","timestamp":1663779835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","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":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","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":"41","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":"6","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":"68% - 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":"2,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":"8","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)"}}]}}