{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:13:37Z","timestamp":1760202817804,"version":"3.40.3"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030249212"},{"type":"electronic","value":"9783030249229"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24922-9_1","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T10:04:49Z","timestamp":1562925889000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Topological Perspective on Distributed Network Algorithms"],"prefix":"10.1007","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Paz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,13]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Ellen, F., Gelashvili, R., Zhu, L.: Why extension-based proofs fail. CoRR abs\/1811.01421 http:\/\/arxiv.org\/abs\/1811.01421 (2018). To appear in STOC 2019","key":"1_CR1","DOI":"10.1145\/3313276.3316407"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/16M1081439","volume":"48","author":"H Attiya","year":"2019","unstructured":"Attiya, H., Casta\u00f1eda, A., Herlihy, M., Paz, A.: Bounds on the step and namespace complexity of renaming. SIAM J. Comput. 48(1), 1\u201332 (2019). https:\/\/doi.org\/10.1137\/16M1081439","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Balliu, A., Brandt, S., Hirvonen, J., Olivetti, D., Rabie, M., Suomela, J.: Lower bounds for maximal matchings and maximal independent sets. CoRR abs\/1901.02441 http:\/\/arxiv.org\/abs\/1901.02441 (2019)","key":"1_CR3","DOI":"10.1109\/FOCS.2019.00037"},{"doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Goldenberg, U.: Locally-iterative distributed ($$\\delta + 1$$)-coloring below szegedy-vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, (PODC), pp. 437\u2013446 (2018). https:\/\/dl.acm.org\/citation.cfm?id=3212769","key":"1_CR4","DOI":"10.1145\/3212734.3212769"},{"doi-asserted-by":"publisher","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: 53rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 321\u2013330 (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.60","key":"1_CR5","DOI":"10.1109\/FOCS.2012.60"},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s13174-012-0073-z","volume":"3","author":"S Bhadra","year":"2012","unstructured":"Bhadra, S., Ferreira, A.: Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. J. Internet Services Appl. 3(3), 269\u2013275 (2012). https:\/\/doi.org\/10.1007\/s13174-012-0073-z","journal-title":"J. Internet Services Appl."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2018.02.019","volume":"726","author":"M Biely","year":"2018","unstructured":"Biely, M., Robinson, P., Schmid, U., Schwarz, M., Winkler, K.: Gracefully degrading consensus and k-set agreement in directed dynamic networks. Theor. Comput. Sci. 726, 41\u201377 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.02.019","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Brandt, S., et al.: A lower bound for the distributed Lov\u00e1sz local lemma. In: 48th ACM Symposium on Theory of Computing (STOC), pp. 479\u2013488 (2016). https:\/\/doi.org\/10.1145\/2897518.2897570","key":"1_CR8","DOI":"10.1145\/2897518.2897570"},{"issue":"5\u20136","key":"1_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","volume":"22","author":"A Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: the lower bound. Distrib. Comput. 22(5\u20136), 287\u2013301 (2010). https:\/\/doi.org\/10.1007\/s00446-010-0108-2","journal-title":"Distrib. Comput."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2108242.2108245","volume":"59","author":"A Casta\u00f1eda","year":"2012","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: the upper bound. J. ACM 59(1), 3:1\u20133:49 (2012). https:\/\/doi.org\/10.1145\/2108242.2108245","journal-title":"J. ACM"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2015.04.004","volume":"590","author":"A Casteigts","year":"2015","unstructured":"Casteigts, A., Flocchini, P., Godard, E., Santoro, N., Yamashita, M.: On the expressivity of time-varying graphs. Theor. Comput. Sci. 590, 27\u201337 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.04.004","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012). https:\/\/doi.org\/10.1080\/17445760.2012.668546","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"Chang, Y., Li, W., Pettie, S.: An optimal distributed$$({\\varDelta }+1)$$-coloring algorithm? In: 50th ACM Symposium on Theory of Computing (STOC), pp. 445\u2013456 (2018). https:\/\/doi.org\/10.1145\/3188745.3188964","key":"1_CR13","DOI":"10.1145\/3188745.3188964"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-662-47666-6_42","volume-title":"Automata, Languages, and Programming","author":"B Charron-Bost","year":"2015","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 528\u2013539. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_42"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009). https:\/\/doi.org\/10.1007\/s00446-009-0084-6","journal-title":"Distrib. Comput."},{"issue":"5","key":"1_CR16","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1145\/355483.355489","volume":"47","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Herlihy, M., Lynch, N.A., Tuttle, M.R.: Tight bounds for k-set agreement. J. ACM 47(5), 912\u2013943 (2000). https:\/\/doi.org\/10.1145\/355483.355489","journal-title":"J. ACM"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2015.01.024","volume":"584","author":"E Coulouma","year":"2015","unstructured":"Coulouma, E., Godard, E., Peters, J.G.: A characterization of oblivious message adversaries for which consensus is solvable. Theor. Comput. Sci. 584, 80\u201390 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.01.024","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Fischer, M., Ghaffari, M., Kuhn, F.: Deterministic distributed edge-coloring via hypergraph maximal matching. In: 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 180\u2013191 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.25","key":"1_CR18","DOI":"10.1109\/FOCS.2017.25"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 270\u2013277 (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch20","key":"1_CR20","DOI":"10.1137\/1.9781611974331.ch20"},{"doi-asserted-by":"publisher","unstructured":"Ghaffari, M., Kuhn, F., Maus, Y.: On the complexity of local distributed graph problems. In: 49th ACM Symposium on Theory of Computing (STOC), pp. 784\u2013797 (2017). https:\/\/doi.org\/10.1145\/3055399.3055471","key":"1_CR21","DOI":"10.1145\/3055399.3055471"},{"doi-asserted-by":"publisher","unstructured":"Godard, E., Perdereau, E.: k-set agreement in communication networks with omission faults. In: 20th International Conference on Principles of Distributed Systems (OPODIS), pp. 8:1\u20138:17 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2016.8","key":"1_CR22","DOI":"10.4230\/LIPIcs.OPODIS.2016.8"},{"issue":"5","key":"1_CR23","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00446-015-0245-8","volume":"30","author":"M G\u00f6\u00f6s","year":"2017","unstructured":"G\u00f6\u00f6s, M., Hirvonen, J., Suomela, J.: Linear-in-$$\\varDelta $$ lowerbounds in the LOCAL model. Distrib. Comput. 30(5), 325\u2013338 (2017). https:\/\/doi.org\/10.1007\/s00446-015-0245-8","journal-title":"Distrib. Comput."},{"doi-asserted-by":"publisher","unstructured":"Harris, D.G., Schneider, J., Su, H.: Distributed $$({\\Delta }+1)$$-coloring in sublogarithmic rounds. In: 48th ACM Symposium on Theory of Computing (STOC), pp. 465\u2013478 (2016). https:\/\/doi.org\/10.1145\/2897518.2897533","key":"1_CR24","DOI":"10.1145\/2897518.2897533"},{"key":"1_CR25","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco (2013)"},{"doi-asserted-by":"publisher","unstructured":"Herlihy, M., Rajsbaum, S.: Set consensus using arbitrary objects. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 324\u2013333 (1994). https:\/\/doi.org\/10.1145\/197917.198119","key":"1_CR26","DOI":"10.1145\/197917.198119"},{"issue":"4","key":"1_CR27","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0960129500003170","volume":"10","author":"M Herlihy","year":"2000","unstructured":"Herlihy, M., Rajsbaum, S.: Algebraic spans. Math. Struct. Comput. Sci. 10(4), 549\u2013573 (2000). http:\/\/journals.cambridge.org\/action\/displayAbstract?aid=54601","journal-title":"Math. Struct. Comput. Sci."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.entcs.2009.02.018","volume":"230","author":"M Herlihy","year":"2009","unstructured":"Herlihy, M., Rajsbaum, S., Tuttle, M.R.: An axiomatic approach to computing the connectivity of synchronous and asynchronous systems. Electr. Notes Theor. Comput. Sci. 230, 79\u2013102 (2009). https:\/\/doi.org\/10.1016\/j.entcs.2009.02.018","journal-title":"Electr. Notes Theor. Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: 25th ACM Symposium on Theory of Computing (STOC), pp. 111\u2013120 (1993). https:\/\/doi.org\/10.1145\/167088.167125","key":"1_CR29","DOI":"10.1145\/167088.167125"},{"issue":"6","key":"1_CR30","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999). https:\/\/doi.org\/10.1145\/331524.331529","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: 42nd ACM Symposium on Theory of Computing (STOC), pp. 513\u2013522 (2010). https:\/\/doi.org\/10.1145\/1806689.1806760","key":"1_CR31","DOI":"10.1145\/1806689.1806760"},{"issue":"2","key":"1_CR32","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2742012","volume":"63","author":"F Kuhn","year":"2016","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1\u201317:44 (2016). https:\/\/doi.org\/10.1145\/2742012","journal-title":"J. ACM"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: 30th ACM Symposium on Principles of Distributed Computing (PODC), pp. 1\u201310 (2011). https:\/\/doi.org\/10.1145\/1993806.1993808","key":"1_CR33","DOI":"10.1145\/1993806.1993808"},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42(1), 82\u201396 (2011). https:\/\/doi.org\/10.1145\/1959045.1959064","journal-title":"SIGACT News"},{"issue":"1","key":"1_CR35","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992). https:\/\/doi.org\/10.1137\/0221015","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Mendes, H., Tasson, C., Herlihy, M.: Distributed computability in Byzantine asynchronous systems. In: 46th Symposium on Theory of Computing (STOC), pp. 704\u2013713 (2014). https:\/\/doi.org\/10.1145\/2591796.2591853","key":"1_CR36","DOI":"10.1145\/2591796.2591853"},{"key":"1_CR37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"doi-asserted-by":"publisher","unstructured":"Rajsbaum, S., Casta\u00f1eda, A., Flores-Pe\u00f1aloza, D., Alcantara, M.: Fault-tolerant robot gathering problems on graphs with arbitrary appearing times. In: 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 493\u2013502 (2017). https:\/\/doi.org\/10.1109\/IPDPS.2017.70","key":"1_CR38","DOI":"10.1109\/IPDPS.2017.70"},{"doi-asserted-by":"publisher","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The iterated restricted immediate snapshot model. In: 14th International Conference on Computing and Combinatorics (COCOON), pp. 487\u2013497 (2008). https:\/\/doi.org\/10.1007\/978-3-540-69733-6_48","key":"1_CR39","DOI":"10.1007\/978-3-540-69733-6_48"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00918ED1V01Y201904DCT016","volume":"9","author":"D Sakavalas","year":"2019","unstructured":"Sakavalas, D., Tseng, L.: Network topology and fault-tolerant consensus. Synth. Lect. Distrib. Comput. Theory 9, 1\u2013151 (2019)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"doi-asserted-by":"publisher","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. In: 25th ACM Symposium on Theory of Computing (STOC), pp. 101\u2013110 (1993). https:\/\/doi.org\/10.1145\/167088.167122","key":"1_CR41","DOI":"10.1145\/167088.167122"},{"issue":"2","key":"1_CR42","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2431211.2431223","volume":"45","author":"J Suomela","year":"2013","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2), 24:1\u201324:40 (2013). https:\/\/doi.org\/10.1145\/2431211.2431223","journal-title":"ACM Comput. Surv."}],"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-24922-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:56:45Z","timestamp":1710266205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24922-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030249212","9783030249229"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24922-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 July 2019","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":"L'Aquila","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.gssi.it\/sirocco2019\/","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":"39","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":"19","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":"9","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":"49% - 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)"}}]}}