{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:30:08Z","timestamp":1770064208228,"version":"3.49.0"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"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":["World Wide Web"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11280-024-01253-8","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T14:02:51Z","timestamp":1708351371000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sampling hypergraphs via joint unbiased random walk"],"prefix":"10.1007","volume":"27","author":[{"given":"Qi","family":"Luo","sequence":"first","affiliation":[]},{"given":"Zhenzhen","family":"Xie","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"issue":"5","key":"1253_CR1","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00778-021-00669-2","volume":"30","author":"Y Shao","year":"2021","unstructured":"Shao, Y., Huang, S., Li, Y., Miao, X., Cui, B., Chen, L.: Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs. VLDB J. 30(5), 769\u2013797 (2021)","journal-title":"VLDB J."},{"key":"1253_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, N.K., Duffield, N.G., Neville, J., Kompella, R.R.: Graph sample and hold: a framework for big-graph analytics. In: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201914, New York, USA - August 24 - 27, 2014, pp. 1446\u20131455 (2014)","DOI":"10.1145\/2623330.2623757"},{"issue":"4","key":"1253_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/3524105","volume":"55","author":"Y Cui","year":"2023","unstructured":"Cui, Y., Li, X., Li, J., Wang, H., Chen, X.: A survey of sampling method for social media embeddedness relationship. ACM Comput. Surv. 55(4), 74\u201317439 (2023)","journal-title":"ACM Comput. Surv."},{"issue":"15","key":"1253_CR4","doi-asserted-by":"publisher","first-page":"4284","DOI":"10.1016\/j.comnet.2007.06.004","volume":"51","author":"V Krishnamurthy","year":"2007","unstructured":"Krishnamurthy, V., Faloutsos, M., Chrobak, M., Cui, J., Lao, L., Percus, A.G.: Sampling large internet topologies for simulation purposes. Comput. Networks 51(15), 4284\u20134302 (2007)","journal-title":"Comput. Networks"},{"issue":"4","key":"1253_CR5","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TCSS.2019.2921422","volume":"6","author":"W Tang","year":"2019","unstructured":"Tang, W., Luo, G., Wu, Y., Tian, L., Zheng, X., Cai, Z.: A second-order diffusion model for influence maximization in social networks. IEEE Trans. Comput. Soc. Syst. 6(4), 702\u2013714 (2019)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"2","key":"1253_CR6","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/TVCG.2020.3030428","volume":"27","author":"Y Zhao","year":"2021","unstructured":"Zhao, Y., Jiang, H., Chen, Q., Qin, Y., Xie, H., Wu, Y., Liu, S., Zhou, Z., Xia, J., Zhou, F.: Preserving minority structures in graph sampling. IEEE Trans. Vis. Comput. Graph. 27(2), 1698\u20131708 (2021)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"1253_CR7","unstructured":"Chen, J., Ma, T., Xiao, C.: Fastgcn: Fast learning with graph convolutional networks via importance sampling. In: 6th International Conference on Learning Representations, ICLR (2018)"},{"key":"1253_CR8","doi-asserted-by":"crossref","unstructured":"Nakajima, K., Shudo, K.: Social graph restoration via random walk sampling. In: 38th IEEE International Conference on Data Engineering, ICDE, pp. 1\u201314 (2022)","DOI":"10.1109\/ICDE53745.2022.00065"},{"key":"1253_CR9","doi-asserted-by":"crossref","unstructured":"Xu, X., Lee, C., Eun, D.Y.: Challenging the limits: Sampling online social networks with cost constraints. In: IEEE Conference on Computer Communications, INFOCOM, pp. 1\u20139 (2017)","DOI":"10.1109\/INFOCOM.2017.8057169"},{"issue":"1","key":"1253_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42005-021-00710-4","volume":"4","author":"F Musciotto","year":"2021","unstructured":"Musciotto, F., Battiston, F., Mantegna, R.N.: Detecting informative higher-order interactions in statistically validated hypergraphs. Commun. Phys. 4(1), 1\u20139 (2021)","journal-title":"Commun. Phys."},{"issue":"1","key":"1253_CR11","doi-asserted-by":"publisher","first-page":"3200","DOI":"10.1126\/sciadv.abq3200","volume":"9","author":"N Veldt","year":"2023","unstructured":"Veldt, N., Benson, A.R., Kleinberg, J.: Combinatorial characterizations and impossibilities for higher-order homophily. Sci. Adv. 9(1), 3200 (2023)","journal-title":"Sci. Adv."},{"issue":"23","key":"1253_CR12","doi-asserted-by":"publisher","first-page":"9679","DOI":"10.1073\/pnas.1019641108","volume":"108","author":"E Ganmor","year":"2011","unstructured":"Ganmor, E., Segev, R., Schneidman, E.: Sparse low-order interaction network underlies a highly correlated and learnable neural population code. Proc. Natl. Acad. Sci. 108(23), 9679\u20139684 (2011)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"11","key":"1253_CR13","doi-asserted-by":"publisher","first-page":"2256","DOI":"10.14778\/3407790.3407823","volume":"13","author":"G Lee","year":"2020","unstructured":"Lee, G., Ko, J., Shin, K.: Hypergraph motifs: Concepts, algorithms, and discoveries. Proc. VLDB Endow. 13(11), 2256\u20132269 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"1253_CR14","doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. In: Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, pp. 1601\u20131608 (2006)","DOI":"10.7551\/mitpress\/7503.003.0205"},{"key":"1253_CR15","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Huang, Y., Ren, X.-L., Lu, L.: Identifying vital nodes through augmented random walks on higher-order networks (2023)","DOI":"10.1016\/j.ins.2024.121067"},{"key":"1253_CR16","doi-asserted-by":"crossref","unstructured":"Choe, M., Yoo, J., Lee, G., Baek, W., Kang, U., Shin, K.: MiDaS: Representative Sampling from Real-world Hypergraphs. In: Proceedings of the ACM Web Conference 2022. WWW \u201922, pp. 1080\u20131092 (2022)","DOI":"10.1145\/3485447.3512157"},{"key":"1253_CR17","unstructured":"Chitra, U., Raphael, B.: Random Walks on Hypergraphs with Edge-Dependent Vertex Weights. In: Proceedings of the 36th International Conference on Machine Learning, pp. 1172\u20131181 (2019)"},{"key":"1253_CR18","doi-asserted-by":"crossref","unstructured":"Hayashi, K., Aksoy, S.G., Park, C.H., Park, H.: Hypergraph random walks, laplacians, and clustering. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management. CIKM \u201920, pp. 495\u2013504, New York, NY, USA (2020)","DOI":"10.1145\/3340531.3412034"},{"issue":"11","key":"1253_CR19","doi-asserted-by":"publisher","first-page":"112566","DOI":"10.1016\/j.disc.2021.112566","volume":"344","author":"M Dyer","year":"2021","unstructured":"Dyer, M., Greenhill, C., Kleer, P., Ross, J., Stougie, L.: Sampling hypergraphs with given degrees. Discrete Math. 344(11), 112566 (2021)","journal-title":"Discrete Math."},{"key":"1253_CR20","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: A case study of unbiased sampling of osns. In: 29th IEEE International Conference on Computer Communications, INFOCOM, pp. 2498\u20132506 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"1253_CR21","unstructured":"Chitra, U., Raphael, B.J.: Random walks on hypergraphs with edge-dependent vertex weights. In: Proceedings of the 36th International Conference on Machine Learning, ICML, vol. 97, pp. 1172\u20131181 (2019)"},{"issue":"2","key":"1253_CR22","doi-asserted-by":"publisher","first-page":"022308","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti, T., Battiston, F., Cencetti, G., Fanelli, D.: Random walks on hypergraphs. Phys. Rev. E 101(2), 022308 (2020)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"1253_CR23","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1140\/epjds\/s13688-020-00231-0","volume":"9","author":"SG Aksoy","year":"2020","unstructured":"Aksoy, S.G., Joslyn, C.A., Marrero, C.O., Praggastis, B., Purvine, E.: Hypernetwork science via high-order hypergraph walks. EPJ Data Sci. 9(1), 16 (2020)","journal-title":"EPJ Data Sci."},{"issue":"1","key":"1253_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1038\/s42005-021-00634-z","volume":"4","author":"A Eriksson","year":"2021","unstructured":"Eriksson, A., Edler, D., Rojas, A., Domenico, M., Rosvall, M.: How choosing random-walk model and network representation matters for flow-based community detection in hypergraphs. Commun. Phys. 4(1), 133 (2021)","journal-title":"Commun. Phys."},{"issue":"1","key":"1253_CR25","doi-asserted-by":"publisher","first-page":"015011","DOI":"10.1088\/2632-072X\/abe27e","volume":"2","author":"T Carletti","year":"2021","unstructured":"Carletti, T., Fanelli, D., Lambiotte, R.: Random walks and community detection in hypergraphs. J. Phys. Complex. 2(1), 015011 (2021)","journal-title":"J. Phys. Complex."},{"issue":"3","key":"1253_CR26","first-page":"2916","volume":"35","author":"H Xie","year":"2023","unstructured":"Xie, H., Yi, P., Li, Y., Lui, J.C.S.: Optimizing random walk based statistical estimation over graphs via bootstrapping. IEEE Trans. Knowl. Data Eng. 35(3), 2916\u20132929 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1253_CR27","unstructured":"Hu, P., Lau, W.C.: A survey and taxonomy of graph sampling. CoRR abs\/1308.5865 (2013)"},{"issue":"2","key":"1253_CR28","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/comnet\/cnx039","volume":"6","author":"S Kirkland","year":"2018","unstructured":"Kirkland, S.: Two-mode networks exhibiting data loss. J. Complex Netw. 6(2), 297\u2013316 (2018)","journal-title":"J. Complex Netw."},{"key":"1253_CR29","unstructured":"Hong, S., Lu, S.: Graph sampling methods for big complex networks integrating centrality, k-core, and spectral sparsification. In: SAC \u201920: The 35th ACM\/SIGAPP Symposium on Applied Computing, pp. 1843\u20131851 (2020)"},{"issue":"7","key":"1253_CR30","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1038\/nbt1116","volume":"23","author":"J-DJ Han","year":"2005","unstructured":"Han, J.-D.J., Dupuy, D., Bertin, N., Cusick, M.E., Vidal, M.: Effect of sampling on topology predictions of protein-protein interaction networks. Nat. Biotechnol 23(7), 839\u2013844 (2005)","journal-title":"Nat. Biotechnol"},{"key":"1253_CR31","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J.M., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 177\u2013187 (2005)","DOI":"10.1145\/1081870.1081893"},{"key":"1253_CR32","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"1253_CR33","doi-asserted-by":"crossref","unstructured":"Yousuf, M.I., Anwer, I., Anwar, R.: Empirical characterization of graph sampling algorithms. CoRR abs\/2102.07980 (2021)","DOI":"10.21203\/rs.3.rs-1710509\/v1"},{"issue":"1865","key":"1253_CR34","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1038\/072294b0","volume":"72","author":"K Pearson","year":"1905","unstructured":"Pearson, K.: The problem of the random walk. Nature 72(1865), 294\u2013294 (1905)","journal-title":"Nature"},{"key":"1253_CR35","doi-asserted-by":"crossref","unstructured":"Jin, L., Chen, Y., Hui, P., Ding, C., Wang, T., Vasilakos, A.V., Deng, B., Li, X.: Albatross sampling: robust and effective hybrid vertex sampling for social graphs. In: Proceedings of the 3rd ACM International Workshop on Hot Topics in Planet-scale Measurement, pp. 11\u201316 (2011)","DOI":"10.1145\/2000172.2000178"},{"key":"1253_CR36","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: A case study of unbiased sampling of osns. In: INFOCOM 2010. 29th IEEE International Conference on Computer Communications, pp. 2498\u20132506 (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"1253_CR37","doi-asserted-by":"crossref","unstructured":"Ribeiro, B.F., Towsley, D.F.: Estimating and sampling graphs with multidimensional random walks. In: Proceedings of the 10th ACM SIGCOMM Internet Measurement Conference, pp. 390\u2013403 (2010)","DOI":"10.1145\/1879141.1879192"},{"issue":"10","key":"1253_CR38","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.14778\/2794367.2794373","volume":"8","author":"Z Zhou","year":"2015","unstructured":"Zhou, Z., Zhang, N., Das, G.: Leveraging history for faster sampling of online social networks. Proc. VLDB Endow. 8(10), 1034\u20131045 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"1253_CR39","first-page":"4570","volume":"35","author":"R Wang","year":"2023","unstructured":"Wang, R., Li, Y., Lin, S., Wu, W., Xie, H., Xu, Y., Lui, J.C.S.: Common neighbors matter: Fast random walk sampling with common neighbor awareness. IEEE Trans. Knowl. Data Eng. 35(5), 4570\u20134584 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1253_CR40","doi-asserted-by":"crossref","unstructured":"Li, Y., Wu, Z., Lin, S., Xie, H., Lv, M., Xu, Y., Lui, J.C.S.: Walking with perception: Efficient random walk sampling via common neighbor awareness. In: 35th IEEE International Conference on Data Engineering, ICDE, pp. 962\u2013973 (2019)","DOI":"10.1109\/ICDE.2019.00090"},{"issue":"10\u201311","key":"1253_CR41","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1016\/j.patcog.2010.07.014","volume":"44","author":"Q Liu","year":"2011","unstructured":"Liu, Q., Huang, Y., Metaxas, D.N.: Hypergraph with sampling for image retrieval. Pattern Recognit. 44(10\u201311), 2255\u20132262 (2011)","journal-title":"Pattern Recognit."},{"issue":"4","key":"1253_CR42","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1002\/rsa.21126","volume":"62","author":"F Joos","year":"2023","unstructured":"Joos, F., Kim, J., K\u00fchn, D., Osthus, D.: Hypergraph regularity and random sampling. Random Struct. Algorithms 62(4), 956\u20131015 (2023)","journal-title":"Random Struct. Algorithms"},{"issue":"5","key":"1253_CR43","doi-asserted-by":"publisher","first-page":"3503","DOI":"10.1007\/s11280-023-01199-3","volume":"26","author":"X Xie","year":"2023","unstructured":"Xie, X., Shi, S., Wang, H., Li, M.: SAT: sampling acceleration tree for adaptive database repartition. World Wide Web (WWW) 26(5), 3503\u20133533 (2023)","journal-title":"World Wide Web (WWW)"},{"key":"1253_CR44","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2013.01.020","volume":"509","author":"C Cooper","year":"2013","unstructured":"Cooper, C., Frieze, A., Radzik, T.: The cover times of random walks on random uniform hypergraphs. Theor. Comput. Sci. 509, 51\u201369 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"1253_CR45","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(77)90127-3","volume":"18","author":"J Bermond","year":"1977","unstructured":"Bermond, J., Heydemann, M., Sotteau, D.: Line graphs of hypergraphs I. Discret. Math. 18(3), 235\u2013241 (1977)","journal-title":"Discret. Math."},{"key":"1253_CR46","doi-asserted-by":"crossref","unstructured":"Lu, L., Peng, X.: High-ordered random walks and generalized laplacians on hypergraphs. In: Algorithms and Models for the Web Graph - 8th International Workshop, WAW. Lecture Notes in Computer Science, vol. 6732, pp. 14\u201325 (2011)","DOI":"10.1007\/978-3-642-21286-4_2"},{"key":"1253_CR47","doi-asserted-by":"crossref","unstructured":"Joslyn, C., Aksoy, S., Arendt, D., Jenkins, L., Praggastis, B., Purvine, E., Zalewski, M.: High performance hypergraph analytics of domain name system relationships. In: HICSS Symposium on Cybersecurity Big Data Analytics (2019)","DOI":"10.1007\/978-3-030-48478-1_1"},{"key":"1253_CR48","doi-asserted-by":"crossref","unstructured":"Brooks, S., Gelman, A., Jones, G., Meng, X.-L.: Handbook of Markov Chain Monte Carlo, (2011)","DOI":"10.1201\/b10905"},{"key":"1253_CR49","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.adhoc.2012.08.010","volume":"12","author":"C Avin","year":"2014","unstructured":"Avin, C., Lando, Y., Lotker, Z.: Radio cover time in hyper-graphs. Ad Hoc Networks 12, 278\u2013290 (2014)","journal-title":"Ad Hoc Networks"},{"key":"1253_CR50","doi-asserted-by":"crossref","unstructured":"Lee, C., Xu, X., Eun, D.Y.: Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling. In: ACM SIGMETRICS\/PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS, pp. 319\u2013330 (2012)","DOI":"10.1145\/2318857.2254795"},{"key":"1253_CR51","doi-asserted-by":"crossref","unstructured":"Hastings, W.K.: Monte carlo sampling methods using markov chains and their applications. Biometrika (1970)","DOI":"10.2307\/2334940"},{"issue":"4","key":"1253_CR52","doi-asserted-by":"publisher","first-page":"1958","DOI":"10.1214\/20-AOS2008","volume":"49","author":"C Andrieu","year":"2021","unstructured":"Andrieu, C., Livingstone, S.: Peskun-tierney ordering for markovian monte carlo: Beyond the reversible scenario. Ann. Stat. 49(4), 1958\u20131981 (2021)","journal-title":"Ann. Stat."},{"key":"1253_CR53","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Holmes, S., Neal, R.M.: Analysis of a nonreversible markov chain sampler. Ann. Appl. Probab, 726\u2013752 (2000)","DOI":"10.1214\/aoap\/1019487508"},{"key":"1253_CR54","unstructured":"Neal, R.M.: Improving asymptotic variance of mcmc estimators: Non-reversible chains are better. Preprint arXiv:math\/0407281 (2004)"},{"key":"1253_CR55","doi-asserted-by":"crossref","unstructured":"Katzir, L., Liberty, E., Somekh, O.: Estimating sizes of social networks via biased sampling. In: Proceedings of the 20th International Conference on World Wide Web, WWW, pp. 597\u2013606 (2011)","DOI":"10.1145\/1963405.1963489"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01253-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-024-01253-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-024-01253-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T21:05:39Z","timestamp":1731359139000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-024-01253-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1253"],"URL":"https:\/\/doi.org\/10.1007\/s11280-024-01253-8","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"13 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"15"}}