{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:19:07Z","timestamp":1763018347476,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:00:00Z","timestamp":1614038400000},"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":[[2021,5]]},"DOI":"10.1007\/s00778-021-00654-9","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T00:10:43Z","timestamp":1614039043000},"page":"471-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient structural node similarity computation on billion-scale graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Xiaoshuang","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5443-4435","authenticated-orcid":false,"given":"Longbin","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Qin","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,2,23]]},"reference":[{"key":"654_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Shervashidze, N., Narayanamurthy, S.M.,\u00a0Josifovski, V., Smola, A.J.: Distributed large-scale natural graph factorization. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 37\u201348 (2013)","DOI":"10.1145\/2488388.2488393"},{"issue":"1","key":"654_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.14778\/1453856.1453903","volume":"1","author":"I Antonellis","year":"2008","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.: Simrank++: query rewriting through link analysis of the click graph. Proc. VLDB Endow. 1(1), 408\u2013421 (2008)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"654_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475\u2013493 (1983)","journal-title":"Networks"},{"key":"654_CR4","doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Advances in Neural Information Processing Systems, NIPS, pp. 585\u2013591 (2001)","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"654_CR5","unstructured":"BlogCatalog. https:\/\/github.com\/quark0\/TAE\/tree\/master\/data\/BlogCatalog-dataset"},{"key":"654_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P.,\u00a0Vigna, S.: The webgraph framework I: compression techniques. In: Proceedings of the 13th International Conference on World Wide Web, pp. 595\u2013602 (2004)","DOI":"10.1145\/988672.988752"},{"key":"654_CR7","doi-asserted-by":"crossref","unstructured":"Cao, S.,\u00a0Lu, W.,\u00a0Xu, Q.: Grarep: Learning graph representations with global structural information. In: Proceedings of the 24th ACM International Conference on Information and Knowledge Management, pp. 891\u2013900 (2015)","DOI":"10.1145\/2806416.2806512"},{"key":"654_CR8","doi-asserted-by":"crossref","unstructured":"Cao, S., Lu, W., Xu, Q.: Deep neural networks for learning graph representations. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 1145\u20131152 (2016)","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"654_CR9","unstructured":"Chamberlain, B.P., Clough, J.R., Deisenroth, M.P.: Neural embeddings of graphs in hyperbolic space. CoRR, abs\/1705.10359 (2017)"},{"key":"654_CR10","doi-asserted-by":"crossref","unstructured":"Chen, X., Lai, L.,\u00a0Qin, L., Lin,X.: Structsim: querying structural node similarity at billion scale. In: 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, TX, USA, April 20\u201324, 2020, pp. 1950\u20131953 (2020)","DOI":"10.1109\/ICDE48307.2020.00211"},{"key":"654_CR11","doi-asserted-by":"crossref","unstructured":"Conte, A.,\u00a0Ferraro, G., Grossi, R.,\u00a0Marino, A., Sadakane, K., Uno, T.: Node similarity with q-grams for real-world labeled networks. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1282\u20131291 (2018)","DOI":"10.1145\/3219819.3220085"},{"issue":"10","key":"654_CR12","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1093\/bioinformatics\/btv026","volume":"31","author":"D Davis","year":"2015","unstructured":"Davis, D., Yavero\u011flu, \u00d6.N., Malod-Dognin, N., Stojmirovic, A., Pr\u017eulj, N.: Topology-function conservation in protein\u2013protein interaction networks. Bioinformatics 31(10), 1632\u20131639 (2015)","journal-title":"Bioinformatics"},{"key":"654_CR13","unstructured":"Distinguishability, C.: A theoretical analysis of normalized discounted cumulative gain (ndcg) ranking measures"},{"key":"654_CR14","doi-asserted-by":"crossref","unstructured":"Donnat, C., Zitnik, M., Hallac, D., Leskovec,J.: Learning structural node embeddings via diffusion wavelets. I:n Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1320\u20131329 (2018)","DOI":"10.1145\/3219819.3220025"},{"issue":"2","key":"654_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"654_CR16","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: Proceedings of the 14th International Conference on World Wide Web, pp. 641\u2013650 (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"654_CR17","doi-asserted-by":"crossref","unstructured":"Fujiwara, Y., Nakatsuji, M., Shiokawa, H.,\u00a0Onizuka, M.: Efficient search algorithm for simrank. In: 29th IEEE International Conference on Data Engineering, pp. 589\u2013600 (2013)","DOI":"10.1109\/ICDE.2013.6544858"},{"key":"654_CR18","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"issue":"3","key":"654_CR19","first-page":"52","volume":"40","author":"WL Hamilton","year":"2017","unstructured":"Hamilton, W.L., Ying, R., Leskovec, J.: Representation learning on graphs: methods and applications. IEEE Data Eng. Bull. 40(3), 52\u201374 (2017)","journal-title":"IEEE Data Eng. Bull."},{"key":"654_CR20","doi-asserted-by":"crossref","unstructured":"Henderson, K., Gallagher, B.,\u00a0Eliassi-Rad, T., Tong, H.,\u00a0Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., Li, L.: Rolx: structural role extraction & mining in large graphs. In: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1231\u20131239 (2012)","DOI":"10.1145\/2339530.2339723"},{"key":"654_CR21","doi-asserted-by":"crossref","unstructured":"Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., Faloutsos, C.: It\u2019s who you know: graph mining using recursive structural features. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 663\u2013671 (2011)","DOI":"10.1145\/2020408.2020512"},{"key":"654_CR22","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"654_CR23","doi-asserted-by":"crossref","unstructured":"Jin, R., Lee, V.E., Hong, H. Axiomatic ranking of network role similarity. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 922\u2013930 (2011)","DOI":"10.1145\/2020408.2020561"},{"issue":"1","key":"654_CR24","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/2518176","volume":"8","author":"R Jin","year":"2014","unstructured":"Jin, R., Lee, V.E., Li, L.: Scalable and axiomatic ranking of network role similarity. ACM Trans. Knowl. Discov. Data 8(1), 3:1\u20133:37 (2014)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"5","key":"654_CR25","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM 46(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"key":"654_CR26","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. In: 50 Years of Integer Programming 1958-2008, pp. 29\u201347 (2010)","DOI":"10.1007\/978-3-540-68279-0_2"},{"key":"654_CR27","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T.,\u00a0Kawarabayashi, K.: Scalable similarity search for simrank. In: Proceedings of the 2014 International Conference on Management of Data, pp. 325\u2013336 (2014)","DOI":"10.1145\/2588555.2610526"},{"issue":"2","key":"654_CR28","doi-asserted-by":"publisher","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht, E.A., Holme, P., Newman, M.E.: Vertex similarity in networks. Phys. Rev. E 73(2), 026120 (2006)","journal-title":"Phys. Rev. E"},{"key":"654_CR29","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"654_CR30","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of simrank for static and dynamic information networks. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 465\u2013476 (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"654_CR31","doi-asserted-by":"crossref","unstructured":"Lin, X., Yuan, Y., Zhang, Q.,\u00a0Zhang, Y. Selecting stars: the k most representative skyline operator. In: Proceedings of the 23rd International Conference on Data Engineering, pp. 86\u201395 (2007)","DOI":"10.1109\/ICDE.2007.367854"},{"key":"654_CR32","doi-asserted-by":"crossref","unstructured":"Lin, Z., Lyu, M.\u00a0R., King, I.: Matchsim: a novel neighbor-based similarity measure with maximum neighborhood matching. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 1613\u20131616 (2009)","DOI":"10.1145\/1645953.1646185"},{"key":"654_CR33","doi-asserted-by":"publisher","first-page":"36420","DOI":"10.1109\/ACCESS.2018.2832185","volume":"6","author":"D Liu","year":"2018","unstructured":"Liu, D., Huang, J., Lin, C.: Recommendation with social roles. IEEE Access 6, 36420\u201336427 (2018)","journal-title":"IEEE Access"},{"issue":"1","key":"654_CR34","doi-asserted-by":"publisher","first-page":"14","DOI":"10.14778\/3151113.3151115","volume":"11","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Zheng, B., He, X., Wei, Z., Xiao, X., Zheng, K., Lu, J.: Probesim: scalable single-source and top-k simrank computations on dynamic graphs. Proc. VLDB Endow. 11(1), 14\u201326 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"654_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. J. Math. Sociol. 1(1), 49\u201380 (1971)","journal-title":"J. Math. Sociol."},{"key":"654_CR36","doi-asserted-by":"crossref","unstructured":"Lyu, T., Zhang, Y., Zhang, Y.: Enhancing the network embedding quality with structural similarity. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 147\u2013156 (2017)","DOI":"10.1145\/3132847.3132900"},{"key":"654_CR37","doi-asserted-by":"crossref","unstructured":"Optimization and approximation in deterministic sequencing and scheduling: a survey. Volume\u00a05 of Annals of Discrete Mathematics, pp. 287\u2013326 (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"654_CR38","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W.: Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1105\u20131114 (2016)","DOI":"10.1145\/2939672.2939751"},{"key":"654_CR39","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"654_CR40","unstructured":"Perozzi, B., Kulkarni, V., Skiena, S.: Walklets: multiscale graph embeddings for interpretable network classification. CoRR, abs\/1605.02115 (2016)"},{"key":"654_CR41","doi-asserted-by":"crossref","unstructured":"Ribeiro, L.F., Saverese, P.H., Figueiredo, D.R.: struc2vec: learning node representations from structural identity. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 385\u2013394 (2017)","DOI":"10.1145\/3097983.3098061"},{"key":"654_CR42","unstructured":"Rosenberg, A., Hirschberg, J.: V-measure: a conditional entropy-based external cluster evaluation measure. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 410\u2013420 (2007)"},{"key":"654_CR43","doi-asserted-by":"crossref","unstructured":"Rossi, R.\u00a0A., Gallagher, B., Neville, J., Henderson, K.: Modeling dynamic behavior in large evolving graphs. In: Sixth ACM International Conference on Web Search and Data Mining, pp. 667\u2013676 (2013)","DOI":"10.1145\/2433396.2433479"},{"issue":"1","key":"654_CR44","doi-asserted-by":"publisher","first-page":"015101","DOI":"10.1103\/PhysRevE.68.015101","volume":"68","author":"MA Serrano","year":"2003","unstructured":"Serrano, M.A., Bogun\u00e1, M.: Topology of the world trade web. Phys. Rev. E 68(1), 015101 (2003)","journal-title":"Phys. Rev. E"},{"key":"654_CR45","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"654_CR46","doi-asserted-by":"crossref","unstructured":"Tang, J.,\u00a0Qu, M., Wang, M., Zhang, M., Yan, , Mei, Q.: LINE: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"654_CR47","doi-asserted-by":"crossref","unstructured":"Tian, B., Xiao, X.: SLING: a near-optimal index structure for simrank. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1859\u20131874 (2016)","DOI":"10.1145\/2882903.2915243"},{"key":"654_CR48","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1225\u20131234 (2016)","DOI":"10.1145\/2939672.2939753"},{"key":"654_CR49","doi-asserted-by":"crossref","unstructured":"Wang, X., Tang, L., Gao, H., Liu, H.: Discovering overlapping groups in social media. In: 2010 IEEE International Conference on Data Mining. IEEE, pp. 569\u2013578 (2010)","DOI":"10.1109\/ICDM.2010.48"},{"key":"654_CR50","doi-asserted-by":"crossref","unstructured":"Wang, Y., Lian, X., Chen, L.: Efficient simrank tracking in dynamic graphs. In: 2018 IEEE 34th International Conference on Data Engineering, pp. 545\u2013556 (2018)","DOI":"10.1109\/ICDE.2018.00056"},{"key":"654_CR51","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)"},{"key":"654_CR52","unstructured":"Yu, W.,\u00a0Lin, X., Zhang, W.: Towards efficient simrank computation on large networks. In: 29th IEEE International Conference on Data Engineering, pp. 601\u2013612 (2013)"},{"issue":"1","key":"654_CR53","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2732219.2732221","volume":"7","author":"W Yu","year":"2013","unstructured":"Yu, W., Lin, X., Zhang, W., Chang, L., Pei, J.: More is simpler: effectively and efficiently assessing node-pair similarities based on hyperlinks. Proc. VLDB Endow. 7(1), 13\u201324 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"654_CR54","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00778-018-0536-3","volume":"28","author":"W Yu","year":"2019","unstructured":"Yu, W., Lin, X., Zhang, W., Pei, J., McCann, J.A.: Simrank: effective and scalable pairwise similarity search based on graph topology. VLDB J. 28(3), 401\u2013426 (2019)","journal-title":"VLDB J."},{"issue":"5","key":"654_CR55","doi-asserted-by":"publisher","first-page":"569","DOI":"10.14778\/2735479.2735489","volume":"8","author":"W Yu","year":"2015","unstructured":"Yu, W., McCann, J.A.: Efficient partial-pairs simrank search for large networks. Proc. VLDB Endow. 8(5), 569\u2013580 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"654_CR56","doi-asserted-by":"crossref","unstructured":"Yu, W., McCann, J.A.: High quality graph-based similarity search. In: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 83\u201392 (2015)","DOI":"10.1145\/2766462.2767720"},{"issue":"3","key":"654_CR57","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inf. Process. Lett. 42(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."},{"key":"654_CR58","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 553\u2013562 (2009)","DOI":"10.1145\/1645953.1646025"},{"issue":"7","key":"654_CR59","doi-asserted-by":"publisher","first-page":"493","DOI":"10.14778\/2536349.2536350","volume":"6","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Zou, L., Feng, Y., Chen, L., Zhao, D.: Efficient simrank-based similarity join over large graphs. Proc. VLDB Endow. 6(7), 493\u2013504 (2013)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"654_CR60","doi-asserted-by":"publisher","first-page":"697","DOI":"10.14778\/3055330.3055336","volume":"10","author":"H Zhu","year":"2017","unstructured":"Zhu, H., Meng, X., Kollios, G.: NED: an inter-graph node metric based on edit distance. Proc. VLDB Endow. 10(6), 697\u2013708 (2017)","journal-title":"Proc. VLDB Endow."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00654-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00654-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00654-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T17:44:00Z","timestamp":1724521440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00654-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,23]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["654"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00654-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2021,2,23]]},"assertion":[{"value":"23 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}