{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T05:15:24Z","timestamp":1783660524811,"version":"3.55.0"},"reference-count":42,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,1,23]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Imbalanced class distributions pose significant challenges in document classification, but which balancing methods work best with different algorithms remains insufficiently understood. This research conducts rigorous statistical analysis of five balancing methods (SMOTE, ADASYN, BorderlineSMOTE, SMOTEENN, SMOTETomek) applied to twelve machine learning classifiers. We use a novel dataset of 2,240 Turkish institutional documents from the Social Security Institution with a marginal class imbalance (2.2:1 ratio) across five functional classifications \u2013 a regime frequently encountered in real institutional settings yet underexamined in the balancing literature, which has concentrated on severely imbalanced benchmarks. Through stratified 10-fold cross-validation with paired\n                    <jats:italic>t<\/jats:italic>\n                    -tests and Cohen\u2019s\n                    <jats:italic>d<\/jats:italic>\n                    effect-size measurements across 72 experimental configurations (yielding 60 pairwise statistical comparisons), we observed algorithm-dependent performance differences that question universal balancing assumptions. SMOTEENN reduced performance for ten of the twelve classifiers at the\n                    <jats:italic>p<\/jats:italic>\n                    &lt; 0.05 level (mean \u0394\n                    <jats:italic>F<\/jats:italic>\n                    1 = \u22120.0495, mean Cohen\u2019s\n                    <jats:italic>d<\/jats:italic>\n                    = \u22121.57; AdaBoost and Naive Bayes showed negative but non-significant changes), while alternative techniques produced algorithm-specific outcomes: ensemble methods showed only descriptive, non-statistically-significant point gains (Random Forest with SMOTE: \u0394\n                    <jats:italic>F<\/jats:italic>\n                    1 = +0.0043,\n                    <jats:italic>p<\/jats:italic>\n                    = 0.470; AdaBoost with SMOTE: \u0394\n                    <jats:italic>F<\/jats:italic>\n                    1 = +0.0225,\n                    <jats:italic>p<\/jats:italic>\n                    = 0.174), whereas the distance-based K-Nearest Neighbors classifier experienced uniform degradation across every balancing method (\u0394\n                    <jats:italic>F<\/jats:italic>\n                    1 = \u22120.0613 to \u22120.0328, all\n                    <jats:italic>p<\/jats:italic>\n                    &lt; 0.05, all large effects). Independent test validation confirmed results with minimal generalization differences (mean absolute \u0394\n                    <jats:italic>F<\/jats:italic>\n                    1 = 0.034 across all 72 configurations). This research introduces the first Turkish institutional document classification dataset, provides statistically robust evidence questioning the universal effectiveness of balancing techniques, and suggests that, in the marginal imbalance regime observed in this institutional dataset, automatic balancing may not be necessary and may even degrade performance for certain algorithm families. Findings highlight the importance of algorithm-specific validation rather than one-size-fits-all approaches in resource-constrained settings.\n                  <\/jats:p>","DOI":"10.1515\/comp-2025-0061","type":"journal-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T04:56:07Z","timestamp":1783659367000},"source":"Crossref","is-referenced-by-count":0,"title":["Algorithm-specific effects of\u00a0class balancing: statistical evidence from\u00a0Turkish institutional document classification"],"prefix":"10.1515","volume":"16","author":[{"given":"Ba\u011fda G\u00fcl","family":"\u0130l\u00e7i","sequence":"first","affiliation":[{"name":"Computer Engineering Department , Siirt University , Siirt 56100 , T\u00fcrkiye"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"\u00d6zlem","family":"Batur Dinler","sequence":"additional","affiliation":[{"name":"Computer Engineering Department , Siirt University , Siirt 56100 , T\u00fcrkiye"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2026,7,10]]},"reference":[{"key":"2026071004560209107_j_comp-2025-0061_ref_001","doi-asserted-by":"crossref","unstructured":"N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, \u201cSMOTE: Synthetic minority over-sampling technique,\u201d J. Artif. Intell. Res., vol. 16, pp. 321\u2013357, 2002. https:\/\/doi.org\/10.1613\/jair.953.","DOI":"10.1613\/jair.953"},{"key":"2026071004560209107_j_comp-2025-0061_ref_002","doi-asserted-by":"crossref","unstructured":"H. He and E. A. Garcia, \u201cLearning from imbalanced data,\u201d IEEE Trans. Knowl. Data Eng., vol.\u00a021, no.\u00a09, pp.\u00a01263\u20131284, 2009, https:\/\/doi.org\/10.1109\/TKDE.2008.239.","DOI":"10.1109\/TKDE.2008.239"},{"key":"2026071004560209107_j_comp-2025-0061_ref_003","doi-asserted-by":"crossref","unstructured":"H. Han, W. Y. Wang, and B. H. Mao, \u201cBorderline-SMOTE: A new over-sampling method in imbalanced data sets learning,\u201d in Advances in Intelligent Computing. ICIC, Lecture Notes in Computer Science, vol.\u00a03644, D. S. Huang, X. P. Zhang, and G. B. Huang, Eds., Berlin, Heidelberg, Springer, 2005.","DOI":"10.1007\/11538059_91"},{"key":"2026071004560209107_j_comp-2025-0061_ref_004","doi-asserted-by":"crossref","unstructured":"G. Haixiang, L. Yijing, J. Shang, G. Mingyun, H. Yuanyue, and G. Bing, \u201cLearning from class-imbalanced data: Review of methods and applications,\u201d Expert Syst. Appl., vol. 73, no. C, pp. 220\u2013239, 2017. https:\/\/doi.org\/10.1016\/j.eswa.2016.12.035.","DOI":"10.1016\/j.eswa.2016.12.035"},{"key":"2026071004560209107_j_comp-2025-0061_ref_005","doi-asserted-by":"crossref","unstructured":"G. E. A. P. A. Batista, R. C. Prati, and M. C. Monard, \u201cA study of the behavior of several methods for balancing machine learning training data,\u201d ACM SIGKDD Explor. Newsl., vol.\u00a06, no.\u00a01, pp.\u00a020\u201329, 2004, https:\/\/doi.org\/10.1145\/1007730.1007735.","DOI":"10.1145\/1007730.1007735"},{"key":"2026071004560209107_j_comp-2025-0061_ref_006","doi-asserted-by":"crossref","unstructured":"A. Fern\u00e1ndez, S. Garc\u00eda, M. Galar, R. C. Prati, B. Krawczyk, and F. Herrera, Learning from Imbalanced Data Sets, Cham, Springer International Publishing, 2018.","DOI":"10.1007\/978-3-319-98074-4"},{"key":"2026071004560209107_j_comp-2025-0061_ref_007","doi-asserted-by":"crossref","unstructured":"B. Krawczyk, \u201cLearning from imbalanced data: Open challenges and future directions,\u201d Prog. Artif. Intell., vol. 5, no. 4, pp. 221\u2013232, 2016. https:\/\/doi.org\/10.1007\/s13748-016-0094-0.","DOI":"10.1007\/s13748-016-0094-0"},{"key":"2026071004560209107_j_comp-2025-0061_ref_008","doi-asserted-by":"crossref","unstructured":"P. Branco, L. Torgo, and R. P. Ribeiro, \u201cA survey of predictive modeling on imbalanced domains,\u201d ACM Comput. Surv., vol.\u00a049, no.\u00a02, pp.\u00a01\u201350, 2016, https:\/\/doi.org\/10.1145\/2907070.","DOI":"10.1145\/2907070"},{"key":"2026071004560209107_j_comp-2025-0061_ref_009","doi-asserted-by":"crossref","unstructured":"M. Galar, A. Fernandez, E. Barrenechea, H. Bustince, and F. Herrera, \u201cA review on ensembles for the class imbalance problem: Bagging-boosting-and hybrid-based approaches,\u201d IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev., vol.\u00a042, no.\u00a04, pp.\u00a0463\u2013484, 2012, https:\/\/doi.org\/10.1109\/TSMCC.2011.2161285.","DOI":"10.1109\/TSMCC.2011.2161285"},{"key":"2026071004560209107_j_comp-2025-0061_ref_010","doi-asserted-by":"crossref","unstructured":"V. L\u00f3pez, A. Fern\u00e1ndez, S. Garc\u00eda, V. Palade, and F. Herrera, \u201cAn insight into classification with imbalanced data: Empirical results and current trends on using data intrinsic characteristics,\u201d Inf. Sci., vol.\u00a0250, pp.\u00a0113\u2013141, 2013, https:\/\/doi.org\/10.1016\/j.ins.2013.07.007.","DOI":"10.1016\/j.ins.2013.07.007"},{"key":"2026071004560209107_j_comp-2025-0061_ref_011","doi-asserted-by":"crossref","unstructured":"C. Sun, X. Qiu, Y. Xu, and X. Huang, \u201cHow to fine-tune BERT for text classification?\u201d in Chinese Computational Linguistics. CCL, Lecture Notes in Computer Science (), vol.\u00a011856, M. Sun, X. Huang, H. Ji, Z. Liu, and Y. Liu, Eds., Cham, Springer, 2019.","DOI":"10.1007\/978-3-030-32381-3_16"},{"key":"2026071004560209107_j_comp-2025-0061_ref_012","doi-asserted-by":"crossref","unstructured":"A. Vabalas, E. Gowen, E. Poliakoff, and A. J. Casson, \u201cMachine learning algorithm validation with a limited sample size,\u201d PLoS One, vol.\u00a014, no.\u00a011, 2019, Art. no. e0224365, https:\/\/doi.org\/10.1371\/journal.pone.0224365.","DOI":"10.1371\/journal.pone.0224365"},{"key":"2026071004560209107_j_comp-2025-0061_ref_013","unstructured":"S. Schweter, \u201cBERTurk \u2013 BERT models for Turkish,\u201d Zenodo, 2020, https:\/\/doi.org\/10.5281\/zenodo.3770924."},{"key":"2026071004560209107_j_comp-2025-0061_ref_014","doi-asserted-by":"crossref","unstructured":"H. Karayi\u011fit, \u00c7. \u0130nan Ac\u0131, and A. Akda\u011fl\u0131, \u201cDetecting abusive instagram comments in Turkish using convolutional neural network and machine learning methods,\u201d Expert Syst. Appl., vol. 174, no. C, 2021, Art. no. 114802, https:\/\/doi.org\/10.1016\/j.eswa.2021.114802.","DOI":"10.1016\/j.eswa.2021.114802"},{"key":"2026071004560209107_j_comp-2025-0061_ref_015","unstructured":"E. J. Hu et al.., \u201cLoRA: Low-Rank adaptation of Large Language Models,\u201d in Proc. ICLR, 2022."},{"key":"2026071004560209107_j_comp-2025-0061_ref_016","doi-asserted-by":"crossref","unstructured":"A. Najafi and O. Varol, \u201cTurkishBERTweet: Fast and reliable large language model for social media analysis,\u201d Expert Syst. Appl., vol.\u00a0255, no.\u00a0Part C, 2024, Art. no. 124737, https:\/\/doi.org\/10.1016\/j.eswa.2024.124737.","DOI":"10.1016\/j.eswa.2024.124737"},{"key":"2026071004560209107_j_comp-2025-0061_ref_017","doi-asserted-by":"crossref","unstructured":"C. Rudin, \u201cStop explaining black box machine learning models for high stakes decisions and use interpretable models instead,\u201d Nat. Mach. Intell., vol. 1, no. 5, pp. 206\u2013215, 2019. https:\/\/doi.org\/10.1038\/s42256-019-0048-x.","DOI":"10.1038\/s42256-019-0048-x"},{"key":"2026071004560209107_j_comp-2025-0061_ref_018","unstructured":"N. V. Chawla, \u201cData mining for imbalanced datasets: An overview,\u201d in Data Mining and Knowledge Discovery Handbook, O. Maimon and L. Rokach, Boston, MA, Springer, 2005."},{"key":"2026071004560209107_j_comp-2025-0061_ref_019","doi-asserted-by":"crossref","unstructured":"H. He, Y. Bai, E. A. Garcia, and S. Li, \u201cADASYN: Adaptive synthetic sampling approach for imbalanced learning,\u201d in 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence), Hong Kong, 2008, pp.\u00a01322\u20131328.","DOI":"10.1109\/IJCNN.2008.4633969"},{"key":"2026071004560209107_j_comp-2025-0061_ref_020","doi-asserted-by":"crossref","unstructured":"I. Tomek, \u201cTwo modifications of CNN,\u201d IEEE Trans. Syst. Man Cybern., vol. 6, no. 11, pp. 769\u2013772, 1976. https:\/\/doi.org\/10.1109\/TSMC.1976.4309452.","DOI":"10.1109\/TSMC.1976.4309452"},{"key":"2026071004560209107_j_comp-2025-0061_ref_021","doi-asserted-by":"crossref","unstructured":"A. D. Pozzolo, O. Caelen, R. A. Johnson, and G. Bontempi, \u201cCalibrating probability with undersampling for unbalanced classification,\u201d in 2015 IEEE Symposium Series on Computational Intelligence, Cape Town, South Africa, 2015, pp.\u00a0159\u2013166.","DOI":"10.1109\/SSCI.2015.33"},{"key":"2026071004560209107_j_comp-2025-0061_ref_022","unstructured":"J. Dem\u0161ar, \u201cStatistical comparisons of classifiers over multiple data sets,\u201d J. Mach. Learn. Res., vol.\u00a07, no.\u00a01, pp.\u00a01\u201330, 2006."},{"key":"2026071004560209107_j_comp-2025-0061_ref_023","doi-asserted-by":"crossref","unstructured":"S. Henning, W. Beluch, A. Fraser, and A. Friedrich, \u201cA survey of methods for addressing class imbalance in deep-learning based natural language processing,\u201d in Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics, 2023, pp.\u00a0523\u2013540.","DOI":"10.18653\/v1\/2023.eacl-main.38"},{"key":"2026071004560209107_j_comp-2025-0061_ref_024","doi-asserted-by":"crossref","unstructured":"V. Werner de Vargas, J. A. Schneider Aranda, R. dos Santos Costa, P. R. da Silva Pereira, and J. L. Vict\u00f3ria Barbosa, \u201cImbalanced data preprocessing techniques for machine learning: A systematic mapping study,\u201d Knowl. Inf. Syst., vol. 65, no. 1, pp. 31\u201357, 2023. https:\/\/doi.org\/10.1007\/s10115-022-01772-8.","DOI":"10.1007\/s10115-022-01772-8"},{"key":"2026071004560209107_j_comp-2025-0061_ref_025","doi-asserted-by":"crossref","unstructured":"S. F. Taskiran, B. Turkoglu, E. Kaya, and T. Asuroglu, \u201cA comprehensive evaluation of oversampling techniques for enhancing text classification performance,\u201d Sci. Rep., vol. 15, no. 1, 2025, Art. no. 21631, https:\/\/doi.org\/10.1038\/s41598-025-05791-7.","DOI":"10.1038\/s41598-025-05791-7"},{"key":"2026071004560209107_j_comp-2025-0061_ref_026","doi-asserted-by":"crossref","unstructured":"M. S. Sawah, H. Elmannai, A. A. El-Bary, K. Lotfy, and O. E. Sheta, \u201cImproving air quality prediction using hybrid BPSO with BWAO for feature selection and hyperparameters optimization,\u201d Sci. Rep., vol. 15, no. 1, 2025, Art. no. 13176, https:\/\/doi.org\/10.1038\/s41598-025-95983-y.","DOI":"10.1038\/s41598-025-95983-y"},{"key":"2026071004560209107_j_comp-2025-0061_ref_027","doi-asserted-by":"crossref","unstructured":"C. Zhang, C. Liu, X. Zhang, and G. Almpanidis, \u201cAn up-to-date comparison of state-of-the-art classification algorithms,\u201d Expert Syst. Appl., vol.\u00a082, pp.\u00a0128\u2013150, 2017, https:\/\/doi.org\/10.1016\/j.eswa.2017.04.003.","DOI":"10.1016\/j.eswa.2017.04.003"},{"key":"2026071004560209107_j_comp-2025-0061_ref_028","doi-asserted-by":"crossref","unstructured":"L. Brigato and L. Iocchi, \u201cA close look at deep learning with small data,\u201d in 2020 25th International Conference on Pattern Recognition (ICPR), Milan, Italy, 2021, pp.\u00a02490\u20132497.","DOI":"10.1109\/ICPR48806.2021.9412492"},{"key":"2026071004560209107_j_comp-2025-0061_ref_029","doi-asserted-by":"crossref","unstructured":"P. Savci and B. Das, \u201cComparison of pre-trained language models in terms of carbon emissions, time and accuracy in multi-label text classification using AutoML,\u201d Heliyon, vol.\u00a09, no.\u00a05, 2023, Art. no. e15670, https:\/\/doi.org\/10.1016\/j.heliyon.2023.e15670.","DOI":"10.1016\/j.heliyon.2023.e15670"},{"key":"2026071004560209107_j_comp-2025-0061_ref_030","doi-asserted-by":"crossref","unstructured":"A. A. Do\u011fan, A. Sayar, and \u0130. \u00c7etiner, \u201cTopic classification of text-based lesson questions in Turkish with BERTurk,\u201d in Mining Intelligence and Knowledge Exploration: 9th International Conference, MIKE 2023, Kristiansand, Norway, June 28\u201330, 2023, Proceedings, Berlin, Heidelberg, Springer-Verlag, pp.\u00a087\u201394.","DOI":"10.1007\/978-3-031-44084-7_9"},{"key":"2026071004560209107_j_comp-2025-0061_ref_031","doi-asserted-by":"crossref","unstructured":"K. Oflazer, \u201cTurkish and its challenges for language processing,\u201d Lang. Resour. Eval., vol.\u00a048, no.\u00a04, pp.\u00a0639\u2013653, 2014, https:\/\/doi.org\/10.1007\/s10579-014-9267-2.","DOI":"10.1007\/s10579-014-9267-2"},{"key":"2026071004560209107_j_comp-2025-0061_ref_032","doi-asserted-by":"crossref","unstructured":"G. G. \u015eahin, M. Steedman, E. Riloff, D. Chiang, J. Hockenmaier, and J. Tsujii, \u201cData augmentation via dependency tree morphing for low-resource languages,\u201d in Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, Association for Computational Linguistics, 2018, pp.\u00a05004\u20135009.","DOI":"10.18653\/v1\/D18-1545"},{"key":"2026071004560209107_j_comp-2025-0061_ref_033","doi-asserted-by":"crossref","unstructured":"S. Y\u0131ld\u0131r\u0131m and T. Y\u0131ld\u0131z, \u201cA comparative analysis of text classification for Turkish language,\u201d PAJES, vol. 24, no. 5, pp. 879\u2013886, 2018. https:\/\/doi.org\/10.5505\/pajes.2018.15931.","DOI":"10.5505\/pajes.2018.15931"},{"key":"2026071004560209107_j_comp-2025-0061_ref_034","doi-asserted-by":"crossref","unstructured":"C. Toraman, E. H. Yilmaz, F. \u015eahi\u0307nu\u00e7, and O. Ozcelik, \u201cImpact of tokenization on language models: An analysis for Turkish,\u201d ACM Trans. Asian Low-Resour. Lang. Inf. Process., vol.\u00a022, no.\u00a04, pp.\u00a01\u201321, 2023, https:\/\/doi.org\/10.1145\/3578707.","DOI":"10.1145\/3578707"},{"key":"2026071004560209107_j_comp-2025-0061_ref_035","doi-asserted-by":"crossref","unstructured":"E. Mumcuo\u011flu, C. E. \u00d6zt\u00fcrk, H. M. Ozaktas, and A. Ko\u00e7, \u201cNatural language processing in law: Prediction of outcomes in the higher courts of Turkey,\u201d Inf. Process. Manag., vol.\u00a058, no.\u00a05, 2021, https:\/\/doi.org\/10.1016\/j.ipm.2021.102684.","DOI":"10.1016\/j.ipm.2021.102684"},{"key":"2026071004560209107_j_comp-2025-0061_ref_036","doi-asserted-by":"crossref","unstructured":"H. Karayi\u011fit, A. Akda\u011fli, and \u00c7. Ac\u0131, \u201cPerformance comparison of data balancing techniques on hate speech detection in Turkish,\u201d PAJES, vol. 30, no. 5, pp. 610\u2013621, 2024. https:\/\/doi.org\/10.5505\/pajes.2023.40072.","DOI":"10.5505\/pajes.2023.40072"},{"key":"2026071004560209107_j_comp-2025-0061_ref_037","doi-asserted-by":"crossref","unstructured":"J. R. Landis and G. G. Koch, \u201cThe measurement of observer agreement for categorical data,\u201d Biometrics, vol.\u00a033, no.\u00a01, pp.\u00a0159\u2013174, 1977, https:\/\/doi.org\/10.2307\/2529310.","DOI":"10.2307\/2529310"},{"key":"2026071004560209107_j_comp-2025-0061_ref_038","unstructured":"A. A. Ak\u0131n and M. D. Ak\u0131n, \u201cZemberek, an open source NLP framework for Turkic languages. GitHub repository,\u201d 2013. Available at: https:\/\/github.com\/ahmetaa\/zemberek-nlp."},{"key":"2026071004560209107_j_comp-2025-0061_ref_039","unstructured":"G. Lema\u00eetre, F. Nogueira, and C. K. Aridas, \u201cImbalanced-learn: A Python toolbox to tackle the curse of imbalanced datasets in machine learning,\u201d J. Mach. Learn. Res., vol.\u00a018, no.\u00a017, pp.\u00a01\u20135, 2017."},{"key":"2026071004560209107_j_comp-2025-0061_ref_040","unstructured":"J. Cohen, Statistical Power Analysis for the Behavioral Sciences, 2nd ed., Hillsdale, NJ, Lawrence Erlbaum Associates, 1988."},{"key":"2026071004560209107_j_comp-2025-0061_ref_041","doi-asserted-by":"crossref","unstructured":"D. Elreedy, A. F. Atiya, and F. Kamalov, \u201cA theoretical distribution analysis of synthetic minority oversampling technique (SMOTE) for imbalanced learning,\u201d Mach. Learn., vol. 113, no. 7, pp. 4903\u20134923, 2024. https:\/\/doi.org\/10.1007\/s10994-022-06296-4.","DOI":"10.1007\/s10994-022-06296-4"},{"key":"2026071004560209107_j_comp-2025-0061_ref_042","doi-asserted-by":"crossref","unstructured":"D. Dablain, B. Krawczyk, and N. V. Chawla, \u201cDeepSMOTE: Fusing deep learning and SMOTE for imbalanced data,\u201d IEEE Trans. Neural Netw. Learn. Syst., vol.\u00a034, no.\u00a09, pp.\u00a06390\u20136404, 2023, https:\/\/doi.org\/10.1109\/TNNLS.2021.3136503.","DOI":"10.1109\/TNNLS.2021.3136503"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0061\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0061\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T04:56:12Z","timestamp":1783659372000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/comp-2025-0061\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,1]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,7,10]]},"published-print":{"date-parts":[[2026,1,23]]}},"alternative-id":["10.1515\/comp-2025-0061"],"URL":"https:\/\/doi.org\/10.1515\/comp-2025-0061","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,1]]},"article-number":"20250061"}}