{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T21:23:26Z","timestamp":1781731406318,"version":"3.54.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001793","name":"Queensland University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001793","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Discrete data and categorical data classification is an essential task across domains such as machine learning, data mining, decision-making, and statistical analysis, aimed at categorizing observations into distinct classes based on their attributes, which can be numerical, categorical, or a combination of both. One characteristic of such data is its uncertainty and ambiguity, stemming from the limitations of information provided by a sparse data space. The Transposed Feature Class Granular (TFCG) distribution has effectively classified this kind of data, highlighting the significance of integrating fuzzy sets, granular computing, and principles of artificial neural networks. Properly tuned hyperparameters using the aforementioned method can greatly improve classification performance. However, manually tuning hyperparameters presents several challenges, including being time-consuming, subjective, and facing scalability issues, as well as the risk of overfitting and yielding inconsistent results. With the assistance of contrastive learning, which enables the model to distinguish between similar (positive) samples and dissimilar (negative) samples, this paper presents an automated hyperparameter optimization method designed to identify effective TFCG distribution classifiers for noncontinuous data. Our proposed approach contributes to simplifying the process of finding optimal hyperparameters for TFCG classification, significantly reducing time complexity. It\u2019s well known that manually tuning parameters is difficult and time-consuming. Our method eliminates the need for manual hyperparameter tuning and produces better results. We address the issue by defining a series of contrastive loss functions for noncontinuous attributes and applying them to derive an optimized TFCG classifier.<\/jats:p>","DOI":"10.1007\/s10115-025-02576-2","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T15:57:30Z","timestamp":1760457450000},"page":"11787-11826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automated contrastive optimization of class-based feature distribution for noncontinuous dataset"],"prefix":"10.1007","volume":"67","author":[{"given":"Qiang","family":"Fu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuefeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"issue":"1","key":"2576_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1186\/s40537-020-00305-w","volume":"7","author":"JT Hancock","year":"2020","unstructured":"Hancock JT, Khoshgoftaar TM (2020) Survey on categorical data for neural networks. J Big Data 7(1):28","journal-title":"J Big Data"},{"key":"2576_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.imavis.2018.04.004","volume":"75","author":"P Rodr\u00edguez","year":"2018","unstructured":"Rodr\u00edguez P, Bautista MA, Gonzalez J, Escalera S (2018) Beyond one-hot encoding: lower dimensional target embedding. Image Vis Comput 75:21\u201331","journal-title":"Image Vis Comput"},{"issue":"2","key":"2576_CR3","first-page":"1828","volume":"24","author":"D Guo","year":"2022","unstructured":"Guo D, Wu EQ, Wu Y, Zhang J, Law R, Lin Y (2022) Flightbert: binary encoding representation for flight trajectory prediction. IEEE Trans Intell Transp Syst 24(2):1828\u20131842","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"5","key":"2576_CR4","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1007\/s40565-019-0552-3","volume":"7","author":"Y Wang","year":"2019","unstructured":"Wang Y, Gan D, Zhang N, Xie L, Kang C (2019) Feature selection for probabilistic load forecasting via sparse penalized quantile regression. J Mod Power Syst Clean Energy 7(5):1200\u20131209","journal-title":"J Mod Power Syst Clean Energy"},{"issue":"11","key":"2576_CR5","doi-asserted-by":"publisher","first-page":"4613","DOI":"10.1007\/s10115-023-01924-4","volume":"65","author":"Y Guo","year":"2023","unstructured":"Guo Y, Wang W (2023) A robust adaptive linear regression method for severe noise. Knowl Inf Syst 65(11):4613\u20134653","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"2576_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.51329\/mehdiophthal1506","volume":"13","author":"N Roustaei","year":"2024","unstructured":"Roustaei N (2024) Application and interpretation of linear-regression analysis. Med Hypothesis Discov Innov Ophthalmol 13(3):151","journal-title":"Med Hypothesis Discov Innov Ophthalmol"},{"issue":"6","key":"2576_CR7","doi-asserted-by":"publisher","first-page":"2595","DOI":"10.1007\/s10115-023-01851-4","volume":"65","author":"H Mamdouh Farghaly","year":"2023","unstructured":"Mamdouh Farghaly H, Shams MY, Abd El-Hafeez T (2023) Hepatitis C virus prediction based on machine learning framework: a real-world case study in Egypt. Knowl Inf Syst 65(6):2595\u20132617","journal-title":"Knowl Inf Syst"},{"issue":"9","key":"2576_CR8","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1007\/s12094-024-03413-8","volume":"26","author":"D Elkahwagy","year":"2024","unstructured":"Elkahwagy D, Kiriacos CJ, Mansour M (2024) Logistic regression and other statistical tools in diagnostic biomarker studies. Clin Transl Oncol 26(9):2172\u20132180","journal-title":"Clin Transl Oncol"},{"key":"2576_CR9","unstructured":"Johannemann J, Hadad V, Athey S, Wager S (2019) Sufficient representations for categorical variables. arXiv preprint arXiv:1908.09874"},{"issue":"3","key":"2576_CR10","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1007\/s10115-018-1250-6","volume":"61","author":"A Bharadwaj","year":"2019","unstructured":"Bharadwaj A, Ramanna S (2019) Categorizing relational facts from the web with fuzzy rough sets. Knowl Inf Syst 61(3):1695\u20131713","journal-title":"Knowl Inf Syst"},{"issue":"11","key":"2576_CR11","doi-asserted-by":"publisher","first-page":"3081","DOI":"10.1007\/s10115-022-01735-z","volume":"64","author":"RR Panda","year":"2022","unstructured":"Panda RR, Nagwani NK (2022) Topic modeling and intuitionistic fuzzy set-based approach for efficient software bug triaging. Knowl Inf Syst 64(11):3081\u20133111","journal-title":"Knowl Inf Syst"},{"key":"2576_CR12","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10115-018-1318-3","volume":"61","author":"G Dai","year":"2019","unstructured":"Dai G, Hu Y, Yang Y, Zhang N, Abraham A, Liu H (2019) A novel fuzzy rule extraction approach using gaussian kernel-based granular computing. Knowl Inf Syst 61:821\u2013846","journal-title":"Knowl Inf Syst"},{"key":"2576_CR13","unstructured":"Bargiela A, Pedrycz W (2022) Granular computing. In: Handbook on computer learning and intelligence: deep learning, intelligent control and evolutionary computation, vol 2, pp 97\u2013132"},{"issue":"5","key":"2576_CR14","doi-asserted-by":"publisher","first-page":"e26586","DOI":"10.1016\/j.heliyon.2024.e26586","volume":"10","author":"M Wojciuk","year":"2024","unstructured":"Wojciuk M, Swiderska-Chadaj Z, Siwek K, Gertych A (2024) Improving classification accuracy of fine-tuned CNN models: impact of hyperparameter optimization. Heliyon 10(5):e26586","journal-title":"Heliyon"},{"key":"2576_CR15","doi-asserted-by":"crossref","unstructured":"Montesinos\u00a0L\u00f3pez OA, Montesinos\u00a0L\u00f3pez A, Crossa J (2022) Overfitting, model tuning, and evaluation of prediction performance. In: Multivariate statistical machine learning methods for genomic prediction, pp 109\u2013139","DOI":"10.1007\/978-3-030-89010-0_4"},{"key":"2576_CR16","doi-asserted-by":"crossref","unstructured":"Montazeri AH, Emami SK, Zaghiyan MR, Eslamian S (2023) Stochastic learning algorithms. In: Handbook of hydroinformatics, pp 385\u2013410","DOI":"10.1016\/B978-0-12-821285-1.00016-6"},{"key":"2576_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13218-015-0381-0","volume":"29","author":"F Hutter","year":"2015","unstructured":"Hutter F, L\u00fccke J, Schmidt-Thieme L (2015) Beyond manual tuning of hyperparameters. KI-K\u00fcnstliche Intelligenz 29:329\u2013337","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"2576_CR18","first-page":"18661","volume":"33","author":"P Khosla","year":"2020","unstructured":"Khosla P, Teterwak P, Wang C, Sarna A, Tian Y, Isola P, Maschinot A, Liu C, Krishnan D (2020) Supervised contrastive learning. Adv Neural Inf Process Syst 33:18661\u201318673","journal-title":"Adv Neural Inf Process Syst"},{"key":"2576_CR19","unstructured":"Liashchynskyi P, Liashchynskyi P (2019) Grid search, random search, genetic algorithm: a big comparison for NAS. arXiv preprint arXiv:1912.06059"},{"key":"2576_CR20","unstructured":"Yu T, Zhu H (2020) Hyper-parameter optimization: a review of algorithms and applications. arXiv preprint arXiv:2003.05689"},{"key":"2576_CR21","first-page":"29848","volume":"34","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Hooi B, Hu D, Liang J, Feng J (2021) Unleashing the power of contrastive self-supervised visual models via contrast-regularized fine-tuning. Adv Neural Inf Process Syst 34:29848\u201329860","journal-title":"Adv Neural Inf Process Syst"},{"issue":"6","key":"2576_CR22","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1109\/TSMCC.2012.2236648","volume":"43","author":"JT Yao","year":"2013","unstructured":"Yao JT, Vasilakos AV, Pedrycz W (2013) Granular computing: perspectives and challenges. IEEE Trans Cybern 43(6):1977\u20131989","journal-title":"IEEE Trans Cybern"},{"key":"2576_CR23","doi-asserted-by":"publisher","first-page":"101833","DOI":"10.1016\/j.inffus.2023.101833","volume":"98","author":"J Qin","year":"2023","unstructured":"Qin J, Mart\u00ednez L, Pedrycz W, Ma X, Liang Y (2023) An overview of granular computing in decision-making: extensions, applications, and challenges. Inf Fus 98:101833","journal-title":"Inf Fus"},{"key":"2576_CR24","doi-asserted-by":"publisher","first-page":"15504","DOI":"10.1109\/JIOT.2023.3349295","volume":"11","author":"G Gad","year":"2024","unstructured":"Gad G, Farrag A, Aboulfotouh A, Bedda K, Fadlullah ZM, Fouda MM (2024) Joint self-organizing maps and knowledge distillation-based communication-efficient federated learning for resource-constrained UAV-IoT systems. IEEE Internet Things J 11:15504\u201315522","journal-title":"IEEE Internet Things J"},{"key":"2576_CR25","doi-asserted-by":"crossref","unstructured":"Miljkovi\u0107 D (2017) Brief review of self-organizing maps. In: 2017 40th international convention on information and communication technology, electronics and microelectronics (MIPRO), pp 1061\u20131066","DOI":"10.23919\/MIPRO.2017.7973581"},{"key":"2576_CR26","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/s11036-019-01353-0","volume":"26","author":"X Qu","year":"2021","unstructured":"Qu X, Yang L, Guo K, Ma L, Sun M, Ke M, Li M (2021) A survey on the development of self-organizing maps for unsupervised intrusion detection. Mob Netw Appl 26:808\u2013829","journal-title":"Mob Netw Appl"},{"issue":"5","key":"2576_CR27","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s41066-023-00370-5","volume":"8","author":"Q Fu","year":"2023","unstructured":"Fu Q, Li Y, Albathan M (2023) A supervised method to enhance distance-based neural network clustering performance by discovering perfect representative neurons. Granul Comput 8(5):1051\u20131065","journal-title":"Granul Comput"},{"key":"2576_CR28","doi-asserted-by":"publisher","first-page":"116529","DOI":"10.1016\/j.eswa.2022.116529","volume":"194","author":"J Gou","year":"2022","unstructured":"Gou J, Sun L, Du L, Ma H, Xiong T, Ou W, Zhan Y (2022) A representation coefficient-based k-nearest centroid neighbor classifier. Expert Syst Appl 194:116529","journal-title":"Expert Syst Appl"},{"issue":"2","key":"2576_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3390\/e22020221","volume":"22","author":"F Nielsen","year":"2020","unstructured":"Nielsen F (2020) On a generalization of the Jensen\u2013Shannon divergence and the Jensen\u2013Shannon centroid. Entropy 22(2):221","journal-title":"Entropy"},{"issue":"1","key":"2576_CR30","doi-asserted-by":"publisher","first-page":"2","DOI":"10.3390\/technologies9010002","volume":"9","author":"A Jaiswal","year":"2020","unstructured":"Jaiswal A, Babu AR, Zadeh MZ, Banerjee D, Makedon F (2020) A survey on contrastive self-supervised learning. Technologies 9(1):2","journal-title":"Technologies"},{"key":"2576_CR31","unstructured":"Chen T, Kornblith S, Norouzi M, Hinton G (2020) A simple framework for contrastive learning of visual representations. In: International conference on machine learning, pp 1597\u20131607"},{"issue":"1","key":"2576_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0197-0","volume":"6","author":"C Shorten","year":"2019","unstructured":"Shorten C, Khoshgoftaar TM (2019) A survey on image data augmentation for deep learning. J Big Data 6(1):1\u201348","journal-title":"J Big Data"},{"key":"2576_CR33","doi-asserted-by":"crossref","unstructured":"Wei J, Zou K (2019) EDA: easy data augmentation techniques for boosting performance on text classification tasks. arXiv preprint arXiv:1901.11196","DOI":"10.18653\/v1\/D19-1670"},{"issue":"7","key":"2576_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3544558","volume":"55","author":"M Bayer","year":"2022","unstructured":"Bayer M, Kaufhold M-A, Reuter C (2022) A survey on data augmentation for text classification. ACM Comput Surv 55(7):1\u201339","journal-title":"ACM Comput Surv"},{"key":"2576_CR35","doi-asserted-by":"crossref","unstructured":"Xu Q, Hong Y, Chen J, Yao J, Zhou G (2023) Data augmentation via back-translation for aspect term extraction. In: 2023 International joint conference on neural networks (IJCNN), pp 1\u20138","DOI":"10.1109\/IJCNN54540.2023.10191183"},{"key":"2576_CR36","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ins.2018.03.050","volume":"450","author":"Y Li","year":"2018","unstructured":"Li Y, Pan Q, Wang S, Yang T, Cambria E (2018) A generative model for category text generation. Inf Sci 450:301\u2013315","journal-title":"Inf Sci"},{"key":"2576_CR37","doi-asserted-by":"crossref","unstructured":"Hayashi T, Watanabe S, Zhang Y, Toda T, Hori T, Astudillo R, Takeda K (2018) Back-translation-style data augmentation for end-to-end ASR. In: 2018 IEEE spoken language technology workshop (SLT), pp 426\u2013433","DOI":"10.1109\/SLT.2018.8639619"},{"key":"2576_CR38","doi-asserted-by":"crossref","unstructured":"He K, Fan H, Wu Y, Xie S, Girshick R (2020) Momentum contrast for unsupervised visual representation learning. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 9729\u20139738","DOI":"10.1109\/CVPR42600.2020.00975"},{"key":"2576_CR39","doi-asserted-by":"crossref","unstructured":"Misra I, Maaten LVD (2020) Self-supervised learning of pretext-invariant representations. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 6707\u20136717","DOI":"10.1109\/CVPR42600.2020.00674"},{"key":"2576_CR40","doi-asserted-by":"crossref","unstructured":"Ghojogh B, Sikaroudi M, Shafiei S, Tizhoosh HR, Karray F, Crowley M (2020) Fisher discriminant triplet and contrastive losses for training Siamese networks. In: 2020 International joint conference on neural networks (IJCNN), pp 1\u20137","DOI":"10.1109\/IJCNN48605.2020.9206833"},{"issue":"1","key":"2576_CR41","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TCSVT.2020.2968484","volume":"31","author":"W Deng","year":"2020","unstructured":"Deng W, Zheng L, Sun Y, Jiao J (2020) Rethinking triplet loss for domain adaptation. IEEE Trans Circuits Syst Video Technol 31(1):29\u201337","journal-title":"IEEE Trans Circuits Syst Video Technol"},{"key":"2576_CR42","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.neucom.2020.02.060","volume":"398","author":"Z Fang","year":"2020","unstructured":"Fang Z, Ren J, Marshall S, Zhao H, Wang Z, Huang K, Xiao B (2020) Triple loss for hard face detection. Neurocomputing 398:20\u201330","journal-title":"Neurocomputing"},{"issue":"1","key":"2576_CR43","doi-asserted-by":"publisher","first-page":"20800","DOI":"10.1038\/s41598-022-25340-w","volume":"12","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, Wang L, Cheng S (2022) Composed query image retrieval based on triangle area triple loss function and combining CNN with transformer. Sci Rep 12(1):20800","journal-title":"Sci Rep"},{"key":"2576_CR44","unstructured":"Hermans A, Beyer L, Leibe B (2017) In defense of the triplet loss for person re-identification. arXiv preprint arXiv:1703.07737"},{"key":"2576_CR45","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.neunet.2021.01.002","volume":"137","author":"D Shi","year":"2021","unstructured":"Shi D, Orouskhani M, Orouskhani Y (2021) A conditional triplet loss for few-shot learning and its application to image co-segmentation. Neural Netw 137:54\u201362","journal-title":"Neural Netw"},{"key":"2576_CR46","unstructured":"Sohn K (2016) Improved deep metric learning with multi-class n-pair loss objective. In: Advances in neural information processing systems, vol 29"},{"key":"2576_CR47","doi-asserted-by":"crossref","unstructured":"Deng Y, Lin X, Li R, Ji R (2019) Multi-scale gem pooling with n-pair center loss for fine-grained image search. In: 2019 IEEE international conference on multimedia and expo (ICME), pp 1000\u20131005","DOI":"10.1109\/ICME.2019.00176"},{"key":"2576_CR48","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.neucom.2020.07.061","volume":"415","author":"L Yang","year":"2020","unstructured":"Yang L, Shami A (2020) On hyperparameter optimization of machine learning algorithms: theory and practice. Neurocomputing 415:295\u2013316","journal-title":"Neurocomputing"},{"key":"2576_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13721-015-0108-z","volume":"5","author":"G Luo","year":"2016","unstructured":"Luo G (2016) A review of automatic selection methods for machine learning algorithms and hyper-parameter values. Netw Model Anal Health Inf Bioinform 5:1\u201316","journal-title":"Netw Model Anal Health Inf Bioinform"},{"issue":"2","key":"2576_CR50","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra J, Bengio Y (2012) Random search for hyper-parameter optimization. J Mach Learn Res 13(2):281\u2013305","journal-title":"J Mach Learn Res"},{"key":"2576_CR51","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter F, Hoos HH, Leyton-Brown K, St\u00fctzle T (2009) ParamILS: an automatic algorithm configuration framework. J Artif Intell Res 36:267\u2013306","journal-title":"J Artif Intell Res"},{"key":"2576_CR52","doi-asserted-by":"crossref","unstructured":"Hutter F, Hoos HH, Leyton-Brown K (2011) Sequential model-based optimization for general algorithm configuration. In: Learning and intelligent optimization: 5th international conference, LION 5, Rome, Italy, January 17\u201321, 2011. Selected Papers 5, pp 507\u2013523","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"2576_CR53","doi-asserted-by":"crossref","unstructured":"Frazier PI (2018) Bayesian optimization. In: Recent advances in optimization and modeling of contemporary problems, pp 255\u2013278","DOI":"10.1287\/educ.2018.0188"},{"key":"2576_CR54","unstructured":"Watanabe S (2023) Tree-structured Parzen estimator: understanding its algorithm components and their roles for better empirical performance. arXiv preprint arXiv:2304.11127"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02576-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-025-02576-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-025-02576-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T05:06:48Z","timestamp":1763701608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-025-02576-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,14]]},"references-count":54,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2576"],"URL":"https:\/\/doi.org\/10.1007\/s10115-025-02576-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,14]]},"assertion":[{"value":"30 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 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 declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}