{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:14:05Z","timestamp":1781892845440,"version":"3.54.5"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030590246","type":"print"},{"value":"9783030590253","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-59025-3_2","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:06:21Z","timestamp":1599721581000},"page":"13-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["The Bang Calculus Revisited"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alejandro","family":"R\u00edos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e9s","family":"Viso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Accattoli, B., Graham-Lengrand, S., Kesner, D.: Tight typings and split bounds. In: PACMPL, 2 (ICFP), pp. 94:1\u201394:30 (2018)","DOI":"10.1145\/3236789"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-47958-3_12","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2016","unstructured":"Accattoli, B., Guerrieri, G.: Open call-by-value. In: Igarashi, A. (ed.) APLAS 2016. LNCS, vol. 10017, pp. 206\u2013226. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47958-3_12"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-02768-1_3","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2018","unstructured":"Accattoli, B., Guerrieri, G.: Types of fireballs. In: Ryu, S. (ed.) APLAS 2018. LNCS, vol. 11275, pp. 45\u201366. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02768-1_3"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-17184-1_15","volume-title":"Programming Languages and Systems","author":"B Accattoli","year":"2019","unstructured":"Accattoli, B., Guerrieri, G., Leberle, M.: Types by need. In: Caires, L. (ed.) ESOP 2019. LNCS, vol. 11423, pp. 410\u2013439. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_15"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-15205-4_30","volume-title":"Computer Science Logic","author":"B Accattoli","year":"2010","unstructured":"Accattoli, B., Kesner, D.: The structural $${\\lambda }$$-calculus. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 381\u2013395. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15205-4_30"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-29822-6_4","volume-title":"Functional and Logic Programming","author":"B Accattoli","year":"2012","unstructured":"Accattoli, B., Paolini, L.: Call-by-value solvability, revisited. In: Schrijvers, T., Thiemann, P. (eds.) FLOPS 2012. LNCS, vol. 7294, pp. 4\u201316. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29822-6_4"},{"key":"2_CR7","unstructured":"Barendregt, H.P.: The Lambda Calculus Its Syntax and Semantics, vol. 103, revised edition. Amsterdam, North Holland (1984)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ic.2015.12.012","volume":"248","author":"E De Benedetti","year":"2016","unstructured":"De Benedetti, E., Rocca, S.R.D.: A type assignment for $$\\lambda $$-calculus complete both for FPTIME and strong normalization. Inf. Comput. 248, 195\u2013214 (2016)","journal-title":"Inf. Comput."},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(4:3)2013","volume":"9","author":"A Bernadet","year":"2013","unstructured":"Bernadet, A., Lengrand, S.: Non-idempotent intersection types and strong normalisation. Log. Methods Comput. Sci. 9(4), 1\u201346 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"2_CR10","volume-title":"Term Rewriting Systems (TeReSe)","author":"M Bezem","year":"2003","unstructured":"Bezem, M., Klop, J.W., van Oostrom, V.: Term Rewriting Systems (TeReSe). Cambridge University Press, Cambridge (2003)"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0168-0072(00)00056-7","volume":"109","author":"A Bucciarelli","year":"2001","unstructured":"Bucciarelli, A., Ehrhard, T.: On phase semantics and denotational semantics: the exponentials. Ann. Pure Appl. Log. 109(3), 205\u2013241 (2001)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR12","unstructured":"Bucciarelli, A., Kesner, D., R\u00edos, A., Viso, A.: The bang calculus revisited. Extended report (2020). https:\/\/arxiv.org\/abs\/2002.04011"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1093\/jigpal\/jzx018","volume":"25","author":"A Bucciarelli","year":"2017","unstructured":"Bucciarelli, A., Kesner, D., Ventura, D.: Non-idempotent intersection types for the lambda-calculus. Log. J. IGPL 25(4), 431\u2013464 (2017)","journal-title":"Log. J. IGPL"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-54830-7_7","volume-title":"Foundations of Software Science and Computation Structures","author":"A Carraro","year":"2014","unstructured":"Carraro, A., Guerrieri, G.: A semantical and operational account of call-by-value solvability. In: Muscholl, A. (ed.) FoSSaCS 2014. LNCS, vol. 8412, pp. 103\u2013118. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54830-7_7"},{"key":"2_CR15","unstructured":"Chouquet, J., Tasson, C.: Taylor expansion for Call-By-Push-Value. In: International Conference on Computer Science Logic (CSL), Barcelona, Spain. LIPIcs, vol. 152, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2020)"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02011875","volume":"19","author":"M Coppo","year":"1978","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: A new type assignment for $$\\lambda $$-terms. Arch. Math. Log. 19(1), 139\u2013156 (1978)","journal-title":"Arch. Math. Log."},{"issue":"4","key":"2_CR17","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M Coppo","year":"1980","unstructured":"Coppo, M., Dezani-Ciancaglini, M.: An extension of the basic functionality theory for the $$\\lambda $$-calculus. Notre Dame J. Form. Log. 21(4), 685\u2013693 (1980)","journal-title":"Notre Dame J. Form. Log."},{"key":"2_CR18","unstructured":"de Carvalho, D.: S\u00e9mantiques de la logique lin\u00e9aire et temps de calcul. Ph.D. thesis, Universit\u00e9 Aix-Marseille II (2007)"},{"key":"2_CR19","unstructured":"de Carvalho, D.: The relational model is injective for multiplicative exponential linear logic. In: International Conference on Computer Science Logic (CSL), Marseille, France. LIPIcs, vol. 62, pages 41:1\u201341:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"7","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1017\/S0960129516000396","volume":"28","author":"D de Carvalho","year":"2018","unstructured":"de Carvalho, D.: Execution time of $$\\lambda $$-terms via denotational semantics and intersection types. Math. Struct. Comput. Sci. 28(7), 1169\u20131203 (2018)","journal-title":"Math. Struct. Comput. Sci."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ic.2015.12.010","volume":"248","author":"D de Carvalho","year":"2016","unstructured":"de Carvalho, D., dede Falco, L.T.: A semantic account of strong normalization in linear logic. Inf. Comput. 248, 104\u2013129 (2016)","journal-title":"Inf. Comput."},{"issue":"20","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1884","DOI":"10.1016\/j.tcs.2010.12.017","volume":"412","author":"D de Carvalho","year":"2011","unstructured":"de Carvalho, D., Pagani, M., de Falco, L.T.: A semantic measure of the execution time in linear logic. Theor. Comput. Sci. 412(20), 1884\u20131902 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR23","unstructured":"Danos, V.: La Logique Lin\u00e9aire appliqu\u00e9e \u00e0 l\u2019\u00e9tude de divers processus de normalisation (principalement du lambda-calcul). PhD thesis, Universit\u00e9 Paris 7 (1990)"},{"key":"2_CR24","unstructured":"Ehrhard, T.: Collapsing non-idempotent intersection types. In: International Conference on Computer Science Logic (CSL), Fontainebleau, France. LIPIcs, vol. 16, pp. 259\u2013273. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-662-49498-1_9","volume-title":"Programming Languages and Systems","author":"T Ehrhard","year":"2016","unstructured":"Ehrhard, T.: Call-by-push-value from a linear logic point of view. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 202\u2013228. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_9"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Ehrhard, T., Guerrieri, G.: The bang calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value. In: International Symposium on Principles and Practice of Declarative Programming (PPDP), Edinburgh, United Kingdom, pp. 174\u2013187. ACM (2016)","DOI":"10.1145\/2967973.2968608"},{"issue":"2\u20133","key":"2_CR27","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/j.tcs.2008.06.001","volume":"403","author":"T Ehrhard","year":"2008","unstructured":"Ehrhard, T., Regnier, L.: Uniformity and the Taylor expansion of ordinary lambda-terms. TCS 403(2\u20133), 347\u2013372 (2008)","journal-title":"TCS"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-57887-0_115","volume-title":"Theoretical Aspects of Computer Software","author":"P Gardner","year":"1994","unstructured":"Gardner, P.: Discovering needed reductions using type theory. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 555\u2013574. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57887-0_115"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0168-0072(88)90025-5","volume":"37","author":"J-Y Girard","year":"1988","unstructured":"Girard, J.-Y.: Normal functors, power series and $$\\lambda $$-calculus. Ann. Pure Appl. Log. 37(2), 129\u2013177 (1988)","journal-title":"Ann. Pure Appl. Log."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Guerrieri, G.: Towards a semantic measure of the execution time in call-by-value lambda-calculus. In: Joint International Workshops on Developments in Computational Models and Intersection Types and Related Systems (DCM\/ITRS), Oxford, UK, EPTCS 283, pp. 57\u201372 (2018)","DOI":"10.4204\/EPTCS.293.5"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Guerrieri, G., Manzonetto, G.: The bang calculus and the two Girard\u2019s translations. In: Joint International Workshops on Linearity & Trends in Linear Logic and Applications (Linearity-TLLA), Oxford, UK, EPTCS, pp. 15\u201330 (2019)","DOI":"10.4204\/EPTCS.292.2"},{"key":"2_CR33","unstructured":"Guerrieri, G., Pellissier, L., de Falco, L.T.: Computing connected proof(-structure)s from their taylor expansion. In: International Conference on Formal Structures for Computation and Deduction (FSCD), Porto, Portugal. LIPIcs, vol. 52, pp. 20:1\u201320:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-662-49630-5_25","volume-title":"Foundations of Software Science and Computation Structures","author":"D Kesner","year":"2016","unstructured":"Kesner, D.: Reasoning about call-by-need by means of types. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 424\u2013441. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_25"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-662-44602-7_23","volume-title":"Theoretical Computer Science","author":"D Kesner","year":"2014","unstructured":"Kesner, D., Ventura, D.: Quantitative types for the linear substitution calculus. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 296\u2013310. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_23"},{"key":"2_CR36","unstructured":"Kesner, D., Vial, P.: Types as resources for classical natural deduction. In: International Conference on Formal Structures for Computation and Deduction (FSCD), Oxford, UK. LIPIcs, vol. 84, pp. 24:1\u201324:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"2_CR37","series-title":"Semantics Structures in Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0954-6","volume-title":"Call-By-Push-Value: A Functional\/Imperative Synthesis","author":"PB Levy","year":"2004","unstructured":"Levy, P.B.: Call-By-Push-Value: A Functional\/Imperative Synthesis. Semantics Structures in Computation, vol. 2. Springer, Dordrecht (2004). https:\/\/doi.org\/10.1007\/978-94-007-0954-6"},{"issue":"4","key":"2_CR38","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10990-006-0480-6","volume":"19","author":"PB Levy","year":"2006","unstructured":"Levy, P.B.: Call-by-push-value: decomposing call-by-value and call-by-name. High. Order Symb. Comput. 19(4), 377\u2013414 (2006)","journal-title":"High. Order Symb. Comput."},{"issue":"1\u20132","key":"2_CR39","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(98)00358-2","volume":"228","author":"J Maraist","year":"1999","unstructured":"Maraist, J., Odersky, M., Turner, D.N., Wadler, P.: Call-by-name, call-by-value, call-by-need and the linear lambda calculus. Theor. Comput. Sci. 228(1\u20132), 175\u2013210 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-12032-9_25","volume-title":"Foundations of Software Science and Computational Structures","author":"M Pagani","year":"2010","unstructured":"Pagani, M., della Rocca, S.R.: Solvability in resource lambda-calculus. In: Ong, L. (ed.) FoSSaCS 2010. LNCS, vol. 6014, pp. 358\u2013373. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12032-9_25"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(94)90012-4","volume":"126","author":"L Regnier","year":"1994","unstructured":"Regnier, L.: Une \u00e9quivalence sur les lambda-termes. TCS 126(2), 281\u2013292 (1994)","journal-title":"TCS"},{"key":"2_CR42","unstructured":"Santo, J.E., Pinto, L., Uustalu, T.: Modal embeddings and calling paradigms. In: International Conference on Formal Structures for Computation and Deduction (FSCD), Dortmund, Germany. LIPIcs, vol. 131, pp. 18:1\u201318:20. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2019)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59025-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T14:27:23Z","timestamp":1619274443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59025-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590246","9783030590253"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59025-3_2","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":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FLOPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Functional and Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"flops2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipl.riec.tohoku.ac.jp\/FLOPS2020\/","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":"25","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":"11","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":"1","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":"44% - 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.2","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.1","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)"}}]}}