{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T19:28:44Z","timestamp":1778354924336,"version":"3.51.4"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN Project AHeAD"],"award-info":[{"award-number":["PRIN Project AHeAD"]}],"id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Inferring tie strengths in social networks is an essential task in social network analysis. Common approaches classify the ties as <jats:italic>weak<\/jats:italic> and <jats:italic>strong<\/jats:italic> ties based on the <jats:italic>strong triadic closure (STC)<\/jats:italic>. The STC states that if for three nodes, <jats:italic>A<\/jats:italic>, <jats:italic>B<\/jats:italic>, and <jats:italic>C<\/jats:italic>, there are strong ties between <jats:italic>A<\/jats:italic> and <jats:italic>B<\/jats:italic>, as well as <jats:italic>A<\/jats:italic> and <jats:italic>C<\/jats:italic>, there has to be a (weak or strong) tie between <jats:italic>B<\/jats:italic> and <jats:italic>C<\/jats:italic>. A variant of the STC called STC+ allows adding a few new weak edges to obtain improved solutions. So far, most works discuss the STC or STC+ in static networks. However, modern large-scale social networks are usually highly dynamic, providing user contacts and communications as streams of edge updates. <jats:italic>Temporal networks<\/jats:italic> capture these dynamics. To apply the STC to temporal networks, we first generalize the STC and introduce a weighted version such that empirical a priori knowledge given in the form of edge weights is respected by the STC. Similarly, we introduce a generalized weighted version of the STC+. The weighted STC is hard to compute, and our main contribution is an efficient 2-approximation (resp.\u00a03-approximation) streaming algorithm for the weighted STC (resp.\u00a0STC+) in temporal networks. As a technical contribution, we introduce a fully dynamic <jats:italic>k<\/jats:italic>-approximation for the minimum weighted vertex cover problem in hypergraphs with edges of size <jats:italic>k<\/jats:italic>, which is a crucial component of our streaming algorithms. An empirical evaluation shows that the weighted STC leads to solutions that better capture the a priori knowledge given by the edge weights than the non-weighted STC. Moreover, we show that our streaming algorithm efficiently approximates the weighted STC in real-world large-scale social networks.<\/jats:p>","DOI":"10.1007\/s10618-025-01093-8","type":"journal-article","created":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T07:16:33Z","timestamp":1740813393000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Inferring tie strength in temporal networks"],"prefix":"10.1007","volume":"39","author":[{"given":"Lutz","family":"Oettershagen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios L.","family":"Konstantinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,1]]},"reference":[{"key":"1093_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-020-00673-0","volume":"34","author":"F Adriaens","year":"2020","unstructured":"Adriaens F, De Bie T, Gionis A et al (2020) Relaxing the strong triadic closure problem for edge strength inference. Data Min Knowl Discov 34:1\u201341","journal-title":"Data Min Knowl Discov"},{"key":"1093_CR2","doi-asserted-by":"crossref","unstructured":"Ahmadian S, Haddadan S (2020) A theoretical analysis of graph evolution caused by triadic closure and algorithmic implications. In: 2020 IEEE International Conference on Big Data (Big Data), IEEE, pp 5\u201314","DOI":"10.1109\/BigData50022.2020.9378434"},{"issue":"2","key":"1093_CR3","first-page":"198","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda R, Even S (1981) A linear-time approximation algorithm for the weighted vertex cover problem. J Algoritm 2(2):198\u2013203","journal-title":"J Algoritm"},{"issue":"3","key":"1093_CR4","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/140998925","volume":"47","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya S, Henzinger M, Italiano GF (2018) Deterministic fully dynamic data structures for vertex cover and matching. SIAM J Comput 47(3):859\u2013887","journal-title":"SIAM J Comput"},{"key":"1093_CR5","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/41\/22\/224015","volume":"41","author":"J Candia","year":"2008","unstructured":"Candia J, Gonz\u00e1lez MC, Wang P et al (2008) Uncovering individual and collective human dynamics from mobile phone records. J phys A: Math Theor 41:224015","journal-title":"J phys A: Math Theor"},{"key":"1093_CR6","unstructured":"Chen J, Molter H, Sorge M, et\u00a0al (2018) Cluster editing in multi-layer and temporal graphs. In: 29th International Symposium on Algorithms and Computation, ISAAC, Schloss Dagstuhl\u2013LZI, pp 24:1\u201324:13"},{"issue":"1","key":"1093_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-69464-3","volume":"10","author":"M Ciaperoni","year":"2020","unstructured":"Ciaperoni M, Galimberti E, Bonchi F et al (2020) Relevance of temporal cores for epidemic spread in temporal networks. Sci Rep 10(1):1\u201315","journal-title":"Sci Rep"},{"key":"1093_CR8","doi-asserted-by":"crossref","unstructured":"Easley DA, Kleinberg JM (2010) Networks, Crowds, and Markets - Reasoning About a Highly Connected World","DOI":"10.1017\/CBO9780511761942"},{"issue":"40","key":"1093_CR9","doi-asserted-by":"publisher","first-page":"14333","DOI":"10.1073\/pnas.0405728101","volume":"101","author":"JP Eckmann","year":"2004","unstructured":"Eckmann JP, Moses E, Sergi D (2004) Entropy of dialogues creates coherent structures in e-mail traffic. Proc Natl Acad Sci 101(40):14333\u201314337","journal-title":"Proc Natl Acad Sci"},{"issue":"1\u20132","key":"1093_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai T (1967) Transitiv orientierbare graphen. Acta Math Hung 18(1\u20132):25\u201366","journal-title":"Acta Math Hung"},{"issue":"1","key":"1093_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois M, Barrat A (2018) Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci 7(1):11","journal-title":"EPJ Data Sci"},{"key":"1093_CR12","doi-asserted-by":"crossref","unstructured":"Gilbert E, Karahalios K (2009) Predicting tie strength with social media. In: Proceedings of the 27th International Conference on Human Factors in Computing Systems, CHI, ACM, pp 211\u2013220","DOI":"10.1145\/1518701.1518736"},{"key":"1093_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert E, Karahalios K, Sandvig C (2008) The network in the garden: an empirical analysis of social media in rural life. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp 1603\u20131612","DOI":"10.1145\/1357054.1357304"},{"key":"1093_CR14","first-page":"1260","volume":"2024","author":"A Gionis","year":"2024","unstructured":"Gionis A, Oettershagen L, Sarpe I (2024) Mining temporal networks. Companion Proc ACM on Web Conf 2024:1260\u20131263","journal-title":"Companion Proc ACM on Web Conf"},{"issue":"6","key":"1093_CR15","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1086\/225469","volume":"78","author":"MS Granovetter","year":"1973","unstructured":"Granovetter MS (1973) The strength of weak ties. Am J Soc 78(6):1360\u20131380","journal-title":"Am J Soc"},{"key":"1093_CR16","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00453-019-00617-1","volume":"82","author":"N Gr\u00fcttemeier","year":"2020","unstructured":"Gr\u00fcttemeier N, Komusiewicz C (2020) On the relation of strong triadic closure and cluster deletion. Algorithmica 82:853\u2013880","journal-title":"Algorithmica"},{"key":"1093_CR17","doi-asserted-by":"crossref","unstructured":"Hanneke S, Xing EP (2006) Discrete temporal models of social networks. In: ICML Workshop on Statistical Network Analysis, Springer, pp 115\u2013125","DOI":"10.1007\/978-3-540-73133-7_9"},{"key":"1093_CR18","doi-asserted-by":"crossref","unstructured":"Hessel J, Tan C, Lee L (2016) Science, askscience, and badscience: On the coexistence of highly related communities. In: Proceedings of the International AAAI Conference on Web and Social Media, pp 171\u2013180","DOI":"10.1609\/icwsm.v10i1.14739"},{"key":"1093_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"A Himmel","year":"2017","unstructured":"Himmel A, Molter H, Niedermeier R et al (2017) Adapting the bron-kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc Netw Anal Min 7:1\u201316","journal-title":"Soc Netw Anal Min"},{"issue":"3","key":"1093_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125","journal-title":"Phys Rep"},{"issue":"2","key":"1093_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.socnet.2004.01.007","volume":"26","author":"P Holme","year":"2004","unstructured":"Holme P, Edling CR, Liljeros F (2004) Structure and time evolution of an internet dating community. Soc Net 26(2):155\u2013174","journal-title":"Soc Net"},{"key":"1093_CR22","first-page":"499","volume-title":"23rd International World Wide Web Conference","author":"H Huang","year":"2014","unstructured":"Huang H, Tang J, Wu S et al (2014) Mining triadic closure patterns in social networks. 23rd International World Wide Web Conference. ACM, WWW, pp 499\u2013504"},{"key":"1093_CR23","doi-asserted-by":"crossref","unstructured":"Kahanda I, Neville J (2009) Using transactional information to predict link strength in online social networks. In: Proceedings of the International AAAI Conference on Web and Social Media, pp 74\u201381","DOI":"10.1609\/icwsm.v3i1.13957"},{"issue":"4","key":"1093_CR24","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe D, Kleinberg JM, Kumar A (2002) Connectivity and inference problems for temporal networks. J Comput Syst Sci 64(4):820\u2013842","journal-title":"J Comput Syst Sci"},{"key":"1093_CR25","unstructured":"Kleinberg J, Tardos E (2006) Algorithm design"},{"key":"1093_CR26","doi-asserted-by":"crossref","unstructured":"Klimt B, Yang Y (2004) The Enron corpus: A new dataset for email classification research. In: European Conf. on Machine Learning, Springer, pp 217\u2013226","DOI":"10.1007\/978-3-540-30115-8_22"},{"key":"1093_CR27","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2020.05.035","volume":"285","author":"AL Konstantinidis","year":"2020","unstructured":"Konstantinidis AL, Papadopoulos C (2020) Maximizing the strong triadic closure in split graphs and proper interval graphs. Discret Appl Math 285:79\u201395","journal-title":"Discret Appl Math"},{"key":"1093_CR28","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2018.05.012","volume":"740","author":"AL Konstantinidis","year":"2018","unstructured":"Konstantinidis AL, Nikolopoulos SD, Papadopoulos C (2018) Strong triadic closure in cographs and graphs of low maximum degree. Theor Comput Sci 740:76\u201384","journal-title":"Theor Comput Sci"},{"issue":"5757","key":"1093_CR29","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets G, Watts DJ (2006) Empirical analysis of an evolving social network. Science 311(5757):88\u201390","journal-title":"Science"},{"key":"1093_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy M, Viard T, Magnien C (2018) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Min 8:1\u201329","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"1093_CR31","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1177\/004912417800700203","volume":"7","author":"N Lin","year":"1978","unstructured":"Lin N, Dayton PW, Greenwald P (1978) Analyzing the instrumental use of relations in the context of social structure. Sociol Method Res 7(2):149\u2013166","journal-title":"Sociol Method Res"},{"key":"1093_CR32","doi-asserted-by":"crossref","unstructured":"Liu P, Benson AR, Charikar M (2019) Sampling methods for counting temporal motifs. In: Proceedings of the twelfth ACM international conference on web search and data mining, pp 294\u2013302","DOI":"10.1145\/3289600.3290988"},{"issue":"1","key":"1093_CR33","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s10618-021-00812-1","volume":"36","author":"A Matakos","year":"2022","unstructured":"Matakos A, Gionis A (2022) Strengthening ties towards a highly-connected world. Data Min Knowl Discov 36(1):448\u2013476","journal-title":"Data Min Knowl Discov"},{"issue":"4","key":"1093_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail O (2016) An introduction to temporal graphs: an algorithmic perspective. Internet Math 12(4):239\u2013280","journal-title":"Internet Math"},{"key":"1093_CR35","doi-asserted-by":"crossref","unstructured":"Mislove A, Marcon M, Gummadi KP, et\u00a0al (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":"10","key":"1093_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.114.108701","volume":"114","author":"A Moinet","year":"2015","unstructured":"Moinet A, Starnini M, Pastor-Satorras R (2015) Burstiness and aging in social temporal networks. Phys Rev Lett 114(10):108701","journal-title":"Phys Rev Lett"},{"issue":"5","key":"1093_CR37","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1089\/big.2020.0086","volume":"8","author":"L Oettershagen","year":"2020","unstructured":"Oettershagen L, Kriege NM, Morris C et al (2020) Classifying dissemination processes in temporal graphs. Big Data 8(5):363\u2013378","journal-title":"Big Data"},{"key":"1093_CR38","doi-asserted-by":"crossref","unstructured":"Oettershagen L, Konstantinidis AL, Italiano GF (2022) Inferring tie strength in temporal networks. In: Machine Learning and Principles and Practice of Knowledge Discovery in Databases ECMLPKDD","DOI":"10.1007\/978-3-031-26390-3_5"},{"issue":"1","key":"1093_CR39","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1140\/epjds\/s13688-021-00302-w","volume":"10","author":"L Ozella","year":"2021","unstructured":"Ozella L, Paolotti D, Lichand G et al (2021) Using wearable proximity sensors to characterize social contact patterns in a village of rural malawi. EPJ Data Sci 10(1):46","journal-title":"EPJ Data Sci"},{"key":"1093_CR40","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the tenth ACM international conference on web search and data mining, pp 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"key":"1093_CR41","doi-asserted-by":"crossref","unstructured":"Pham H, Shahabi C, Liu Y (2016) Inferring social strength from spatiotemporal data. ACM Trans Database Syst 41(1):7:1\u20137:47","DOI":"10.1145\/2877200"},{"issue":"8","key":"1093_CR42","doi-asserted-by":"publisher","first-page":"1927","DOI":"10.1007\/s11590-018-1330-2","volume":"13","author":"A Pyatkin","year":"2019","unstructured":"Pyatkin A, Lykhovyd E, Butenko S (2019) The maximum number of induced open triangles in graphs of a given order. Optim Lett 13(8):1927\u20131935","journal-title":"Optim Lett"},{"key":"1093_CR43","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI, https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"1093_CR44","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A (2019) Mining temporal networks. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 3225\u20133226","DOI":"10.1145\/3292500.3332295"},{"key":"1093_CR45","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Tatti N, Gionis A (2017) Inferring the strength of social ties: A community-driven approach. In: Proc. of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp 1017\u20131025","DOI":"10.1145\/3097983.3098199"},{"key":"1093_CR46","doi-asserted-by":"crossref","unstructured":"Sintos S, Tsaparas P (2014) Using strong triadic closure to characterize ties in social networks. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1466\u20131475","DOI":"10.1145\/2623330.2623664"},{"issue":"8","key":"1093_CR47","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A et al (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PloS One 6(8):e23176","journal-title":"PloS One"},{"key":"1093_CR48","first-page":"1236","volume-title":"11th IEEE International Conference on Data Mining","author":"C Tantipathananandh","year":"2011","unstructured":"Tantipathananandh C, Berger-Wolf TY (2011) Finding communities in dynamic social networks. 11th IEEE International Conference on Data Mining. IEEE Computer Society, ICDM, pp 1236\u20131241"},{"key":"1093_CR49","unstructured":"Veldt N (2022) Correlation clustering via strong triadic closure labeling: Fast approximation algorithms and practical lower bounds. In: International Conference on Machine Learning, PMLR, pp 22,060\u201322,083"},{"key":"1093_CR50","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard T, Latapy M, Magnien C (2016) Computing maximal cliques in link streams. Theor Comput Sci 609:245\u2013252","journal-title":"Theor Comput Sci"},{"key":"1093_CR51","unstructured":"Wei HT, Hon WK, Horn P, et\u00a0al (2018) An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity. In: Approx., Random., and Combinatorial Opt. Algor. and Techniques (APPROX\/RANDOM 2018), Schloss Dagstuhl\u2013LZI, pp 27:1\u201327:14"},{"issue":"8","key":"1093_CR52","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TKDE.2016.2556663","volume":"28","author":"B Wu","year":"2016","unstructured":"Wu B, Yi K, Li Z (2016) Counting triangles in large graphs by random sampling. IEEE Trans Know Data Eng 28(8):2013\u20132026","journal-title":"IEEE Trans Know Data Eng"},{"key":"1093_CR53","doi-asserted-by":"crossref","unstructured":"Xiang R, Neville J, Rogati M (2010) Modeling relationship strength in online social networks. In: Proceedings of the 19th International Conference on World Wide Web, WWW, ACM, pp 981\u2013990","DOI":"10.1145\/1772690.1772790"},{"key":"1093_CR54","doi-asserted-by":"crossref","unstructured":"Zhou L, Yang Y, Ren X, et\u00a0al (2018) Dynamic network embedding by modeling triadic closure process. In: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, AAAI Press, pp 571\u2013578","DOI":"10.1609\/aaai.v32i1.11257"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01093-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-025-01093-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-025-01093-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T02:48:46Z","timestamp":1741574926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-025-01093-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1093"],"URL":"https:\/\/doi.org\/10.1007\/s10618-025-01093-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"9 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 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 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"}}],"article-number":"16"}}