{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:33Z","timestamp":1742971053826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031442735"},{"type":"electronic","value":"9783031442742"}],"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-44274-2_13","type":"book-chapter","created":{"date-parts":[[2023,9,30]],"date-time":"2023-09-30T01:02:06Z","timestamp":1696035726000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Fagnano Triangle Patrolling Problem (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Georgiou","sequence":"first","affiliation":[]},{"given":"Somnath","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,30]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-28645-5_48","volume-title":"Advances in Artificial Intelligence \u2013 SBIA 2004","author":"A Almeida","year":"2004","unstructured":"Almeida, A., et al.: Recent advances on multi-agent patrolling. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 474\u2013483. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28645-5_48"},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1287\/opre.1110.0983","volume":"59","author":"S Alpern","year":"2011","unstructured":"Alpern, S., Morton, A., Papadaki, K.: Patrolling games. Oper. Res. 59(5), 1246\u20131257 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s43154-022-00078-5","volume":"3","author":"N Basilico","year":"2022","unstructured":"Basilico, N.: Recent trends in robotic patrolling. Curr. Robot. Rep. 3(2), 65\u201376 (2022)","journal-title":"Curr. Robot. Rep."},{"issue":"6","key":"13_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1080\/00029890.2008.11920555","volume":"115","author":"AM Baxter","year":"2008","unstructured":"Baxter, A.M., Umble, R.: Periodic orbits for billiards on an equilateral triangle. Amer. Math. Monthly 115(6), 479\u2013491 (2008)","journal-title":"Amer. Math. Monthly"},{"key":"13_CR5","unstructured":"Bedaride, N.: Periodic billiard trajectories in polyhedra. arXiv preprint arXiv:1104.1051 (2011)"},{"key":"13_CR6","unstructured":"Chevaleyre, Y.: Theoretical analysis of the multi-agent patrolling problem. In: IAT, pp. 302\u2013308 (2004)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-73117-9_26","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"H Chuangpishit","year":"2018","unstructured":"Chuangpishit, H., Czyzowicz, J., G\u0105sieniec, L., Georgiou, K., Jurdzi\u0144ski, T., Kranakis, E.: Patrolling a path connecting a set of points with unbalanced frequencies of visits. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 367\u2013380. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73117-9_26"},{"key":"13_CR8","unstructured":"Collins, A., et al.: Optimal patrolling of fragmented boundaries. In: Blelloch, G.E., V\u00f6cking, B. (eds.) 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, Montreal, QC, Canada, 23\u201325 July 2013, pp. 241\u2013250. ACM (2013)"},{"key":"13_CR9","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-53982-9_5","volume-title":"Operations Research and Enterprise Systems","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., MacQuarrie, F., Pajak, D.: Distributed patrolling with two-speed robots (and an application to transportation). In: Vitoriano, B., Parlier, G.H. (eds.) ICORES 2016. CCIS, vol. 695, pp. 71\u201395. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53982-9_5"},{"key":"13_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-11072-7_15","volume-title":"Distributed Computing by Mobile Entities: Current Research in Moving and Computing","author":"J Czyzowicz","year":"2019","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E.: Patrolling. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities: Current Research in Moving and Computing. LNCS, vol. 11340, pp. 371\u2013400. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_15"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-319-51966-1_22","volume-title":"Foundations and Practice of Security","author":"J Czyzowicz","year":"2017","unstructured":"Czyzowicz, J., Kosowski, A., Kranakis, E., Taleb, N.: Patrolling trees with mobile robots. In: Cuppens, F., Wang, L., Cuppens-Boulahia, N., Tawbi, N., Garcia-Alfaro, J. (eds.) FPS 2016. LNCS, vol. 10128, pp. 331\u2013344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51966-1_22"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-030-48966-3_16","volume-title":"Combinatorial Algorithms","author":"P Damaschke","year":"2020","unstructured":"Damaschke, P.: Two robots patrolling on a line: integer version and approximability. In: G\u0105sieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 211\u2013223. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48966-3_16"},{"key":"13_CR13","unstructured":"Damaschke, P.: Distance-based solution of patrolling problems with individual waiting times. In: M\u00fcller-Hannemann, M., Perea, F. (eds.) ATMOS 2021. OASIcs, vol. 96, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"3\u20134","key":"13_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10472-010-9193-y","volume":"57","author":"Y Elmaliach","year":"2009","unstructured":"Elmaliach, Y., Agmon, N., Kaminka, G.A.: Multi-robot area patrol under frequency constraints. Ann. Math. Artif. Intell. 57(3\u20134), 293\u2013320 (2009)","journal-title":"Ann. Math. Artif. Intell."},{"key":"13_CR15","unstructured":"Elmaliach, Y., Shiloni, A., Kaminka, G.A.: A realistic model of frequency-based multi-robot polyline patrolling. In: AAMAS (1), pp. 63\u201370 (2008)"},{"issue":"7","key":"13_CR16","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1007\/s10514-018-09822-3","volume":"43","author":"L Freda","year":"2019","unstructured":"Freda, L., et al.: 3D multi-robot patrolling with a two-level coordination strategy. Auton. Robots 43(7), 1747\u20131779 (2019)","journal-title":"Auton. Robots"},{"issue":"6","key":"13_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1080\/00029890.2019.1593087","volume":"126","author":"R Garcia","year":"2019","unstructured":"Garcia, R.: Elliptic billiards and ellipses associated to the 3-periodic orbits. Am. Math. Mon 126(6), 491\u2013504 (2019)","journal-title":"Am. Math. Mon"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ejor.2019.02.026","volume":"277","author":"T Garrec","year":"2019","unstructured":"Garrec, T.: Continuous patrolling and hiding games. Eur. J. Oper. Res. 277(1), 42\u201351 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-030-79987-8_24","volume-title":"Combinatorial Algorithms","author":"K Georgiou","year":"2021","unstructured":"Georgiou, K., Kundu, S., Pra\u0142at, P.: Makespan trade-offs for visiting triangle edges. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 340\u2013355. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_24"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Georgiou, K., Kundu, S., Pralat, P.: The Fagnano triangle patrolling problem. CoRR, abs\/2307.13153 (2023)","DOI":"10.1007\/978-3-031-44274-2_13"},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/S0036144599355725","volume":"42","author":"L Halbeisen","year":"2000","unstructured":"Halbeisen, L., Hungerb\u00fchler, N.: On periodic billiard trajectories in obtuse triangles. SIAM Rev. 42(4), 657\u2013670 (2000)","journal-title":"SIAM Rev."},{"issue":"12","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1016\/j.robot.2008.01.006","volume":"56","author":"N Hazon","year":"2008","unstructured":"Hazon, N., Kaminka, G.A.: On redundancy, efficiency, and robustness in coverage for multiple robots. Robot. Auton. Syst. 56(12), 1102\u20131114 (2008)","journal-title":"Robot. Auton. Syst."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1109\/JAS.2019.1911537","volume":"6","author":"L Huang","year":"2019","unstructured":"Huang, L., Zhou, M., Hao, K., Hou, E.S.H.: A survey of multi-robot regular and adversarial patrolling. IEEE CAA J. Autom. Sinica 6(4), 894\u2013903 (2019)","journal-title":"IEEE CAA J. Autom. Sinica"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00039-009-0009-3","volume":"19","author":"RN Karasev","year":"2009","unstructured":"Karasev, R.N.: Periodic billiard trajectories in smooth convex bodies. Geom. Funct. Anal. 19(2), 423\u2013428 (2009)","journal-title":"Geom. Funct. Anal."},{"issue":"2","key":"13_CR25","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-014-0226-3","volume":"28","author":"A Kawamura","year":"2015","unstructured":"Kawamura, A., Kobayashi, Y.: Fence patrolling by mobile agents with distinct speeds. Distrib. Comput. 28(2), 147\u2013154 (2015)","journal-title":"Distrib. Comput."},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.tcs.2020.07.037","volume":"839","author":"A Kawamura","year":"2020","unstructured":"Kawamura, A., Soejima, M.: Simple strategies versus optimal schedules in multi-agent patrolling. Theoret. Comput. Sci. 839, 195\u2013206 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-30303-1_1","volume-title":"Foundations and Practice of Security","author":"E Kranakis","year":"2016","unstructured":"Kranakis, E., Krizanc, D.: Optimization problems in infrastructure security. In: Garcia-Alfaro, J., Kranakis, E., Bonfante, G. (eds.) FPS 2015. LNCS, vol. 9482, pp. 3\u201313. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30303-1_1"},{"issue":"5","key":"13_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.052922","volume":"90","author":"C Lafargue","year":"2014","unstructured":"Lafargue, C., et al.: Localized lasing modes of triangular organic microlasers. Phys. Rev. E 90(5), 052922 (2014)","journal-title":"Phys. Rev. E"},{"key":"13_CR29","unstructured":"Lapidus, M.L., Niemeyer, R.G.: Families of periodic orbits of the koch snowflake fractal billiard (2011)"},{"issue":"10","key":"13_CR30","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1177\/0278364915624974","volume":"35","author":"SK Lee","year":"2016","unstructured":"Lee, S.K., Fekete, S.P., McLurkin, J.: Structured triangulation in multi-robot systems: coverage, patrolling, voronoi partitions, and geodesic centers. Int. J. Robot. Res. 35(10), 1234\u20131260 (2016)","journal-title":"Int. J. Robot. Res."},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-36483-8_11","volume-title":"Multi-Agent-Based Simulation II","author":"A Machado","year":"2003","unstructured":"Machado, A., Ramalho, G., Zucker, J.-D., Drogoul, A.: Multi-agent patrolling: an empirical analysis of alternative architectures. In: Sim\u00e3o Sichman, J., Bousquet, F., Davidsson, P. (eds.) MABS 2002. LNCS (LNAI), vol. 2581, pp. 155\u2013170. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36483-8_11"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Morales-Ponce, O.: Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots. In: Mukherjee, N., Pemmaraju, S.V. (eds.) ICDCN 2020: 21st International Conference on Distributed Computing and Networking, Kolkata, India, 4\u20137 January 2020, pp. 10:1\u201310:10. ACM (2020)","DOI":"10.1145\/3369740.3369773"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Pasqualetti, F., Franchi, A., Bullo, F.: On optimal cooperative patrolling. In: CDC, pp. 7153\u20137158. IEEE (2010)","DOI":"10.1109\/CDC.2010.5717873"},{"issue":"7","key":"13_CR34","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1049\/iet-cvi.2019.0963","volume":"14","author":"C Piciarelli","year":"2020","unstructured":"Piciarelli, C., Foresti, G.L.: Drone swarm patrolling with uneven coverage requirements. IET Comput. Vis. 14(7), 452\u2013461 (2020)","journal-title":"IET Comput. Vis."},{"key":"13_CR35","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-19170-1_15","volume-title":"Technological Innovation for Sustainability","author":"D Portugal","year":"2011","unstructured":"Portugal, D., Rocha, R.: A survey on multi-robot patrolling algorithms. In: Camarinha-Matos, L.M. (ed.) DoCEIS 2011. IAICT, vol. 349, pp. 139\u2013146. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19170-1_15"},{"issue":"2","key":"13_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/10586458.2006.10128961","volume":"15","author":"RE Schwartz","year":"2006","unstructured":"Schwartz, R.E.: Obtuse triangular billiards i: near the (2, 3, 6) triangle. Exp. Math. 15(2), 161\u2013182 (2006)","journal-title":"Exp. Math."},{"issue":"2","key":"13_CR37","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1080\/10586458.2009.10128891","volume":"18","author":"RE Schwartz","year":"2009","unstructured":"Schwartz, R.E.: Obtuse triangular billiards ii: one hundred degrees worth of periodic trajectories. Exp. Math. 18(2), 137\u2013171 (2009)","journal-title":"Exp. Math."},{"key":"13_CR38","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2013.03.019","volume":"532","author":"X Tan","year":"2014","unstructured":"Tan, X., Jiang, B.: Minimization of the maximum distance between the two guards patrolling a polygonal region. Theor. Comput. Sci. 532, 73\u201379 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"13_CR39","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/00029890.2009.11920934","volume":"116","author":"S Troubetzkoy","year":"2009","unstructured":"Troubetzkoy, S.: Dual billiards, fagnano orbits, and regular polygons. Am. Math. Mon. 116(3), 251\u2013260 (2009)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"13_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1070\/RM1992v047n03ABEH000893","volume":"47","author":"YB Vorobets","year":"1992","unstructured":"Vorobets, Y.B., Gal\u2019perin, G.A., Stepin, A.M.: Periodic billiard trajectories in polygons: generating mechanisms. Russ. Math. Surv. 47(3), 5 (1992)","journal-title":"Russ. Math. Surv."},{"issue":"3","key":"13_CR41","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37(3), 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-44274-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T01:03:34Z","timestamp":1709859814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-44274-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031442735","9783031442742"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-44274-2_13","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":"30 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jersey City, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"2 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~SSS2023","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":"78","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":"32","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":"8","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":"41% - 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":"5","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":"4 invited papers","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)"}}]}}