{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:59:42Z","timestamp":1742918382983,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030795269"},{"type":"electronic","value":"9783030795276"}],"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-79527-6_18","type":"book-chapter","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T11:03:43Z","timestamp":1624100623000},"page":"315-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fault-Tolerant Distance Labeling for Planar Graphs"],"prefix":"10.1007","author":[{"given":"Aviv","family":"Bar-Natan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6024-1557","authenticated-orcid":false,"given":"Panagiotis","family":"Charalampopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6993-5440","authenticated-orcid":false,"given":"Pawe\u0142","family":"Gawrychowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9262-1821","authenticated-orcid":false,"given":"Shay","family":"Mozes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4510-7552","authenticated-orcid":false,"given":"Oren","family":"Weimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Abraham, I., Chechik, S., Gavoille, C.: Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In: 44th STOC, pp. 1199\u20131218 (2012). https:\/\/doi.org\/10.1145\/2213977.2214084","DOI":"10.1145\/2213977.2214084"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Abraham, I., Chechik, S., Gavoille, C., Peleg, D.: Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Trans. Algorithms 12(2), 22:1\u201322:17 (2016). https:\/\/doi.org\/10.1145\/2818694","DOI":"10.1145\/2818694"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: 25th PODC, pp. 188\u2013197. ACM (2006). https:\/\/doi.org\/10.1145\/1146381.1146411","DOI":"10.1145\/1146381.1146411"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Alon, N., Nenadov, R.: Optimal induced universal graphs for bounded-degree graphs. In: 28th SODA, pp. 1149\u20131157 (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.74","DOI":"10.1137\/1.9781611974782.74"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Alstrup, S., Dahlgaard, S., Knudsen, M.B.T.: Optimal induced universal graphs and adjacency labeling for trees. J. ACM 64(4), 27:1\u201327:22 (2017). https:\/\/doi.org\/10.1145\/3088513","DOI":"10.1145\/3088513"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1137\/16M1105967","volume":"33","author":"S Alstrup","year":"2019","unstructured":"Alstrup, S., Kaplan, H., Thorup, M., Zwick, U.: Adjacency labeling schemes and induced-universal graphs. SIAM J. Discret. Math. 33(1), 116\u2013137 (2019). https:\/\/doi.org\/10.1137\/16M1105967","journal-title":"SIAM J. Discret. Math."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bar-Natan, A., Charalampopoulos, P., Gawrychowski, P., Mozes, S., Weimann, O.: Fault-tolerant distance labeling for planar graphs. CoRR abs\/2102.07154 (2021)","DOI":"10.1007\/978-3-030-79527-6_18"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Baswana, S., Lath, U., Mehta, A.S.: Single source distance oracle for planar digraphs avoiding a failed node or link. In: 23rd SODA. pp. 223\u2013232 (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.20","DOI":"10.1137\/1.9781611973099.20"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Bez\u00e1kov\u00e1, I., Searns, A.: On counting oracles for path problems. In: 29th ISAAC, pp. 56:1\u201356:12 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2018.56","DOI":"10.4230\/LIPIcs.ISAAC.2018.56"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.endm.2007.01.022","volume":"28","author":"N Bonichon","year":"2007","unstructured":"Bonichon, N., Gavoille, C., Labourel, A.: Short labels by traversal and jumping. Electron. Not. Discrete Math. 28, 153\u2013160 (2007). https:\/\/doi.org\/10.1016\/j.endm.2007.01.022","journal-title":"Electron. Not. Discrete Math."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1137\/120864271","volume":"42","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Chambers, E.W., Erickson, J.: Multiple-source shortest paths in embedded graphs. SIAM J. Comput. 42(4), 1542\u20131571 (2013). https:\/\/doi.org\/10.1137\/120864271","journal-title":"SIAM J. Comput."},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Gawrychowski, P., Mozes, S., Weimann, O.: Almost optimal distance oracles for planar graphs. In: 51st STOC, pp. 138\u2013151 (2019). https:\/\/doi.org\/10.1145\/3313276.3316316","DOI":"10.1145\/3313276.3316316"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Charalampopoulos, P., Mozes, S., Tebeka, B.: Exact distance oracles for planar graphs with failing vertices. In: 30th SODA, pp. 2110\u20132123 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.127","DOI":"10.1137\/1.9781611975482.127"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10878-009-9260-7","volume":"21","author":"B Courcelle","year":"2009","unstructured":"Courcelle, B., Gavoille, C., Kant\u00e9, M.M.: Compact labelings for efficient first-order model-checking. J. Comb. Optim. 21(1), 19\u201346 (2009). https:\/\/doi.org\/10.1007\/s10878-009-9260-7","journal-title":"J. Comb. Optim."},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00224-009-9211-9","volume":"47","author":"B Courcelle","year":"2010","unstructured":"Courcelle, B., Twigg, A.: Constrained-path labellings on graphs of bounded clique-width. Theory of Comput. Syst. 47(2), 531\u2013567 (2010). https:\/\/doi.org\/10.1007\/s00224-009-9211-9","journal-title":"Theory of Comput. Syst."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Emek, Y., Peleg, D., Roditty, L.: A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Trans. Algorithms 6(4), 64:1\u201364:13 (2010). https:\/\/doi.org\/10.1145\/1824777.1824784","DOI":"10.1145\/1824777.1824784"},{"issue":"5","key":"18_CR17","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1016\/j.jcss.2005.05.007","volume":"72","author":"J Fakcharoenphol","year":"2006","unstructured":"Fakcharoenphol, J., Rao, S.: Planar graphs, negative weight edges, shortest paths, and near linear time. J. Comput. Syst. Sci. 72(5), 868\u2013889 (2006). https:\/\/doi.org\/10.1016\/j.jcss.2005.05.007","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Feigenbaum, J., Karger, D.R., Mirrokni, V.S., Sami, R.: Subjective-cost policy routing. In: 1st WINE, pp. 174\u2013183 (2005). https:\/\/doi.org\/10.1007\/11600930_18","DOI":"10.1007\/11600930_18"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.tcs.2007.02.020","volume":"378","author":"J Feigenbaum","year":"2007","unstructured":"Feigenbaum, J., Karger, D.R., Mirrokni, V.S., Sami, R.: Subjective-cost policy routing. Theor. Comput. Sci. 378(2), 175\u2013189 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.02.020","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987). https:\/\/doi.org\/10.1137\/0216064","journal-title":"SIAM J. Comput."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: 9th ESA, pp. 476\u2013487 (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_40","DOI":"10.1007\/3-540-44676-1_40"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9rennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85\u2013112 (2004). https:\/\/doi.org\/10.1016\/j.jalgor.2004.05.002","journal-title":"J. Algorithms"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Mozes, S., Weimann, O., Wulff-Nilsen, C.: Better tradeoffs for exact distance oracles in planar graphs. In: 29th SODA, pp. 515\u2013529 (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.34","DOI":"10.1137\/1.9781611975031.34"},{"key":"18_CR24","unstructured":"Gawrychowski, P., Uzna\u0144ski, P.: A note on distance labeling in planar graphs. CoRR abs\/1611.06529 (2016)"},{"key":"18_CR25","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BFb0067362","volume-title":"Graph Theory and Applications","author":"RL Graham","year":"1972","unstructured":"Graham, R.L., Pollak, H.O.: On embedding graphs in squashed cubes. In: Alavi, Y., Lick, D.R., White, A.T. (eds.) Graph Theory and Applications. LNM, vol. 303, pp. 99\u2013110. Springer, Heidelberg (1972). https:\/\/doi.org\/10.1007\/BFb0067362"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Gupta, A., Kumar, A., Rastogi, R.: Traveling with a pez dispenser (or, routing issues in MPLS). In: 42nd FOCS, pp. 148\u2013157 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959889","DOI":"10.1109\/SFCS.2001.959889"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Hsu, T., Lu, H.: An optimal labeling for node connectivity. In: 20th ISAAC (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_32","DOI":"10.1007\/978-3-642-10631-6_32"},{"key":"18_CR28","doi-asserted-by":"publisher","unstructured":"Italiano, G.F., Karczmarz, A., Parotsidis, N.: Planar reachability under single vertex or edge failures. In: 32nd SODA, pp. 2739\u20132758 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.163","DOI":"10.1137\/1.9781611976465.163"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved algorithms for min cut and max flow in undirected planar graphs. In: 43rd STOC, pp. 313\u2013322 (2011). https:\/\/doi.org\/10.1145\/1993636.1993679","DOI":"10.1145\/1993636.1993679"},{"issue":"4","key":"18_CR30","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM J. Discrete Math. 5(4), 596\u2013603 (1992). https:\/\/doi.org\/10.1137\/0405049","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Kaplan, H., Mozes, S., Nussbaum, Y., Sharir, M.: Submatrix maximum queries in monge matrices and partial monge matrices, and their applications. ACM Trans. Algorithms 13(2), 26:1\u201326:42 (2017). https:\/\/doi.org\/10.1145\/3039873","DOI":"10.1145\/3039873"},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539703433912","volume":"34","author":"M Katz","year":"2004","unstructured":"Katz, M., Katz, N.A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34(1), 23\u201340 (2004). https:\/\/doi.org\/10.1137\/S0097539703433912","journal-title":"SIAM J. Comput."},{"key":"18_CR33","unstructured":"Klein, P.N.: Multiple-source shortest paths in planar graphs. In: 16th SODA, pp. 146\u2013155 (2005). http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070454"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Klein, P.N., Mozes, S., Sommer, C.: Structured recursive separator decompositions for planar graphs in linear time. In: 45th STOC, pp. 505\u2013514 (2013). https:\/\/doi.org\/10.1145\/2488608.2488672","DOI":"10.1145\/2488608.2488672"},{"key":"18_CR35","doi-asserted-by":"publisher","unstructured":"Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: A linear-space $${O}(n \\log ^2 n)$$-time algorithm. ACM Trans. Algorithms 6(2), 30:1\u201330:18 (2010). https:\/\/doi.org\/10.1145\/1721837.1721846","DOI":"10.1145\/1721837.1721846"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Korman, A.: Labeling schemes for vertex connectivity. ACM Trans. Algorithms 6(2), 39:1\u201339:10 (2010). https:\/\/doi.org\/10.1145\/1721837.1721855","DOI":"10.1145\/1721837.1721855"},{"key":"18_CR37","doi-asserted-by":"publisher","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. In: 16th STOC, pp. 376\u2013382 (1984). https:\/\/doi.org\/10.1145\/800057.808703","DOI":"10.1145\/800057.808703"},{"key":"18_CR38","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. De l\u2019Imprimerie Royale (1781)"},{"key":"18_CR39","doi-asserted-by":"publisher","unstructured":"Mozes, S., Wulff-Nilsen, C.: Shortest paths in planar graphs with real lengths in $${O}(n \\log ^2 n \/ \\log \\log n)$$ time. In: 18th ESA, pp. 206\u2013217 (2010). https:\/\/doi.org\/10.1007\/978-3-642-15781-3_18","DOI":"10.1007\/978-3-642-15781-3_18"},{"issue":"3","key":"18_CR40","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory 33(3), 167\u2013176 (2000)","journal-title":"J. Graph Theory"},{"issue":"3","key":"18_CR41","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.tcs.2005.03.015","volume":"340","author":"D Peleg","year":"2005","unstructured":"Peleg, D.: Informative labeling schemes for graphs. Theor. Comput. Sci. 340(3), 577\u2013593 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.03.015","journal-title":"Theor. Comput. Sci."},{"key":"18_CR42","doi-asserted-by":"publisher","unstructured":"Petersen, C., Rotbart, N., Simonsen, J.G., Wulff-Nilsen, C.: Near-optimal adjacency labeling scheme for power-law graphs. In: 43rd ICALP, pp. 133:1\u2013133:15 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.133","DOI":"10.4230\/LIPIcs.ICALP.2016.133"},{"key":"18_CR43","unstructured":"Rotbart, N.G.: New Ideas on Labeling Schemes. Ph.D. thesis, University of Copenhagen (2016)"},{"issue":"6","key":"18_CR44","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993\u20131024 (2004). https:\/\/doi.org\/10.1145\/1039488.1039493","journal-title":"J. ACM"},{"key":"18_CR45","unstructured":"Twigg, A.D.: Compact forbidden-set routing. Tech. Rep. UCAM-CL-TR-678, University of Cambridge, Computer Laboratory (2006). https:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-678.pdf"},{"key":"18_CR46","doi-asserted-by":"publisher","unstructured":"Wulff-Nilsen, C.: Solving the replacement paths problem for planar directed graphs in $${O}(n \\log n)$$ time. In: 21st SODA, pp. 756\u2013765 (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.62","DOI":"10.1137\/1.9781611973075.62"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79527-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T19:16:24Z","timestamp":1672514184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79527-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030795269","9783030795276"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79527-6_18","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":"20 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 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":"sirocco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2021.ii.uni.wroc.pl\/","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":"48","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":"20","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":"42% - 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":"6","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)"}}]}}