{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:53Z","timestamp":1740122393876,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T00:00:00Z","timestamp":1593734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602370","61672026"],"award-info":[{"award-number":["61602370","61672026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772411","U1736205"],"award-info":[{"award-number":["61772411","U1736205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10618-020-00699-4","type":"journal-article","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T13:06:10Z","timestamp":1593781570000},"page":"1744-1776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Credible seed identification for large-scale structural network alignment"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9539-5046","authenticated-orcid":false,"given":"Chenxu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhiyuan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Xiapu","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Qin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,3]]},"reference":[{"issue":"7","key":"699_CR1","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1093\/bioinformatics\/btt071","volume":"29","author":"AE Alada\u011f","year":"2013","unstructured":"Alada\u011f AE, Erten C (2013) Spinal: scalable protein interaction network alignment. Bioinformatics 29(7):917\u2013924","journal-title":"Bioinformatics"},{"key":"699_CR2","doi-asserted-by":"crossref","unstructured":"Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x? Anonymized social networks, hidden patterns, and structural steganography. In: International world wide web conference. ACM, pp 181\u2013190","DOI":"10.1145\/1242572.1242598"},{"issue":"1","key":"699_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2435209.2435212","volume":"7","author":"M Bayati","year":"2013","unstructured":"Bayati M, Gleich DF, Saberi A, Wang Y (2013) Message-passing algorithms for sparse network alignment. ACM TKDD 7(1):1\u201331","journal-title":"ACM TKDD"},{"key":"699_CR4","doi-asserted-by":"crossref","unstructured":"Bayati M, Gerritsen M, Gleich DF, Saberi A, Wang Y (2009) Algorithms for large, sparse network alignment problems. In: International conference on data mining (ICDM). IEEE, pp 705\u2013710","DOI":"10.1109\/ICDM.2009.135"},{"issue":"10","key":"699_CR5","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):P10008","journal-title":"J Stat Mech Theory Exp"},{"key":"699_CR6","volume-title":"Statistics for experimenters","author":"GE Box","year":"1978","unstructured":"Box GE, Hunter WG, Hunter JS et al (1978) Statistics for experimenters. Wiley, New York"},{"key":"699_CR7","doi-asserted-by":"crossref","unstructured":"Chen Z, Yu X, Song B, Gao J, Hu X, Yang WS (2017) Community-based network alignment for large attributed network. In: Conference on information and knowledge management (CIKM). ACM, pp 587\u2013596","DOI":"10.1145\/3132847.3132904"},{"key":"699_CR8","doi-asserted-by":"crossref","unstructured":"Chui H, Rangarajan A (2000) A feature registration framework using mixture models. In: IEEE workshop on mathematical methods in biomedical image analysis. IEEE, pp 190\u2013197","DOI":"10.1109\/MMBIA.2000.852377"},{"issue":"3","key":"699_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1074\/mcp.M600381-MCP200","volume":"6","author":"SR Collins","year":"2007","unstructured":"Collins SR, Kemmeren P, Zhao XC, Greenblatt JF, Spencer F, Holstege FC, Weissman JS, Krogan NJ (2007) Toward a comprehensive atlas of the physical interactome of saccharomyces cerevisiae. Mol Cell Proteom 6(3):439\u2013450","journal-title":"Mol Cell Proteom"},{"issue":"03","key":"699_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Sansone C, Vento M (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(03):265\u2013298","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"699_CR11","doi-asserted-by":"crossref","unstructured":"Du B, Tong H (2018) Fasten: fast Sylvester equation solver for graph mining. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 1339\u20131347","DOI":"10.1145\/3219819.3220002"},{"key":"699_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-72903-7_8","volume-title":"International workshop on graph-based representations in pattern recognition","author":"D Emms","year":"2007","unstructured":"Emms D, Hancock ER, Wilson RC (2007) A correspondence measure for graph matching using the discrete quantum walk. International workshop on graph-based representations in pattern recognition. Springer, Berlin, pp 81\u201391"},{"key":"699_CR13","doi-asserted-by":"crossref","unstructured":"Fabiana C, Garetto M, Leonardi E (2015) De-anonymizing scale-free social networks by percolation graph matching. In: IEEE conference on computer communications. IEEE, pp 1571\u20131579","DOI":"10.1109\/INFOCOM.2015.7218536"},{"issue":"13","key":"699_CR14","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/j.imavis.2003.09.004","volume":"21","author":"AW Fitzgibbon","year":"2003","unstructured":"Fitzgibbon AW (2003) Robust registration of 2d and 3d point sets. Image Vis Comput 21(13):1145\u20131153","journal-title":"Image Vis Comput"},{"key":"699_CR15","volume-title":"Computers and intractability","author":"MR Garey","year":"2002","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol 29. WH Freeman, New York"},{"issue":"4","key":"699_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S Gold","year":"1996","unstructured":"Gold S, Rangarajan A (1996) A graduated assignment algorithm for graph matching. IEEE Trans Pattern Anal Mach Intell 18(4):377\u2013388","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"699_CR17","unstructured":"Gold S, Lu CP, Rangarajan A, Pappu S, Mjolsness E (1995) New algorithms for 2d and 3d point matching: pose estimation and correspondence. In: Annual conference on neural information processing systems, pp 957\u2013964"},{"key":"699_CR18","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"17","key":"699_CR19","doi-asserted-by":"publisher","first-page":"i658","DOI":"10.1093\/bioinformatics\/btw447","volume":"32","author":"S Hashemifar","year":"2016","unstructured":"Hashemifar S, Ma J, Naveed H, Canzar S, Xu J (2016) Modulealign: module-based global alignment of protein-protein interaction networks. Bioinformatics 32(17):i658\u2013i664","journal-title":"Bioinformatics"},{"key":"699_CR20","unstructured":"Heimann M, Shen H, Koutra D (2018) Node representation learning for multiple networks: the case of graph alignment. arXiv preprint arXiv:1802.06257"},{"issue":"1","key":"699_CR21","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.datak.2008.06.003","volume":"67","author":"W Hu","year":"2008","unstructured":"Hu W, Qu Y, Cheng G (2008) Matching large ontologies: a divide-and-conquer approach. Data Knowl Eng 67(1):140\u2013160","journal-title":"Data Knowl Eng"},{"key":"699_CR22","doi-asserted-by":"crossref","unstructured":"Ji S, Li W, Srivatsa M, Beyah R (2014a) Structural data de-anonymization. In: ACM conference on computer and communications security (CCS). ACM, pp 1040\u20131053","DOI":"10.1145\/2660267.2660278"},{"key":"699_CR23","doi-asserted-by":"crossref","unstructured":"Ji S, Li W, Srivatsa M, He JS, Beyah R (2014b) Structure based data de-anonymization of social networks and mobility traces. In: Information security. Springer, pp 237\u2013254","DOI":"10.1007\/978-3-319-13257-0_14"},{"key":"699_CR24","unstructured":"Ji S, Li W, Mittal P, Hu X, Beyah R (2015) Secgraph: a uniform and open-source evaluation system for graph data anonymization and de-anonymization. In: USENIX security, pp 303\u2013318"},{"key":"699_CR25","doi-asserted-by":"crossref","unstructured":"Ji S, Li W, Yang S, Mittal P, Beyah R (2016) On the relative de-anonymizability of graph data: quantification and evaluation. In: IEEE conference on computer communications. IEEE, pp 1\u20139","DOI":"10.1109\/INFOCOM.2016.7524585"},{"issue":"1","key":"699_CR26","first-page":"S59","volume":"10","author":"GW Klau","year":"2009","unstructured":"Klau GW (2009) A new graph-based method for pairwise global network alignment. Bioinformatics 10(1):S59","journal-title":"Bioinformatics"},{"issue":"12","key":"699_CR27","doi-asserted-by":"publisher","first-page":"2232","DOI":"10.1109\/TKDE.2011.174","volume":"24","author":"G Kollias","year":"2012","unstructured":"Kollias G, Mohammadi S, Grama A (2012) Network similarity decomposition (nsd): a fast and scalable approach to network alignment. IEEE Trans Knowl Data Eng 24(12):2232\u20132243","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"699_CR28","doi-asserted-by":"crossref","unstructured":"Korula N, Lattanzi S (2014) An efficient reconciliation algorithm for social networks. In: International conference on very large data bases, VLDB endowment, pp 377\u2013388","DOI":"10.14778\/2732269.2732274"},{"key":"699_CR29","doi-asserted-by":"crossref","unstructured":"Koutra D, Tong H, Lubensky D (2013) Big-align: fast bipartite graph alignment. In: International conference on data mining (ICDM). IEEE, pp 389\u2013398","DOI":"10.1109\/ICDM.2013.152"},{"issue":"50","key":"699_CR30","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","volume":"7","author":"O Kuchaiev","year":"2010","unstructured":"Kuchaiev O, Milenkovi\u0107 T, Memi\u0161evi\u0107 V, Hayes W, Pr\u017eulj N (2010) Topological network alignment uncovers biological function and phylogeny. J R Soc Interface 7(50):1341\u20131354","journal-title":"J R Soc Interface"},{"key":"699_CR31","unstructured":"Leskovec J, Krevl A (2014) Snap datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data. Accessed 10 Apr 2020"},{"key":"699_CR32","unstructured":"Liu L, Cheung WK, Li X, Liao L (2016) Aligning users across social networks using network embedding. In: International joint conferences on artificial intelligence (IJCAI), pp 1774\u20131780"},{"issue":"10","key":"699_CR33","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B Luo","year":"2001","unstructured":"Luo B, Hancock ER (2001) Structural graph matching using the em algorithm and singular value decomposition. IEEE Trans Pattern Anal Mach Intell 23(10):1120\u20131136","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"13","key":"699_CR34","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1093\/bioinformatics\/btv130","volume":"31","author":"N Malod-Dognin","year":"2015","unstructured":"Malod-Dognin N, Pr\u017eulj N (2015) L-graal: Lagrangian graphlet-based network aligner. Bioinformatics 31(13):2182\u20132189","journal-title":"Bioinformatics"},{"key":"699_CR35","unstructured":"Mamano N, Hayes W (2016) Sana: simulated annealing network alignment applied to biological networks. arXiv preprint arXiv:1607.02642"},{"key":"699_CR36","doi-asserted-by":"crossref","unstructured":"Melnik S, Garcia-Molina H, Rahm E (2002) Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: International conference on data engineering, vol 2002. IEEE Computer Society, pp 117\u2013128","DOI":"10.1109\/ICDE.2002.994702"},{"issue":"12","key":"699_CR37","doi-asserted-by":"publisher","first-page":"2262","DOI":"10.1109\/TPAMI.2010.46","volume":"32","author":"A Myronenko","year":"2010","unstructured":"Myronenko A, Song X (2010) Point set registration: coherent point drift. IEEE Trans Pattern Anal Mach Intell 32(12):2262\u20132275","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"699_CR38","doi-asserted-by":"crossref","unstructured":"Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: IEEE symposium on security and privacy. IEEE, pp 173\u2013187","DOI":"10.1109\/SP.2009.22"},{"key":"699_CR39","doi-asserted-by":"crossref","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. In: International conference on very large data bases. VLDB endowment, pp 102\u2013114","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"699_CR40","doi-asserted-by":"crossref","unstructured":"Nilizadeh S, Kapadia A, Ahn YY (2014) Community-enhanced de-anonymization of online social networks. In: ACM conference on computer and communications security (CCS). ACM, pp 537\u2013548","DOI":"10.1145\/2660267.2660324"},{"key":"699_CR41","doi-asserted-by":"crossref","unstructured":"Pedarsani P, Figueiredo DR, Grossglauser M (2013) A Bayesian method for matching two similar graphs without seeds. In: Allerton. IEEE, pp 1598\u20131607","DOI":"10.1109\/Allerton.2013.6736720"},{"issue":"2","key":"699_CR42","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TC.2012.202","volume":"63","author":"W Peng","year":"2014","unstructured":"Peng W, Li F, Zou X, Wu J (2014) A two-stage deanonymization attack against anonymized social networks. IEEE Trans Comput 63(2):290\u2013303","journal-title":"IEEE Trans Comput"},{"key":"699_CR43","doi-asserted-by":"crossref","unstructured":"Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"699_CR44","unstructured":"Pfeiffer JJ, Neville J (2011) Methods to determine node centrality and clustering in graphs with uncertain structure. In: International AAAI conference on web and social media (ICWSM), pp 590\u2013593"},{"key":"699_CR45","unstructured":"Pothen A, Simon HD, Liou K (2000) Partitioning sparse matrices with eigenvectors of graphs. In: International conference on very large data bases. VLDB endowment, pp 102\u2013114"},{"key":"699_CR46","doi-asserted-by":"crossref","unstructured":"Ribeiro LF, Saverese PH, Figueiredo DR (2017) struc2vec: learning node representations from structural identity. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"699_CR47","doi-asserted-by":"crossref","unstructured":"Robles-Kelly A, Hancock ER (2003) Graph matching using spectral seriation. In: International workshop on energy minimization methods in computer vision and pattern recognition. Springer, pp 517\u2013532","DOI":"10.1007\/978-3-540-45063-4_33"},{"key":"699_CR48","doi-asserted-by":"publisher","DOI":"10.1002\/9781118631980","volume-title":"Simulation and the Monte Carlo method","author":"RY Rubinstein","year":"2016","unstructured":"Rubinstein RY, Kroese DP (2016) Simulation and the Monte Carlo method, vol 10. Wiley, New York"},{"key":"699_CR49","doi-asserted-by":"crossref","unstructured":"Rusinkiewicz S, Levoy M (2001) Efficient variants of the ICP algorithm. In: International conference on 3-D digital imaging and modeling. IEEE, pp 145\u2013152","DOI":"10.1109\/IM.2001.924423"},{"key":"699_CR50","unstructured":"Scott J (2000) Social network analysis: a handbook. In: International conference on very large data bases. VLDB endowment, pp 102\u2013114"},{"key":"699_CR51","doi-asserted-by":"crossref","unstructured":"Singh R, Xu J, Berger B (2007) Pairwise global alignment of protein interaction networks by matching neighborhood topology. In: Annual international conference on research in computational molecular biology. Springer, pp 16\u201331","DOI":"10.1007\/978-3-540-71681-5_2"},{"key":"699_CR52","doi-asserted-by":"crossref","unstructured":"Srivatsa M, Hicks M (2012) Deanonymizing mobility traces: using social network as a side-channel. In: ACM conference on computer and communications security (CCS). ACM, pp 628\u2013637","DOI":"10.1145\/2382196.2382262"},{"key":"699_CR53","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, Zhang M, Yan J, Mei Q (2015) Line: large-scale information network embedding. In: International world wide web conference. ACM, pp 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"issue":"14","key":"699_CR54","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1093\/bioinformatics\/btv161","volume":"31","author":"V Vijayan","year":"2015","unstructured":"Vijayan V, Saraph V, Milenkovi\u0107 T (2015) Magna++: maximizing accuracy in global network alignment via both node and edge conservation. Bioinformatics 31(14):2409\u20132411","journal-title":"Bioinformatics"},{"key":"699_CR55","doi-asserted-by":"crossref","unstructured":"Wang C, Zhao Z, Wang Y, Qin D, Luo X, Qin T (2018) Deepmatching: a structural seed identification framework for social network alignment. In: International conference on distributed computing systems, pp 459\u2013470","DOI":"10.1109\/ICDCS.2018.00065"},{"key":"699_CR56","doi-asserted-by":"crossref","unstructured":"Wondracek G, Holz T, Kirda E, Kruegel C (2010) A practical attack to de-anonymize social network users. In: IEEE symposium on security and privacy. IEEE, pp 223\u2013238","DOI":"10.1109\/SP.2010.21"},{"issue":"1","key":"699_CR57","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1089\/cmb.2006.0076","volume":"14","author":"Q Yang","year":"2007","unstructured":"Yang Q, Sze SH (2007) Path matching and graph matching in biological networks. J Comput Biol 14(1):56\u201367","journal-title":"J Comput Biol"},{"key":"699_CR58","doi-asserted-by":"crossref","unstructured":"Yartseva L, Grossglauser M (2013) On the performance of percolation graph matching. In: ACM conference on Online social networks. ACM, pp 119\u2013130","DOI":"10.1145\/2512938.2512952"},{"issue":"12","key":"699_CR59","doi-asserted-by":"publisher","first-page":"i259","DOI":"10.1093\/bioinformatics\/btp196","volume":"25","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy M, Bach F, Vert JP (2009) Global alignment of protein-protein interaction networks by graph matching methods. Bioinformatics 25(12):i259\u20131267","journal-title":"Bioinformatics"},{"issue":"2","key":"699_CR60","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01427149","volume":"13","author":"Z Zhang","year":"1994","unstructured":"Zhang Z (1994) Iterative point matching for registration of free-form curves and surfaces. Int J Comput Vis 13(2):119\u2013152","journal-title":"Int J Comput Vis"},{"key":"699_CR61","unstructured":"Zhang J, Philip SY (2015) Integrated anchor and social link predictions across social networks. In: Twenty-fourth international joint conference on artificial intelligence"},{"key":"699_CR62","doi-asserted-by":"crossref","unstructured":"Zhang J, Yu PS (2015) Multiple anonymized social network alignment. In: International conference on data mining (ICDM). IEEE, pp 599\u2013608","DOI":"10.1109\/ICDM.2015.114"},{"key":"699_CR63","doi-asserted-by":"crossref","unstructured":"Zhang S, Tong H (2016) Final: fast attributed network alignment. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 1345\u20131354","DOI":"10.1145\/2939672.2939766"},{"key":"699_CR64","doi-asserted-by":"crossref","unstructured":"Zhang Y, Tang J, Yang Z, Pei J, Yu PS (2015) Cosnet: connecting heterogeneous social networks with local and global consistency. In: SIGKDD conference on knowledge discovery and data mining. ACM, pp 1485\u20131494","DOI":"10.1145\/2783258.2783268"},{"key":"699_CR65","doi-asserted-by":"crossref","unstructured":"Zhang S, Tong H, Tang J, Xu J, Fan W (2017) ineat: incomplete network alignment. In: International conference on data mining (ICDM). IEEE, pp 1189\u20131194","DOI":"10.1109\/ICDM.2017.160"},{"key":"699_CR66","doi-asserted-by":"crossref","unstructured":"Zhang S, Tong H, Maciejewski R, Eliassi-Rad T (2019) Multilevel network alignment. In: International world wide web conference. ACM, pp 2344\u20132354","DOI":"10.1145\/3308558.3313484"},{"issue":"2","key":"699_CR67","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/TKDE.2015.2485222","volume":"28","author":"X Zhou","year":"2016","unstructured":"Zhou X, Liang X, Zhang H, Ma Y (2016) Cross-platform identification of anonymous identical users in multiple social media networks. IEEE Trans Knowl Data Eng 28(2):411\u2013424","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00699-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00699-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,2]],"date-time":"2021-07-02T23:22:29Z","timestamp":1625268149000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00699-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,3]]},"references-count":67,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["699"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00699-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2020,7,3]]},"assertion":[{"value":"28 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}