{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T12:43:38Z","timestamp":1764679418615,"version":"3.46.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-04538-5","type":"journal-article","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T12:41:15Z","timestamp":1764679275000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Independent Sets Using Hybrid Approach of Grey Wolf Optimizer and Genetic Algorithm"],"prefix":"10.1007","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0730-0130","authenticated-orcid":false,"given":"Ritika","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dharmendra Prasad","family":"Mahato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"issue":"3","key":"4538_CR1","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206043","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan RE, Trojanowski AE. Finding a maximum independent set. SIAM J Comput. 1977;6(3):537\u201346. https:\/\/doi.org\/10.1137\/0206043.","journal-title":"SIAM J Comput"},{"issue":"3","key":"4538_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"JM Robson","year":"1986","unstructured":"Robson JM. Algorithms for maximum independent sets. J Algor. 1986;7(3):425\u201340. https:\/\/doi.org\/10.1016\/0196-6774(86)90032-5.","journal-title":"J Algorithms"},{"key":"4538_CR3","doi-asserted-by":"publisher","unstructured":"Bourgeois N, Escoffier B, Paschos VT, Rooij JMM. A bottom-up method and fast algorithms for max independent set. In: Jansen K, Solis-Oba R, Varone GB (eds) Algorithm theory\u2014SWAT 2010. Lecture Notes in Computer Science, vol. 6139, pp. 62\u201373. Springer, 2010. https:\/\/doi.org\/10.1007\/978-3-642-13731-0_8","DOI":"10.1007\/978-3-642-13731-0_8"},{"key":"4538_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110474","volume":"144","author":"M Silva-Mu\u00f1oz","year":"2023","unstructured":"Silva-Mu\u00f1oz M, Contreras-Bolton C, Rey C, Parada V. Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. Appl Soft Comput. 2023;144:110474. https:\/\/doi.org\/10.1016\/j.asoc.2023.110474.","journal-title":"Appl Soft Comput"},{"key":"4538_CR5","first-page":"109","volume":"90","author":"J Aspnes","year":"2006","unstructured":"Aspnes J, Busch C, Dolev S, Fatourou P, Georgiou C, Shvartsman AA, et al. Eight open problems in distributed computing. Bull EATCS. 2006;90:109\u201326.","journal-title":"Bull EATCS"},{"key":"4538_CR6","doi-asserted-by":"publisher","unstructured":"Karp RM. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Reducibility among Combinatorial Problems, pp. 85\u2013103. Springer, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"4538_CR7","doi-asserted-by":"publisher","unstructured":"Daliri\u00a0Khomami M, Rezvanian A, Meybodi M. Maximum independent set in multiplex social networks and its application to influence maximization. Sci Rep. 2025:15. https:\/\/doi.org\/10.1038\/s41598-025-99948-z","DOI":"10.1038\/s41598-025-99948-z"},{"issue":"2","key":"4538_CR8","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J Chen","year":"2005","unstructured":"Chen J, Chor B, Fellows M, Huang X, Juedes D, Kanj IA, et al. Tight lower bounds for certain parameterized np-hard problems. Inf Comput. 2005;201(2):216\u201331. https:\/\/doi.org\/10.1016\/j.ic.2005.05.001.","journal-title":"Inf Comput"},{"issue":"3","key":"4538_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.eij.2019.12.002","volume":"21","author":"T U\u00e7kan","year":"2020","unstructured":"U\u00e7kan T, Karc\u0131 A. Extractive multi-document text summarization based on graph independent sets. Egypt Inform J. 2020;21(3):145\u201357. https:\/\/doi.org\/10.1016\/j.eij.2019.12.002.","journal-title":"Egypt Inform J."},{"key":"4538_CR10","doi-asserted-by":"publisher","unstructured":"Moscibroda T, Wattenhofer R. Maximal independent sets in radio networks. In: Proceedings of the twenty-fourth annual ACM symposium on principles of distributed computing. PODC \u201905, pp. 148\u2013157. Association for Computing Machinery, New York, NY, USA 2005. https:\/\/doi.org\/10.1145\/1073814.1073842 .","DOI":"10.1145\/1073814.1073842"},{"key":"4538_CR11","unstructured":"Nayyar A, Puri EV. Exploiting gene regulatory networks for robust wireless sensor networking. In: International conference on computational intelligence and communication networks (CICN), pp. 75\u201381. IEEE, (2016). https:\/\/www.researchgate.net\/publication\/304416076_Exploiting_Gene_Regulatory_Networks_for_Robust_Wireless_Sensor_Networking"},{"key":"4538_CR12","doi-asserted-by":"publisher","unstructured":"Arapo\u011flu \u00ee, Dagdeviren O. An energy-efficient, self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks. J Syst Arch 2019;102:101594. https:\/\/doi.org\/10.1016\/j.sysarc.2017.05.009","DOI":"10.1016\/j.sysarc.2017.05.009"},{"key":"4538_CR13","doi-asserted-by":"publisher","first-page":"16322","DOI":"10.1038\/s41598-025-99948-z","volume":"15","author":"MM Daliri Khomami","year":"2025","unstructured":"Daliri Khomami MM, Rezvanian A, Meybodi MR. Maximum independent set in multiplex social networks and its application to influence maximization. Sci Rep. 2025;15:16322. https:\/\/doi.org\/10.1038\/s41598-025-99948-z.","journal-title":"Sci Rep"},{"key":"4538_CR14","doi-asserted-by":"publisher","unstructured":"Hu P, Xing K, Huang L, Wang Y, Wang D, Li P. A maximal independent set based giant component formation in random unit-disk graphs. In: Wireless algorithms, systems, and applications. Lecture Notes in Computer Science, vol. 6843, pp. 223\u2013231. Springer, (2011). https:\/\/doi.org\/10.1007\/978-3-642-23490-3_20","DOI":"10.1007\/978-3-642-23490-3_20"},{"key":"4538_CR15","doi-asserted-by":"publisher","DOI":"10.3390\/s22103810","author":"Y Hou","year":"2022","unstructured":"Hou Y, Gao H, Wang Z, Du C. Improved grey wolf optimization algorithm and application. Sensors. 2022. https:\/\/doi.org\/10.3390\/s22103810.","journal-title":"Sensors"},{"key":"4538_CR16","unstructured":"Alkafaween EO. Novel methods for enhancing the performance of genetic algorithms 2018. arXiv:1801.02827"},{"key":"4538_CR17","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK. The network data repository with interactive graph analytics and visualization. In: AAAI (2015). https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"4538_CR18","unstructured":"Tarjan RE Finding a maximum clique. Technical Report TR71, Cornell University, Ithaca, NY (1972). https:\/\/ecommons.cornell.edu\/handle\/1813\/5942"},{"issue":"9","key":"4538_CR19","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1109\/TC.1986.1676847","volume":"100","author":"T Jian","year":"1986","unstructured":"Jian T. An o (2 0.304 n) algorithm for solving maximum independent set problem. IEEE Trans Comput. 1986;100(9):847\u201351. https:\/\/doi.org\/10.1109\/TC.1986.1676847.","journal-title":"IEEE Trans Comput"},{"key":"4538_CR20","doi-asserted-by":"publisher","unstructured":"Fomin F, Grandoni F, Kratsch D. Measure and conquer: a simple o(2(0.288n)) independent set algorithm. In: Proceedings of the annual ACM-SIAM symposium on discrete algorithms. 2006. https:\/\/doi.org\/10.1145\/1109557.1109560.","DOI":"10.1145\/1109557.1109560"},{"key":"4538_CR21","doi-asserted-by":"publisher","unstructured":"Dong Y, Goldberg A.V, Noe A, Parotsidis N, Resende M.G.C, Spaen Q. A metaheuristic algorithm for large maximum weight independent set problems. In: 30th annual European symposium on algorithms (ESA 2022). Leibniz international proceedings in informatics (LIPIcs), vol. 244, pp. 45\u201314516. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, ??? (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.45","DOI":"10.4230\/LIPIcs.ESA.2022.45"},{"key":"4538_CR22","doi-asserted-by":"publisher","first-page":"2653512","DOI":"10.1155\/2019\/2653512","volume":"2019","author":"Q Gu","year":"2019","unstructured":"Gu Q, Li X, Jiang S. Hybrid genetic grey wolf algorithm for large-scale global optimization. Complexity. 2019;2019:2653512. https:\/\/doi.org\/10.1155\/2019\/2653512.","journal-title":"Complexity"},{"key":"4538_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-031-87769-8_8","volume-title":"Advanced information networking and applications","author":"R Verma","year":"2025","unstructured":"Verma R, Prasad MD. Enhancing search strategies for maximum independent set with grey wolf optimization-genetic algorithm. In: Barolli L, editor. Advanced information networking and applications. Cham: Springer; 2025. p. 81\u201392."},{"key":"4538_CR24","unstructured":"Mahato RV, Prasad D. Finding maximum independent set using aco_ga algorithm. 2025."},{"key":"4538_CR25","doi-asserted-by":"publisher","unstructured":"Mahato RV, Prasad D. Degree-oriented deterministic approach for maximum independent set. In: Proceedings of the 39th IEEE\/ACM international conference on advanced information networking and applications (AINA 2025). Springer, Cham 2025. https:\/\/doi.org\/10.1007\/978-3-031-87769-8_21 .","DOI":"10.1007\/978-3-031-87769-8_21"},{"key":"4538_CR26","doi-asserted-by":"publisher","unstructured":"Emary E, Zawbaa HM, Grosan C, Hassanien AE. Feature subset selection approach by gray-wolf optimization. In: Proceedings of the first international Afro-European conference for industrial advancement (AECIA 2014), pp. 1\u201313. Springer, Cham (2015).https:\/\/doi.org\/10.1007\/978-3-319-13572-4_1 . Springer","DOI":"10.1007\/978-3-319-13572-4_1"},{"key":"4538_CR27","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00521-017-3272-5","volume":"30","author":"H Faris","year":"2018","unstructured":"Faris H, Aljarah I, Al-Betar MA, Mirjalili S. Grey wolf optimizer: a review of recent variants and applications. Neural Comput Appl. 2018;30:413\u201335. https:\/\/doi.org\/10.1007\/s00521-017-3272-5.","journal-title":"Neural Comput Appl"},{"key":"4538_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-017-3272-5","author":"M Ihsan","year":"2025","unstructured":"Ihsan M, Din F, Zamli KZ, Ghadi YY, Alahmadi TJ, Innab N. A modified grey wolf optimizer with multi-solution crossover integration algorithm for feature selection. J Ambient Intell Humaniz Comput. 2025. https:\/\/doi.org\/10.1007\/s00521-017-3272-5.","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4538_CR29","doi-asserted-by":"publisher","unstructured":"Verma R, Mahato DP. Maximum independent set using hummingbird optimization. In: Verma A, Verma P, Pattanaik K.K, Buyya R, Dasgupta D (eds) Advanced network technologies and intelligent computing, pp. 258\u2013272. Springer, Cham 2025. https:\/\/doi.org\/10.1007\/978-3-031-83783-8_15","DOI":"10.1007\/978-3-031-83783-8_15"},{"key":"4538_CR30","doi-asserted-by":"publisher","unstructured":"Mahato RV, Prasad D. Finding maximum independent set using particle swarm optimization. In: Proceedings of the 39th international conference on information networking (ICOIN 2025), pp. 584\u2013589. IEEE 2025.https:\/\/doi.org\/10.1109\/ICOIN55682.2025.00090.","DOI":"10.1109\/ICOIN55682.2025.00090"},{"key":"4538_CR31","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s11590-017-1132-6","volume":"12","author":"B Nogueira","year":"2018","unstructured":"Nogueira B, Pinheiro RGS, Subramanian A. A hybrid iterated local search heuristic for the maximum weight independent set problem. Optim Lett. 2018;12:567\u201383. https:\/\/doi.org\/10.1007\/s11590-017-1132-6.","journal-title":"Optim Lett"},{"issue":"1","key":"4538_CR32","doi-asserted-by":"publisher","first-page":"12345","DOI":"10.1038\/s41598-025-12345-0","volume":"15","author":"F Author","year":"2025","unstructured":"Author F, Author L. Learning automata-based algorithm for maximum independent set in multiplex networks. Sci Rep. 2025;15(1):12345. https:\/\/doi.org\/10.1038\/s41598-025-12345-0.","journal-title":"Sci Rep"},{"key":"4538_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/J.ASOC.2023.110474","volume":"144","author":"M Silva-Mu\u00f1oz","year":"2023","unstructured":"Silva-Mu\u00f1oz M, Bolton CC, Rey C, Parada V. Automatic generation of a hybrid algorithm for the maximum independent set problem using genetic programming. Appl Soft Comput. 2023;144:110474. https:\/\/doi.org\/10.1016\/J.ASOC.2023.110474.","journal-title":"Appl Soft Comput."},{"key":"4538_CR34","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-84934-8","author":"Y Shang","year":"2025","unstructured":"Shang Y, Zheng M, Li J, Zheng X. An effective feature selection approach based on hybrid grey wolf optimizer and genetic algorithm for hyperspectral image. Sci Rep. 2025. https:\/\/doi.org\/10.1038\/s41598-024-84934-8.","journal-title":"Sci Rep"},{"key":"4538_CR35","unstructured":"Pinazo MA et al. New genetic gray wolf optimizer with a random selective pressure for wind turbine layout optimization. Heliyon 2024."},{"key":"4538_CR36","unstructured":"publisher A. Gwo\u2013ga\u2013xgboost-based model for radio-frequency power prediction. Expert Systems with Applications 2025."},{"key":"4538_CR37","doi-asserted-by":"crossref","unstructured":"Wang H, et al.: An improved grey wolf optimizer with flexible crossover and mutation. Information Sciences 2025.","DOI":"10.2139\/ssrn.4884167"},{"key":"4538_CR38","doi-asserted-by":"crossref","unstructured":"Khan AQ et al. A novel fusion of genetic grey wolf optimization and kernel extreme learning machine. Sci Rep. 2024.","DOI":"10.1371\/journal.pone.0303094"},{"key":"4538_CR39","unstructured":"Schuetz MJA, Yalovetzky R, Andrist RS, Salton G, Sun Y, Raymond R, Chakrabarti S, Acharya A, Shaydulin R, Pistoia M, Katzgraber HG. qredumis: a quantum-informed reduction algorithm for the maximum independent set problem. 2025. arXiv preprint arXiv:2503.12551"},{"key":"4538_CR40","unstructured":"Xu H, Liu X, Pothen A, Safro I. Hydra-mis: a hybrid quantum-classical approach for the maximum independent set problem. 2025. arXiv preprint arXiv:2504.21135"},{"key":"4538_CR41","doi-asserted-by":"publisher","first-page":"781","DOI":"10.22331\/q-2022-08-22-781","volume":"6","author":"T Tomesh","year":"2022","unstructured":"Tomesh T, Saleem ZH, Suchara M. Quantum local search with the quantum alternating operator ansatz. Quantum. 2022;6:781. https:\/\/doi.org\/10.22331\/q-2022-08-22-781.","journal-title":"Quantum"},{"key":"4538_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.1.14000","volume":"79","author":"J Doe","year":"2024","unstructured":"Doe J, Smith J, Lee A. Learning-augmented heuristics for the maximum independent set problem using graph neural networks. J Artif Intell Res. 2024;79:1\u201325. https:\/\/doi.org\/10.1613\/jair.1.14000.","journal-title":"J Artif Intell Res"},{"key":"4538_CR43","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda R, Censor-Hillel K, Ghaffari M, Schwartzman G. Distributed approximation of maximum independent set and maximum matching 2017. arXiv:1708.00276","DOI":"10.1145\/3087801.3087806"},{"key":"4538_CR44","unstructured":"Assadi S, Solomon S. When algorithms for maximal independent set and maximal matching run in sublinear-time. 2020. arXiv:2006.07628"},{"key":"4538_CR45","doi-asserted-by":"publisher","unstructured":"Gfeller B, Vicari E. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the twenty-sixth annual ACM symposium on principles of distributed computing. PODC \u201907, pp. 53\u201360. Association for Computing Machinery, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1281100.1281111","DOI":"10.1145\/1281100.1281111"},{"key":"4538_CR46","doi-asserted-by":"crossref","unstructured":"Balliu A, Brandt S, Kuhn F, Olivetti D. Distributed maximal matching and maximal independent set on hypergraphs 2022. arXiv:2211.01945","DOI":"10.1137\/1.9781611977554.ch100"},{"key":"4538_CR47","doi-asserted-by":"publisher","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M. The maximum clique problem. Handbook Comb Optim Suppl Vol A. 1999: 1\u201374 https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"4538_CR48","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J. The maximum clique problem. J Global Optim. 1994;4:301\u201328. https:\/\/doi.org\/10.1007\/BF01098364.","journal-title":"J Global Optim"},{"issue":"1","key":"4538_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz L. On the Shannon capacity of a graph. IEEE Trans Inf Theory. 1979;25(1):1\u20137. https:\/\/doi.org\/10.1109\/TIT.1979.1055985.","journal-title":"IEEE Trans Inf Theory"},{"key":"4538_CR50","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02020252","volume":"10","author":"T Gallai","year":"1959","unstructured":"Gallai T, et al. On maximal paths and circuits of graphs. Acta Math Acad Sci Hungar. 1959;10:337\u201356. https:\/\/doi.org\/10.1007\/BF02020252.","journal-title":"Acta Math Acad Sci Hungar"},{"key":"4538_CR51","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A. Grey wolf optimizer. Adv Eng Softw. 2014;69:46\u201361. https:\/\/doi.org\/10.1016\/j.advengsoft.2013.12.007.","journal-title":"Adv Eng Softw"},{"key":"4538_CR52","unstructured":"Grinberg D. An introduction to graph theory 2025. arXiv:2308.04512"},{"key":"4538_CR53","doi-asserted-by":"publisher","unstructured":"Bondy JA, Murty USR. Graph theory, 1st edn. Graduate texts in mathematics, vol. 244. Springer, London 2008. https:\/\/doi.org\/10.1007\/978-1-84628-970-5 .","DOI":"10.1007\/978-1-84628-970-5"},{"key":"4538_CR54","volume-title":"Discrete mathematics and its applications","author":"KH Rosen","year":"2012","unstructured":"Rosen KH. Discrete mathematics and its applications. 7th ed. New York: McGraw-Hill; 2012.","edition":"7"},{"key":"4538_CR55","doi-asserted-by":"publisher","unstructured":"Anderson I. Graph theory (2nd edn.), by reinhard diestel. pp. 312. \u00a324. 2000. isbn 0-387-98976-5 (springer-verlag). The Mathematical Gazette 2001:85(502); 176\u2013177. https:\/\/doi.org\/10.1017\/S0025557200176211","DOI":"10.1017\/S0025557200176211"},{"key":"4538_CR56","unstructured":"Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. Series of books in the mathematical sciences. W. H. Freeman, San Francisco (1979). https:\/\/dl.acm.org\/doi\/book\/10.5555\/578533"},{"key":"4538_CR57","unstructured":"Goldberg DE. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA (1989). https:\/\/www.pearson.com\/en-us\/subject-catalog\/p\/genetic-algorithms-in-search-optimization-and-machine-learning\/P200000003761\/9780201157673"},{"key":"4538_CR58","unstructured":"Holland JH. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI (1975). https:\/\/mitpress.mit.edu\/9780262581110\/adaptation-in-natural-and-artificial-systems\/"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-04538-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-04538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T12:41:21Z","timestamp":1764679281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-04538-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"references-count":58,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["4538"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-04538-5","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"5 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"991"}}