{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T04:40:12Z","timestamp":1783226412349,"version":"3.54.6"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T00:00:00Z","timestamp":1628035200000},"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":["Computing"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s00607-021-00982-2","type":"journal-article","created":{"date-parts":[[2021,8,4]],"date-time":"2021-08-04T17:05:58Z","timestamp":1628096758000},"page":"2227-2249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":108,"title":["A modified DeepWalk method for link prediction in attributed social network"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4459-0703","authenticated-orcid":false,"given":"Kamal","family":"Berahmand","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elahe","family":"Nasiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehrdad","family":"Rostami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saman","family":"Forouzandeh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,4]]},"reference":[{"issue":"4","key":"982_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TCSS.2018.2879494","volume":"5","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A, Vasighi M (2018) Community detection in complex networks by detecting and expanding core nodes through extended local similarity of nodes. IEEE Trans Comput Soc Syst 5(4):1021\u20131033","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"06","key":"982_CR2","doi-asserted-by":"publisher","first-page":"1850062","DOI":"10.1142\/S0217979218500625","volume":"32","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A (2018) LP-LPA: A link influence-based label propagation algorithm for discovering community structures in networks. Int J Mod Phys B 32(06):1850062","journal-title":"Int J Mod Phys B"},{"key":"982_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.chaos.2018.03.014","volume":"110","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos Solitons Fractals 110:41\u201354","journal-title":"Chaos Solitons Fractals"},{"issue":"11","key":"982_CR4","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1007\/s00607-018-0684-8","volume":"101","author":"K Berahmand","year":"2019","unstructured":"Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101(11):1711\u20131733","journal-title":"Computing"},{"issue":"12","key":"982_CR5","doi-asserted-by":"publisher","first-page":"1850142","DOI":"10.1142\/S0217979218501424","volume":"32","author":"K Berahmand","year":"2018","unstructured":"Berahmand K, Samadi N, Sheikholeslami SM (2018) Effect of rich-club on diffusion in complex networks. Int J Mod Phys B 32(12):1850142","journal-title":"Int J Mod Phys B"},{"issue":"10","key":"982_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1140\/epjb\/e2019-100225-8","volume":"92","author":"E Nasiri","year":"2019","unstructured":"Nasiri E, Bouyer A, Nourani E (2019) A node representation learning approach for link prediction in social networks using game theory and K-core decomposition. Eur Phys J B 92(10):228","journal-title":"Eur Phys J B"},{"key":"982_CR7","doi-asserted-by":"crossref","unstructured":"Gallagher B et al (2008) Using ghost edges for classification in sparsely labeled networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1401890.1401925"},{"key":"982_CR8","doi-asserted-by":"crossref","unstructured":"Huang Z, Zeng DD (2006) A link prediction approach to anomalous email detection. In: 2006 IEEE International conference on systems, man and cybernetics. IEEE","DOI":"10.1109\/ICSMC.2006.384552"},{"issue":"3","key":"982_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1093\/bioinformatics\/bts688","volume":"29","author":"C Lei","year":"2013","unstructured":"Lei C, Ruan J (2013) A novel link prediction algorithm for reconstructing protein\u2013protein interaction networks by topological similarity. Bioinformatics 29(3):355\u2013364","journal-title":"Bioinformatics"},{"issue":"6","key":"982_CR10","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A 390(6):1150\u20131170","journal-title":"Phys A"},{"key":"982_CR11","doi-asserted-by":"crossref","unstructured":"Folino F, Pizzuti C (2012) Link prediction approaches for disease networks. In: International conference on information technology in bio-and medical informatics. Springer","DOI":"10.1007\/978-3-642-32395-9_8"},{"issue":"3","key":"982_CR12","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1007\/s11042-019-08270-0","volume":"79","author":"B Kaya","year":"2020","unstructured":"Kaya B (2020) A hotel recommendation system based on customer location: a link prediction approach. Multimed Tools Appl 79(3):1745\u20131758","journal-title":"Multimed Tools Appl"},{"key":"982_CR13","doi-asserted-by":"crossref","unstructured":"Dhannuri SP et al (2019) Privacy control in social networks by trust aware link prediction. In: 2019 6th International conference on electrical engineering, computer science and informatics (EECSI). IEEE","DOI":"10.23919\/EECSI48112.2019.8977087"},{"issue":"06","key":"982_CR14","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1142\/S012918311001549X","volume":"21","author":"Q-M Zhang","year":"2010","unstructured":"Zhang Q-M, Shang M-S, L\u00fc L (2010) Similarity-based classification in partially labeled networks. Int J Mod Phys C 21(06):813\u2013824","journal-title":"Int J Mod Phys C"},{"key":"982_CR15","first-page":"42","volume":"290","author":"M Pavlov","year":"2007","unstructured":"Pavlov M, Ichise R (2007) Finding experts by link prediction in co-authorship networks. FEWS 290:42\u201355","journal-title":"FEWS"},{"issue":"4","key":"982_CR16","doi-asserted-by":"publisher","first-page":"046132","DOI":"10.1103\/PhysRevE.64.046132","volume":"64","author":"EM Jin","year":"2001","unstructured":"Jin EM, Girvan M, Newman ME (2001) Structure of growing social networks. Phys Rev E 64(4):046132","journal-title":"Phys Rev E"},{"issue":"18","key":"982_CR17","doi-asserted-by":"publisher","first-page":"18619","DOI":"10.1007\/s11042-016-4270-9","volume":"76","author":"A Biswas","year":"2017","unstructured":"Biswas A, Biswas B (2017) Community-based link prediction. Multimed Tools Appl 76(18):18619\u201318639","journal-title":"Multimed Tools Appl"},{"key":"982_CR18","doi-asserted-by":"publisher","first-page":"124289","DOI":"10.1016\/j.physa.2020.124289","volume":"553","author":"A Kumar","year":"2020","unstructured":"Kumar A et al (2020) Link prediction techniques, applications, and performance: a survey. Phys A Stat Mech Appl 553:124289","journal-title":"Phys A Stat Mech Appl"},{"issue":"9","key":"982_CR19","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"982_CR20","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 (2018) Graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78\u201394","journal-title":"Knowl Based Syst"},{"key":"982_CR21","first-page":"1","volume":"80","author":"S Forouzandeh","year":"2020","unstructured":"Forouzandeh S, Berahmand K, Rostami M (2020) Presentation of a recommender system with ensemble learning and graph embedding: a case on MovieLens. Multimed Tools Appl 80:1\u201328","journal-title":"Multimed Tools Appl"},{"key":"982_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.08.013","author":"K Berahmand","year":"2020","unstructured":"Berahmand K et al (2020) A new attributed graph clustering by using label propagation in complex networks. J King Saud Univ Comput Inf Sci. https:\/\/doi.org\/10.1016\/j.jksuci.2020.08.013","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"2","key":"982_CR23","first-page":"9","volume":"6","author":"LM Aiello","year":"2012","unstructured":"Aiello LM et al (2012) Friendship prediction and homophily in social media. ACM Trans Web (TWEB) 6(2):9","journal-title":"ACM Trans Web (TWEB)"},{"key":"982_CR24","unstructured":"Mikolov T et al (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"issue":"1","key":"982_CR25","first-page":"1","volume":"58","author":"P Wang","year":"2015","unstructured":"Wang P et al (2015) Link prediction in social networks: the state-of-the-art. Science China Inf Sci 58(1):1\u201338","journal-title":"Science China Inf Sci"},{"issue":"4","key":"982_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3012704","volume":"49","author":"V Mart\u00ednez","year":"2016","unstructured":"Mart\u00ednez V, Berzal F, Cubero J-C (2016) A survey of link prediction in complex networks. ACM Comput Surv (CSUR) 49(4):1\u201333","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"3","key":"982_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0378-8733(03)00009-1","volume":"25","author":"LA Adamic","year":"2003","unstructured":"Adamic LA, Adar E (2003) Friends and neighbors on the web. Soc Netw 25(3):211\u2013230","journal-title":"Soc Netw"},{"issue":"1","key":"982_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"key":"982_CR29","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2002) SimRank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining","DOI":"10.1145\/775047.775126"},{"issue":"4","key":"982_CR30","doi-asserted-by":"publisher","first-page":"046122","DOI":"10.1103\/PhysRevE.80.046122","volume":"80","author":"L L\u00fc","year":"2009","unstructured":"L\u00fc L, Jin C-H, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(4):046122","journal-title":"Phys Rev E"},{"key":"982_CR31","unstructured":"Al Hasan M et al (2006) Link prediction using supervised learning. In: SDM06: workshop on link analysis, counter-terrorism and security"},{"issue":"1","key":"982_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-020-00352-3","volume":"7","author":"M Rostami","year":"2020","unstructured":"Rostami M, Berahmand K, Forouzandeh S (2020) A novel method of constrained feature selection by the measurement of pairwise constraints uncertainty. J Big Data 7(1):1\u201321","journal-title":"J Big Data"},{"issue":"2","key":"982_CR33","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1117454.1117458","volume":"7","author":"J O'Madadhain","year":"2005","unstructured":"O\u2019Madadhain J, Hutchins J, Smyth P (2005) Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explor Newsl 7(2):23\u201330","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"982_CR34","unstructured":"Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: International workshop on privacy, security, and trust in KDD. Springer, Berlin"},{"key":"982_CR35","unstructured":"Sarkar P, Moore A (2012) A tractable approach to finding closest truncated-commute-time neighbors in large graphs. arXiv preprint arXiv:1206.5259"},{"key":"982_CR36","doi-asserted-by":"crossref","unstructured":"Kashima H, Abe N (2006) A parameterized probabilistic model of network evolution for supervised link prediction. In: Sixth international conference on data mining (ICDM'06). IEEE","DOI":"10.1109\/ICDM.2006.8"},{"key":"982_CR37","doi-asserted-by":"crossref","unstructured":"Menon AK, Elkan C (2011) Link prediction via matrix factorization. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, Berlin","DOI":"10.1007\/978-3-642-23783-6_28"},{"key":"982_CR38","doi-asserted-by":"crossref","unstructured":"Ou M et al (2016) Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2939672.2939751"},{"key":"982_CR39","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2015) Grarep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management","DOI":"10.1145\/2806416.2806512"},{"key":"982_CR40","doi-asserted-by":"crossref","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining","DOI":"10.1145\/2939672.2939753"},{"key":"982_CR41","doi-asserted-by":"crossref","unstructured":"Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: AAAI","DOI":"10.1609\/aaai.v30i1.10179"},{"key":"982_CR42","doi-asserted-by":"crossref","unstructured":"Tang J et al (2015) Line: large-scale information network embedding. In: Proceedings of the 24th international conference on World Wide Web. International World Wide Web Conferences Steering Committee","DOI":"10.1145\/2736277.2741093"},{"issue":"4","key":"982_CR43","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MSP.2017.2693418","volume":"34","author":"MM Bronstein","year":"2017","unstructured":"Bronstein MM et al (2017) Geometric deep learning: going beyond euclidean data. IEEE Signal Process Mag 34(4):18\u201342","journal-title":"IEEE Signal Process Mag"},{"key":"982_CR44","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"issue":"1","key":"982_CR45","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39\u201354","journal-title":"Soc Netw"},{"issue":"3","key":"982_CR46","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F et al (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355\u2013369","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"982_CR47","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. ACM","DOI":"10.1145\/2623330.2623732"},{"key":"982_CR48","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1145\/2939672.2939754","volume":"2016","author":"A Grover","year":"2016","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. Kdd 2016:855\u2013864","journal-title":"Kdd"},{"key":"982_CR49","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 (1994) Social network analysis: methods and applications, vol 8. Cambridge University Press, Cambridge"},{"issue":"1","key":"982_CR50","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/1756-0381-1-12","volume":"1","author":"GA Pavlopoulos","year":"2008","unstructured":"Pavlopoulos GA, Wegener A-L, Schneider R (2008) A survey of visualization tools for biological network analysis. Biodata Min 1(1):12","journal-title":"Biodata Min"},{"key":"982_CR51","unstructured":"Popescul A, Ungar LH (2003) Statistical relational learning for link prediction. In: IJCAI workshop on learning statistical models from relational data. Citeseer"},{"issue":"5","key":"982_CR52","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.jocs.2014.01.003","volume":"5","author":"CA Bliss","year":"2014","unstructured":"Bliss CA et al (2014) An evolutionary algorithm approach to link prediction in dynamic social networks. J Comput Sci 5(5):750\u2013764","journal-title":"J Comput Sci"},{"key":"982_CR53","doi-asserted-by":"crossref","unstructured":"Zhu S et al (2007) Combining content and link for classification using matrix factorization. In: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval","DOI":"10.1145\/1277741.1277825"},{"key":"982_CR54","unstructured":"Yang C et al (2015) Network representation learning with rich text information. In: IJCAI"},{"key":"982_CR55","unstructured":"Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: International conference on machine learning"},{"key":"982_CR56","unstructured":"Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems"},{"key":"982_CR57","doi-asserted-by":"crossref","unstructured":"Wang S et al (2016) Paired restricted Boltzmann machine for linked data. In: Proceedings of the 25th ACM international on conference on information and knowledge management","DOI":"10.1145\/2983323.2983756"},{"key":"982_CR58","doi-asserted-by":"crossref","unstructured":"Huang X, Li J, Hu X (2017) Accelerated attributed network embedding. In: Proceedings of the 2017 SIAM international conference on data mining. SIAM","DOI":"10.1137\/1.9781611974973.71"},{"issue":"2","key":"982_CR59","doi-asserted-by":"publisher","first-page":"83","DOI":"10.25126\/jtiik.201412116","volume":"1","author":"E Faizal","year":"2014","unstructured":"Faizal E (2014) Case based reasoning diagnosis Penyakit cardiovascular dengan metode simple matching coefficient similarity. Jurnal Teknologi Informasi dan Ilmu Komputer 1(2):83\u201390","journal-title":"Jurnal Teknologi Informasi dan Ilmu Komputer"},{"issue":"3","key":"982_CR60","first-page":"93","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen P et al (2008) Collective classification in network data. AI Mag 29(3):93\u201393","journal-title":"AI Mag"},{"key":"982_CR61","doi-asserted-by":"crossref","unstructured":"Li J et al (2015) Unsupervised streaming feature selection in social media. In: Proceedings of the 24th ACM international on conference on information and knowledge management. ACM","DOI":"10.1145\/2806416.2806501"},{"key":"982_CR62","unstructured":"McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS. Citeseer"},{"key":"982_CR63","doi-asserted-by":"crossref","unstructured":"Wang X et al (2017) Community preserving network embedding. In: Thirty-first AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"982_CR64","volume-title":"Introduction to modern information retrieval","author":"GG Chowdhury","year":"2010","unstructured":"Chowdhury GG (2010) Introduction to modern information retrieval. Facet Publishing, London"},{"issue":"4","key":"982_CR65","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","volume":"71","author":"T Zhou","year":"2009","unstructured":"Zhou T, L\u00fc L, Zhang Y-C (2009) Predicting missing links via local information. Eur Phys J B 71(4):623\u2013630","journal-title":"Eur Phys J B"},{"issue":"3","key":"982_CR66","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1007601015854","volume":"42","author":"F Provost","year":"2001","unstructured":"Provost F, Fawcett T (2001) Robust classification for imprecise environments. Mach Learn 42(3):203\u2013231","journal-title":"Mach Learn"},{"issue":"Oct","key":"982_CR67","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F et al (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12(Oct):2825\u20132830","journal-title":"J Mach Learn Res"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00982-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00982-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00982-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T14:52:50Z","timestamp":1673016770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00982-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,4]]},"references-count":67,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["982"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00982-2","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,4]]},"assertion":[{"value":"10 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}