{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:02:18Z","timestamp":1764842538127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030866914"},{"type":"electronic","value":"9783030866921"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86692-1_10","type":"book-chapter","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:24:41Z","timestamp":1632777881000},"page":"114-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Approximation Ratio of LZ-End to LZ77"],"prefix":"10.1007","author":[{"given":"Takumi","family":"Ideue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2922-9434","authenticated-orcid":false,"given":"Takuya","family":"Mieno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2547-1509","authenticated-orcid":false,"given":"Mitsuru","family":"Funakoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-9353","authenticated-orcid":false,"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6138-1607","authenticated-orcid":false,"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003). https:\/\/doi.org\/10.1017\/CBO9780511546563"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., et al.: Queries on LZ-bounded encodings. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) 2015 Data Compression Conference, DCC 2015, Snowbird, UT, USA, 7\u20139 April 2015, pp. 83\u201392. IEEE (2015). https:\/\/doi.org\/10.1109\/DCC.2015.69","DOI":"10.1109\/DCC.2015.69"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/11821069_14","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J Berstel","year":"2006","unstructured":"Berstel, J., Savelli, A.: Crochemore factorization of sturmian and other infinite words. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 157\u2013166. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11821069_14"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2018.09.002","volume":"50","author":"P Bille","year":"2018","unstructured":"Bille, P., Gagie, T., G\u00f8rtz, I.L., Prezza, N.: A separation between RLSLPs and LZ77. J. Discret. Algorithms 50, 36\u201339 (2018). https:\/\/doi.org\/10.1016\/j.jda.2018.09.002","journal-title":"J. Discret. Algorithms"},{"key":"10_CR5","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical report, Digital SRC Research Report (1994)"},{"issue":"7","key":"10_CR6","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","volume":"51","author":"M Charikar","year":"2005","unstructured":"Charikar, M., et al.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554\u20132576 (2005). https:\/\/doi.org\/10.1109\/TIT.2005.850116","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV. The quotient groups of the lower central series. Ann. Math. 68(1), 81\u201395 (1958). http:\/\/www.jstor.org\/stable\/1970044","DOI":"10.2307\/1970044"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), 8:1\u20138:39 (2021). https:\/\/doi.org\/10.1145\/3426473","DOI":"10.1145\/3426473"},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inf. Process. Lett. 12(5), 244\u2013250 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90024-7","journal-title":"Inf. Process. Lett."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2013.07.024","volume":"532","author":"HH Do","year":"2014","unstructured":"Do, H.H., Jansson, J., Sadakane, K., Sung, W.: Fast relative Lempel-Ziv self-index for similar sequences. Theor. Comput. Sci. 532, 14\u201330 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.07.024","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-28332-1_21","volume-title":"Language and Automata Theory and Applications","author":"T Gagie","year":"2012","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: A faster grammar-based self-index. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 240\u2013251. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28332-1_21"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-642-54423-1_63","volume-title":"LATIN 2014: Theoretical Informatics","author":"T Gagie","year":"2014","unstructured":"Gagie, T., Gawrychowski, P., K\u00e4rkk\u00e4inen, J., Nekrich, Y., Puglisi, S.J.: LZ77-based self-indexing with faster pattern matching. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 731\u2013742. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54423-1_63"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-19929-0_19","volume-title":"Combinatorial Pattern Matching","author":"K Goto","year":"2015","unstructured":"Goto, K., Bannai, H., Inenaga, S., Takeda, M.: LZD Factorization: simple and practical online grammar compression with variable-to-fixed encoding. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 219\u2013230. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19929-0_19"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Nakashima, Y., Puglisi, S.J., Shur, A.M.: On the size of Lempel-Ziv and Lyndon factorizations. In: Vollmer, H., Vall\u00e9e, B. (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. LIPIcs, Hannover, Germany, 8\u201311 March 2017, vol. 66, pp. 45:1\u201345:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2017.45","DOI":"10.4230\/LIPIcs.STACS.2017.45"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kociumaka, T.: Resolution of the Burrows-Wheeler transform conjecture. In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, 16\u201319 November 2020, pp. 1002\u20131013. IEEE (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00097","DOI":"10.1109\/FOCS46700.2020.00097"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kosolobov, D.: LZ-End parsing in compressed space. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) 2017 Data Compression Conference, DCC 2017, Snowbird, UT, USA, 4\u20137 April 2017, pp. 350\u2013359. IEEE (2017). https:\/\/doi.org\/10.1109\/DCC.2017.73","DOI":"10.1109\/DCC.2017.73"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Kempa, D., Kosolobov, D.: LZ-End parsing in linear time. In: Pruhs, K., Sohler, C. (eds.) 25th Annual European Symposium on Algorithms, ESA 2017. LIPIcs, Vienna, Austria, 4\u20136 September 2017, vol. 87, pp. 53:1\u201353:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.53","DOI":"10.4230\/LIPIcs.ESA.2017.53"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 827\u2013840. ACM (2018). https:\/\/doi.org\/10.1145\/3188745.3188814","DOI":"10.1145\/3188745.3188814"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-61792-9_17","volume-title":"LATIN 2020: Theoretical Informatics","author":"T Kociumaka","year":"2020","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Towards a definitive measure of repetitiveness. In: Kohayakawa, Y., Miyazawa, F.K. (eds.) LATIN 2021. LNCS, vol. 12118, pp. 207\u2013219. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61792-9_17"},{"issue":"11","key":"10_CR20","doi-asserted-by":"publisher","first-page":"3195","DOI":"10.1007\/s00453-020-00722-6","volume":"82","author":"D Kosolobov","year":"2020","unstructured":"Kosolobov, D., Valenzuela, D., Navarro, G., Puglisi, S.J.: Lempel\u2013Ziv-Like Parsing in Small Space. Algorithmica 82(11), 3195\u20133215 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00722-6","journal-title":"Algorithmica"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2012.02.006","volume":"483","author":"S Kreft","year":"2013","unstructured":"Kreft, S., Navarro, G.: On compressing and indexing repetitive sequences. Theor. Comput. Sci. 483, 115\u2013133 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.02.006","journal-title":"Theor. Comput. Sci."},{"key":"10_CR22","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Lempel-Ziv parsing and sublinear-size index structures for string matching (extended abstract). In: Proceedings of the 3rd South American Workshop on String Processing, WSP 1996, pp. 141\u2013155. Carleton University Press (1996)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-16321-0_20","volume-title":"String Processing and Information Retrieval","author":"S Kuruppu","year":"2010","unstructured":"Kuruppu, S., Puglisi, S.J., Zobel, J.: Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 201\u2013206. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16321-0_20"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-59212-7_15","volume-title":"String Processing and Information Retrieval","author":"K Kutsukake","year":"2020","unstructured":"Kutsukake, K., Matsumoto, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: On repetitiveness measures of Thue-Morse words. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 213\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_15"},{"key":"10_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words, vol. 105. Cambridge University Press, Cambridge (2005)"},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.3390\/a14040116","volume":"14","author":"S Mitsuya","year":"2021","unstructured":"Mitsuya, S., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: Compressed communication complexity of Hamming distance. Algorithms 14(4), 116 (2021). https:\/\/doi.org\/10.3390\/a14040116","journal-title":"Algorithms"},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1109\/TIT.2020.3042746","volume":"67","author":"G Navarro","year":"2021","unstructured":"Navarro, G., Ochoa, C., Prezza, N.: On the approximation ratio of ordered parsings. IEEE Trans. Inf. Theory 67(2), 1008\u20131026 (2021). https:\/\/doi.org\/10.1109\/TIT.2020.3042746","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Nishimoto, T., Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274, 116\u2013129 (2020). https:\/\/doi.org\/10.1016\/j.dam.2019.01.014","DOI":"10.1016\/j.dam.2019.01.014"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Nishimoto, T., Tabei, Y.: LZRR: LZ77 parsing with right reference. In: Bilgin, A., Marcellin, M.W., Serra-Sagrist\u00e0, J., Storer, J.A. (eds.) Data Compression Conference, DCC 2019, Snowbird, UT, USA, 26\u201329 March 2019, pp. 211\u2013220. IEEE (2019). https:\/\/doi.org\/10.1109\/DCC.2019.00029","DOI":"10.1109\/DCC.2019.00029"},{"issue":"1\u20133","key":"10_CR30","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1\u20133), 211\u2013222 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00777-6","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1145\/322344.322346","volume":"29","author":"JA Storer","year":"1982","unstructured":"Storer, J.A., Szymanski, T.G.: Data compression via textual substitution. J. ACM 29(4), 928\u2013951 (1982). https:\/\/doi.org\/10.1145\/322344.322346","journal-title":"J. ACM"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Urabe, Y., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: On the size of overlapping Lempel-Ziv and Lyndon factorizations. In: Pisanti, N., Pissis, S.P. (eds.) 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. LIPIcs, Pisa, Italy, 18\u201320 June 2019, vol. 128, pp. 29:1\u201329:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2019.29","DOI":"10.4230\/LIPIcs.CPM.2019.29"},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977). https:\/\/doi.org\/10.1109\/TIT.1977.1055714","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10_CR34","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055934","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86692-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T21:26:35Z","timestamp":1632777995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86692-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866914","9783030866921"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86692-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cristal.univ-lille.fr\/spire2021\/","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":"30","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":"14","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":"4","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.87","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":"2.32","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":"2 invited papers are also included. The symposium was held virtually.","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)"}}]}}