{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:22:01Z","timestamp":1743074521087,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031147135"},{"type":"electronic","value":"9783031147142"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-14714-2_23","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T21:03:13Z","timestamp":1660424593000},"page":"324-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Combined Critical Node and\u00a0Edge Detection Problem. An\u00a0Evolutionary Approach"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"K\u00e9pes","sequence":"first","affiliation":[]},{"given":"No\u00e9mi","family":"Gask\u00f3","sequence":"additional","affiliation":[]},{"given":"G\u00e9za","family":"Vekov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"issue":"21","key":"23_CR1","doi-asserted-by":"publisher","first-page":"4947","DOI":"10.1242\/jcs.02714","volume":"118","author":"R Albert","year":"2005","unstructured":"Albert, R.: Scale-free networks in cell biology. J. Cell Sci. 118(21), 4947\u20134957 (2005)","journal-title":"J. Cell Sci."},{"issue":"6139","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1126\/science.1235381","volume":"340","author":"K Amunts","year":"2013","unstructured":"Amunts, K., et al.: Bigbrain: an ultrahigh-resolution 3d human brain model. Science 340(6139), 1472\u20131475 (2013)","journal-title":"Science"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","volume":"55","author":"R Aringhieri","year":"2016","unstructured":"Aringhieri, R., Grosso, A., Hosteins, P., Scatamacchia, R.: A general evolutionary framework for different classes of critical node problems. Eng. Appl. Artif. Intell. 55, 128\u2013145 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"7","key":"23_CR4","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graphs. Comput. Oper. Res. 36(7), 2193\u20132200 (2009)","journal-title":"Comput. Oper. Res."},{"key":"23_CR5","unstructured":"Arulselvan, A., Commander, C.W., Pardalos, P.M., Shylo, O.: Managing network risk via critical node identification. Risk management in telecommunication networks. Springer (2007)"},{"key":"23_CR6","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-1-4419-0534-5_4","volume-title":"Performance Models and Risk Management in Communications Systems","author":"A Arulselvan","year":"2011","unstructured":"Arulselvan, A., Commander, C.W., Shylo, O., Pardalos, P.M.: Cardinality-constrained critical node detection problem. In: G\u00fclp\u0131nar, N., Harrison, P., R\u00fcstem, B. (eds.) Performance Models and Risk Management in Communications Systems. SOIA, vol. 46, pp. 79\u201391. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-0534-5_4"},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.baae.2007.06.003","volume":"8","author":"J Bascompte","year":"2007","unstructured":"Bascompte, J.: Networks in ecology. Basic Appl. Ecol. 8(6), 485\u2013490 (2007)","journal-title":"Basic Appl. Ecol."},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P.: Identifying sets of key players in a social network. Comput. Math. Organ. Theory 12(1), 21\u201334 (2006)","journal-title":"Comput. Math. Organ. Theory"},{"issue":"9","key":"23_CR9","doi-asserted-by":"publisher","first-page":"2719","DOI":"10.1007\/s00453-021-00840-9","volume":"83","author":"LH Chen","year":"2021","unstructured":"Chen, L.H., Hung, L.J., Lotze, H., Rossmanith, P.: Online node-and edge-deletion problems with advice. Algorithmica 83(9), 2719\u20132753 (2021)","journal-title":"Algorithmica"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dinh, T.N., Thai, M.T.: Precise structural vulnerability assessment via mathematical programming. In: 2011-MILCOM 2011 Military Communications Conference, pp. 1351\u20131356. IEEE (2011)","DOI":"10.1109\/MILCOM.2011.6127492"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1109\/TNET.2014.2317486","volume":"23","author":"TN Dinh","year":"2014","unstructured":"Dinh, T.N., Thai, M.T.: Network under joint node and link attacks: Vulnerability assessment methods and analysis. IEEE\/ACM Trans. Networking 23(3), 1001\u20131011 (2014)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"6","key":"23_CR12","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1093\/comnet\/cny007","volume":"6","author":"M Dzaferagic","year":"2018","unstructured":"Dzaferagic, M., Kaminski, N., McBride, N., Macaluso, I., Marchetti, N.: A functional complexity framework for the analysis of telecommunication networks. J. Complex Networks 6(6), 971\u2013988 (2018)","journal-title":"J. Complex Networks"},{"key":"23_CR13","unstructured":"Ellens, W., Kooij, R.E.: Graph measures and network robustness. arXiv preprint arXiv:1311.5064 (2013)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-17458-2_15","volume-title":"Combinatorial Optimization and Applications","author":"N Fan","year":"2010","unstructured":"Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Wu, W., Daescu, O. (eds.) COCOA 2010. LNCS, vol. 6508, pp. 170\u2013183. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17458-2_15"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ejor.2021.01.030","volume":"294","author":"F Furini","year":"2021","unstructured":"Furini, F., Ljubi\u0107, I., San Segundo, P., Zhao, Y.: A branch-and-cut algorithm for the edge interdiction clique problem. Eur. J. Oper. Res. 294(1), 54\u201369 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"23_CR16","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821\u20137826 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"21","key":"23_CR17","doi-asserted-by":"publisher","first-page":"8685","DOI":"10.1073\/pnas.0701361104","volume":"104","author":"KI Goh","year":"2007","unstructured":"Goh, K.I., Cusick, M.E., Valle, D., Childs, B., Vidal, M., Barab\u00e1si, A.L.: The human disease network. Proc. Natl. Acad. Sci. 104(21), 8685\u20138690 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"S Iyer","year":"2013","unstructured":"Iyer, S., Killingback, T., Sundaram, B., Wang, Z.: Attack robustness and centrality of complex networks. PLoS ONE 8(4), e59613 (2013)","journal-title":"PLoS ONE"},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Kunegis, J.: Konect: The koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, WWW 2013, pp. 1343\u20131350. Companion, Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.01.043","volume":"210","author":"M Lalou","year":"2016","unstructured":"Lalou, M., Tahraoui, M.A., Kheddouci, H.: Component-cardinality-constrained critical node problem in graphs. Discret. Appl. Math. 210, 150\u2013163 (2016)","journal-title":"Discret. Appl. Math."},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou, M., Tahraoui, M.A., Kheddouci, H.: The critical node detection problem in networks: a survey. Comput. Sci. Rev. 28, 92\u2013117 (2018)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR23","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-91086-4_5","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2019","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 129\u2013168. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_5"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ins.2016.10.014","volume":"377","author":"M Lozano","year":"2017","unstructured":"Lozano, M., Garc\u00eda-Mart\u00ednez, C., Rodriguez, F.J., Trujillo, H.M.: Optimizing network attacks by artificial bee colony. Inf. Sci. 377, 30\u201350 (2017)","journal-title":"Inf. Sci."},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","volume":"54","author":"D Lusseau","year":"2003","unstructured":"Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behav. Ecol. Sociobiol. 54(4), 396\u2013405 (2003)","journal-title":"Behav. Ecol. Sociobiol."},{"issue":"3","key":"23_CR26","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theoret. Comput. Sci. 351(3), 394\u2013406 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-030-58115-2_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"K Michalak","year":"2020","unstructured":"Michalak, K.: Evolutionary graph-based V+E optimization for protection against epidemics. In: B\u00e4ck, T., Preuss, M., Deutz, A., Wang, H., Doerr, C., Emmerich, M., Trautmann, H. (eds.) PPSN 2020. LNCS, vol. 12270, pp. 399\u2013412. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58115-2_28"},{"issue":"5663","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1126\/science.1089167","volume":"303","author":"R Milo","year":"2004","unstructured":"Milo, R., et al.: Superfamilies of evolved and designed networks. Science 303(5663), 1538\u20131542 (2004)","journal-title":"Science"},{"issue":"3","key":"23_CR29","first-page":"1","volume":"5","author":"D Purevsuren","year":"2016","unstructured":"Purevsuren, D., Cui, G., Win, N.N.H., Wang, X.: Heuristic algorithm for identifying critical nodes in graphs. Adv. Comput. Sci. Int. J. 5(3), 1\u20134 (2016)","journal-title":"Adv. Comput. Sci. Int. J."},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Reimand, J., Tooming, L., Peterson, H., Adler, P., Vilo, J.: Graphweb: mining heterogeneous biological networks for gene modules with functional significance. Nucleic Acids Res. 36, 452\u2013459 (2008)","DOI":"10.1093\/nar\/gkn230"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"2","key":"23_CR32","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/net.20464","volume":"60","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C.: Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2), 103\u2013119 (2012)","journal-title":"Networks"},{"issue":"3","key":"23_CR33","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.disopt.2012.07.001","volume":"9","author":"S Shen","year":"2012","unstructured":"Shen, S., Smith, J.C., Goli, R.: Exact interdiction models and algorithms for disconnecting networks via node deletions. Discret. Optim. 9(3), 172\u2013188 (2012)","journal-title":"Discret. Optim."},{"key":"23_CR34","unstructured":"SocioPatterns: Infectious contact networks. http:\/\/www.sociopatterns.org\/datasets\/"},{"issue":"3","key":"23_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1140\/epjb\/e2011-10979-2","volume":"81","author":"L \u0160ubelj","year":"2011","unstructured":"\u0160ubelj, L., Bajec, M.: Robust network community detection using balanced propagation. The European Physical Journal B 81(3), 353\u2013362 (2011)","journal-title":"The European Physical Journal B"},{"issue":"1","key":"23_CR36","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/s00442-006-0553-6","volume":"151","author":"SR Sundaresan","year":"2007","unstructured":"Sundaresan, S.R., Fischhoff, I.R., Dushoff, J., Rubenstein, D.I.: Network metrics reveal differences in social organization between two fission-fusion species, grevy\u2019s zebra and onager. Oecologia 151(1), 140\u2013149 (2007)","journal-title":"Oecologia"},{"issue":"2","key":"23_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10898-015-0274-7","volume":"66","author":"Y Tang","year":"2016","unstructured":"Tang, Y., Richard, J.P.P., Smith, J.C.: A class of algorithms for mixed-integer bilevel min-max optimization. J. Global Optim. 66(2), 225\u2013262 (2016)","journal-title":"J. Global Optim."},{"issue":"11","key":"23_CR38","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca, M.: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput. Oper. Res. 39(11), 2763\u20132775 (2012)","journal-title":"Comput. Oper. Res."},{"key":"23_CR39","doi-asserted-by":"publisher","unstructured":"Wang, S., Zhang, T., Feng, C.: Nodes and links jointed critical region identification based network vulnerability assessing. In: 2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC), pp. 66\u201371 (2016). https:\/\/doi.org\/10.1109\/ICNIDC.2016.7974537","DOI":"10.1109\/ICNIDC.2016.7974537"},{"issue":"6","key":"23_CR40","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1287\/opre.12.6.934","volume":"12","author":"R Wollmer","year":"1964","unstructured":"Wollmer, R.: Removing arcs from a network. Oper. Res. 12(6), 934\u2013940 (1964)","journal-title":"Oper. Res."},{"issue":"2","key":"23_CR41","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.026111","volume":"78","author":"R Yang","year":"2008","unstructured":"Yang, R., Huang, L., Lai, Y.C.: Selectivity-based spreading dynamics on complex networks. Phys. Rev. E 78(2), 026111 (2008)","journal-title":"Phys. Rev. E"},{"issue":"4","key":"23_CR42","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33(4), 452\u2013473 (1977)","journal-title":"J. Anthropol. Res."},{"issue":"15","key":"23_CR43","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1016\/j.dam.2010.06.006","volume":"158","author":"R Zenklusen","year":"2010","unstructured":"Zenklusen, R.: Matching interdiction. Discret. Appl. Math. 158(15), 1676\u20131690 (2010)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14714-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:43:14Z","timestamp":1710261794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14714-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147135","9783031147142"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14714-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","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":"185","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":"85","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":"46% - 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.75","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":"3.11","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}