{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:47:42Z","timestamp":1743054462955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492716"},{"type":"electronic","value":"9783031492723"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49272-3_3","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"39-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Min-k-planar Drawings of\u00a0Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9110","authenticated-orcid":false,"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"B\u00fcngener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4224-1550","authenticated-orcid":false,"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4379-6059","authenticated-orcid":false,"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7250-0600","authenticated-orcid":false,"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1698-3868","authenticated-orcid":false,"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2886-9694","authenticated-orcid":false,"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0471-4118","authenticated-orcid":false,"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Ackerman, E.: On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.101574","DOI":"10.1016\/j.comgeo.2019.101574"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory Ser. A 114(3), 563\u2013571 (2007). https:\/\/doi.org\/10.1016\/j.jcta.2006.08.002","journal-title":"J. Comb. Theory Ser. A"},{"key":"3_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0021784","volume-title":"Graph Drawing","author":"PK Agarwal","year":"1995","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. In: Brandenburg, F. (ed.) GD 1995. LNCS, vol. 1027, pp. 1\u20137. Springer, Cham (1995). https:\/\/doi.org\/10.1007\/BFb0021784"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1\u20139 (1997). https:\/\/doi.org\/10.1007\/BF01196127","journal-title":"Combinatorica"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2019.08.006","volume":"142","author":"P Angelini","year":"2020","unstructured":"Angelini, P., et al.: Simple k-planar graphs are simple (k+1)-quasiplanar. J. Comb. Theory Ser. B 142, 1\u201335 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2019.08.006","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-35802-0_20","volume-title":"Graph Drawing and Network Visualization","author":"P Angelini","year":"2019","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Schneck, T.: Efficient generation of different topological representations of graphs beyond-planarity. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 253\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_20"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"573","DOI":"10.7155\/jgaa.00531","volume":"24","author":"P Angelini","year":"2020","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Schneck, T.: Efficient generation of different topological representations of graphs beyond-planarity. J. Graph Algorithms Appl. 24(4), 573\u2013601 (2020). https:\/\/doi.org\/10.7155\/jgaa.00531","journal-title":"J. Graph Algorithms Appl."},{"key":"3_CR8","series-title":"LNCS","first-page":"646","volume-title":"Graph Drawing and Network Visualization","author":"C Bachmaier","year":"2018","unstructured":"Bachmaier, C., Rutter, I., Stumpf, P.: 1-gap planarity of complete bipartite graphs. In: Biedl, T.C., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 646\u2013648. Springer, Cham (2018)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-73915-1_41","volume-title":"Graph Drawing and Network Visualization","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., et al.: Gap-planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 531\u2013545. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_41"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2018.05.029","volume":"745","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., et al.: Gap-planar graphs. Theor. Comput. Sci. 745, 36\u201352 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.05.029","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-662-45803-7_17","volume-title":"Graph Drawing","author":"MA Bekos","year":"2014","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.-H., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 198\u2013209. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_17"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00453-016-0200-5","volume":"79","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S., Kaufmann, M.: On the recognition of fan-planar and maximal outer-fan-planar graphs. Algorithmica 79(2), 401\u2013427 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0200-5","journal-title":"Algorithmica"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) SoCG. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.16","DOI":"10.4230\/LIPIcs.SoCG.2017.16"},{"key":"3_CR14","unstructured":"Binucci, C., et al.: Min-$$k$$-planar drawings of graphs. CoRR 2308.13401 (2023). https:\/\/arxiv.org\/abs\/2308.13401"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-031-43380-1_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C Binucci","year":"2023","unstructured":"Binucci, C., et al.: Nonplanar graph drawings with $$k$$ vertices per face. In: Paulusma, D., Ries, B. (eds.) WG 2023. LNCS, vol. 14093, pp. 86\u2013100. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43380-1_7"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2015.04.020","volume":"589","author":"C Binucci","year":"2015","unstructured":"Binucci, C., et al.: Fan-planarity: properties and complexity. Theor. Comput. Sci. 589, 76\u201386 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.020","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-662-45803-7_16","volume-title":"Graph Drawing","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Montecchiani, F., Patrignani, M., Tollis, I.G.: Fan-planar graphs: combinatorial properties and complexity results. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 186\u2013197. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_16"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/mana.3211170125","volume":"117","author":"R Bodendiek","year":"1984","unstructured":"Bodendiek, R., Schumacher, H., Wagner, K.: \u00dcber 1-optimale graphen. Math. Nachr. 117, 323\u2013339 (1984)","journal-title":"Math. Nachr."},{"issue":"5","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM J. Comput. 42(5), 1803\u20131829 (2013). https:\/\/doi.org\/10.1137\/120872310","journal-title":"SIAM J. Comput."},{"key":"3_CR20","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1999)"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Didimo, W., Liotta, G., Montecchiani, F.: A survey on graph drawing beyond planarity. ACM Comput. Surv. 52(1), 4:1\u20134:37 (2019). https:\/\/doi.org\/10.1145\/3301281","DOI":"10.1145\/3301281"},{"key":"3_CR22","unstructured":"Dujmovic, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci. 2011 (2011)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-030-92931-2_6","volume-title":"Graph Drawing and Network Visualization","author":"H F\u00f6rster","year":"2021","unstructured":"F\u00f6rster, H., Kaufmann, M., Raftopoulou, C.N.: Recognizing and embedding simple optimal 2-planar graphs. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 87\u2013100. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92931-2_6"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/110858586","volume":"27","author":"J Fox","year":"2013","unstructured":"Fox, J., Pach, J., Suk, A.: The number of edges in $$k$$-quasi-planar graphs. SIAM J. Discret. Math. 27(1), 550\u2013561 (2013). https:\/\/doi.org\/10.1137\/110858586","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-0010-x","volume":"49","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossings per edge. Algorithmica 49(1), 1\u201311 (2007). https:\/\/doi.org\/10.1007\/s00453-007-0010-x","journal-title":"Algorithmica"},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5","volume-title":"Beyond Planar Graphs","year":"2020","unstructured":"Hong, S., Tokuyama, T. (eds.): Beyond Planar Graphs. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-981-15-6533-5"},{"key":"3_CR27","doi-asserted-by":"publisher","unstructured":"Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. Electron. J. Comb. 29(1) (2022). https:\/\/doi.org\/10.37236\/10521","DOI":"10.37236\/10521"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017). https:\/\/doi.org\/10.1016\/j.cosrev.2017.06.002","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"3_CR29","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J Pach","year":"2006","unstructured":"Pach, J., Radoicic, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discret. Computat. Geom. 36(4), 527\u2013552 (2006). https:\/\/doi.org\/10.1007\/s00454-006-1264-9","journal-title":"Discret. Computat. Geom."},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-62495-3_59","volume-title":"Graph Drawing","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. In: North, S. (ed.) GD 1996. LNCS, vol. 1190, pp. 345\u2013354. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62495-3_59"},{"issue":"3","key":"3_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997). https:\/\/doi.org\/10.1007\/BF01215922","journal-title":"Combinatorica"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02996313","volume":"29","author":"G Ringel","year":"1965","unstructured":"Ringel, G.: Ein Sechsfarbenproblem auf der Kugel. Abh. Math. Sem. Univ. Hamb. 29, 107\u2013117 (1965)","journal-title":"Abh. Math. Sem. Univ. Hamb."},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-70904-6_16","volume-title":"Graph Drawing","author":"DR Wood","year":"2007","unstructured":"Wood, D.R., Telle, J.A.: Planar decompositions and the crossing number of graphs with an excluded minor. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 150\u2013161. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_16"},{"key":"3_CR34","unstructured":"Wood, D.R., Telle, J.A.: Planar decompositions and the crossing number of graphs with an excluded minor. New York J. Math. 13, 117\u2013146 (2007). https:\/\/nyjm.albany.edu\/j\/2007\/13-8.pdf"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49272-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:05:16Z","timestamp":1704963916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49272-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492716","9783031492723"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49272-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","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":"100","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":"31","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":"7","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":"31% - 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","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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}