{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:26:51Z","timestamp":1778167611559,"version":"3.51.4"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:00:00Z","timestamp":1753920000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In Social Network Analysis (SNA), the application of Directed Acyclic Graphs (DAGs) provides unique opportunities to explore structures where relationships have direction and do not form cycles, such as citation networks and organizational hierarchies. Recently, the gravitational model has gained recognition as an effective method for identifying influential spreaders within complex networks, a problem of relevance in SNA. While there have been numerous investigations into the gravitational model in undirected and cyclic graphs, the unique challenges and dynamics associated with DAGs have yet to be fully explored. In this study, we conduct a comprehensive analysis of the gravitational model for ranking nodes in DAGs. First, we introduce an efficient linear-time algorithm specifically designed to compute the gravitational index of nodes in large-scale DAGs. Next, using thousands of synthetic and empirical DAGs, we compare the impact of the gravitational index on the accuracy and resolution of node rankings across different mass indexes. We then examine how DAG structural properties influence the monotonicity of node rankings, with a particular focus on the k-shell index. We find that, in DAGs, the gravitational formula effectively enhances the monotonicity of k-shell centrality, though it is less effective for other types of centrality indexes. We also find that smaller, shorter, and highly centralized DAGs exhibit low ranking resolution across all centrality indexes examined in this study, including the gravity-based ones. Despite this challenge, our results demonstrate that the application of gravity-based models improves the ranking accuracy of several centrality measures across most of the studied DAG datasets.<\/jats:p>","DOI":"10.1007\/s13278-025-01500-4","type":"journal-article","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T13:11:28Z","timestamp":1753967488000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring the gravitational model for ranking influential nodes in directed acyclic networks"],"prefix":"10.1007","volume":"15","author":[{"given":"Alberto","family":"Garcia-Robledo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahboobeh","family":"Zangiabady","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jotte","family":"Sonneveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,31]]},"reference":[{"issue":"12","key":"1500_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"TL Adam","year":"1974","unstructured":"Adam TL, Chandy KM, Dickson J (1974) A comparison of list schedules for parallel processing systems. Commun ACM 17(12):685\u2013690","journal-title":"Commun ACM"},{"key":"1500_CR2","doi-asserted-by":"crossref","unstructured":"Ahn Y-Y, Han S, Kwak H, Moon S, Jeong H (2007) Analysis of topological characteristics of huge online social networking services. In: Proceedings of the 16th international conference on world wide web, pp 835\u2013844","DOI":"10.1145\/1242572.1242685"},{"issue":"2","key":"1500_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho AV, Garey MR, Ullman JD (1972) The transitive reduction of a directed graph. SIAM J Comput 1(2):131\u2013137","journal-title":"SIAM J Comput"},{"key":"1500_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","volume":"395","author":"J Bae","year":"2014","unstructured":"Bae J, Kim S (2014) Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Phys A 395:549\u2013559","journal-title":"Phys A"},{"key":"1500_CR5","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"},{"key":"1500_CR6","unstructured":"Berahmand K, Saberi-Movahed F, Sheikhpour R, Li Y, Jalili M (2025) A comprehensive survey on spectral clustering with graph structure learning. arXiv preprint arXiv:2501.13597"},{"key":"1500_CR7","doi-asserted-by":"crossref","unstructured":"Bing W, Wei D, Zhu Z (2024) Identifying influential nodes in complex networks based on multi-order neighbor propagation probability metric and gravity centrality. In: SSRN. 31 pages. Available online at SSRN: https:\/\/ssrn.com\/abstract=4970734 or http:\/\/dx.doi.org\/10.2139\/ssrn.4970734. Accessed 12 Mar 2025","DOI":"10.2139\/ssrn.4970734"},{"key":"1500_CR8","unstructured":"CAIDA (2025) Caida as rank, customer cone. Online. (n.d. Available: https:\/\/asrank.caida.org\/about#customer-cone. Accessed: 12-Mar-2025)"},{"key":"1500_CR9","unstructured":"Canon L-C, Sayah ME, H\u00e9am P-C (2019a) Code to compare random task graph generation methods. Figshare. https:\/\/figshare.com\/articles\/dataset\/Code_to_compare_random_task_graph_generation_methods\/7725545?file=14380010. (Accessed: 12-Mar-2025)"},{"key":"1500_CR10","doi-asserted-by":"publisher","unstructured":"Canon L-C, Sayah ME, H\u00e9am P-C (2019b) A comparison of random task graph generation methods for scheduling problems. https:\/\/doi.org\/10.48550\/arXiv.1902.05808 Accessed 12 Mar 2025","DOI":"10.48550\/arXiv.1902.05808"},{"key":"1500_CR11","doi-asserted-by":"crossref","unstructured":"Canon L-C, Sayah ME, H\u00e9am P-C (2019c) A comparison of random task graph generation methods for scheduling problems. In: Euro-par 2019: Parallel processing, 25th international conference on parallel and distributed computing (p.Proc. 25). Cham, Switzerland, Springer International Publishing","DOI":"10.1007\/978-3-030-29400-7_5"},{"issue":"27","key":"1500_CR12","doi-asserted-by":"publisher","first-page":"11150","DOI":"10.1073\/pnas.0701175104","volume":"104","author":"S Carmi","year":"2007","unstructured":"Carmi S et al (2007) A model of internet topology using k-shell decomposition. Proc Natl Acad Sci USA 104(27):11150\u201311154","journal-title":"Proc Natl Acad Sci USA"},{"key":"1500_CR13","doi-asserted-by":"crossref","unstructured":"Cordeiro D, Mouni\u00e9 G, Perarnau S, Trystram D, Vincent JM, Wagner F (2010) Random graph generation for scheduling simulations. In: Proceedings of the international conference on simulation tools and techniques (ICST), p 60","DOI":"10.4108\/ICST.SIMUTOOLS2010.8667"},{"key":"1500_CR14","doi-asserted-by":"crossref","unstructured":"Derl\u00e9n M, Lindholm J (2017) Measuring centrality in legal citation networks \u2013 a case study of the hits and pagerank algorithms. Online. (Available: https:\/\/ssrn.com\/abstract=2910926 or http:\/\/dx.doi.org\/10.2139\/ssrn.2910926. Accessed: 12 Mar 2025","DOI":"10.2139\/ssrn.2910926"},{"key":"1500_CR15","unstructured":"Duong PV et\u00a0al (2022) Enhancement of gravity centrality measure based on local clustering method by identifying influential nodes in social networks. In: Proceedings of the international conference on multimedia technology and enhanced learning. Cham, Switzerland, Springer Nature"},{"issue":"6","key":"1500_CR16","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades P, Lin X, Smyth WF (1993) A fast and effective heuristic for the feedback arc set problem. Inf Process Lett 47(6):319\u2013323","journal-title":"Inf Process Lett"},{"key":"1500_CR17","doi-asserted-by":"publisher","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs i. Publ Math Debrecen 6:290\u2013297","journal-title":"Publ Math Debrecen"},{"key":"1500_CR18","doi-asserted-by":"crossref","unstructured":"Fowler JH, Johnson TR, Spriggs-II JF, Jeon S, Wahlbeck PJ (2007) Network analysis and the law: Measuring the legal importance of precedents at the U.S. supreme court. In: Political Analysis: An Annual Publication of the Methodology Section of the American Political Science Association, 15(3), 324\u2013346","DOI":"10.1093\/pan\/mpm011"},{"issue":"1","key":"1500_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"key":"1500_CR20","unstructured":"Freeman LC (2002) Centrality in social networks: Conceptual clarification. In: Social networks: Critical concepts in sociology, vol 1, London, Routledge, pp 238\u2013263"},{"issue":"2","key":"1500_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/980972.980992","volume":"5","author":"J Gehrke","year":"2003","unstructured":"Gehrke J, Ginsparg P, Kleinberg J (2003) Overview of the 2003 KDD cup. ACM SIGKDD Explorations Newsl 5(2):149\u2013151","journal-title":"ACM SIGKDD Explorations Newsl"},{"issue":"4","key":"1500_CR22","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1137\/S0036144500371907","volume":"42","author":"HW Hethcote","year":"2000","unstructured":"Hethcote HW (2000) The mathematics of infectious diseases. SIAM Rev 42(4):599\u2013653","journal-title":"SIAM Rev"},{"key":"1500_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2021.111613","volume":"154","author":"J Hu","year":"2022","unstructured":"Hu J, Zhang Y, Wu P, Li H (2022) An analysis of the global fuel-trading market based on the visibility graph approach. Chaos Solitons & Fractals 154:111613","journal-title":"Chaos Solitons & Fractals"},{"issue":"5","key":"1500_CR24","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/ac4226","volume":"31","author":"Y Jiang","year":"2022","unstructured":"Jiang Y, Yang SQ, Yan YW, Tong TC, Dai JY (2022) A novel method for identifying influential nodes in complex networks based on gravity model. Chin Phys B 31(5):058903","journal-title":"Chin Phys B"},{"issue":"3","key":"1500_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036113","volume":"76","author":"E Kenah","year":"2007","unstructured":"Kenah E, Robins JM (2007) Second look at the spread of epidemics on networks. Phys Rev E-Stat Nonlinear Soft Matter Phys 76(3):036113","journal-title":"Phys Rev E-Stat Nonlinear Soft Matter Phys"},{"issue":"1\u20132","key":"1500_CR26","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\u20132):81\u201393","journal-title":"Biometrika"},{"key":"1500_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD international conference on knowledge discovery in data mining, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"key":"1500_CR28","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"11","key":"1500_CR29","doi-asserted-by":"publisher","first-page":"6773","DOI":"10.1109\/TKDE.2023.3274547","volume":"36","author":"H Li","year":"2024","unstructured":"Li H, Cao H, Feng Y, Li X, Pei J (2024) Optimization of graph clustering inspired by dynamic belief systems. IEEE Trans Knowl Data Eng 36(11):6773\u20136785. https:\/\/doi.org\/10.1109\/TKDE.2023.3274547","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1500_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2020.110456","volume":"143","author":"H Li","year":"2021","unstructured":"Li H, Shang Q, Deng Y (2021) A generalized gravity model for influential spreaders identification in complex networks. Chaos Solitons & Fractals 143:110456","journal-title":"Chaos Solitons & Fractals"},{"issue":"1","key":"1500_CR31","first-page":"1","volume":"18","author":"H-J Li","year":"2024","unstructured":"Li H-J, Feng Y, Xia C, Cao J (2024) Overlapping graph clustering in attributed networks via generalized cluster potential game. ACM Trans Knowl Discov Data 18(1):1\u201326","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1500_CR32","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.ins.2021.08.026","volume":"578","author":"S Li","year":"2021","unstructured":"Li S, Xiao F (2021) The identification of crucial spreaders in complex networks by effective gravity model. Inf Sci 578:725\u2013749","journal-title":"Inf Sci"},{"issue":"1","key":"1500_CR33","doi-asserted-by":"publisher","first-page":"22194","DOI":"10.1038\/s41598-021-01218-1","volume":"11","author":"Z Li","year":"2021","unstructured":"Li Z, Huang X (2021) Identifying influential spreaders in complex networks by an improved gravity model. Sci Rep 11(1):22194","journal-title":"Sci Rep"},{"issue":"1","key":"1500_CR34","doi-asserted-by":"publisher","first-page":"9879","DOI":"10.1038\/s41598-022-14005-3","volume":"12","author":"Z Li","year":"2022","unstructured":"Li Z, Huang X (2022) Identifying influential spreaders by gravity model considering multi-characteristics of nodes. Sci Rep 12(1):9879","journal-title":"Sci Rep"},{"key":"1500_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105464","volume":"193","author":"F Liu","year":"2020","unstructured":"Liu F, Wang Z, Deng Y (2020) GMM: a generalized mechanics model for identifying the importance of nodes in complex networks. Knowl-Based Syst 193:105464","journal-title":"Knowl-Based Syst"},{"key":"1500_CR36","first-page":"6985650","volume":"1","author":"Y Liu","year":"2023","unstructured":"Liu Y, Cheng Z, Li X, Wang Z (2023) An entropy-based gravity model for influential spreaders identification in complex networks. Complexity 1:6985650","journal-title":"Complexity"},{"key":"1500_CR37","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","volume":"451","author":"LL Ma","year":"2016","unstructured":"Ma LL, Ma C, Zhang HF, Wang BH (2016) Identifying influential spreaders in complex networks based on gravity formula. Phys A 451:205\u2013212","journal-title":"Phys A"},{"key":"1500_CR38","doi-asserted-by":"crossref","unstructured":"Mislove A, Koppula HS, Gummadi KP, Druschel P, Bhattacharjee B (2008) Growth of the FLICKR social network. In: Proceedings of the first workshop on online social networks, pp 25\u201330","DOI":"10.1145\/1397735.1397742"},{"key":"1500_CR39","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM conference on internet measurement, pp 29\u201342","DOI":"10.1145\/1298306.1298311"},{"issue":"3","key":"1500_CR40","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0033799","volume":"7","author":"E Mones","year":"2012","unstructured":"Mones E, Vicsek L, Vicsek T (2012) Hierarchy measure for complex networks. PLoS ONE 7(3):e33799","journal-title":"PLoS ONE"},{"issue":"4","key":"1500_CR41","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1140\/epjb\/e20020122","volume":"26","author":"Y Moreno","year":"2002","unstructured":"Moreno Y, Pastor Satorras R, Vespignani A (2002) Epidemic outbreaks in complex heterogeneous networks. Eur Phys J B 26(4):521\u2013529","journal-title":"Eur Phys J B"},{"key":"1500_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125534","volume":"261","author":"S Nejadshamsi","year":"2025","unstructured":"Nejadshamsi S, Bentahar J, Eicker U, Wang C, Jamshidi F (2025) A geographic-semantic context-aware urban commuting flow prediction model using graph neural network. Expert Syst Appl 261:125534","journal-title":"Expert Syst Appl"},{"key":"1500_CR43","doi-asserted-by":"crossref","unstructured":"Niu J, Yang H, Wang L (2017) Logarithmic gravity centrality for identifying influential spreaders in dynamic large-scale social networks. In: Proceedings of the 2017 IEEE international conference on communications (ICC), pp 1\u20136","DOI":"10.1109\/ICC.2017.7997236"},{"key":"1500_CR44","first-page":"239","volume-title":"New directions in the theory of graphs","author":"RW Robinson","year":"1973","unstructured":"Robinson RW (1973) Counting labeled acyclic digraphs. In: Harary F (ed) New directions in the theory of graphs. New York, Academic Press, pp 239\u2013273"},{"issue":"19","key":"1500_CR45","doi-asserted-by":"publisher","first-page":"e2","DOI":"10.4108\/eai.13-6-2019.159121","volume":"6","author":"A Samad","year":"2019","unstructured":"Samad A, Islam MA, Iqbal MA, Aleem M (2019) Centrality-based paper citation recommender system. EAI End Trans Ind Netw Intell Syst 6(19):e2","journal-title":"EAI End Trans Ind Netw Intell Syst"},{"issue":"3","key":"1500_CR46","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman SB (1983) Network structure and minimum degree. Soc Netw 5(3):269\u2013287","journal-title":"Soc Netw"},{"key":"1500_CR47","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ins.2021.01.053","volume":"577","author":"Q Shang","year":"2021","unstructured":"Shang Q, Deng Y, Cheong KH (2021) Identifying influential nodes in complex networks: effective distance gravity model. Inf Sci 577:162\u2013179","journal-title":"Inf Sci"},{"issue":"6","key":"1500_CR48","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1002\/asi.20529","volume":"58","author":"N Shibata","year":"2007","unstructured":"Shibata N, Kajikawa Y, Matsushima K (2007) Topological analysis of citation networks to discover the future core articles. J Am Soc Inform Sci Technol 58(6):872\u2013882","journal-title":"J Am Soc Inform Sci Technol"},{"key":"1500_CR49","unstructured":"Sonneveld JJ (2020) A gravitational approach for ranking autonomous systems in large autonomous system networks. B.S. thesis, University of Twente"},{"key":"1500_CR50","first-page":"388","volume":"334","author":"J Wang","year":"2018","unstructured":"Wang J, Li C, Xia C (2018) Improved centrality indicators to characterize the nodal spreading capability in complex networks. Appl Math Comput 334:388\u2013400","journal-title":"Appl Math Comput"},{"issue":"4","key":"1500_CR51","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00582738","volume":"1","author":"P Winkler","year":"1985","unstructured":"Winkler P (1985) Random orders. Order 1(4):317\u2013331","journal-title":"Order"},{"issue":"5","key":"1500_CR52","doi-asserted-by":"publisher","first-page":"1727","DOI":"10.1093\/comjnl\/bxad097","volume":"67","author":"N Xiang","year":"2024","unstructured":"Xiang N, Tang X, Liu H, Ma X (2024) Identifying and ranking influential spreaders in complex networks by localized decreasing gravity model. Comput J 67(5):1727\u20131746","journal-title":"Comput J"},{"key":"1500_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112974","volume":"166","author":"P Yang","year":"2023","unstructured":"Yang P, Meng F, Zhao L, Zhou L (2023) AOGC: an improved gravity centrality based on an adaptive truncation radius and omni-channel paths for identifying key nodes in complex networks. Chaos Solitons & Fractals 166:112974","journal-title":"Chaos Solitons & Fractals"},{"key":"1500_CR54","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107198","volume":"227","author":"X Yang","year":"2021","unstructured":"Yang X, Xiao F (2021) An improved gravity model to identify influential nodes in complex networks based on k-shell method. Knowl-Based Syst 227:107198","journal-title":"Knowl-Based Syst"},{"key":"1500_CR55","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.10.070","volume":"618","author":"Q Zhang","year":"2022","unstructured":"Zhang Q, Shuai B, L\u00fc M (2022) A novel method to identify influential nodes in complex networks based on gravity centrality. Inf Sci 618:98\u2013117","journal-title":"Inf Sci"},{"key":"1500_CR56","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1016\/j.ins.2022.07.084","volume":"609","author":"J Zhao","year":"2022","unstructured":"Zhao J, Wen T, Jahanshahi H, Cheong KH (2022) The random walk-based gravity model to identify influential nodes in complex networks. Inf Sci 609:1706\u20131720","journal-title":"Inf Sci"},{"issue":"2","key":"1500_CR57","doi-asserted-by":"publisher","first-page":"521","DOI":"10.3390\/app14020521","volume":"14","author":"N Zhao","year":"2024","unstructured":"Zhao N, Yang S, Wang H, Zhou X, Luo T, Wang J (2024) A novel method to identify key nodes in complex networks based on degree and neighborhood information. Appl Sci 14(2):521","journal-title":"Appl Sci"},{"issue":"1","key":"1500_CR58","doi-asserted-by":"publisher","first-page":"16404","DOI":"10.1038\/s41598-023-43585-x","volume":"13","author":"S Zhu","year":"2023","unstructured":"Zhu S, Zhan J, Li X (2023) Identifying influential nodes in complex networks using a gravity model based on the h-index method. Sci Rep 13(1):16404","journal-title":"Sci Rep"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01500-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-025-01500-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-025-01500-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:29:18Z","timestamp":1765960158000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-025-01500-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,31]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["1500"],"URL":"https:\/\/doi.org\/10.1007\/s13278-025-01500-4","relation":{},"ISSN":["1869-5469"],"issn-type":[{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,31]]},"assertion":[{"value":"4 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"83"}}