{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:03:54Z","timestamp":1764785034097,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031215339"},{"type":"electronic","value":"9783031215346"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T00:00:00Z","timestamp":1674000000000},"content-version":"vor","delay-in-days":382,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network models are developed and used in various fields of science as their design and analysis can improve the understanding of the numerous complex systems we can observe on an everyday basis. From an algorithmics point of view, structural insights into networks can guide the engineering of tailor-made graph algorithms required to face the <jats:italic>big data<\/jats:italic> challenge.<\/jats:p><jats:p>By design, network models describe graph classes and therefore can often provide meaningful synthetic instances whose applications include experimental case studies. While there exist public network libraries with numerous datasets, the available instances do not fully satisfy the needs of experimenters, especially pertaining to size and diversity. As several SPP 1736 projects engineered practical graph algorithms, multiple sampling algorithms for various graph models were designed and implemented to supplement experimental campaigns. In this chapter, we survey the results obtained for these so-called graph generators. <jats:italic>This chapter is partially based on<\/jats:italic> [43 SPP].<\/jats:p>","DOI":"10.1007\/978-3-031-21534-6_2","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:02:53Z","timestamp":1673985773000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generating Synthetic Graph Data from Random Network Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1197-3153","authenticated-orcid":false,"given":"Ulrich","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2630-7548","authenticated-orcid":false,"given":"Manuel","family":"Penschuck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"issue":"9","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988). https:\/\/doi.org\/10.1145\/48529.48535","journal-title":"Commun. ACM"},{"key":"2_CR2","unstructured":"Allendorf, D.: Implementation and evaluation of a uniform graph sampling algorithm for prescribed power-law degree sequences. Master\u2019s thesis. Goethe University Frankfurt, Germany (2020)"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"Arman, A., Gao, P., Wormald, N.C.: Fast uniform generation of random graphs with given degree sequences. In: FOCS, pp. 1371\u20131379. IEEE Computer Society (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00084","DOI":"10.1109\/FOCS.2019.00084"},{"issue":"5439","key":"2_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL 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","volume-title":"Network Science","author":"AL Barab\u00e1si","year":"2016","unstructured":"Barab\u00e1si, A.L., et al.: Network Science. Cambridge University Press, Cambridge (2016)"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"036113","DOI":"10.1103\/physreve.71.036113","volume":"71","author":"V Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E 71(3), 036113 (2005). https:\/\/doi.org\/10.1103\/physreve.71.036113","journal-title":"Phys. Rev. E"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Katzmann, M., Meyer, U., Penschuck, M., Weyand, C.: Efficiently generating geometric inhomogeneous and hyperbolic random graphs. In: ESA, pp. 21:1\u201321:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2019.21","DOI":"10.4230\/LIPIcs.ESA.2019.21"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511814068","DOI":"10.1017\/CBO9780511814068"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-39206-1_23","volume-title":"Automata, Languages, and Programming","author":"K Bringmann","year":"2013","unstructured":"Bringmann, K., Friedrich, T.: Exact and efficient generation of geometric random variates and random graphs. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 267\u2013278. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_23"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Keusch, R., Lengler, J.: Sampling geometric inhomogeneous random graphs in linear time. In: ESA, pp. 20:1\u201320:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2017.20","DOI":"10.4230\/LIPIcs.ESA.2017.20"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2018.08.014","volume":"760","author":"K Bringmann","year":"2019","unstructured":"Bringmann, K., Keusch, R., Lengler, J.: Geometric inhomogeneous random graphs. Theor. Comput. Sci. 760, 35\u201354 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.014","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1109\/MDAT.2017.2750900","volume":"35","author":"C Brugger","year":"2018","unstructured":"Brugger, C., et al.: A memory centric architecture of the link assessment algorithm in large graphs. IEEE Des. Test 35(1), 7\u201315 (2018). https:\/\/doi.org\/10.1109\/MDAT.2017.2750900","journal-title":"IEEE Des. Test"},{"key":"2_CR13","unstructured":"Carstens, C.J., Berger, A., Strona, G.: Curveball: a new generation of sampling algorithms for graphs with fixed degree sequence. CoRR abs\/1609.05137 (2016)"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Carstens, C.J., Hamann, M., Meyer, U., Penschuck, M., Tran, H., Wagner, D.: Parallel and I\/O-efficient randomisation of massive networks using global curveball trades. In: ESA, pp. 11:1\u201311:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.11","DOI":"10.4230\/LIPIcs.ESA.2018.11"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: a recursive model for graph mining. In: SDM, pp. 442\u2013446. SIAM (2004). https:\/\/doi.org\/10.1137\/1.9781611972740.43","DOI":"10.1137\/1.9781611972740.43"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Eggenberger, F., P\u00f3lya, G.: \u00dcber die Statistik verketteter Vorg\u00e4nge. ZAMM-J. Appl. Math. Mech.\/Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 3(4), 279\u2013289 (1923)","DOI":"10.1002\/zamm.19230030407"},{"key":"2_CR17","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Mathematicae Debrecen (1959)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.jpdc.2019.03.011","volume":"131","author":"D Funke","year":"2019","unstructured":"Funke, D., et al.: Communication-free massively distributed graph generation. J. Parallel Distrib. Comput. 131, 200\u2013217 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2019.03.011","journal-title":"J. Parallel Distrib. Comput."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Funke, D., Lamm, S., Sanders, P., Schulz, C., Strash, D., von Looz, M.: Communication-free massively distributed graph generation. In: IPDPS, pp. 336\u2013347. IEEE Computer Society (2018). https:\/\/doi.org\/10.1109\/IPDPS.2018.00043","DOI":"10.1109\/IPDPS.2018.00043"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959). https:\/\/doi.org\/10.1214\/aoms\/1177706098","journal-title":"Ann. Math. Stat."},{"key":"2_CR21","unstructured":"Gkantsidis, C., Mihail, M., Zegura, E.W.: The Markov Chain simulation method for generating connected power law random graphs. In: Workshop on Algorithm Engineering and Experiments, pp. 16\u201325. Society for Industrial and App. Math. SIAM (2003)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-642-31585-5_51","volume-title":"Automata, Languages, and Programming","author":"L Gugelmann","year":"2012","unstructured":"Gugelmann, L., Panagiotou, K., Peter, U.: Random hyperbolic graphs: degree sequence and clustering - (extended abstract). In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 573\u2013585. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_51"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. I. J. Soc. Ind. App. Math. 10(3), 496\u2013506 (1962). https:\/\/doi.org\/10.1137\/0110037","DOI":"10.1137\/0110037"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Hamann, M., Meyer, U., Penschuck, M., Tran, H., Wagner, D.: I\/O-efficient generation of massive graphs following the LFR benchmark. ACM J. Exp. Algorithmics 23, 1-33 (2018). https:\/\/doi.org\/10.1145\/3230743","DOI":"10.1145\/3230743"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Hamann, M., Meyer, U., Penschuck, M., Wagner, D.: I\/O-efficient generation of massive graphs following the LFR benchmark. In: ALENEX, pp. 58\u201372. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974768.5","DOI":"10.1137\/1.9781611974768.5"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Havel, V.: Pozn\u00e1mka o existenci kone\u010dn\u00fdch graf\u016f. \u010casopis pro p\u011bstov\u00e1n\u00ed matematiky 080(4), 477\u2013480 (1955)","DOI":"10.21136\/CPM.1955.108220"},{"issue":"4","key":"2_CR27","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/nws.2020.21","volume":"8","author":"L H\u00fcbschle-Schneider","year":"2020","unstructured":"H\u00fcbschle-Schneider, L., Sanders, P.: Linear work generation of R-MAT graphs. Netw. Sci. 8(4), 543\u2013550 (2020). https:\/\/doi.org\/10.1017\/nws.2020.21","journal-title":"Netw. Sci."},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"016118","DOI":"10.1103\/physreve.80.016118","volume":"80","author":"A Lancichinetti","year":"2009","unstructured":"Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009). https:\/\/doi.org\/10.1103\/physreve.80.016118","journal-title":"Phys. Rev. E"},{"key":"2_CR29","unstructured":"von Looz, M.: High-performance graph algorithms. Ph.D. thesis. KIT - Karlsruhe Institute of Technology (2018)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-44543-4_35","volume-title":"Combinatorial Algorithms","author":"M von Looz","year":"2016","unstructured":"von Looz, M., Meyerhenke, H.: Querying probabilistic neighborhoods in spatial data sets efficiently. In: M\u00e4kinen, V., Puglisi, S.J., Salmela, L. (eds.) IWOCA 2016. LNCS, vol. 9843, pp. 449\u2013460. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44543-4_35"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"von Looz, M., Meyerhenke, H.: Updating dynamic random hyperbolic graphs in sublinear time. ACM J. Exp. Algorithmics 23, 1\u201330 (2018). https:\/\/doi.org\/10.1145\/3195635","DOI":"10.1145\/3195635"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-662-48971-0_40","volume-title":"Algorithms and Computation","author":"M von Looz","year":"2015","unstructured":"von Looz, M., Meyerhenke, H., Prutkin, R.: Generating random hyperbolic graphs in subquadratic time. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 467\u2013478. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_40"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"von Looz, M., \u00d6zdayi, M.S., Laue, S., Meyerhenke, H.: Generating massive complex networks with hyperbolic geometry faster in practice. In: HPEC, pp. 1\u20136. IEEE (2016). https:\/\/doi.org\/10.1109\/HPEC.2016.7761644","DOI":"10.1109\/HPEC.2016.7761644"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-77004-6_14","volume-title":"Algorithms and Models for the Web-Graph","author":"M Mahdian","year":"2007","unstructured":"Mahdian, M., Xu, Y.: Stochastic kronecker graphs. In: Bonato, A., Chung, F.R.K. (eds.) WAW 2007. LNCS, vol. 4863, pp. 179\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77004-6_14"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-36574-5_3","volume-title":"Algorithms for Memory Hierarchies","author":"A Maheshwari","year":"2003","unstructured":"Maheshwari, A., Zeh, N.: A survey of techniques for designing I\/O-efficient algorithms. In: Meyer, U., Sanders, P., Sibeyn, J. (eds.) Algorithms for Memory Hierarchies. LNCS, vol. 2625, pp. 36\u201361. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36574-5_3"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"Meyer, U., Penschuck, M.: Generating massive scale-free networks under resource constraints. In: ALENEX, pp. 39\u201352. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974317.4","DOI":"10.1137\/1.9781611974317.4"},{"key":"2_CR37","unstructured":"Morton, G.M.: A comp. oriented geodetic data base and a new technique in file sequencing. Technical report. Int. Business Machines Company, New York (1966). https:\/\/domino.research.ibm.com\/library\/cyberdig.nsf\/0\/0dabf9473b9c86d48525779800566a39?OpenDocument"},{"key":"2_CR38","first-page":"45","volume":"19","author":"RC Murphy","year":"2010","unstructured":"Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the graph 500. Cray Users Group (CUG) 19, 45\u201374 (2010)","journal-title":"Cray Users Group (CUG)"},{"key":"2_CR39","doi-asserted-by":"publisher","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010). https:\/\/doi.org\/10.1093\/ACPROF:OSO\/9780199206650.001.0001","DOI":"10.1093\/ACPROF:OSO\/9780199206650.001.0001"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(026113), 1\u201316 (2004). http:\/\/link.aps.org\/abstract\/PRE\/v69\/e026113","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"2_CR41","doi-asserted-by":"publisher","unstructured":"Orenstein, J.A., Merrett, T.H.: A class of data structures for associative searching. In: PODS, pp. 181\u2013190. ACM (1984). https:\/\/doi.org\/10.1145\/588011.588037","DOI":"10.1145\/588011.588037"},{"key":"2_CR42","doi-asserted-by":"publisher","unstructured":"Penschuck, M.: Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory. In: SEA, pp. 26:1\u201326:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2017.26","DOI":"10.4230\/LIPIcs.SEA.2017.26"},{"key":"2_CR43","unstructured":"Penschuck, M.: Scalable generation of random graphs. Ph.D. thesis. Goethe University Frankfurt (2020)"},{"key":"2_CR44","unstructured":"Penschuck, M., et al.: Recent advances in scalable network generation. CoRR abs\/2003.00736 (2020)"},{"key":"2_CR45","volume-title":"The Logic of Scientific Discovery","author":"K Popper","year":"1959","unstructured":"Popper, K.: The Logic of Scientific Discovery. Hutchinson, London (1959)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Price, D.J.D.S.: Networks of scientific papers. Science 149(3683), 510\u2013515 (1965). http:\/\/www.jstor.org\/stable\/1716232","DOI":"10.1126\/science.149.3683.510"},{"key":"2_CR47","doi-asserted-by":"publisher","unstructured":"Sanders, P., Lamm, S., H\u00fcbschle-Schneider, L., Schrade, E., Dachsbacher, C.: Efficient parallel random sampling - vectorized, cache-efficient, and online. ACM Trans. Math. Softw. 44(3), 29:1\u201329:14 (2018). https:\/\/doi.org\/10.1145\/3157734","DOI":"10.1145\/3157734"},{"issue":"7","key":"2_CR48","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.ipl.2016.02.004","volume":"116","author":"P Sanders","year":"2016","unstructured":"Sanders, P., Schulz, C.: Scalable generation of scale-free graphs. Inf. Process. Lett. 116(7), 489\u2013491 (2016). https:\/\/doi.org\/10.1016\/j.ipl.2016.02.004","journal-title":"Inf. Process. Lett."},{"key":"2_CR49","doi-asserted-by":"publisher","unstructured":"Schlauch, W.E., Zweig, K.A.: Influence of the null-model on motif detection. In: IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining ASONAM, pp. 514\u2013519. Association for Computing Machinery ACM (2015). https:\/\/doi.org\/10.1145\/2808797.2809400","DOI":"10.1145\/2808797.2809400"},{"issue":"5","key":"2_CR50","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1002\/asi.4630270505","volume":"27","author":"DJ de Solla Price","year":"1976","unstructured":"de Solla Price, D.J.: A general theory of bibliometric and other cumulative advantage processes. J. Am. Soc. Inf. Sci. 27(5), 292\u2013306 (1976). https:\/\/doi.org\/10.1002\/asi.4630270505","journal-title":"J. Am. Soc. Inf. Sci."},{"issue":"1","key":"2_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-017-0054-z","volume":"2","author":"CL Staudt","year":"2017","unstructured":"Staudt, C.L., Hamann, M., Gutfraind, A., Safro, I., Meyerhenke, H.: Generating realistic scaled complex networks. Appl. Netw. Sci. 2(1), 1\u201329 (2017). https:\/\/doi.org\/10.1007\/s41109-017-0054-z","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5114","volume":"5","author":"G Strona","year":"2014","unstructured":"Strona, G., Nappo, D., Boccacci, F., Fattorini, S., San-Miguel-Ayanz, J.: A fast and unbiased procedure to randomize ecological binary matrices with fixed row and column totals. Nat. Commun. 5(1), 1\u20139 (2014). https:\/\/doi.org\/10.1038\/ncomms5114","journal-title":"Nat. Commun."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21534-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T20:03:26Z","timestamp":1673985806000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21534-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031215339","9783031215346"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21534-6_2","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":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}