{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:48:53Z","timestamp":1743004133416,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484774"},{"type":"electronic","value":"9783030484781"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48478-1_5","type":"book-chapter","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:57:21Z","timestamp":1591059441000},"page":"68-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions"],"prefix":"10.1007","author":[{"given":"Mindaugas","family":"Bloznelis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joona","family":"Karjalainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Leskel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"key":"5_CR1","first-page":"1","volume":"18","author":"E Abbe","year":"2018","unstructured":"Abbe, E.: Community detection and stochastic block models: recent developments. J. Mach. Learn. Res. 18, 1\u201386 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"5_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/15427951.2008.10129305","volume":"5","author":"W Aiello","year":"2008","unstructured":"Aiello, W., Bonato, A., Cooper, C., Janssen, J., Pra\u0142at, P.: A spatial web graph model with local influence regions. Internet Math. 5(1\u20132), 175\u2013196 (2008)","journal-title":"Internet Math."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47\u201397 (2002). \n                  https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev. Mod. Phys."},{"issue":"12","key":"5_CR4","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1080\/02664763.2015.1043870","volume":"42","author":"IL Amerise","year":"2015","unstructured":"Amerise, I.L., Tarsitano, A.: Correction methods for ties in rank correlations. J. Appl. Stat. 42(12), 2584\u20132596 (2015). \n                  https:\/\/doi.org\/10.1080\/02664763.2015.1043870","journal-title":"J. Appl. Stat."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"056114","DOI":"10.1103\/PhysRevE.74.056114","volume":"74","author":"M \u00c1ngeles Serrano","year":"2006","unstructured":"\u00c1ngeles Serrano, M., Bogu\u00f1\u00e1, M.: Clustering in complex networks I. General formalism. Phys. Rev. E 74, 056114 (2006). \n                  https:\/\/doi.org\/10.1103\/PhysRevE.74.056114","journal-title":"Phys. Rev. E"},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1214\/13-AAP942","volume":"24","author":"FG Ball","year":"2014","unstructured":"Ball, F.G., Sirl, D.J., Trapman, P.: Epidemics on random intersection graphs. Ann. Appl. Probab. 24(3), 1081\u20131128 (2014). \n                  https:\/\/doi.org\/10.1214\/13-AAP942","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1214\/12-AAP874","volume":"23","author":"M Bloznelis","year":"2013","unstructured":"Bloznelis, M.: Degree and clustering coefficient in sparse random intersection graphs. Ann. Appl. Probab. 23(3), 1254\u20131289 (2013). \n                  https:\/\/doi.org\/10.1214\/12-AAP874","journal-title":"Ann. Appl. Probab."},{"doi-asserted-by":"crossref","unstructured":"Bloznelis, M.: Degree-degree distribution in a power law random intersection graph with clustering. Internet Math. 1\u201325 (2017)","key":"5_CR8","DOI":"10.24166\/im.03.2017"},{"issue":"38","key":"5_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1214\/EJP.v18-2277","volume":"18","author":"M Bloznelis","year":"2013","unstructured":"Bloznelis, M., Jaworski, J., Kurauskas, V.: Assortativity and clustering of sparse random intersection graphs. Electron. J. Probab. 18(38), 24 (2013). \n                  https:\/\/doi.org\/10.1214\/EJP.v18-2277","journal-title":"Electron. J. Probab."},{"unstructured":"Bloznelis, M., Leskel\u00e4, L.: Clustering and percolation on superpositions of Bernoulli random graphs (2019). \n                  https:\/\/arxiv.org\/abs\/1912.13404","key":"5_CR10"},{"issue":"3","key":"5_CR11","first-page":"1","volume":"22","author":"M Bode","year":"2015","unstructured":"Bode, M., Fountoulakis, N., M\u00fcller, T.: On the largest component of a hyperbolic model of complex networks. Electron. J. Comb. 22(3), 1\u201352 (2015)","journal-title":"Electron. J. Comb."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"036112","DOI":"10.1103\/PhysRevE.68.036112","volume":"68","author":"M Bogu\u00f1\u00e1","year":"2003","unstructured":"Bogu\u00f1\u00e1, M., Pastor-Satorras, R.: Class of correlated random networks with hidden variables. Phys. Rev. E 68, 036112 (2003). \n                  https:\/\/doi.org\/10.1103\/PhysRevE.68.036112","journal-title":"Phys. Rev. E"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/rsa.20168","volume":"31","author":"B Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algor. 31(1), 3\u2013122 (2007). \n                  https:\/\/doi.org\/10.1002\/rsa.20168","journal-title":"Random Struct. Algor."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1093\/sf\/53.2.181","volume":"53","author":"RL Breiger","year":"1974","unstructured":"Breiger, R.L.: The duality of persons and groups. Soc. Forces 53(2), 181\u2013190 (1974). \n                  https:\/\/doi.org\/10.1093\/sf\/53.2.181","journal-title":"Soc. Forces"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1239\/jap\/1222441827","volume":"45","author":"T Britton","year":"2008","unstructured":"Britton, T., Deijfen, M., Lager\u00e5s, A.N., Lindholm, M.: Epidemics on random graphs with tunable clustering. J. Appl. Probab. 45(3), 743\u2013756 (2008). \n                  https:\/\/doi.org\/10.1239\/jap\/1222441827","journal-title":"J. Appl. Probab."},{"issue":"1","key":"5_CR16","first-page":"1","volume":"24","author":"\u00c9 Czabarka","year":"2017","unstructured":"Czabarka, \u00c9., Rauh, J., Sadeghi, K., Short, T., Sz\u00e9kely, L.: On the number of non-zero elements of joint degree vectors. Electron. J. Comb. 24(1), 1\u201314 (2017)","journal-title":"Electron. J. Comb."},{"key":"5_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831","volume-title":"Introduction to Random Graphs","author":"A Frieze","year":"2015","unstructured":"Frieze, A., Karo\u0144ski, M.: Introduction to Random Graphs. Cambridge University Press, Cambridge (2015). \n                  https:\/\/doi.org\/10.1017\/CBO9781316339831"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S1571-0653(04)00377-4","volume":"10","author":"E Godehardt","year":"2001","unstructured":"Godehardt, E., Jaworski, J.: Two models of random intersection graphs and their applications. Electron. Notes Discret. Math. 10, 129\u2013132 (2001)","journal-title":"Electron. Notes Discret. Math."},{"unstructured":"Gr\u00f6hn, T., Karjalainen, J., Leskel\u00e4, L.: Clique and cycle frequencies in a sparse random graph model with overlapping communities, November 2019. \n                  https:\/\/arxiv.org\/abs\/1911.12827","key":"5_CR19"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109\u2013137 (1983). \n                  https:\/\/doi.org\/10.1016\/0378-8733(83)90021-7","journal-title":"Soc. Netw."},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1214\/16-AOP1098","volume":"45","author":"E Jacob","year":"2017","unstructured":"Jacob, E., M\u00f6rters, P.: Robustness of scale-free spatial networks. Ann. Probab. 45(3), 1680\u20131722 (2017). \n                  https:\/\/doi.org\/10.1214\/16-AOP1098","journal-title":"Ann. Probab."},{"key":"5_CR22","series-title":"Probability and Its Applications","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. APA. Springer, New York (2002). \n                  https:\/\/doi.org\/10.1007\/978-1-4757-4015-8"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-92871-5_4","volume-title":"Algorithms and Models for the Web Graph","author":"J Karjalainen","year":"2018","unstructured":"Karjalainen, J., van Leeuwaarden, J.S.H., Leskel\u00e4, L.: Parameter estimators of sparse random intersection graphs with thinned communities. In: Bonato, A., Pra\u0142at, P., Raigorodskii, A. (eds.) WAW 2018. LNCS, vol. 10836, pp. 44\u201358. Springer, Cham (2018). \n                  https:\/\/doi.org\/10.1007\/978-3-319-92871-5_4"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-67810-8_1","volume-title":"Algorithms and Models for the Web Graph","author":"J Karjalainen","year":"2017","unstructured":"Karjalainen, J., Leskel\u00e4, L.: Moment-based parameter estimation in binomial random intersection graph models. In: Bonato, A., Chung Graham, F., Pra\u0142at, P. (eds.) WAW 2017. LNCS, vol. 10519, pp. 1\u201315. Springer, Cham (2017). \n                  https:\/\/doi.org\/10.1007\/978-3-319-67810-8_1"},{"issue":"1\u20132","key":"5_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: the subgraph problem. Comb. Probab. Comput. 8(1\u20132), 131\u2013159 (1999). \n                  https:\/\/doi.org\/10.1017\/S0963548398003459","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"5_CR26","doi-asserted-by":"publisher","first-page":"2200","DOI":"10.1137\/18M121201X","volume":"33","author":"M Kiwi","year":"2019","unstructured":"Kiwi, M., Mitsche, D.: On the second largest component of random hyperbolic graphs. SIAM J. Discret. Math. 33(4), 2200\u20132217 (2019). \n                  https:\/\/doi.org\/10.1137\/18M121201X","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogu\u00f1\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"doi-asserted-by":"crossref","unstructured":"Krot, A., Prokhorenkova, L.O.: Assortativity in generalized preferential attachment models. Internet Math. 9\u201321 (2017)","key":"5_CR28","DOI":"10.1007\/978-3-319-49787-7_2"},{"issue":"284","key":"5_CR29","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1080\/01621459.1958.10501481","volume":"53","author":"WH Kruskal","year":"1958","unstructured":"Kruskal, W.H.: Ordinal measures of association. J. Am. Stat. Assoc. 53(284), 814\u2013861 (1958). \n                  http:\/\/www.jstor.org\/stable\/2281954","journal-title":"J. Am. Stat. Assoc."},{"unstructured":"Kurauskas, V.: On local weak limit and subgraph counts for sparse random graphs (2015). \n                  https:\/\/arxiv.org\/abs\/1504.08103","key":"5_CR30"},{"doi-asserted-by":"publisher","unstructured":"Mahadevan, P., Krioukov, D., Fall, K., Vahdat, A.: Systematic topology analysis and generation using degree correlations. In: Proceedings of the 2006 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM 2006, pp. 135\u2013146 (2006). \n                  https:\/\/doi.org\/10.1145\/1159913.1159930","key":"5_CR31","DOI":"10.1145\/1159913.1159930"},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0963548398003526","volume":"7","author":"M Molloy","year":"1998","unstructured":"Molloy, M., Reed, B.: The size of the giant component of a random graph with a given degree sequence. Comb. Probab. Comput. 7(3), 295\u2013305 (1998). \n                  https:\/\/doi.org\/10.1017\/S0963548398003526","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"5_CR33","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.jmva.2005.11.007","volume":"98","author":"J Ne\u0161lehov\u00e1","year":"2007","unstructured":"Ne\u0161lehov\u00e1, J.: On rank correlation measures for non-continuous random variables. J. Multivar. Anal. 98(3), 544\u2013567 (2007). \n                  https:\/\/doi.org\/10.1016\/j.jmva.2005.11.007","journal-title":"J. Multivar. Anal."},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"MEJ Newman","year":"2002","unstructured":"Newman, M.E.J.: Assortative mixing in networks. Phys. Rev. Lett. 89, 208701 (2002). \n                  https:\/\/doi.org\/10.1103\/PhysRevLett.89.208701","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003). \n                  https:\/\/doi.org\/10.1137\/S003614450342480","journal-title":"SIAM Rev."},{"unstructured":"Petti, S., Vempala, S.: Approximating sparse graphs: the random overlapping communities model (2018). \n                  https:\/\/arxiv.org\/abs\/1802.03652","key":"5_CR36"},{"unstructured":"Sadeghi, K., Rinaldo, A.: Statistical models for degree distributions of networks. In: NIPS (2014)","key":"5_CR37"},{"issue":"1","key":"5_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0149-9","volume":"4","author":"V Vadon","year":"2019","unstructured":"Vadon, V., Komj\u00e1thy, J., van der Hofstad, R.: A new model for overlapping communities with arbitrary internal structure. Appl. Netw. Sci. 4(1), 1\u201319 (2019). \n                  https:\/\/doi.org\/10.1007\/s41109-019-0149-9","journal-title":"Appl. Netw. Sci."},{"issue":"3","key":"5_CR39","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1080\/15427951.2013.850455","volume":"10","author":"R van der Hofstad","year":"2014","unstructured":"van der Hofstad, R., Litvak, N.: Degree-degree dependencies in random graphs with heavy-tailed degrees. Internet Math. 10(3), 287\u2013334 (2014). \n                  https:\/\/doi.org\/10.1080\/15427951.2013.850455","journal-title":"Internet Math."},{"issue":"4","key":"5_CR40","first-page":"427","volume":"4","author":"P van der Hoorn","year":"2014","unstructured":"van der Hoorn, P., Litvak, N.: Convergence of rank based degree-degree correlations in random directed networks. Moscow J. Comb. Num. Theory 4(4), 427\u2013465 (2014)","journal-title":"Moscow J. Comb. Num. Theory"},{"issue":"2","key":"5_CR41","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/15427951.2014.927038","volume":"11","author":"P van der Hoorn","year":"2015","unstructured":"van der Hoorn, P., Litvak, N.: Degree-degree dependencies in directed networks with heavy-tailed degrees. Internet Math. 11(2), 155\u2013179 (2015)","journal-title":"Internet Math."},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","volume":"65","author":"A V\u00e1zquez","year":"2002","unstructured":"V\u00e1zquez, A., Pastor-Satorras, R., Vespignani, A.: Large-scale topological and dynamical properties of the internet. Phys. Rev. E 65, 066130 (2002). \n                  https:\/\/doi.org\/10.1103\/PhysRevE.65.066130","journal-title":"Phys. Rev. E"},{"key":"5_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2009","unstructured":"Villani, C.: Optimal Transport: Old and New. Springer, New York (2009)"},{"doi-asserted-by":"publisher","unstructured":"Yang, J., Leskovec, J.: Structure and overlaps of ground-truth communities in networks. ACM Trans. Intell. Syst. Technol. 5(2) (2014). \n                  https:\/\/doi.org\/10.1145\/2594454","key":"5_CR44","DOI":"10.1145\/2594454"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48478-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T03:37:05Z","timestamp":1593229025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48478-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484774","9783030484781"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48478-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Models for the Web-Graph","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2020","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":"waw2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/math.ryerson.ca\/waw2020\/","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":"19","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":"12","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":"63% - 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":"2","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)"}},{"value":"The conference was postponed from June 2020 to September 2020 due to the corona pandemic.","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)"}}]}}