{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T17:14:20Z","timestamp":1778692460831,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"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":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s41060-026-01123-8","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T17:54:17Z","timestamp":1778349257000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A regret-aware framework for effective social media advertising"],"prefix":"10.1007","volume":"22","author":[{"given":"Poonam","family":"Sharma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dildar","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"1123_CR1","first-page":"131","volume":"2","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S.: Social network analysis: Methods and applications. Cambridge Univ. Press Google Schola 2, 131\u2013134 (1994)","journal-title":"Cambridge Univ. Press Google Schola"},{"key":"1123_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100286","volume":"37","author":"P Chunaev","year":"2020","unstructured":"Chunaev, P.: Community detection in node-attributed social networks: a survey. Comput. Sci. Rev. 37, 100286 (2020)","journal-title":"Comput. Sci. Rev."},{"key":"1123_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","volume":"24","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media: Performance and application considerations. Data Min. Knowl. Disc. 24, 515\u2013554 (2012)","journal-title":"Data Min. Knowl. Disc."},{"key":"1123_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2018.02.011","volume":"108","author":"MA Javed","year":"2018","unstructured":"Javed, M.A., Younis, M.S., Latif, S., Qadir, J., Baig, A.: Community detection in networks: a multidisciplinary review. J. Netw. Comput. Appl. 108, 87\u2013111 (2018)","journal-title":"J. Netw. Comput. Appl."},{"key":"1123_CR5","doi-asserted-by":"crossref","unstructured":"Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: European Conference on Principles of Data Mining and Knowledge Discovery, pp. 259\u2013271. Springer (2006)","DOI":"10.1007\/11871637_27"},{"key":"1123_CR6","doi-asserted-by":"crossref","unstructured":"Bakshy, E., Rosenn, I., Marlow, C., Adamic, L.: The role of social networks in information diffusion. In: Proceedings of the 21st International Conference on World Wide Web, pp. 519\u2013528. (2012)","DOI":"10.1145\/2187836.2187907"},{"issue":"10","key":"1123_CR7","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, K.-L.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1123_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100393","volume":"40","author":"M Azaouzi","year":"2021","unstructured":"Azaouzi, M., Mnasri, W., Romdhane, L.B.: New trends in influence maximization models. Comput. Sci. Rev. 40, 100393 (2021)","journal-title":"Comput. Sci. Rev."},{"key":"1123_CR9","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, D.K.: A survey on influence maximization in a social network. Knowl. Inf. Syst. 62, 3417\u20133455 (2020)","journal-title":"Knowl. Inf. Syst."},{"key":"1123_CR10","doi-asserted-by":"crossref","unstructured":"Das, A., Gollapudi, S., Munagala, K.: Modeling opinion dynamics in social networks. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining, pp. 403\u2013412. (2014)","DOI":"10.1145\/2556195.2559896"},{"key":"1123_CR11","unstructured":"De, A., Valera, I., Ganguly, N., Bhattacharya, S., Gomez Rodriguez, M.: Learning and forecasting opinion dynamics in social networks. Adv. Neural Inform. Process. Syst 29, (2016)"},{"key":"1123_CR12","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: 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. (2002)","DOI":"10.1145\/775047.775057"},{"key":"1123_CR13","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57\u201366. (2001)","DOI":"10.1145\/502512.502525"},{"key":"1123_CR14","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2022.11.041","volume":"619","author":"Z Liang","year":"2023","unstructured":"Liang, Z., He, Q., Du, H., Xu, W.: Targeted influence maximization in competitive social networks. Inf. Sci. 619, 390\u2013405 (2023)","journal-title":"Inf. Sci."},{"key":"1123_CR15","doi-asserted-by":"crossref","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013804. (2016)","DOI":"10.1145\/2939672.2939745"},{"key":"1123_CR16","doi-asserted-by":"crossref","unstructured":"Chen, W., Collins, A., Cummings, R., Ke, T., Liu, Z., Rincon, D., Sun, X., Wang, Y., Wei, W., Yuan, Y.: Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 Siam International Conference on Data Mining, pp. 379\u2013390. SIAM (2011)","DOI":"10.1137\/1.9781611972818.33"},{"key":"1123_CR17","first-page":"10718","volume":"34","author":"B Peng","year":"2021","unstructured":"Peng, B.: Dynamic influence maximization. Adv. Neural. Inf. Process. Syst. 34, 10718\u201310731 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"1123_CR18","doi-asserted-by":"crossref","unstructured":"Cautis, B., Maniu, S., Tziortziotis, N.: Adaptive influence maximization. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 3185\u20133186 (2019)","DOI":"10.1145\/3292500.3332285"},{"key":"1123_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Li, Y., Bao, Z., Zheng, B., Jagadish, H.: Minimizing the regret of an influence provider. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2115\u20132127. (2021)","DOI":"10.1145\/3448016.3457257"},{"key":"1123_CR20","doi-asserted-by":"crossref","unstructured":"Ali, D., Bhagat, A.K., Banerjee, S., Prasad, Y.: Efficient algorithms for regret minimization in billboard advertisement (student abstract). In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 16148\u201316149. (2023)","DOI":"10.1609\/aaai.v37i13.26934"},{"key":"1123_CR21","doi-asserted-by":"crossref","unstructured":"Ali, D., Banerjee, S., Prasad, Y.: Toward regret-free slot allocation in billboard advertisement. Int. J. Data Sci. Anal. 1 , 25 (2024)","DOI":"10.1007\/s41060-024-00566-1"},{"key":"1123_CR22","doi-asserted-by":"publisher","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201903, pp. 137\u2013146. Association for Computing Machinery, New York, NY, USA (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"1123_CR23","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1007\/11523468_91","volume-title":"Automata, Languages and Programming","author":"D Kempe","year":"2005","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) Automata, Languages and Programming, pp. 1127\u20131138. Springer, Berlin, Heidelberg (2005)"},{"key":"1123_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"key":"1123_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201907, pp. 420\u2013429. Association for Computing Machinery, New York, NY, USA (2007). doi: 10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"key":"1123_CR26","doi-asserted-by":"publisher","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing Social Influence in Nearly Optimal Time, pp. 946\u2013957. (). https:\/\/doi.org\/10.1137\/1.9781611973402.70","DOI":"10.1137\/1.9781611973402.70"},{"key":"1123_CR27","doi-asserted-by":"publisher","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201914, pp. 75\u201386. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2588555.2593670","DOI":"10.1145\/2588555.2593670"},{"key":"1123_CR28","doi-asserted-by":"publisher","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: A martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201915, pp. 1539\u20131554. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"key":"1123_CR29","doi-asserted-by":"crossref","unstructured":"Jung, K., Heo, W., Chen, W.: Irie: Scalable and robust influence maximization in social networks. In: IEEE 12th International Conference on Data Mining, pp. 918\u2013923. IEEE (2012)","DOI":"10.1109\/ICDM.2012.79"},{"key":"1123_CR30","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, pp. 509\u2013518 (2013)","DOI":"10.1145\/2505515.2505541"},{"key":"1123_CR31","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Chen, W., Cheng, X.: Imrank: influence maximization via finding self-consistent ranking. In: Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval, pp. 475\u2013484 (2014)","DOI":"10.1145\/2600428.2609592"},{"issue":"2","key":"1123_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2532549","volume":"5","author":"Y-C Chen","year":"2014","unstructured":"Chen, Y.-C., Zhu, W.-Y., Peng, W.-C., Lee, W.-C., Lee, S.-Y.: Cim: Community-based influence maximization in social networks. ACM Trans. Intell. Syst. Technol. (TIST) 5(2), 1\u201331 (2014)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"issue":"6","key":"1123_CR33","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, M.S., Rezvani, M.: Incim: A community-based algorithm for influence maximization problem under the linear threshold model. Inform. Process. & Manag. 52(6), 1188\u20131199 (2016)","journal-title":"Inform. Process. & Manag."},{"key":"1123_CR34","doi-asserted-by":"crossref","unstructured":"Shang, J., Zhou, S., Li, X., Liu, L., Wu, H.: Cofim: A community-based framework for influence maximization on large-scale networks. Knowl.-Based Syst. 117, 88\u2013100 (2017)","DOI":"10.1016\/j.knosys.2016.09.029"},{"key":"1123_CR35","doi-asserted-by":"crossref","unstructured":"Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model, vol. 134, pp. 149\u2013158. (2017). (Knowl.-Based Syst)","DOI":"10.1016\/j.knosys.2017.07.029"},{"key":"1123_CR36","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong, M., Yan, J., Shen, B., Ma, L., Cai, Q.: Influence maximization in social networks based on discrete particle swarm optimization. Inf. Sci. 367, 600\u2013614 (2016)","journal-title":"Inf. Sci."},{"key":"1123_CR37","doi-asserted-by":"crossref","unstructured":"\u015e\u0130M\u015eEK, A., Resul, K.: Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst. Appl. 114, 224\u2013236 (2018)","DOI":"10.1016\/j.eswa.2018.07.038"},{"key":"1123_CR38","doi-asserted-by":"crossref","unstructured":"Bucur, D., Iacca, G.: Influence maximization in social networks with genetic algorithms. In: Applications of Evolutionary Computation: 19th European Conference, EvoApplications 2016, Porto, Portugal, March 30-April 1, 2016, Proceedings, Part I 19, pp. 379\u2013392 (2016). Springer","DOI":"10.1007\/978-3-319-31204-0_25"},{"key":"1123_CR39","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, D.K.: Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst. Appl. 125, 1\u201313 (2019)","journal-title":"Expert Syst. Appl."},{"key":"1123_CR40","doi-asserted-by":"crossref","unstructured":"Han, S., Zhuang, F., He, Q., Shi, Z.: 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\u201316, 2014. Proceedings, Part I 18, pp. 65\u201377 (2014). Springer","DOI":"10.1007\/978-3-319-06608-0_6"},{"issue":"4","key":"1123_CR41","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1287\/ijoo.2019.0012","volume":"1","author":"S Raghavan","year":"2019","unstructured":"Raghavan, S., Zhang, R.: A branch-and-cut approach for the weighted target set selection problem on social networks. INFORMS J. Optimizat. 1(4), 304\u2013322 (2019)","journal-title":"INFORMS J. Optimizat."},{"key":"1123_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2014.02.027","volume":"535","author":"F Cicalese","year":"2014","unstructured":"Cicalese, F., Cordasco, G., Gargano, L., Milani\u010d, M., Vaccaro, U.: Latency-bounded target set selection in social networks. Theoret. Comput. Sci. 535, 1\u201315 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"1123_CR43","unstructured":"Chu, H., Lin, B.: Fpt approximation using treewidth: Capacitated vertex cover, target set selection and vector dominating set, (2023). (arXiv preprint)"},{"key":"1123_CR44","doi-asserted-by":"crossref","unstructured":"Hartmann, T.A.: Target set selection parameterized by clique-width and maximum threshold. In: SOFSEM 2018: Theory and Practice of Computer Science: 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29-February 2, 2018, Proceedings 44, pp. 137\u2013149 (2018). Springer","DOI":"10.1007\/978-3-319-73117-9_10"},{"issue":"7","key":"1123_CR45","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, L.V.S.: Viral marketing meets social advertising: Ad allocation with minimum regret. Proc. VLDB Endow. 8(7), 814\u2013825 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"1123_CR46","doi-asserted-by":"publisher","unstructured":"Ali, D., Banerjee, S., Prasad, Y.: Regret minimization in billboard advertisement under zonal influence constraint. In: Proceedings of the 39th ACM\/SIGAPP Symposium on Applied Computing. SAC \u201924, pp. 329\u2013336. Association for Computing Machinery, New York, NY, USA (2024). https:\/\/doi.org\/10.1145\/3605098.3636052","DOI":"10.1145\/3605098.3636052"},{"key":"1123_CR47","doi-asserted-by":"crossref","unstructured":"Ali, D., Banerjee, S., Prasad, Y.: Towards regret free slot allocation in billboard advertisement. CoRR (2024). arXiv:2401.16464https:\/\/doi.org\/10.48550\/ARXIV.2401.16464","DOI":"10.1007\/s41060-024-00566-1"},{"issue":"13","key":"1123_CR48","doi-asserted-by":"publisher","first-page":"16148","DOI":"10.1609\/aaai.v37i13.26934","volume":"37","author":"D Ali","year":"2024","unstructured":"Ali, D., Bhagat, A.K., Banerjee, S., Prasad, Y.: Efficient algorithms for regret minimization in billboard advertisement (student abstract). Proceed. AAAI Conf. Artif. Intell. 37(13), 16148\u201316149 (2024). https:\/\/doi.org\/10.1609\/aaai.v37i13.26934","journal-title":"Proceed. AAAI Conf. Artif. Intell."},{"key":"1123_CR49","doi-asserted-by":"crossref","unstructured":"Ali, D., Banerjee, S., Prasad, Y.: Minimizing regret in billboard advertisement under zonal influence constraint, (2024). (arXiv preprint)","DOI":"10.1145\/3605098.3636052"},{"key":"1123_CR50","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.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Disc. 25, 545\u2013576 (2012)","journal-title":"Data Min. Knowl. Disc."},{"key":"1123_CR51","doi-asserted-by":"crossref","unstructured":"Fink, C.G., Omodt, N., Zinnecker, S., Sprint, G.: A congressional twitter network dataset quantifying pairwise probability of influence. Data Brief , (2023)","DOI":"10.1016\/j.dib.2023.109521"},{"key":"1123_CR52","doi-asserted-by":"publisher","unstructured":"Yin, H., Benson, A.R., Leskovec, J., Gleich, D.F.: Local higher-order graph clustering. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201917, pp. 555\u2013564. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3097983.3098069","DOI":"10.1145\/3097983.3098069"},{"key":"1123_CR53","unstructured":"Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. In: Advances in neural information processing systems, p. 25. (2012)"},{"key":"1123_CR54","doi-asserted-by":"publisher","unstructured":"Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web. WWW \u201910, pp. 641\u2013650. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1772690.1772756","DOI":"10.1145\/1772690.1772756"},{"issue":"4","key":"1123_CR55","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","volume":"25","author":"HT Nguyen","year":"2017","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Trans. Netw. 25(4), 2419\u20132429 (2017). https:\/\/doi.org\/10.1109\/TNET.2017.2691544","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-026-01123-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-026-01123-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-026-01123-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T16:29:25Z","timestamp":1778689765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-026-01123-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,9]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s41060-026-01123-8","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,9]]},"assertion":[{"value":"6 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2026","order":3,"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":"165"}}