{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:40:04Z","timestamp":1747262404001,"version":"3.40.5"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030766566"},{"type":"electronic","value":"9783030766573"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-76657-3_2","type":"book-chapter","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T20:02:23Z","timestamp":1621108943000},"page":"20-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Split Trees \u2013 A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0717-4671","authenticated-orcid":false,"given":"Cecilia","family":"Holmgren","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,16]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"2297","DOI":"10.1214\/13-AAP978","volume":"24","author":"L Addario-Berry","year":"2014","unstructured":"Addario-Berry, L., Broutin, N., Holmgren, C.: Cutting down trees with a Markov chainsaw. Ann. Appl. Probab. 24, 2297\u20132339 (2014)","journal-title":"Ann. Appl. Probab."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00453-019-00667-5","volume":"82","author":"M Albert","year":"2020","unstructured":"Albert, M., Holmgren, C., Johansson, T., Skerman, F.: Embedding small digraphs and permutations in binary trees and split trees. Algorithmica 82, 589\u2013615 (2020)","journal-title":"Algorithmica"},{"key":"2_CR3","volume-title":"Applied Probability and Queues","author":"S Asmussen","year":"1987","unstructured":"Asmussen, S.: Applied Probability and Queues. Wiley, Chichester (1987)"},{"issue":"5439","key":"2_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1002\/rsa.20603","volume":"48","author":"E Baur","year":"2016","unstructured":"Baur, E.: Percolation on random recursive trees. Random. Struct. Alg. 48, 655\u2013680 (2016)","journal-title":"Random. Struct. Alg."},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1239\/jap\/1378401225","volume":"50","author":"J Bertoin","year":"2013","unstructured":"Bertoin, J.: Almost giant clusters for percolation on large trees with logarithmic heights. J. Appl. Probab. 50(3), 603\u2013611 (2013)","journal-title":"J. Appl. Probab."},{"issue":"24","key":"2_CR7","first-page":"1","volume":"19","author":"J Bertoin","year":"2014","unstructured":"Bertoin, J.: On the non-Gaussian fluctuations of the giant cluster for percolation on random recursive trees. Electron. J. Probab. 19(24), 1\u201315 (2014)","journal-title":"Electron. J. Probab."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/rsa.20448","volume":"44","author":"J Bertoin","year":"2014","unstructured":"Bertoin, J.: Sizes of the largest clusters for supercritical percolation on random recursive trees. Random Struct. Algorithms 44(1), 29\u201344 (2014)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Bertoin, J., Uribe Bravo, G.: Supercritical percolation on large scale-free random trees. Ann. Appl. Probab. 25(1), 81\u2013103 (2015)","DOI":"10.1214\/13-AAP988"},{"issue":"43","key":"2_CR10","first-page":"1","volume":"20","author":"G Berzunza","year":"2015","unstructured":"Berzunza, G.: Yule processes with rare mutation and their applications to percolation on $$b$$-ary trees. Electron. J. Probab. 20(43), 1\u201323 (2015)","journal-title":"Electron. J. Probab."},{"key":"2_CR11","unstructured":"Berzunza, G., Cai, X.S., Holmgren, C.: The asymptotic non-normality of the giant cluster for percolation on random split trees. https:\/\/arxiv.org\/abs\/1902.08109 (2019)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/9486","volume":"28","author":"G Berzunza","year":"2021","unstructured":"Berzunza, G., Cai, X.S., Holmgren, C.: The $$k$$-cut model in deterministic and random trees. Electron. J. Combin. 28(1), 1\u201330 (2021)","journal-title":"Electron. J. Combin."},{"key":"2_CR13","unstructured":"Berzunza, G., Holmgren, C.: The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. https:\/\/arxiv.org\/abs\/2003.12018 (2020)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O.: Percolation. Cambridge University Press, Cambridge (2006)","DOI":"10.1017\/CBO9781139167383"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1002\/rsa.20456","volume":"41","author":"B Bollob\u00e1s","year":"2012","unstructured":"Bollob\u00e1s, B., Riordan, O.: Asymptotic normality of the size of the giant component in a random hypergraph. Random Struct. Algorithms 41(4), 441\u2013450 (2012)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Broadbent, S., Hammersley, J.: Percolation processes I. Crystals and mazes. Math. Proc. Cambridge Philos. Soc. 53(3), 629\u2013641 (1957)","DOI":"10.1017\/S0305004100032680"},{"issue":"3\u20134","key":"2_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00453-006-0112-x","volume":"46","author":"N Broutin","year":"2006","unstructured":"Broutin, N., Devroye, L.: Large deviations for the weighted height of an extended class of trees. Algorithmica 46(3\u20134), 271\u2013297 (2006)","journal-title":"Algorithmica"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00236-008-0069-0","volume":"45","author":"N Broutin","year":"2008","unstructured":"Broutin, N., Devroye, L., McLeish, E.: Weighted height of random trees. Acta Inform. 45(4), 237\u2013277 (2008)","journal-title":"Acta Inform."},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1214\/11-AAP812","volume":"22","author":"N Broutin","year":"2012","unstructured":"Broutin, N., Holmgren, C.: The total path length of split trees. Ann. Appl. Probab. 22(5), 1745\u20131777 (2012)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S0963548318000512","volume":"28","author":"XS Cai","year":"2019","unstructured":"Cai, X.S., Holmgren, C., Janson, S., Johansson, T., Skerman, F.: Inversions in split trees and conditional Galton-Watson trees. Comb. Probab. Comput. 28(3), 335\u2013364 (2019)","journal-title":"Comb. Probab. Comput."},{"issue":"53","key":"2_CR21","first-page":"1","volume":"24","author":"XS Cai","year":"2019","unstructured":"Cai, X.S., Devroye, L., Holmgren, C., Skerman, F.: $$k$$-cut on paths and some trees. Electron. J. Probab. 24(53), 1\u201322 (2019)","journal-title":"Electron. J. Probab."},{"issue":"4","key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.37236\/8350","volume":"26","author":"XS Cai","year":"2019","unstructured":"Cai, X.S., Holmgren, C.: Cutting resilient networks - complete binary trees. Electron. J. Combin. 26(4), 1\u201328 (2019)","journal-title":"Electron. J. Combin."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Dagon, D., Gu, G., Lee, C.P., Lee, W.: A taxonomy of botnet structures. In: Twenty-Third Annual Computer Security Applications Conference (ACSAC 2007), pp. 325\u2013333 (2007)","DOI":"10.1109\/ACSAC.2007.44"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L Devroye","year":"1986","unstructured":"Devroye, L.: A note on the height of binary search trees. J. Assoc. Comput. Mach. 33, 489\u2013498 (1986)","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02915448","volume":"26","author":"L Devroye","year":"1988","unstructured":"Devroye, L.: Applications of the theory of records in the study of random trees. Acta Inform. 26, 123\u2013130 (1988)","journal-title":"Acta Inform."},{"issue":"2","key":"2_CR26","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/rsa.3240010206","volume":"1","author":"L Devroye","year":"1990","unstructured":"Devroye, L.: On the height of random $$m$$-ary search trees. Random Struct. Algorithms 1(2), 191\u2013203 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-662-12788-9_7","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"L Devroye","year":"1998","unstructured":"Devroye, L.: Branching processes and their applications in the analysis of tree structures and tree algorithms. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 249\u2013314. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/978-3-662-12788-9_7"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/S0097539795283954","volume":"28","author":"L Devroye","year":"1998","unstructured":"Devroye, L.: Universal limit laws for depth in random trees. SIAM J. Comput. 28, 409\u2013432 (1998)","journal-title":"SIAM J. Comput."},{"key":"2_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random Trees","author":"M Drmota","year":"2009","unstructured":"Drmota, M.: Random Trees. Springer, Vienna (2009)"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/rsa.20233","volume":"34","author":"M Drmota","year":"2009","unstructured":"Drmota, M., Iksanov, A., Moehle, M., Roesler, U.: A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree. Random Struct. Alg. 34, 319\u2013336 (2009)","journal-title":"Random Struct. Alg."},{"key":"2_CR31","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications. Volume II, 2nd edn. Wiley, New York (1971)"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Friedkin","year":"1960","unstructured":"Friedkin, E.: Trie memory. Commun. ACM 3, 490\u2013500 (1960)","journal-title":"Commun. ACM"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1214\/EJP.v10-265","volume":"10","author":"C Goldschmidt","year":"2005","unstructured":"Goldschmidt, C., Martin, J.: Random recursive trees and the Bolthausen-Sznitman coalescent. Electron. J. Probab. 10, 718\u2013745 (2005)","journal-title":"Electron. J. Probab."},{"key":"2_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03981-6","volume-title":"Percolation","author":"G Grimmett","year":"1999","unstructured":"Grimmett, G.: Percolation, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"2_CR35","first-page":"321","volume":"4","author":"CAR Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Partition (Algorithm 63), Ouicksort (Algorithm 64), and Find (Algorithm 65). Comm. ACM 4, 321\u2013322 (1961)","journal-title":"Comm. ACM"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"CAR Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Ouicksort. Comput. J. 5, 10\u201315 (1962)","journal-title":"Comput. J."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1017\/S096354830999068X","volume":"19","author":"C Holmgren","year":"2010","unstructured":"Holmgren, C.: Random records and cuttings in binary search trees. Comb. Probab. Comput. 19, 391\u2013424 (2010)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1239\/aap\/1300198517","volume":"43","author":"C Holmgren","year":"2011","unstructured":"Holmgren, C.: A weakly 1-stable distribution for the number of random records and cuttings in split trees. Adv. in Appl. Probab. 43, 151\u2013177 (2011)","journal-title":"Adv. in Appl. Probab."},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/EJP.v17-1723","volume":"17","author":"C Holmgren","year":"2012","unstructured":"Holmgren, C.: Novel characteristics of split trees by use of renewal theory. Electron. J. Probab. 17, 1\u201327 (2012)","journal-title":"Electron. J. Probab."},{"key":"2_CR40","unstructured":"Jacquet, P., R\u00e9gnier, M.: Normal limiting distribution for the size and the external path length of tries. Technical report 827, INRIA-Rocquencourt (1988)"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Janson, S.: Random records and cuttings in complete binary trees. In: Mathematics and Computer Science III Birkh\u00e4user, Basel, pp. 241\u2013253 (2004)","DOI":"10.1007\/978-3-0348-7915-6_24"},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/rsa.20086","volume":"29","author":"S Janson","year":"2006","unstructured":"Janson, S.: Random cuttings and records in deterministic and random trees. Random Struct. Alg. 29, 139\u2013179 (2006)","journal-title":"Random Struct. Alg."},{"issue":"1","key":"2_CR43","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0963548318000226","volume":"28","author":"S Janson","year":"2019","unstructured":"Janson, S.: Random recursive trees and preferential attachment trees are random split trees. Comb. Probab. Comput. 28(1), 81\u201399 (2019)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4015-8","volume-title":"Foundations of Modern Probability","author":"O Kallenberg","year":"2002","unstructured":"Kallenberg, O.: Foundations of Modern Probability, 2nd edn. Springer, New York (2002)","edition":"2"},{"key":"2_CR45","unstructured":"Knuth, D.E.: The Art of Computer Programming. Vol. 3: Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S1446788700006698","volume":"11","author":"A Meir","year":"1970","unstructured":"Meir, A., Moon, J.W.: Cutting down random trees. J. Australian Math. Soc. 11, 313\u2013324 (1970)","journal-title":"J. Australian Math. Soc."},{"issue":"1","key":"2_CR47","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/(SICI)1098-2418(199908)15:1<25::AID-RSA2>3.0.CO;2-R","volume":"15","author":"R Neininger","year":"1999","unstructured":"Neininger, R., R\u00fcschendorf, L.: On the internal pathlength of $$d$$-dimensional quad trees. Random Struct. Alg. 15(1), 25\u201341 (1999)","journal-title":"Random Struct. Alg."},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1051\/ita\/1991250100851","volume":"25","author":"U Roesler","year":"1991","unstructured":"Roesler, U.: A limit theorem for \u201cQuicksort\u201d. RAIRO Inform. Th\u00e9or. Appl. 25, 85\u2013100 (1991)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"1\u20132","key":"2_CR49","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF02679621","volume":"29","author":"U Roesler","year":"2001","unstructured":"Roesler, U.: On the analysis of stochastic divide and conquer algorithms. Algorithmica 29(1\u20132), 238\u2013261 (2001)","journal-title":"Algorithmica"},{"issue":"91","key":"2_CR50","first-page":"1","volume":"17","author":"J Schweinsberg","year":"2012","unstructured":"Schweinsberg, J.: Dynamics of the evolving Bolthausen-Sznitman coalecent. Electron. J. Probab. 17(91), 1\u201350 (2012)","journal-title":"Electron. J. Probab."},{"issue":"4","key":"2_CR51","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1002\/rsa.20464","volume":"43","author":"TG Seierstad","year":"2013","unstructured":"Seierstad, T.G.: On the normality of giant components. Random Struct. Algorithms 43(4), 452\u2013485 (2013)","journal-title":"Random Struct. Algorithms"},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Stepanov, V.E.: Phase transitions in random graphs. Teor. Verojatnost. i Primenen. 15, 200\u2013216 (1970)","DOI":"10.1137\/1115027"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry and Mathematical Morphology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76657-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T22:02:53Z","timestamp":1747260173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76657-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030766566","9783030766573"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76657-3_2","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":"16 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DGMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discrete Geometry and Mathematical Morphology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dgmm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dgmm2021.se\/","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":"59","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":"36","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":"61% - 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":"1,3","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)"}}]}}