{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:10:37Z","timestamp":1740546637869,"version":"3.38.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T00:00:00Z","timestamp":1727568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T00:00:00Z","timestamp":1727568000000},"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":["Soc. Netw. Anal. Min."],"DOI":"10.1007\/s13278-024-01357-z","type":"journal-article","created":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T08:01:30Z","timestamp":1727596890000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A co-operative game theoretic approach for the budgeted influence maximization problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,29]]},"reference":[{"issue":"7","key":"1357_CR1","doi-asserted-by":"publisher","first-page":"814","DOI":"10.14778\/2752939.2752950","volume":"8","author":"C Aslay","year":"2015","unstructured":"Aslay C, Lu W, Bonchi F, Goyal A, Lakshmanan LVS (2015) Viral marketing meets social advertising: ad allocation with minimum regret. Proc VLDB Endow 8(7):814\u2013825. https:\/\/doi.org\/10.14778\/2752939.2752950","journal-title":"Proc VLDB Endow"},{"key":"1357_CR2","doi-asserted-by":"crossref","unstructured":"Angell R, Schoenebeck G (2017) Don\u2019t be greedy: leveraging community structure to find high quality seed sets for influence maximization. In: Web and Internet Economics: 13th International Conference, WINE 2017, Bangalore, India, December 17\u201320, 2017, Proceedings 13, Springer, pp 16\u201329","DOI":"10.1007\/978-3-319-71924-5_2"},{"key":"1357_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl 125:1\u201313","journal-title":"Expert Syst Appl"},{"key":"1357_CR4","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62:3417\u20133455","journal-title":"Knowl Inf Syst"},{"issue":"9","key":"1357_CR5","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.14778\/3397230.3397244","volume":"13","author":"S Bian","year":"2020","unstructured":"Bian S, Guo Q, Wang S, Yu JX (2020) Efficient algorithms for budgeted influence maximization on massive social networks. Proc VLDB Endow 13(9):1498\u20131510","journal-title":"Proc VLDB Endow"},{"issue":"P10","key":"1357_CR6","first-page":"008","volume":"10","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 10(P10):008","journal-title":"J Stat Mech Theory Exp"},{"key":"1357_CR7","doi-asserted-by":"crossref","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Internet and network economics: 6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings 6, Springer, pp 539\u2013550","DOI":"10.1007\/978-3-642-17572-5_48"},{"issue":"6","key":"1357_CR8","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.ipm.2016.05.006","volume":"52","author":"A Bozorgi","year":"2016","unstructured":"Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188\u20131199","journal-title":"Inf Process Manag"},{"issue":"5","key":"1357_CR9","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro J, G\u00f3mez D, Tejada J (2009) Polynomial calculation of the shapley value based on sampling. Comput Op Res 36(5):1726\u20131730","journal-title":"Comput Op Res"},{"key":"1357_CR10","unstructured":"Chen Y, Chang S, Chou C, Peng W, Lee S (2012) Exploring community structures for influence maximization in social networks. In: The 6th SNA-KDD workshop on social network mining and analysis held in conjunction with KDD, vol\u00a012, pp 1\u20136"},{"issue":"6","key":"1357_CR11","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1038\/s42256-023-00657-x","volume":"5","author":"H Chen","year":"2023","unstructured":"Chen H, Covert IC, Lundberg SM, Lee SI (2023) Algorithms to estimate shapley value feature attributions. Nat Mach Intell 5(6):590\u2013601","journal-title":"Nat Mach Intell"},{"key":"1357_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s10618-010-0186-6","volume":"21","author":"W Chen","year":"2010","unstructured":"Chen W, Liu Z, Sun X, Wang Y (2010) A game-theoretic framework to identify overlapping communities in social networks. Data Mining Knowl Discov 21:224\u2013240","journal-title":"Data Mining Knowl Discov"},{"key":"1357_CR13","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (2010b) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"issue":"2","key":"1357_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532549","volume":"5","author":"YC Chen","year":"2014","unstructured":"Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technol (TIST) 5(2):1\u201331","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"1357_CR15","doi-asserted-by":"crossref","unstructured":"Clark A, Poovendran R (2011) Maximizing influence in competitive environments: a game-theoretic approach. In: Decision and game theory for security: second international conference, GameSec 2011, College Park, MD, Maryland, USA, November 14-15, 2011. Proceedings 2, Springer, pp 151\u2013162","DOI":"10.1007\/978-3-642-25280-8_13"},{"key":"1357_CR16","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Sketch-based influence maximization and computation: Scaling up with guarantees. In: Proceedings of the 23rd ACM international conference on conference on information and knowledge management, pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"key":"1357_CR17","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2022","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2022) Introduction to algorithms. MIT press"},{"issue":"8","key":"1357_CR18","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1016\/j.physa.2009.12.028","volume":"389","author":"F Ding","year":"2010","unstructured":"Ding F, Liu Y, Shen B, Si XM (2010) An evolutionary game theory model of binary opinion formation. Phys A Stat Mech Appl 389(8):1745\u20131752","journal-title":"Phys A Stat Mech Appl"},{"issue":"1","key":"1357_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1109\/MIS.2005.16","volume":"20","author":"P Domingos","year":"2005","unstructured":"Domingos P (2005) Mining social networks for viral marketing. IEEE Intell Syst 20(1):80\u201382","journal-title":"IEEE Intell Syst"},{"key":"1357_CR20","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"2","key":"1357_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/moor.4.2.99","volume":"4","author":"P Dubey","year":"1979","unstructured":"Dubey P, Shapley LS (1979) Mathematical properties of the banzhaf power index. Math Op Res 4(2):99\u2013131","journal-title":"Math Op Res"},{"key":"1357_CR22","doi-asserted-by":"crossref","unstructured":"Ficara A, Fiumara G, De\u00a0Meo P, Liotta A (2021) Correlations among game of thieves and other centrality measures in complex networks. Data science and internet of things: research and applications at the intersection of DS and IoT pp 43\u201362","DOI":"10.1007\/978-3-030-67197-6_3"},{"key":"1357_CR23","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011a) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"1357_CR24","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining, IEEE, pp 211\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"issue":"2","key":"1357_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2503792.2503797","volume":"42","author":"A Guille","year":"2013","unstructured":"Guille A, Hacid H, Favre C, Zighed DA (2013) Information diffusion in online social networks: a survey. ACM Sigmod Record 42(2):17\u201328","journal-title":"ACM Sigmod Record"},{"issue":"3","key":"1357_CR26","first-page":"817","volume":"19","author":"E G\u00fcney","year":"2019","unstructured":"G\u00fcney E (2019) On the optimal solution of budgeted influence maximization problem in social networks. Op Res 19(3):817\u2013831","journal-title":"Op Res"},{"key":"1357_CR27","doi-asserted-by":"crossref","unstructured":"Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: Advances in Knowledge Discovery and Data Mining: 18th Pacific-Asia Conference, PAKDD 2014, Tainan, Taiwan, May 13-16, 2014. Proceedings, Part I 18, Springer, pp 65\u201377","DOI":"10.1007\/978-3-319-06608-0_6"},{"issue":"120","key":"1357_CR28","first-page":"943","volume":"526","author":"T Hong","year":"2019","unstructured":"Hong T, Liu Q (2019) Seeds selection for spreading in a weighted cascade model. Phys A Stat Mech Appl 526(120):943","journal-title":"Phys A Stat Mech Appl"},{"key":"1357_CR29","doi-asserted-by":"crossref","unstructured":"Hossain M (2012) Users\u2019 motivation to participate in online crowdsourcing platforms. In: 2012 international conference on innovation management and technology research, IEEE, pp 310\u2013315","DOI":"10.1109\/ICIMTR.2012.6236409"},{"key":"1357_CR30","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining, IEEE, pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"1357_CR31","doi-asserted-by":"crossref","unstructured":"Ke X, Khan A, Cong G (2018) Finding seeds and relevant tags jointly: For targeted influence maximization in social networks. In: Proceedings of the 2018 international conference on management of data, pp 1097\u20131111","DOI":"10.1145\/3183713.3199670"},{"key":"1357_CR32","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1357_CR33","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2005) Influential nodes in a diffusion model for social networks. In: Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings 32, Springer, pp 1127\u20131138","DOI":"10.1007\/11523468_91"},{"key":"1357_CR34","doi-asserted-by":"crossref","unstructured":"Kostka J, Oswald YA, Wattenhofer R (2008) Word of mouth: rumor dissemination in social networks. In: structural information and communication complexity: 15th International Colloquium, SIROCCO 2008 Villars-sur-Ollon, Switzerland, June 17-20, 2008 Proceedings 15, Springer, pp 185\u2013196","DOI":"10.1007\/978-3-540-69355-0_16"},{"issue":"1","key":"1357_CR35","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. ACM Trans Knowl Discov Data (TKDD) 1(1):2","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"1357_CR36","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007b) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1357_CR37","doi-asserted-by":"crossref","unstructured":"Li H, Bhowmick SS, Cui J, Gao Y, Ma J (2015) Getreal: towards realistic selection of influence maximization strategies in competitive networks. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1525\u20131537","DOI":"10.1145\/2723372.2723710"},{"issue":"10","key":"1357_CR38","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"1357_CR39","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3390\/info8040118","volume":"8","author":"M Li","year":"2017","unstructured":"Li M, Wang X, Gao K, Zhang S (2017) A survey on information diffusion in online social networks: models and methods. Information 8(4):118","journal-title":"Information"},{"key":"1357_CR40","doi-asserted-by":"crossref","unstructured":"Logins A, Karras P (2019) Content-based network influence probabilities: extraction and application. In: 2019 international conference on data mining workshops (ICDMW), IEEE, pp 69\u201372","DOI":"10.1109\/ICDMW.2019.00020"},{"key":"1357_CR41","unstructured":"Maleki S, Tran-Thanh L, Hines G, Rahwan T, Rogers A (2013) Bounding the estimation error of sampling-based shapley value approximation. arXiv preprint arXiv:1306.4265"},{"key":"1357_CR42","doi-asserted-by":"crossref","DOI":"10.1142\/8902","volume-title":"Game theory and mechanism design,","author":"Y Narahari","year":"2014","unstructured":"Narahari Y (2014) Game theory and mechanism design, vol 4. World Scientific"},{"issue":"1","key":"1357_CR43","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2010","unstructured":"Narayanam R, Narahari Y (2010) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng 8(1):130\u2013147","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"6","key":"1357_CR44","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084\u20131094","journal-title":"IEEE J Sel Areas Commun"},{"issue":"3","key":"1357_CR45","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.eswa.2014.09.037","volume":"42","author":"K Rahimkhani","year":"2015","unstructured":"Rahimkhani K, Aleahmad A, Rahgozar M, Moeini A (2015) A fast algorithm for finding most influential people based on the linear threshold model. Expert Syst Appl 42(3):1353\u20131361","journal-title":"Expert Syst Appl"},{"key":"1357_CR46","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"1357_CR47","doi-asserted-by":"crossref","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: International semantic Web conference, Springer, pp 351\u2013368","DOI":"10.1007\/978-3-540-39718-2_23"},{"key":"1357_CR48","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100","journal-title":"Knowl Based Syst"},{"key":"1357_CR49","volume-title":"A value for n-person games","author":"LS Shapley","year":"1953","unstructured":"Shapley LS et al (1953) A value for n-person games. Princeton University Press Princeton"},{"key":"1357_CR50","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.neucom.2019.02.010","volume":"338","author":"Q Shi","year":"2019","unstructured":"Shi Q, Wang C, Chen J, Feng Y, Chen C (2019) Post and repost: a holistic view of budgeted influence maximization. Neurocomputing 338:92\u2013100","journal-title":"Neurocomputing"},{"key":"1357_CR51","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"1357_CR52","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"issue":"1","key":"1357_CR53","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2016","unstructured":"Tong G, Wu W, Tang S, Du DZ (2016) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Trans Netw 25(1):112\u2013125","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1357_CR54","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining Knowl Discov 25:545\u2013576","journal-title":"Data Mining Knowl Discov"},{"key":"1357_CR55","unstructured":"Wang S, Yang S, Xu Z, Truong VA (2020) Fast thompson sampling algorithm with cumulative oversampling: application to budgeted influence maximization. arXiv preprint arXiv:2004.11963"},{"key":"1357_CR56","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.ins.2019.10.003","volume":"512","author":"T Wen","year":"2020","unstructured":"Wen T, Deng Y (2020) Identification of influencers in complex networks by local information dimensionality. Inf Sci 512:549\u2013562","journal-title":"Inf Sci"},{"key":"1357_CR57","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.physa.2014.09.010","volume":"416","author":"Y Wu","year":"2014","unstructured":"Wu Y, Yang Y, Jiang F, Jin S, Xu J (2014) Coritivity-based influence maximization in social networks. Phys A Stat Mech Appl 416:467\u2013480","journal-title":"Phys A Stat Mech Appl"},{"key":"1357_CR58","doi-asserted-by":"crossref","unstructured":"Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: a generative model approach. In: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, pp 671\u2013680","DOI":"10.1145\/2348283.2348373"},{"key":"1357_CR59","doi-asserted-by":"publisher","first-page":"14,367","DOI":"10.1109\/ACCESS.2018.2809547","volume":"6","author":"Q Yu","year":"2018","unstructured":"Yu Q, Li H, Liao Y, Cui S (2018) Fast budgeted influence maximization over multi-action event logs. IEEE Access 6:14,367-14,378","journal-title":"IEEE Access"},{"issue":"5","key":"1357_CR60","doi-asserted-by":"publisher","first-page":"056,118","DOI":"10.1103\/PhysRevE.72.056118","volume":"72","author":"MG Zimmermann","year":"2005","unstructured":"Zimmermann MG, Egu\u00edluz VM (2005) Cooperation, social networks, and the emergence of leadership in a prisoner\u2019s dilemma with adaptive local interactions. Phys Rev E 72(5):056,118","journal-title":"Phys Rev E"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-024-01357-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-024-01357-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T05:43:12Z","timestamp":1740462192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-024-01357-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,29]]},"references-count":60,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1357"],"URL":"https:\/\/doi.org\/10.1007\/s13278-024-01357-z","relation":{},"ISSN":["1869-5469"],"issn-type":[{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2024,9,29]]},"assertion":[{"value":"29 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"197"}}