{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:31:29Z","timestamp":1775010689586,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:00:00Z","timestamp":1691712000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10489-023-04864-2","type":"journal-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T11:02:26Z","timestamp":1691751746000},"page":"25678-25696","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["List-based mining top-k average-utility itemsets with effective pruning and threshold raising strategies"],"prefix":"10.1007","volume":"53","author":[{"given":"Zelin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4877-5975","authenticated-orcid":false,"given":"Gufeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,11]]},"reference":[{"key":"4864_CR1","first-page":"487","volume-title":"Proceedings 20th International Conference","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proceedings 20th International Conference. Very Large Data Bases, VLDB, pp 487\u2013499"},{"issue":"12","key":"4864_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B et al (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Transactions on Knowledge and Data Engineering 21(12):1708\u20131721","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"4864_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/02564602.2014.1000396","volume":"32","author":"B Bakariya","year":"2015","unstructured":"Bakariya B, Thakur GS (2015) An efficient algorithm for extracting high utility itemsets from weblog data. IETE Technical Review 32(2):151\u2013160. https:\/\/doi.org\/10.1080\/02564602.2014.1000396","journal-title":"IETE Technical Review"},{"key":"4864_CR4","doi-asserted-by":"crossref","unstructured":"Bouasker S, Ben Yahia S (2015) Key correlation mining by simultaneous monotone and anti-monotone constraints checking. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, pp 851\u2013856","DOI":"10.1145\/2695664.2695802"},{"key":"4864_CR5","doi-asserted-by":"publisher","unstructured":"Chen CH, Lan GC, Hong TP et\u00a0al. (2016) Mining fuzzy temporal association rules by item lifespans. Applied Soft Computing 41(C):265\u2013274. https:\/\/doi.org\/10.1016\/j.asoc.2016.01.008","DOI":"10.1016\/j.asoc.2016.01.008"},{"key":"4864_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2018.04.008","volume":"453","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P et al (2018) Fast and effective cluster-based information retrieval using frequent closed itemsets. Information Sciences 453:154\u2013167","journal-title":"Information Sciences"},{"key":"4864_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong QH, Liao B, Fournier-Viger P et al (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowledge-Based Systems 104:106\u2013122","journal-title":"Knowledge-Based Systems"},{"key":"4864_CR8","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T et\u00a0al. (2014a) Spmf: A java open-source pattern mining library. http:\/\/www.philippe-fournier-viger.com\/spmf\/index.php"},{"key":"4864_CR9","first-page":"83","volume-title":"Andreasen T","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Wu CW, Zida S et al (2014) Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Christiansen H, Cubero JC et al (eds) Andreasen T. Systems. Springer International Publishing, Foundations of Intelligent, pp 83\u201392"},{"key":"4864_CR10","doi-asserted-by":"publisher","unstructured":"Gan W, Wan S, Chen J et\u00a0al. (2020) Tophui: Top-k high-utility itemset mining with negative utility. In: 2020 IEEE International Conference on Big Data (Big Data), pp 5350\u20135359, https:\/\/doi.org\/10.1109\/BigData50022.2020.9378288","DOI":"10.1109\/BigData50022.2020.9378288"},{"issue":"2","key":"4864_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin YJAsr (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Record 29(2):1\u201312","journal-title":"ACM SIGMOD Record"},{"key":"4864_CR12","doi-asserted-by":"publisher","unstructured":"Han X, Liu X, Li J et\u00a0al. (2021) Efficient top-k high utility itemset mining on massive data. INFORMATION SCIENCES 557:382\u2013406. https:\/\/doi.org\/10.1016\/j.ins.2020.08.028","DOI":"10.1016\/j.ins.2020.08.028"},{"key":"4864_CR13","doi-asserted-by":"publisher","unstructured":"Hong T, Lee C, Wang S (2009) Mining high average-utility itemsets. In: 2009 IEEE International Conference on Systems, Man and Cybernetics, pp 2526\u20132530, https:\/\/doi.org\/10.1109\/ICSMC.2009.5346333","DOI":"10.1109\/ICSMC.2009.5346333"},{"issue":"7","key":"4864_CR14","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"TP Hong","year":"2011","unstructured":"Hong TP, Lee CH, Wang SL (2011) Effective utility mining with the measure of average utility. Expert Systems with Applications 38(7):8259\u20138265","journal-title":"Expert Systems with Applications"},{"key":"4864_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y et al (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Information Sciences 543:85\u2013105","journal-title":"Information Sciences"},{"issue":"5","key":"4864_CR16","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Systems with Applications 42(5):2371\u20132381","journal-title":"Expert Systems with Applications"},{"key":"4864_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) Hminer: Efficiently mining high utility itemsets. Expert Systems with Applications 90:168\u2013183","journal-title":"Expert Systems with Applications"},{"key":"4864_CR18","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Systems with Applications 117:148\u2013165","journal-title":"Expert Systems with Applications"},{"key":"4864_CR19","first-page":"193","volume":"28","author":"GC Lan","year":"2012","unstructured":"Lan GC, Hong TP, Tseng V (2012) A projection-based approach for discovering high average-utility itemsets. J Inf Sci Eng 28:193\u2013209","journal-title":"J Inf Sci Eng"},{"key":"4864_CR20","doi-asserted-by":"publisher","unstructured":"Lan GC, Hong TP, Tseng VS (2012) Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int J Inf Technol Decision Making 11(05):1009\u20131030. https:\/\/doi.org\/10.1142\/s0219622012500307, https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622012500307","DOI":"10.1142\/s0219622012500307"},{"key":"4864_CR21","doi-asserted-by":"publisher","unstructured":"Lan GC, Hong TP, Tseng VS et al (2014) Applying the maximum utility measure in high utility sequential pattern mining. Expert Systems with Applications 41(11):5071\u20135081. https:\/\/doi.org\/10.1016\/j.eswa.2014.02.022, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417414000852","DOI":"10.1016\/j.eswa.2014.02.022"},{"key":"4864_CR22","doi-asserted-by":"crossref","unstructured":"Li G, Shang T, Zhang Y (2022) Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure. Applied Intelligence","DOI":"10.1007\/s10489-022-03722-x"},{"issue":"2","key":"4864_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Li T, Fournier-Viger P et al (2016) An efficient algorithm to mine high average-utility itemsets. Advanced Engineering Informatics 30(2):233\u2013243","journal-title":"Advanced Engineering Informatics"},{"key":"4864_CR24","doi-asserted-by":"crossref","unstructured":"Lin JCW, Ren S, Fournier-Viger P et\u00a0al. (2017a) Ehaupm: Efficient high average-utility pattern mining with tighter upper bounds. IEEE Access 5:12,927\u201312,940","DOI":"10.1109\/ACCESS.2017.2717438"},{"issue":"2","key":"4864_CR25","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10489-017-0896-1","volume":"47","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Ren S, Fournier-Viger P et al (2017) A fast algorithm for mining high average-utility itemsets. Applied Intelligence 47(2):331\u2013346","journal-title":"Applied Intelligence"},{"key":"4864_CR26","doi-asserted-by":"publisher","unstructured":"Lin JCW, Li Y, Fournier-Viger P e al. (2020a) Efficient chain structure for high-utility sequential pattern mining. IEEE Access 8:40,714\u201340,722. https:\/\/doi.org\/10.1109\/access.2020.2976662","DOI":"10.1109\/access.2020.2976662"},{"key":"4864_CR27","doi-asserted-by":"publisher","unstructured":"Lin JCW, Ming-Tai Wu J, Djenouri Y et\u00a0al. (2020b) Mining multiple fuzzy frequent patterns with compressed list structures. In: 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, https:\/\/doi.org\/10.1109\/fuzz48607.2020.9177543","DOI":"10.1109\/fuzz48607.2020.9177543"},{"key":"4864_CR28","doi-asserted-by":"publisher","unstructured":"Liu J, Zhang X, Fung BCM et al (2018) Opportunistic mining of top-n high utility patterns. Information Sciences 441:171\u2013186. https:\/\/doi.org\/10.1016\/j.ins.2018.02.035, tONUP","DOI":"10.1016\/j.ins.2018.02.035"},{"key":"4864_CR29","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on Information and knowledge management, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"4864_CR30","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu Y, Wk Liao, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Berlin Heidelberg, Advances in Knowledge Discovery and Data Mining, pp 689\u2013695"},{"key":"4864_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowledge-Based Systems 76:109\u2013126. https:\/\/doi.org\/10.1016\/j.knosys.2014.12.010","journal-title":"Knowledge-Based Systems"},{"key":"4864_CR32","doi-asserted-by":"crossref","unstructured":"Sethi KK, Ramesh D (2020) A fast high average-utility itemset mining with efficient tighter upper bounds and novel list structure. The Journal of Supercomputing","DOI":"10.1007\/s11227-020-03247-5"},{"key":"4864_CR33","doi-asserted-by":"publisher","unstructured":"Shie BE, Yu PS, Tseng VS (2012) Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Systems with Applications 39(17):12,947\u201312,960. https:\/\/doi.org\/10.1016\/j.eswa.2012.05.035","DOI":"10.1016\/j.eswa.2012.05.035"},{"key":"4864_CR34","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2014.03.074","volume":"278","author":"SJ Shin","year":"2014","unstructured":"Shin SJ, Lee DS, Lee WSJIS (2014) Cp-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams. Information Sciences 278:559\u2013576","journal-title":"Information Sciences"},{"key":"4864_CR35","doi-asserted-by":"crossref","unstructured":"Song W, Liu L, Huang C (2021) Generalized maximal utility for mining high average-utility itemsets. Knowledge and Information Systems","DOI":"10.1007\/s10115-021-01614-z"},{"key":"4864_CR36","doi-asserted-by":"crossref","unstructured":"Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), vol 1. IEEE, pp 305\u2013312","DOI":"10.1109\/ICTAI.2007.30"},{"issue":"1","key":"4864_CR37","doi-asserted-by":"publisher","first-page":"342","DOI":"10.2991\/ijcis.2019.125905650","volume":"12","author":"H Tang","year":"2018","unstructured":"Tang H, Liu Y, Systems LWJIJoCI (2018) A new algorithm of mining high utility sequential pattern in streaming data. International Journal of Computational Intelligence Systems 12(1):342\u2013350. https:\/\/doi.org\/10.2991\/ijcis.2019.125905650","journal-title":"International Journal of Computational Intelligence Systems"},{"issue":"2","key":"4864_CR38","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","volume":"31","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B et al (2019) Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Transactions on Knowledge and Data Engineering 31(2):301\u2013314","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"104","key":"4864_CR39","first-page":"847","volume":"183","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B et al (2019) Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowledge-Based Systems 183(104):847","journal-title":"Knowledge-Based Systems"},{"key":"4864_CR40","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE et\u00a0al. (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"4864_CR41","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B, Wu C et al (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Transactions on Knowledge and Data Engineering 25(8):1772\u20131786","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"4864_CR42","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng VS, Wu C, Fournier-Viger P et al (2016) Efficient algorithms for mining top-k high utility itemsets. IEEE Transactions on Knowledge and Data Engineering 28(1):54\u201367","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"4864_CR43","doi-asserted-by":"crossref","unstructured":"Uno T, Kiyomi M, Arimura H (2004) Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Fimi","DOI":"10.1145\/1133905.1133916"},{"key":"4864_CR44","doi-asserted-by":"publisher","unstructured":"Wang CM, Chen SH, Huang YF (2009) A fuzzy approach for mining high utility quantitative itemsets. In: 2009 IEEE International Conference on Fuzzy Systems. IEEE, https:\/\/doi.org\/10.1109\/fuzzy.2009.5277408","DOI":"10.1109\/fuzzy.2009.5277408"},{"issue":"2","key":"4864_CR45","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10115-015-0914-8","volume":"49","author":"JZ Wang","year":"2016","unstructured":"Wang JZ, Huang JL, Chen YC (2016) On efficiently mining high utility sequential patterns. Knowledge and Information Systems 49(2):597\u2013627. https:\/\/doi.org\/10.1007\/s10115-015-0914-8","journal-title":"Knowledge and Information Systems"},{"key":"4864_CR46","doi-asserted-by":"publisher","unstructured":"Wu CW, Shie BE, Tseng VS et al. (2012) Mining top-k high utility itemsets. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, USA, KDD \u201912, p 78\u201d86, https:\/\/doi.org\/10.1145\/2339530.2339546, https:\/\/doi.org\/10.1145\/2339530.2339546","DOI":"10.1145\/2339530.2339546"},{"issue":"10","key":"4864_CR47","doi-asserted-by":"publisher","first-page":"3429","DOI":"10.1007\/s10489-018-1155-9","volume":"48","author":"R Wu","year":"2018","unstructured":"Wu R, He Z (2018) Top-k high average-utility itemsets mining with effective pruning strategies. Applied Intelligence 48(10):3429\u20133445","journal-title":"Applied Intelligence"},{"key":"4864_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/s40815-020-01003-8","author":"F Yang","year":"2021","unstructured":"Yang F, Mu N, Liao X et al (2021) Ea-hufim: Optimization for fuzzybased high-utility itemsets mining. International Journal of Fuzzy Systems. https:\/\/doi.org\/10.1007\/s40815-020-01003-8","journal-title":"International Journal of Fuzzy Systems"},{"key":"4864_CR49","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS, Wu CW et\u00a0al. (2009) An efficient algorithm for maintaining frequent closed itemsets over data stream. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer, pp 767\u2013776","DOI":"10.1007\/978-3-642-02568-6_78"},{"key":"4864_CR50","doi-asserted-by":"crossref","unstructured":"Yildirim I, Celik M (2019) An efficient tree-based algorithm for mining high average-utility itemset. IEEE Access 7:144,245\u2013144,263","DOI":"10.1109\/ACCESS.2019.2945840"},{"issue":"10","key":"4864_CR51","doi-asserted-by":"publisher","first-page":"4762","DOI":"10.1016\/j.eswa.2014.01.042","volume":"41","author":"JC Ying","year":"2014","unstructured":"Ying JC, Chen HS, Lin KW et al (2014) Semantic trajectory-based high utility item recommendation system. Expert Systems with Applications 41(10):4762\u20134776. https:\/\/doi.org\/10.1016\/j.eswa.2014.01.042","journal-title":"Expert Systems with Applications"},{"key":"4864_CR52","doi-asserted-by":"crossref","unstructured":"Yun U, Kim D (2017) Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Generation Computer Systems 68:346\u2013360","DOI":"10.1016\/j.future.2016.10.027"},{"key":"4864_CR53","first-page":"530","volume-title":"Mexican international conference on artificial intelligence","author":"S Zida","year":"2015","unstructured":"Zida S, Fournier-Viger P, Lin JCW et al (2015) Efim: A highly efficient algorithm for high-utility itemset mining. Mexican international conference on artificial intelligence. Springer International Publishing, Advances in Artificial Intelligence and Soft Computing, pp 530\u2013546"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04864-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04864-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04864-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:22:50Z","timestamp":1698070970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04864-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,11]]},"references-count":53,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4864"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04864-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,11]]},"assertion":[{"value":"1 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":2,"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 competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}]}}