{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:18:49Z","timestamp":1770268729338,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100021115","name":"Indian Institute of Technology Jammu","doi-asserted-by":"publisher","award":["SG100047"],"award-info":[{"award-number":["SG100047"]}],"id":[{"id":"10.13039\/100021115","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    <jats:italic>Billboard Advertisement<\/jats:italic>\n                    is a popular out-of-home advertising technique adopted by commercial houses. Companies own billboards and offer them to commercial houses on a payment basis. Given a database of billboards with slot information, we want to determine which\n                    <jats:italic>k<\/jats:italic>\n                    slots to choose to maximize the influence. We call this the\n                    <jats:sc>Influential Billboard Slot Selection<\/jats:sc>\n                    (\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\textsc {IBSS}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>IBSS<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    ) Problem and pose it as a combinatorial optimization problem. We show that the influence function considered in this paper is non-negative, monotone, and submodular. The incremental greedy approach based on the marginal gain computation leads to a constant factor approximation guarantee. However, this method scales very poorly when the size of the problem instance is very large. To address this, we propose a spatial partitioning and pruned submodularity graph-based approach divided into the following three steps: pre-processing, pruning, and selection. We analyze the proposed solution approaches to understand their time, space requirements, and performance guarantees. We conduct extensive experiments with real-world datasets and compare the performance of the proposed solution approaches with the available baseline methods. We observe that the proposed approaches lead to more influence than all the baseline methods within a reasonable computational time.\n                  <\/jats:p>","DOI":"10.1007\/s41019-025-00306-w","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T08:04:10Z","timestamp":1755849850000},"page":"764-785","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Influential Billboard Slot Selection Using Spatial Clustering and Pruned Submodularity Graph"],"prefix":"10.1007","volume":"10","author":[{"given":"Dildar","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1761-5944","authenticated-orcid":false,"given":"Suman","family":"Banerjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yamuna","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"306_CR1","unstructured":"Lamar Advertising Company (2025) Research\u2014Lamar advertising. Accessed 30 May 2025. https:\/\/www.lamar.com\/howtoadvertise\/Research\/"},{"key":"306_CR2","unstructured":"Top Media Advertising (2025) Billboard advertising statistics. Accessed 30 May 2025. https:\/\/topmediadvertising.co.uk\/billboard-advertising-statistics\/"},{"key":"306_CR3","unstructured":"The Business Research Company (2025) Billboard and outdoor advertising global market report. Accessed 30 May 2025. https:\/\/www.thebusinessresearchcompany.com\/report\/billboard-and-outdoor-advertising-global-market-report"},{"issue":"2","key":"306_CR4","first-page":"1","volume":"13","author":"L Wang","year":"2022","unstructured":"Wang L, Yu Z, Guo B, Yang D, Ma L, Liu Z, Xiong F (2022) Data-driven targeted advertising recommendation system for outdoor billboard. ACM Trans Intell Syst Technol (TIST) 13(2):1\u201323","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"306_CR5","doi-asserted-by":"crossref","unstructured":"Zhang Y, Li Y, Bao Z, Mo S, Zhang P (2019) Optimizing impression counts for outdoor advertising. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining. KDD \u201919. Association for Computing Machinery, New York, NY, pp 1205\u20131215","DOI":"10.1145\/3292500.3330829"},{"issue":"2","key":"306_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1086\/451461","volume":"33","author":"G Feder","year":"1985","unstructured":"Feder G, Just RE, Zilberman D (1985) Adoption of agricultural innovations in developing countries: a survey. Econ Dev Cult Change 33(2):255\u2013298","journal-title":"Econ Dev Cult Change"},{"issue":"2","key":"306_CR7","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.tele.2013.06.001","volume":"31","author":"S Lee","year":"2014","unstructured":"Lee S (2014) Examining the factors that influence early adopters\u2019 smartphone adoption: the case of college students. Telematics Inform 31(2):308\u2013318","journal-title":"Telematics Inform"},{"key":"306_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.enpol.2014.01.043","volume":"68","author":"W Sierzchula","year":"2014","unstructured":"Sierzchula W, Bakker S, Maat K, van Wee B (2014) The influence of financial incentives and other socio-economic factors on electric vehicle adoption. Energy Policy 68:183\u2013194","journal-title":"Energy Policy"},{"key":"306_CR9","doi-asserted-by":"crossref","unstructured":"Zhou F, Wu H, Trajcevski G, Khokhar A, Zhang K (2020) Semi-supervised trajectory understanding with POI attention for end-to-end trip recommendation. ACM Trans Spatial Algorithms Syst (TSAS) 6(2):1\u201325","DOI":"10.1145\/3378890"},{"key":"306_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124222","volume":"252","author":"S AlKheder","year":"2024","unstructured":"AlKheder S (2024) Experimental road safety study of the actual driver reaction to the street ads using eye tracking, multiple linear regression and decision trees methods. Expert Syst Appl 252:124222","journal-title":"Expert Syst Appl"},{"issue":"1","key":"306_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TVCG.2016.2598432","volume":"23","author":"D Liu","year":"2017","unstructured":"Liu D, Weng D, Li Y, Bao J, Zheng Y, Qu H, Wu Y (2017) SmartAdP: visual analytics of large-scale taxi trajectories for selecting billboard locations. IEEE Trans Visual Comput Graphics 23(1):1\u201310","journal-title":"IEEE Trans Visual Comput Graphics"},{"issue":"2","key":"306_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3587426","volume":"9","author":"J Gudmundsson","year":"2023","unstructured":"Gudmundsson J, Pfeifer J, Seybold MP (2023) On practical nearest sub-trajectory queries under the Fr\u00e9chet distance. ACM Trans Spatial Algorithms Syst 9(2):1\u201324","journal-title":"ACM Trans Spatial Algorithms Syst"},{"issue":"3","key":"306_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2964906","volume":"2","author":"H-J Hung","year":"2016","unstructured":"Hung H-J, Yang D-N, Lee W-C (2016) Social influence-aware reverse nearest neighbor search. ACM Trans Spatial Algorithms Syst (TSAS) 2(3):1\u201335","journal-title":"ACM Trans Spatial Algorithms Syst (TSAS)"},{"issue":"2","key":"306_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3543850","volume":"9","author":"R Uddin","year":"2023","unstructured":"Uddin R, Mahin MT, Rajan P, Ravishankar CV, Tsotras VJ (2023) Dwell regions: generalized stay regions for streaming and archival trajectory data. ACM Trans Spatial Algorithms Syst 9(2):1\u201335","journal-title":"ACM Trans Spatial Algorithms Syst"},{"key":"306_CR15","doi-asserted-by":"crossref","unstructured":"Dai J, Yang B, Guo C, Ding Z (2015) Personalized route recommendation using big trajectory data. In: 2015 IEEE 31st international conference on data engineering. IEEE, pp 543\u2013554","DOI":"10.1109\/ICDE.2015.7113313"},{"issue":"2","key":"306_CR16","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1109\/TITS.2019.2897776","volume":"21","author":"B Qu","year":"2019","unstructured":"Qu B, Yang W, Cui G, Wang X (2019) Profitable taxi travel route recommendation based on big taxi trajectory data. IEEE Trans Intell Transp Syst 21(2):653\u2013668","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"306_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326060","volume":"13","author":"Y Huang","year":"2019","unstructured":"Huang Y, Xiao Z, Yu X, Wang D, Havyarimana V, Bai J (2019) Road network construction with complex intersections based on sparsely sampled private car trajectory data. ACM Trans Knowl Discov Data (TKDD) 13(3):1\u201328","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"306_CR18","first-page":"9085238","volume":"1","author":"Q Xue","year":"2019","unstructured":"Xue Q, Wang K, Lu JJ (2019) Liu Y (2019) Rapid driving style recognition in car-following using machine learning and vehicle trajectory data. J Adv Transp 1:9085238","journal-title":"J Adv Transp"},{"issue":"2","key":"306_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3582427","volume":"9","author":"KK Qin","year":"2023","unstructured":"Qin KK, Ren Y, Shao W, Lake B, Privitera F, Salim FD (2023) Multiple-level point embedding for solving human trajectory imputation with prediction. ACM Trans Spatial Algorithms Syst 9(2):1\u201322","journal-title":"ACM Trans Spatial Algorithms Syst"},{"issue":"2","key":"306_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3656470","volume":"10","author":"M Musleh","year":"2023","unstructured":"Musleh M, Mokbel MF (2023) Let\u2019s speak trajectories: a vision to use NLP models for trajectory analysis tasks. ACM Trans Spatial Algorithms Syst 10(2):1\u201325","journal-title":"ACM Trans Spatial Algorithms Syst"},{"issue":"5","key":"306_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3350488","volume":"14","author":"P Zhang","year":"2020","unstructured":"Zhang P, Bao Z, Li Y, Li G, Zhang Y, Peng Z (2020) Towards an optimal outdoor advertising placement: when a budget constraint meets moving trajectories. ACM Trans Knowl Discov Data (TKDD) 14(5):1\u201332","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"10","key":"306_CR22","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 (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"306_CR23","doi-asserted-by":"crossref","unstructured":"Zhou Z, Wu W, Li X, Lee ML, Hsu W (2011) MaxFirst for MaxBRkNN. In: 2011 IEEE 27th international conference on data engineering, pp 828\u2013839","DOI":"10.1109\/ICDE.2011.5767892"},{"key":"306_CR24","doi-asserted-by":"crossref","unstructured":"Li G, Chen S, Feng J, Tan K-l, Li W-s (2014) Efficient location-aware influence maximization. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. SIGMOD \u201914. Association for Computing Machinery, New York, NY, pp 87\u201398","DOI":"10.1145\/2588555.2588561"},{"issue":"4","key":"306_CR25","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s41019-021-00157-1","volume":"6","author":"P Liu","year":"2021","unstructured":"Liu P, Wang M, Cui J, Li H (2021) Top-k competitive location selection over moving objects. Data Sci Eng 6(4):392\u2013401","journal-title":"Data Sci Eng"},{"issue":"1","key":"306_CR26","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.14778\/1687627.1687754","volume":"2","author":"RC-W Wong","year":"2009","unstructured":"Wong RC-W, \u00d6zsu MT, Yu PS, Fu AW-C, Liu L (2009) Efficient method for maximizing bichromatic reverse nearest neighbor. Proc VLDB Endow 2(1):1126\u20131137","journal-title":"Proc VLDB Endow"},{"key":"306_CR27","unstructured":"Xia T, Zhang D, Kanoulas E, Du Y (2005) On computing top-t most influential spatial sites. In: Proceedings of the 31st international conference on very large data bases, pp 946\u2013957"},{"issue":"1","key":"306_CR28","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor JS (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"key":"306_CR29","doi-asserted-by":"publisher","first-page":"386","DOI":"10.33543\/1101386391","volume":"11","author":"J Zahr\u00e1dka","year":"2021","unstructured":"Zahr\u00e1dka J, Machov\u00e1 V, Ku\u010dera J (2021) What is the price of outdoor advertising: a case study of the Czech republic? Ad Alta J Interdiscip Res 11:386","journal-title":"Ad Alta J Interdiscip Res"},{"key":"306_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-031-70626-4_7","volume-title":"Advances in databases and information systems","author":"D Ali","year":"2024","unstructured":"Ali D, Banerjee S, Prasad Y (2024) Influential billboard slot selection under zonal influence constraint. In: Tekli J, Gamper J, Chbeir R, Manolopoulos Y (eds) Advances in databases and information systems. Springer, Cham, pp 93\u2013106"},{"key":"306_CR31","doi-asserted-by":"crossref","unstructured":"Ali D, Kumar H, Banerjee S, Prasad Y (2024) An effective tag assignment approach for billboard advertisement. In: International conference on web information systems engineering. Springer, pp 159\u2013173","DOI":"10.1007\/978-981-96-0579-8_12"},{"key":"306_CR32","doi-asserted-by":"crossref","unstructured":"Ali D, Banerjee S, Prasad Y (2025) Multi-slot tag assignment problem in billboard advertisement. In: Australasian database conference, pp 158\u2013170","DOI":"10.1007\/978-981-96-1242-0_12"},{"key":"306_CR33","doi-asserted-by":"crossref","unstructured":"Guo L, Zhang D, Cong G, Wu W, Tan K-L (2017) Influence maximization in trajectory databases. In: 2017 IEEE 33rd international conference on data engineering (ICDE), pp 27\u201328","DOI":"10.1109\/ICDE.2017.20"},{"issue":"4","key":"306_CR34","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TKDE.2017.2776268","volume":"30","author":"S Wang","year":"2018","unstructured":"Wang S, Bao Z, Culpepper JS, Sellis T, Cong G (2018) Reverse $$k$$ nearest neighbor search over trajectories. IEEE Trans Knowl Data Eng 30(4):757\u2013771","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"306_CR35","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1109\/TII.2019.2891258","volume":"16","author":"L Wang","year":"2020","unstructured":"Wang L, Yu Z, Yang D, Ma H, Sheng H (2020) Efficiently targeted billboard advertising using crowdsensing vehicle trajectory data. IEEE Trans Ind Inf 16(2):1058\u20131066","journal-title":"IEEE Trans Ind Inf"},{"issue":"7","key":"306_CR36","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","journal-title":"Proc VLDB Endow"},{"key":"306_CR37","doi-asserted-by":"crossref","unstructured":"Zhang Y, Li Y, Bao Z, Zheng B, Jagadish H (2021) Minimizing the regret of an influence provider. In: Proceedings of the 2021 international conference on management of data, pp 2115\u20132127","DOI":"10.1145\/3448016.3457257"},{"key":"306_CR38","doi-asserted-by":"publisher","first-page":"16148","DOI":"10.1609\/aaai.v37i13.26934","volume":"37","author":"D Ali","year":"2023","unstructured":"Ali D, Bhagat AK, Banerjee S, Prasad Y (2023) Efficient algorithms for regret minimization in billboard advertisement (student abstract). Proceedings of the AAAI conference on artificial intelligence 37:16148\u201316149","journal-title":"Proceedings of the AAAI conference on artificial intelligence"},{"key":"306_CR39","doi-asserted-by":"crossref","unstructured":"Ali D, Banerjee S, Prasad Y (2024) Toward regret-free slot allocation in billboard advertisement. Int J Data Sci Anal, 1\u201325","DOI":"10.1007\/s41060-024-00566-1"},{"key":"306_CR40","doi-asserted-by":"crossref","unstructured":"Ali D, Banerjee S, Prasad Y (2024) Regret minimization in billboard advertisement under zonal influence constraint. In: Proceedings of the 39th ACM\/SIGAPP symposium on applied computing, pp 329\u2013336","DOI":"10.1145\/3605098.3636052"},{"key":"306_CR41","doi-asserted-by":"crossref","unstructured":"Ali D, Banerjee S, Prasad Y (2024) Minimizing regret in billboard advertisement under zonal influence constraint. arXiv preprint arXiv:2402.01294","DOI":"10.1145\/3605098.3636052"},{"key":"306_CR42","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani VV (2001) Approximation algorithms. Springer, Berlin"},{"issue":"1","key":"306_CR43","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions\u2013I. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"key":"306_CR44","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"M Fisher","year":"1978","unstructured":"Fisher M, Nemhauser G, Wolsey L (1978) An analysis of approximations for maximizing submodular set functions II. Math Program Stud 8:73","journal-title":"Math Program Stud"},{"key":"306_CR45","unstructured":"Zhou T, Ouyang H, Bilmes J, Chang Y, Guestrin C (2017) Scaling submodular maximization via pruned submodularity graphs. In: Artificial intelligence and statistics. PMLR, pp 316\u2013324"},{"key":"306_CR46","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-031-22064-7_17","volume-title":"Advanced data mining and applications","author":"D Ali","year":"2022","unstructured":"Ali D, Banerjee S, Prasad Y (2022) Influential billboard slot selection using pruned submodularity graph. In: Chen W, Yao L, Cai T, Pan S, Shen T, Li X (eds) Advanced data mining and applications. Springer, Cham, pp 216\u2013230"},{"key":"306_CR47","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/3-540-57182-5_65","volume-title":"Mathematical foundations of computer science 1993","author":"D Wagner","year":"1993","unstructured":"Wagner D, Wagner F (1993) Between min cut and graph bisection. In: Borzyszkowski AM, Soko\u0142owski S (eds) Mathematical foundations of computer science 1993. Springer, Berlin, pp 744\u2013750"},{"key":"306_CR48","doi-asserted-by":"crossref","unstructured":"Ali D, Banerjee S, Jain S, Prasad Y (2025) Fairness driven slot allocation problem in billboard advertisement. arXiv preprint arXiv:2502.05851","DOI":"10.1007\/978-981-96-8173-0_5"},{"key":"306_CR49","unstructured":"New York City Taxi and Limousine Commission (2025) TLC trip record data. Accessed 30 May 2025. https:\/\/www.nyc.gov\/site\/tlc\/about\/tlc-trip-record-data.page"},{"key":"306_CR50","unstructured":"Yang D (2025) Dingqi Yang\u2019s homepage. Accessed 30 May 2025. https:\/\/sites.google.com\/site\/yangdingqi\/home"},{"key":"306_CR51","unstructured":"Lamar Advertising Company (2025) Lamar inventory browser. Accessed 30 May 2025. https:\/\/ib.lamar.com\/app\/"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00306-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00306-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00306-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:41:58Z","timestamp":1765528918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00306-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["306"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00306-w","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"20 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 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 have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}