{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T18:44:50Z","timestamp":1771958690488,"version":"3.50.1"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T00:00:00Z","timestamp":1633564800000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s00778-021-00701-5","type":"journal-article","created":{"date-parts":[[2021,10,8]],"date-time":"2021-10-08T05:11:55Z","timestamp":1633669915000},"page":"897-925","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["General graph generators: experiments, analyses, and improvements"],"prefix":"10.1007","volume":"31","author":[{"given":"Sheng","family":"Xiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5877-7387","authenticated-orcid":false,"given":"Dawei","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengping","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"key":"701_CR1","unstructured":"Airoldi, E.M., Blei, D.M., Fienberg, S.E., et al.: Mixed membership stochastic blockmodels[J]. JMLR 1(9):1981\u20132014 (2008)"},{"key":"701_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu, L., Faloutsos, C.: RTG: a recursive realistic graph generator using random typing[J]. Data Min. Knowl. Discov. 19(2):194\u2013209 (2009)","DOI":"10.1007\/s10618-009-0140-7"},{"key":"701_CR3","doi-asserted-by":"crossref","unstructured":"Albert, R., Barab\u00e1si, A.-L.: Statistical mechanics of complex networks. Reviews of modern physics, page\u00a047, 2002","DOI":"10.1103\/RevModPhys.74.47"},{"key":"701_CR4","unstructured":"Bacciu, D., Micheli, A., Podda, M.: Graph generation by sequential edge prediction. ESANN (2019)"},{"key":"701_CR5","doi-asserted-by":"crossref","unstructured":"Bacciu, D., Micheli, A., Podda, M.: Edge-based sequential graph generation with recurrent neural networks[J]. Neurocomputing 4(16):177\u2013189 (2020)","DOI":"10.1016\/j.neucom.2019.11.112"},{"key":"701_CR6","doi-asserted-by":"crossref","unstructured":"Bagan, G., Bonifati, A., Ciucanu, R., Fletcher, G.H.L., Lemay, A., Advokaat, N.: gmark,: Schema-driven generation of graphs and queries. IEEE TKDE 856\u2013869,(2017)","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"701_CR7","doi-asserted-by":"crossref","unstructured":"Barrett, C.\u00a0L., Beckman, R.\u00a0J., Khan, M., Kumar, V.\u00a0S.\u00a0A., Marathe, M.\u00a0V., Stretz, P.\u00a0E. , Dutta, T., Lewis, B.\u00a0L.: Generation and analysis of large synthetic social contact networks. In WSC, pages 1003\u20131014. IEEE, 2009","DOI":"10.1109\/WSC.2009.5429425"},{"key":"701_CR8","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E, page 036113, 2005","DOI":"10.1103\/PhysRevE.71.036113"},{"key":"701_CR9","doi-asserted-by":"crossref","unstructured":"Blondel, V.\u00a0D., Guillaume, J.-L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory and Experiment, page P10008, 2008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"701_CR10","unstructured":"Bojchevski, A., Shchur, O., Z\u00fcgner, D., G\u00fcnnemann, S.: Netgan: Generating graphs via random walks. In: ICML, pp. 610\u2013619, 2018"},{"key":"701_CR11","doi-asserted-by":"crossref","unstructured":"Bonifati, A., Holubov\u00e1, I., Prat-P\u00e9rez, A., Sakr, S.: Graph generators: State of the art and open challenges. ACM Comput Surv 53(2):1\u201330 (2020)","DOI":"10.1145\/3379445"},{"key":"701_CR12","unstructured":"Brockschmidt, M., Allamanis, M., Gaunt, A.L., Polozov, O.: Generative code modeling with graphs. ICLR. OpenReview.net (2019)"},{"key":"701_CR13","doi-asserted-by":"crossref","unstructured":"Bu, D., Zhao, Y., Cai, L., et al.: Topological structure analysis of the protein\u2013protein interaction network in budding yeast[J]. Nucleic acids research 31(9):2443\u20132450 (2003)","DOI":"10.1093\/nar\/gkg340"},{"key":"701_CR14","doi-asserted-by":"crossref","unstructured":"Cayley. On Monge\u2019s: \u201dM\u00e9moire sur la Th\u00e9orie des D\u00e9blais et des Remblais\u201d. In: Proceedings of the London Mathematical Society, pp. 139\u2013143 (1882)","DOI":"10.1112\/plms\/s1-14.1.139"},{"key":"701_CR15","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-mat: A recursive model for graph mining. In: ICDM, 2004","DOI":"10.1137\/1.9781611972740.43"},{"issue":"1\u201327","key":"701_CR16","first-page":"27","volume":"27","author":"C Chang","year":"2011","unstructured":"Chang, C., Lin, C.: LIBSVM: A library for support vector machines. ACM Trans. Intell. Syst. Technol. 27(1\u201327), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"701_CR17","unstructured":"Chung, J., Gulcehre, C., Cho, K., Bengio, Y.: Empirical evaluation of gated recurrent neural networks on sequence modeling. NeurIPS (2014)"},{"key":"701_CR18","unstructured":"Dai, H., Nazi, A., Li, Y., Dai, B., Schuurmans, D.: Scalable deep generative modeling for sparse graphs. In ICML, pages 2302\u20132312, (2020)"},{"key":"701_CR19","doi-asserted-by":"crossref","unstructured":"Dobson, D.P., Doig, J.A.: Distinguishing enzyme structures from non-enzymes without alignments. J. Mol. Biol. 771\u2013783,(2003)","DOI":"10.1016\/S0022-2836(03)00628-4"},{"key":"701_CR20","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs i. publicationes mathematicae (debrecen). 1959"},{"key":"701_CR21","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In Advances in neural information processing systems, pages 2672\u20132680, 2014"},{"key":"701_CR22","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowledge-Based Syst. 151, 78\u201394 (2018)","journal-title":"Knowledge-Based Syst."},{"key":"701_CR23","unstructured":"Grover, A., Zweig, A., Ermon, S.: Graphite: Iterative generative modeling of graphs. In ICML, pages 2434\u20132444, 2019"},{"key":"701_CR24","unstructured":"Gulrajani, I., Ahmed, F., Arjovsky, M., Dumoulin, V., Courville, A.\u00a0C.: Improved training of wasserstein gans. In: NeurIPS, pages 5767\u20135777, 2017"},{"key":"701_CR25","unstructured":"Hagberg, A.\u00a0A., Schult, D.\u00a0A., Swart, P.\u00a0J.: Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy2008), pages 11\u201315, 2008"},{"key":"701_CR26","doi-asserted-by":"crossref","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory[J]. Neural comput. 9(8):1735\u20131780 (1992)","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"701_CR27","doi-asserted-by":"crossref","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic block models: First steps[J]. Social networks 5(2):109\u2013137 (1983)","DOI":"10.1016\/0378-8733(83)90021-7"},{"key":"701_CR28","unstructured":"Jin, W., Barzilay, R., Jaakkola, T.: Junction tree variational autoencoder for molecular graph generation. In ICML, pages 2328\u20132337, 2018"},{"key":"701_CR29","doi-asserted-by":"crossref","unstructured":"Jin, W., Barzilay, R., Jaakkola, T.: Junction tree variational autoencoder for molecular graph generation, 2019","DOI":"10.1039\/9781788016841-00228"},{"key":"701_CR30","doi-asserted-by":"crossref","unstructured":"Joshi, A.\u00a0K., Hitzler, P., Dong, G.: Linkgen: Multipurpose linked data generator. In ISWC, Lecture Notes in Computer Science, pages 113\u2013121, (2016)","DOI":"10.1007\/978-3-319-46547-0_12"},{"key":"701_CR31","doi-asserted-by":"crossref","unstructured":"Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks[J]. Physical review E 83(1):016\u2013107 (2011)","DOI":"10.1103\/PhysRevE.83.016107"},{"key":"701_CR32","unstructured":"Kingma, D.P., Welling, M.: Auto-encoding variational bayes. ICLR (2014)"},{"key":"701_CR33","unstructured":"Kipf, T.\u00a0N., Welling, M.: Semi-supervised classification with graph convolutional networks, 2016"},{"key":"701_CR34","unstructured":"Kipf, T.N., Welling, M.: Variational graph auto-encoders. NeurIPS (2016)"},{"key":"701_CR35","doi-asserted-by":"publisher","DOI":"10.1137\/130914218","volume-title":"A scalable generative graph model with community structure","author":"TG Kolda","year":"2014","unstructured":"Kolda, T.G., Pinar, A., Plantenga, T.D., Seshadhri, C.: A scalable generative graph model with community structure. SIAM J. Sci, Comput (2014)"},{"key":"701_CR36","doi-asserted-by":"crossref","unstructured":"Kullback, S., Leibler, R. A.: On information and sufficiency[J]. Ann. Math. Statist. 22(1):79\u201386 (1951)","DOI":"10.1214\/aoms\/1177729694"},{"key":"701_CR37","unstructured":"Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. JMLR 985\u20131042,(2010)"},{"key":"701_CR38","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.\u00a0M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: SIGKDD, pages 177\u2013187. ACM, (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"701_CR39","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., et al.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters[J]. Internet Math. 6(1):29\u2013123 (2009)","DOI":"10.1080\/15427951.2009.10129177"},{"key":"701_CR40","unstructured":"Li, Y., Tarlow, D., Brockschmidt, M., Zemel, R.\u00a0S.: Gated graph sequence neural networks. In Y.\u00a0Bengio and Y.\u00a0LeCun, editors, ICLR, 2016"},{"key":"701_CR41","unstructured":"Li, Y., Vinyals, O., Dyer, C., Pascanu, R., Battaglia, P.W.: Learning deep generative models of graphs. CoRR (2018)"},{"key":"701_CR42","unstructured":"Liao, R., Li, Y., Song, Y., Wang, S., Hamilton, W., Duvenaud, D.\u00a0K., Urtasun, R., Zemel, R.: Efficient graph generation with graph recurrent attention networks. In NeurIPS, pages 4255\u20134265, 2019"},{"key":"701_CR43","unstructured":"Ma, T., Chen, J., Xiao, C.: Constrained generation of semantically valid graphs via regularizing variational autoencoders. In NeurIPS, page 7113\u20137124, 2018"},{"key":"701_CR44","unstructured":"Marcelli, A., Quer, S., Squillero, G.: The maximum common subgraph problem: A portfolio approach. CoRR (2019)"},{"key":"701_CR45","doi-asserted-by":"crossref","unstructured":"McCallum, A.K., Nigam, K., Rennie, J., et al.: Automating the construction of internet portals with machine learning[J]. Inf. Retr. 3(2):127\u2013163 (2003)","DOI":"10.1023\/A:1009953814988"},{"key":"701_CR46","unstructured":"Mehta, N., Carin, L., Rai, P.: Stochastic blockmodels meet graph neural networks. In ICML, pages 4466\u20134474, 2019"},{"key":"701_CR47","doi-asserted-by":"crossref","unstructured":"Moreno, S., Neville, J., Kirshner, S.: Tied kronecker product graph models to capture variance in network populations. ACM TKDD (2018)","DOI":"10.1145\/3161885"},{"key":"701_CR48","unstructured":"Neumann, M., Moreno, P., Antanas, L., et al.: Graph kernels for object category prediction in task-dependent robot grasping[C]\/\/Online. In: Proceedings of the Eleventh Workshop on Mining and Learning with Graphs, p6 (2013)"},{"key":"701_CR49","doi-asserted-by":"crossref","unstructured":"Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., Zhang, C.: Adversarially regularized graph autoencoder for graph embedding. In IJCAI, pages 2609\u20132615, 2018","DOI":"10.24963\/ijcai.2018\/362"},{"key":"701_CR50","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: Online learning of social representations. In SIGKDD, pages 701\u2013710. ACM, 2014","DOI":"10.1145\/2623330.2623732"},{"key":"701_CR51","unstructured":"Podda, M., Bacciu, D., Micheli, A.: A deep generative model for fragment-based molecule generation[C]\/\/International Conference on Artificial Intelligence and Statistics. PMLR 2240\u20132250 (2020)"},{"key":"701_CR52","unstructured":"Rezende, D.\u00a0J., Mohamed, S., Wierstra, D.: Stochastic backpropagation and approximate inference in deep generative models. In ICML, JMLR Workshop and Conference Proceedings. JMLR.org, 2014"},{"key":"701_CR53","doi-asserted-by":"crossref","unstructured":"Robins, G., Pattison, P., Kalish, Y., Lusher, D.: An introduction to exponential random graph (p*) models for social networks. Social networks 29(2):173\u2013191 (2007)","DOI":"10.1016\/j.socnet.2006.08.002"},{"key":"701_CR54","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Davies, R., Sarkar, R., Sutton, C.: Gemsec: Graph embedding with self clustering. In: Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2019, pages 65\u201372. ACM, 2019","DOI":"10.1145\/3341161.3342890"},{"key":"701_CR55","doi-asserted-by":"crossref","unstructured":"Salha, G., Hennequin, R., Remy, J.-B., Moussallam, M., Vazirgiannis, M.: Fastgae: Scalable graph autoencoders with stochastic subgraph decoding. arXiv preprint arXiv:2002.01910, 2020","DOI":"10.1016\/j.neunet.2021.04.015"},{"key":"701_CR56","doi-asserted-by":"crossref","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 353\u2013362 (1983)","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"701_CR57","doi-asserted-by":"crossref","unstructured":"Sarkar, A., Mehta, N., Rai, P.: Graph representation learning via ladder gamma variational autoencoders[C]\/\/Proceedings of the AAAI Conference on Artificial Intelligence 34(04):5604\u20135611 (2003)","DOI":"10.1609\/aaai.v34i04.6013"},{"key":"701_CR58","doi-asserted-by":"crossref","unstructured":"Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag., pages 93\u2013106, 2008","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"701_CR59","doi-asserted-by":"crossref","unstructured":"Simonovsky, M., Komodakis, N.: Graphvae: Towards generation of small graphs using variational autoencoders. In ICANN, pages 412\u2013422, 2018","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"701_CR60","doi-asserted-by":"crossref","unstructured":"Simonovsky, M., Komodakis, N.: In: In, I.C.A.N.N. (eds) Graphvae: Towards generation of small graphs using variational autoencoders, pp. 412\u2013422. Springer (2018)","DOI":"10.1007\/978-3-030-01418-6_41"},{"key":"701_CR61","doi-asserted-by":"crossref","unstructured":"Stoyanovich, J., Howe, B., Jagadish, H.V.: Responsible data management. In: Proc. VLDB Endow. 3474\u20133488,(2020)","DOI":"10.14778\/3415478.3415570"},{"key":"701_CR62","unstructured":"Su, S., Hajimirsadeghi, H., Mori, G.: Graph generation with variational recurrent neural network. CoRR (2019)"},{"key":"701_CR63","doi-asserted-by":"crossref","unstructured":"Tai, K.S., Socher, R., Manning, C.D.: Improved semantic representations from tree-structured long short-term memory networks. In: ACL, pp. 1556\u20131566. The Association for Computer Linguistics (2015)","DOI":"10.3115\/v1\/P15-1150"},{"key":"701_CR64","unstructured":"Teh, Y.W., Gr\u00fcr, D., Ghahramani, Z.: Stick-breaking construction for the indian buffet process. In: Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, pages 556\u2013563. PMLR, 2007"},{"key":"701_CR65","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. ICLR (2018)"},{"key":"701_CR66","doi-asserted-by":"crossref","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u201dsmall-world\u201d networks (see comments). Nature, pages pp .440\u2013442 (1998)","DOI":"10.1038\/30918"},{"key":"701_CR67","unstructured":"Wu, L., Chen, Y., Shen, K., Guo, X., Gao, H., Li, S., Pei, J., Long, B.: Graph neural networks for natural language processing: A survey. CoRR (2021)"},{"key":"701_CR68","doi-asserted-by":"crossref","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE TNNLS 1\u201321,(2020)","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"701_CR69","doi-asserted-by":"crossref","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. IEEE TNNLS 1\u201321,(2020)","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"701_CR70","unstructured":"Xia, F., Sun, K., Yu, S., Aziz, A., Wan, L., Pan, S., Liu, H.: Graph learning: A survey. CoRR, abs\/2105.00696, 2021"},{"key":"701_CR71","doi-asserted-by":"crossref","unstructured":"Xiao, H., Huang, M., Zhu, X.: Transg: A generative model for knowledge graph embedding. In: ACL, The Association for Computer Linguistics (2016)","DOI":"10.18653\/v1\/P16-1219"},{"key":"701_CR72","doi-asserted-by":"crossref","unstructured":"Xie, S., Kirillov, A., Girshick, R.\u00a0B., He, K.: Exploring randomly wired neural networks for image recognition. In: ICCV, pages 1284\u20131293. IEEE, 2019","DOI":"10.1109\/ICCV.2019.00137"},{"key":"701_CR73","unstructured":"Yang, C., Zhuang, P., Shi, W., Luu, A., Li, P.: Conditional structure generation through graph variational generative adversarial nets. NeurIPS (2019)"},{"key":"701_CR74","unstructured":"You, J., Leskovec, J., He, K., Xie, S.: Graph structure of neural networks. In ICML, pages 10881\u201310891, 2020"},{"key":"701_CR75","unstructured":"You, J., Liu, B., Ying, R., Pande, V., Leskovec, J.: In: NeurIPS, In., page, (eds.) Graph convolutional policy network for goal-directed molecular graph generation. Curran Associates Inc, pp. 6412\u20136422(2018)"},{"key":"701_CR76","unstructured":"You, J., Wu, H., Barrett, C.\u00a0W., Ramanujan, R., Leskovec, J.: G2SAT: learning to generate SAT formulas. In NeurIPS, pages 10552\u201310563, 2019"},{"key":"701_CR77","unstructured":"You, J., Ying, R., Ren, X., Hamilton, W., Leskovec, J.: Graphrnn: Generating realistic graphs with deep auto-regressive models. In ICML, pages 5694\u20135703, 2018"},{"key":"701_CR78","unstructured":"Zhang, Z., Cui, P., Zhu, W.: Deep learning on graphs: a survey. IEEE TKDE, (2020)"},{"key":"701_CR79","unstructured":"Zhao, L., Akoglu, L.: Pairnorm: Tackling oversmoothing in gnns. ICLR (2020)"},{"key":"701_CR80","doi-asserted-by":"crossref","unstructured":"Zhou, D., Zheng, L., Han, J., He, J.: A data-driven graph generative model for temporal interaction networks. In SIGKDD, pages 401\u2013411. ACM, 2020","DOI":"10.1145\/3394486.3403082"},{"key":"701_CR81","doi-asserted-by":"crossref","unstructured":"Zhou, D., Zheng, L., Han, J., He, J.: A data-driven graph generative model for temporal interaction networks. In: SIGKDD, page 401\u2013411, 2020","DOI":"10.1145\/3394486.3403082"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00701-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T06:06:37Z","timestamp":1661666797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00701-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,7]]},"references-count":81,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00701-5","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,7]]},"assertion":[{"value":"21 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2021","order":5,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":6,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The original version was revised due to update in sixth author affiliation.","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}