{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T19:02:50Z","timestamp":1779130970191,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031206238","type":"print"},{"value":"9783031206245","type":"electronic"}],"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-20624-5_2","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"20-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Elastic-Degenerate String Matching with\u00a01 Error"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6647-088X","authenticated-orcid":false,"given":"Giulia","family":"Bernardini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9897-1512","authenticated-orcid":false,"given":"Esteban","family":"Gabory","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6938-8902","authenticated-orcid":false,"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michelle","family":"Sweering","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1988-3507","authenticated-orcid":false,"given":"Wiktor","family":"Zuba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"t al Alzamel, M., e.: Degenerate string comparison and applications. In: Parida, L., Ukkonen, E. (eds.) 18th International Workshop on Algorithms in Bioinformatics, WABI 2018, Helsinki, Finland, 20\u201322 August 2018, LIPIcs, vol. 113, pp. 21:1\u201321:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.WABI.2018.21","DOI":"10.4230\/LIPIcs.WABI.2018.21"},{"issue":"1\u20134","key":"2_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.3233\/FI-2020-1947","volume":"175","author":"M Alzamel","year":"2020","unstructured":"Alzamel, M., et al.: Comparing degenerate strings. Fundam. Informaticae 175(1\u20134), 41\u201358 (2020). https:\/\/doi.org\/10.3233\/FI-2020-1947","journal-title":"Fundam. Informaticae"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Amir, A., Keselman, D., Landau, G.M., Lewenstein, M., Lewenstein, N., Rodeh, M.: Text indexing and dictionary matching with one error. J. Algorithms 37(2), 309\u2013325 (2000). https:\/\/doi.org\/10.1006\/jagm.2000.1104","DOI":"10.1006\/jagm.2000.1104"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00097-X","volume":"50","author":"A Amir","year":"2004","unstructured":"Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257\u2013275 (2004). https:\/\/doi.org\/10.1016\/S0196-6774(03)00097-X","journal-title":"J. Algorithms"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Aoyama, K., Nakashima, Y., Inenaga, T., Inenaga, S., Bannai, H., Takeda, M.: Faster online elastic degenerate string matching. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) Annual Symposium on Combinatorial Pattern Matching, CPM 2018, Qingdao, China, 2\u20134 July 2018, LIPIcs, vol. 105, pp. 9:1\u20139:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.9","DOI":"10.4230\/LIPIcs.CPM.2018.9"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719839_9"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Bernardini, G., Pisanti, N., Pissis, S., Rosone, G.: Pattern matching on elastic-degenerate text with errors. In: 24th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 74\u201390 (2017). https:\/\/doi.org\/10.1007\/978-3-319-67428-5_7","DOI":"10.1007\/978-3-319-67428-5_7"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bernardini, G., Gawrychowski, P., Pisanti, N., Pissis, S.P., Rosone, G.: Even faster elastic-degenerate string matching via fast matrix multiplication. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Patras, Greece, 9\u201312 July 2019, LIPIcs, vol. 132, pp. 21:1\u201321:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.21","DOI":"10.4230\/LIPIcs.ICALP.2019.21"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1137\/20M1368033","volume":"51","author":"G Bernardini","year":"2022","unstructured":"Bernardini, G., Gawrychowski, P., Pisanti, N., Pissis, S.P., Rosone, G.: Elastic-degenerate string matching via fast matrix multiplication. SIAM J. Comput. 51(3), 549\u2013576 (2022). https:\/\/doi.org\/10.1137\/20M1368033","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2019.08.012","volume":"812","author":"G Bernardini","year":"2020","unstructured":"Bernardini, G., Pisanti, N., Pissis, S.P., Rosone, G.: Approximate pattern matching on elastic-degenerate text. Theor. Comput. Sci. 812, 109\u2013122 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.08.012","journal-title":"Theor. Comput. Sci."},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the RAM, revisited. In: Hurtado, F., van Kreveld, M.J. (eds.) Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, 13\u201315 June 2011, pp. 1\u201310. ACM (2011). https:\/\/doi.org\/10.1145\/1998196.1998198","DOI":"10.1145\/1998196.1998198"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3385898","volume":"25","author":"P Charalampopoulos","year":"2020","unstructured":"Charalampopoulos, P., Iliopoulos, C.S., Liu, C., Pissis, S.P.: Property suffix array with applications in indexing weighted sequences. ACM J. Exp. Algorithmics 25, 1\u201316 (2020). https:\/\/doi.org\/10.1145\/3385898","journal-title":"ACM J. Exp. Algorithmics"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Wellnitz, P.: Faster approximate pattern matching: a unified approach. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 978\u2013989. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00095","DOI":"10.1109\/FOCS46700.2020.00095"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Kociumaka, T., Wellnitz, P.: Faster pattern matching under edit distance. CoRR abs\/2204.03087 (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.03087, (announced at FOCS 2022)","DOI":"10.48550\/arXiv.2204.03087"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B Chazelle","year":"1988","unstructured":"Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comput. 17(3), 427\u2013462 (1988). https:\/\/doi.org\/10.1137\/0217026","journal-title":"SIAM J. Comput."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: Babai, L. (ed.) Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 91\u2013100. ACM (2004). https:\/\/doi.org\/10.1145\/1007352.1007374","DOI":"10.1145\/1007352.1007374"},{"issue":"6","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539700370527","volume":"31","author":"R Cole","year":"2002","unstructured":"Cole, R., Hariharan, R.: Approximate string matching: a simpler faster algorithm. SIAM J. Comput. 31(6), 1761\u20131782 (2002). https:\/\/doi.org\/10.1137\/S0097539700370527","journal-title":"SIAM J. Comput."},{"key":"2_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007). https:\/\/doi.org\/10.1017\/CBO9780511546853"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with 0(1) worst case access time. J. ACM 31(3), 538\u2013544 (1984). https:\/\/doi.org\/10.1145\/828.1884","journal-title":"J. ACM"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Gao, Y., He, M., Nekrich, Y.: Fast preprocessing for optimal orthogonal range reporting and range successor with applications to text indexing. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms, ESA 2020, Pisa, Italy (Virtual Conference), 7\u20139 September 2020, LIPIcs, vol. 173, pp. 54:1\u201354:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.54","DOI":"10.4230\/LIPIcs.ESA.2020.54"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Ghazawi, S., Landau, G.M.: On indeterminate strings matching. In: G\u00f8rtz, I.L., Weimann, O. (eds.) 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, Copenhagen, Denmark, 17\u201319 June 2020, LIPIcs, vol. 161, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2020.14","DOI":"10.4230\/LIPIcs.CPM.2020.14"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Uznanski, P.: Towards unified approximate pattern matching for Hamming and l_1 distance. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9\u201313 July 2018, LIPIcs, vol. 107, pp. 62:1\u201362:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.62","DOI":"10.4230\/LIPIcs.ICALP.2018.62"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Grossi, R., Iliopoulos, C.S., Liu, C., Pisanti, N., Pissis, S.P., Retha, A., Rosone, G., Vayani, F., Versari, L.: On-line pattern matching on similar texts. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, 4\u20136 July 2017, LIPIcs, vol. 78, pp. 9:1\u20139:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.9","DOI":"10.4230\/LIPIcs.CPM.2017.9"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Iliopoulos, C.S., Kundu, R., Pissis, S.P.: Efficient pattern matching in elastic-degenerate strings. Inf. Comput. 279, 104616 (2021). https:\/\/doi.org\/10.1016\/j.ic.2020.104616","DOI":"10.1016\/j.ic.2020.104616"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"IUPAC-IUB Commission on Biochemical Nomenclature: Abbreviations and symbols for nucleic acids, polynucleotides, and their constituents. Biochemistry 9(20), 4022\u20134027 (1970). https:\/\/doi.org\/10.1016\/0022-2836(71)90319-6","DOI":"10.1016\/0022-2836(71)90319-6"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"GM Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. 43, 239\u2013249 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90178-7","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"GM Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci. 37(1), 63\u201378 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90045-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"2_CR29","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(03)00053-7","volume":"304","author":"JC Na","year":"2003","unstructured":"Na, J.C., Apostolico, A., Iliopoulos, C.S., Park, K.: Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 304(1\u20133), 87\u2013101 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00053-7","journal-title":"Theor. Comput. Sci."},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70575-8_8","volume-title":"Automata, Languages and Programming","author":"M Ru\u017ei\u0107","year":"2008","unstructured":"Ru\u017ei\u0107, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 84\u201395. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_8"},{"issue":"6","key":"2_CR31","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539703435728","volume":"34","author":"Q Shi","year":"2005","unstructured":"Shi, Q., J\u00e1J\u00e1, J.F.: Novel transformation techniques using q-heaps with applications to computational geometry. SIAM J. Comput. 34(6), 1474\u20131492 (2005). https:\/\/doi.org\/10.1137\/S0097539703435728","journal-title":"SIAM J. Comput."},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1093\/bib\/bbw089","volume":"19","author":"The Computational Pan-Genomics Consortium","year":"2018","unstructured":"The Computational Pan-Genomics Consortium: Computational pan-genomics: status, promises and challenges. Brief. Bioinf. 19(1), 118\u2013135 (2018). https:\/\/doi.org\/10.1093\/bib\/bbw089","journal-title":"Brief. Bioinf."}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:04:39Z","timestamp":1667084679000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","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":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","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":"114","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":"46","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":"40% - 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":"8.7","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)"}}]}}