{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T22:45:32Z","timestamp":1779144332302,"version":"3.51.4"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T00:00:00Z","timestamp":1734480000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10618-024-01076-1","type":"journal-article","created":{"date-parts":[[2024,12,18]],"date-time":"2024-12-18T12:44:22Z","timestamp":1734525862000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Meta-path based proximity learning in heterogeneous information networks"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4218-3904","authenticated-orcid":false,"given":"Wenyi","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent W.","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangqiu","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,18]]},"reference":[{"key":"1076_CR1","doi-asserted-by":"crossref","unstructured":"Fang Y, Lin W, Zheng VW, Wu M, Chang KC-C, Li X-L (2016) Semantic proximity search on graphs with metagraph-based learning. In: 2016 IEEE 32nd International Conference on Data Engineering (ICDE), pp. 277\u2013288","DOI":"10.1109\/ICDE.2016.7498247"},{"key":"1076_CR2","doi-asserted-by":"crossref","unstructured":"Yu X, Ren X, Sun Y, Gu Q, Sturt B, Khandelwal U, Norick B, Han J (2014) Personalized entity recommendation: A heterogeneous information network approach. In: WSDM, pp. 283\u2013292","DOI":"10.1145\/2556195.2556259"},{"key":"1076_CR3","doi-asserted-by":"crossref","unstructured":"Zhao H, Yao Q, Li J, Song Y, Lee DL (2017) Meta-graph based recommendation fusion over heterogeneous information networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 635\u2013644","DOI":"10.1145\/3097983.3098063"},{"issue":"2","key":"1076_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/TKDE.2018.2833443","volume":"31","author":"C Shi","year":"2018","unstructured":"Shi C, Hu B, Zhao WX, Philip SY (2018) Heterogeneous information network embedding for recommendation. IEEE Trans Know Data Eng (TKDE) 31(2):357\u2013370","journal-title":"IEEE Trans Know Data Eng (TKDE)"},{"key":"1076_CR5","doi-asserted-by":"crossref","unstructured":"Sun Y, Norick B, Han J, Yan X, Yu PS, Yu X (2012) Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: KDD, pp. 1348\u20131356","DOI":"10.1145\/2339530.2339738"},{"key":"1076_CR6","doi-asserted-by":"crossref","unstructured":"Wang C, Song Y, Li H, Zhang M, Han J (2015) Knowsim: A document similarity measure on structured heterogeneous information networks. In: ICDM, pp. 1015\u20131020","DOI":"10.1109\/ICDM.2015.131"},{"key":"1076_CR7","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Mei Q (2015) Pte: Predictive text embedding through large-scale heterogeneous text networks. In: KDD, pp. 1165\u20131174","DOI":"10.1145\/2783258.2783307"},{"key":"1076_CR8","doi-asserted-by":"crossref","unstructured":"Wang C, Song Y, Li H, Zhang M, Han J (2016) Text classification with heterogeneous information network kernels. In: AAAI, vol. 30","DOI":"10.1609\/aaai.v30i1.10297"},{"key":"1076_CR9","doi-asserted-by":"crossref","unstructured":"Hou S, Ye Y, Song Y, Abdulhayoglu M (2017) Hindroid: An intelligent android malware detection system based on structured heterogeneous information network. In: KDD, pp. 1507\u20131515","DOI":"10.1145\/3097983.3098026"},{"key":"1076_CR10","doi-asserted-by":"crossref","unstructured":"Hosseini A, Chen T, Wu W, Sun Y, Sarrafzadeh M (2018) Heteromed: Heterogeneous information network for medical diagnosis. In: CIKM, pp. 763\u2013772","DOI":"10.1145\/3269206.3271805"},{"issue":"11","key":"1076_CR11","doi-asserted-by":"publisher","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endowment 4(11):992\u20131003","journal-title":"Proc VLDB Endowment"},{"key":"1076_CR12","doi-asserted-by":"crossref","unstructured":"Dong Y, Chawla NV, Swami A (2017) metapath2vec: Scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 135\u2013144","DOI":"10.1145\/3097983.3098036"},{"key":"1076_CR13","unstructured":"Xu K, Li J, Zhang M, Du SS, Kawarabayashi K-i, Jegelka S (2020) What can neural networks reason about? ICLR"},{"key":"1076_CR14","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: The World Wide Web Conference, pp. 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"1076_CR15","unstructured":"Battaglia PW, Hamrick JB, Bapst V, Sanchez-Gonzalez A, Zambaldi V, Malinowski M, Tacchetti A, Raposo D, Santoro A, Faulkner R, et al (2018) Relational inductive biases, deep learning, and graph networks. arXiv preprint arXiv:1806.01261"},{"key":"1076_CR16","doi-asserted-by":"crossref","unstructured":"Fan C, Zeng L, Ding Y, Chen M, Sun Y, Liu Z (2019) Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 559\u2013568","DOI":"10.1145\/3357384.3357979"},{"key":"1076_CR17","unstructured":"Veli\u010dkovi\u0107 P, Ying R, Padovano M, Hadsell R, Blundell C (2020) Neural execution of graph algorithms. In: International Conference on Learning Representations"},{"key":"1076_CR18","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008"},{"key":"1076_CR19","doi-asserted-by":"crossref","unstructured":"Xiao W, Zhao H, Zheng VW, Song Y (2021) Neural pathsim for inductive similarity search in heterogeneous information networks. In: Proceedings of the 30th ACM International Conference on Information & Knowledge Management, pp. 2201\u20132210","DOI":"10.1145\/3459637.3482454"},{"key":"1076_CR20","doi-asserted-by":"publisher","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27-30, 2016, pp. 770\u2013778. IEEE Computer Society, https:\/\/doi.org\/10.1109\/CVPR.2016.90","DOI":"10.1109\/CVPR.2016.90"},{"key":"1076_CR21","first-page":"4967","volume":"30","author":"A Santoro","year":"2017","unstructured":"Santoro A, Raposo D, Barrett DG, Malinowski M, Pascanu R, Battaglia P, Lillicrap T (2017) A simple neural network module for relational reasoning. Adv Neural Inf Process Syst 30:4967\u20134976","journal-title":"Adv Neural Inf Process Syst"},{"key":"1076_CR22","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"1076_CR23","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1076_CR24","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, pp. 1025\u20131035"},{"key":"1076_CR25","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks? In: International Conference on Learning Representations"},{"key":"1076_CR26","unstructured":"Mikolov T, Chen K, Corrado G, Dean J (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781"},{"key":"1076_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen GH, Lee JB, Rossi RA, Ahmed NK, Koh E, Kim S (2018) Continuous-time dynamic network embeddings. In: WWW, pp. 969\u2013976","DOI":"10.1145\/3184558.3191526"},{"key":"1076_CR28","doi-asserted-by":"crossref","unstructured":"Hu Z, Dong Y, Wang K, Sun Y (2020) Heterogeneous graph transformer. In: Proceedings of The Web Conference 2020, pp. 2704\u20132710","DOI":"10.1145\/3366423.3380027"},{"key":"1076_CR29","unstructured":"Brody S, Alon U, Yahav E (2022) How attentive are graph attention networks? In: International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=F72ximsx7C1"},{"key":"1076_CR30","unstructured":"Cong W, Zhang S, Kang J, Yuan B, Wu H, Zhou X, Tong H, Mahdavi M (2023) Do we really need complicated model architectures for temporal networks? In: The Eleventh International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=ayPPc0SyLv1"},{"key":"1076_CR31","unstructured":"Luo Y, Li P (2022) Neighborhood-aware scalable temporal network representation learning. Learning on Graphs Conference"},{"issue":"4","key":"1076_CR32","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2002) Cumulated gain-based evaluation of ir techniques. ACM Trans Inf Syst (TOIS) 20(4):422\u2013446","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"1076_CR33","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"1076_CR34","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: ESWC, pp. 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"1076_CR35","unstructured":"Yun S, Jeong M, Kim R, Kang J, Kim HJ (2019) Graph transformer networks. In: NeurIPS, pp. 11960\u201311970"},{"issue":"4","key":"1076_CR36","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1111\/exsy.12062","volume":"32","author":"C Moreira","year":"2015","unstructured":"Moreira C, Calado P, Martins B (2015) Learning to rank academic experts in the DBLP dataset. Expert Syst J Knowl Eng 32(4):477\u2013493. https:\/\/doi.org\/10.1111\/exsy.12062","journal-title":"Expert Syst J Knowl Eng"},{"key":"1076_CR37","doi-asserted-by":"publisher","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: extraction and mining of academic social networks. In: Li, Y., Liu, B., Sarawagi, S. (eds.) Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 990\u2013998. ACM, ???. https:\/\/doi.org\/10.1145\/1401890.1402008","DOI":"10.1145\/1401890.1402008"},{"key":"1076_CR38","unstructured":"Xu, ruan, korpeoglu, kumar, achan (2020) Inductive representation learning on temporal graphs. In: ICLR"},{"key":"1076_CR39","volume-title":"The pagerank citation ranking: Bringing order to the web","author":"L Page","year":"1999","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The pagerank citation ranking: Bringing order to the web. Stanford InfoLab, Stanford"},{"key":"1076_CR40","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 426\u2013434","DOI":"10.1145\/1401890.1401944"},{"key":"1076_CR41","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2003) Scaling personalized web search. In: Proceedings of the 12th International Conference on World Wide Web, pp. 271\u2013279","DOI":"10.1145\/775152.775191"},{"key":"1076_CR42","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, pp. 538\u2013543","DOI":"10.1145\/775047.775126"},{"key":"1076_CR43","doi-asserted-by":"crossref","unstructured":"Xu X, Yuruk N, Feng Z, Schweiger TA (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824\u2013833","DOI":"10.1145\/1281192.1281280"},{"key":"1076_CR44","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Pan J-Y (2006) Fast random walk with restart and its applications. In: Sixth International Conference on Data Mining (ICDM\u201906), pp. 613\u2013622. IEEE","DOI":"10.1109\/ICDM.2006.70"},{"issue":"3","key":"1076_CR45","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Renders J-M, Saerens M (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":"1076_CR46","doi-asserted-by":"crossref","unstructured":"Lao N, Cohen WW (2010) Fast query execution for retrieval models based on path-constrained random walks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 881\u2013888","DOI":"10.1145\/1835804.1835916"},{"issue":"1","key":"1076_CR47","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao N, Cohen WW (2010) Relational retrieval using a combination of path-constrained random walks. Mach Learn 81(1):53\u201367","journal-title":"Mach Learn"},{"key":"1076_CR48","doi-asserted-by":"crossref","unstructured":"He Y, Song Y, Li J, Ji C, Peng J, Peng H (2019) Hetespaceywalk: A heterogeneous spacey random walk for heterogeneous information network embedding. In: CIKM, pp. 639\u2013648","DOI":"10.1145\/3357384.3358061"},{"issue":"1","key":"1076_CR49","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TKDE.2016.2598561","volume":"29","author":"C Shi","year":"2016","unstructured":"Shi C, Li Y, Zhang J, Sun Y, Philip SY (2016) A survey of heterogeneous information network analysis. IEEE Trans Knowl Data Eng 29(1):17\u201337","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"10","key":"1076_CR50","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TKDE.2013.2297920","volume":"26","author":"C Shi","year":"2014","unstructured":"Shi C, Kong X, Huang Y, Philip SY, Wu B (2014) Hetesim: A general framework for relevance measure in heterogeneous networks. IEEE Trans Knowl Data Eng 26(10):2479\u20132492","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1076_CR51","doi-asserted-by":"crossref","unstructured":"Yang M, Zhou M, Kalander M, Huang Z, King I (2021) Discrete-time temporal network embedding via implicit hierarchical learning in hyperbolic space. In: SIGKDD","DOI":"10.1145\/3447548.3467422"},{"key":"1076_CR52","doi-asserted-by":"crossref","unstructured":"Sankar A, Wu Y, Gou L, Zhang W, Yang H (2020) Dysat: Deep neural representation learning on dynamic graphs via self-attention networks. In: WSDM","DOI":"10.1145\/3336191.3371845"},{"key":"1076_CR53","doi-asserted-by":"crossref","unstructured":"Chang X, Liu X, Wen J, Li S, Fang Y, Song L, Qi Y (2020) Continuous-time dynamic graph learning via neural interaction processes. In: CIKM","DOI":"10.1145\/3340531.3411946"},{"key":"1076_CR54","unstructured":"Rossi E, Chamberlain B, Frasca F, Eynard D, Monti F, Bronstein MM (2020) Temporal graph networks for deep learning on dynamic graphs. CoRR abs\/2006.10637[SPACE]arXiv: 2006.10637"},{"key":"1076_CR55","doi-asserted-by":"crossref","unstructured":"Pareja A, Domeniconi G, Chen J, Ma T, Suzumura T, Kanezashi H, Kaler T, Schardl T, Leiserson C (2020) Evolvegcn: Evolving graph convolutional networks for dynamic graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 5363\u20135370","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"1076_CR56","doi-asserted-by":"publisher","unstructured":"Manessi F, Rozza A, Manzo M (2020) Dynamic graph convolutional networks. Pattern Recognit. 97[SPACE]https:\/\/doi.org\/10.1016\/j.patcog.2019.107000","DOI":"10.1016\/j.patcog.2019.107000"},{"key":"1076_CR57","doi-asserted-by":"crossref","unstructured":"Yang L, Xiao Z, Jiang W, Wei Y, Hu Y, Wang H (2020) Dynamic heterogeneous graph embedding using hierarchical attentions. In: ECIR","DOI":"10.1007\/978-3-030-45442-5_53"},{"issue":"2","key":"1076_CR58","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/2850578.2850580","volume":"9","author":"T Hayashi","year":"2015","unstructured":"Hayashi T, Akiba T, Yoshida Y (2015) Fully dynamic betweenness centrality maintenance on massive networks. Proc VLDB Endow 9(2):48\u201359. https:\/\/doi.org\/10.14778\/2850578.2850580","journal-title":"Proc VLDB Endow"},{"key":"1076_CR59","doi-asserted-by":"publisher","unstructured":"Chehreghani MH (2021) Dynamical algorithms for data mining and machine learning over dynamic graphs. WIREs Data Mining Knowl. Discov. 11(2). https:\/\/doi.org\/10.1002\/WIDM.1393","DOI":"10.1002\/WIDM.1393"},{"key":"1076_CR60","unstructured":"Gilmer J, Schoenholz SS, Riley PF, Vinyals O, Dahl GE (2017) Neural message passing for quantum chemistry. arXiv preprint arXiv:1704.01212"},{"key":"1076_CR61","unstructured":"Li P, Wang Y, Wang H, Leskovec J (2020) Distance encoding: Design provably more powerful neural networks for graph representation learning. In: NeurIPS"},{"key":"1076_CR62","doi-asserted-by":"crossref","unstructured":"Liu X, Pan H, He M, Song Y, Jiang X, Shang L (2020) Neural subgraph isomorphism counting. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 1959\u20131969","DOI":"10.1145\/3394486.3403247"},{"key":"1076_CR63","unstructured":"Lou Z, You J, Wen C, Canedo A, Leskovec J et al (2020) Neural subgraph matching. arXiv preprint arXiv:2007.03092"},{"key":"1076_CR64","unstructured":"Zhu Z, Zhang Z, Xhonneux L-P, Tang J (2021) Neural bellman-ford networks: A general graph neural network framework for link prediction. In: Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P.S., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems, vol. 34, pp. 29476\u201329490. Curran Associates, Inc., ???. https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/f6a673f09493afcd8b129a0bcf1cd5bc-Paper.pdf"},{"key":"1076_CR65","unstructured":"Avelar PHdC (2019) Learning centrality measures with graph neural networks. LUME"},{"issue":"1","key":"1076_CR66","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1109\/TNSE.2020.3035352","volume":"8","author":"MR Mendon\u00e7a","year":"2020","unstructured":"Mendon\u00e7a MR, Barreto AM, Ziviani A (2020) Approximating network centrality measures using node embedding and machine learning. IEEE Trans Netw Sci Eng 8(1):220\u2013230","journal-title":"IEEE Trans Netw Sci Eng"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-024-01076-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T11:46:21Z","timestamp":1737027981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-024-01076-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,18]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1076"],"URL":"https:\/\/doi.org\/10.1007\/s10618-024-01076-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,18]]},"assertion":[{"value":"5 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"8"}}