{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T01:11:05Z","timestamp":1743556265258,"version":"3.40.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62106206"],"award-info":[{"award-number":["62106206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Comput Intell Syst"],"DOI":"10.1007\/s44196-025-00798-4","type":"journal-article","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:40:18Z","timestamp":1743554418000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Instance Assignment Coverage Feature for Operation Control of SAT Solver"],"prefix":"10.1007","volume":"18","author":[{"given":"Zhihui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuwei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanfeng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,31]]},"reference":[{"key":"798_CR1","doi-asserted-by":"crossref","unstructured":"Marques Silva, J.P., Sakallah, K.A.: GRASP\u2014a new search algorithm for satisfiability. In: Rutenbar, R.A., Otten, R.H.J.M. (eds.) Proceedings of the 1996 IEEE\/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10\u201314, 1996, pp. 220\u2013227. IEEE (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"798_CR2","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., et al.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18\u201322, 2001, pp. 530\u2013535. ACM (2001)","DOI":"10.1145\/378239.379017"},{"key":"798_CR3","doi-asserted-by":"crossref","unstructured":"Jamali, S., Mitchell, D.: Simplifying CDCL clause database reduction. In: Janota, M., Lynce, I. (eds.), Theory and Applications of Satisfiability Testing\u2014SAT 2019\u201422nd International Conference, SAT 2019, Lisbon, Portugal, July 9\u201312, 2019, Proceedings. Lecture Notes in Computer Science, vol. 11628. Springer, pp. 183\u2013192 (2019)","DOI":"10.1007\/978-3-030-24258-9_12"},{"key":"798_CR4","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Biere, A., et al. Handbook of Satisfiability\u20142nd edn, vol. 336. Frontiers in Artificial Intelligence and Applications, pp. 133\u2013182. IOS Press (2021)","DOI":"10.3233\/FAIA200987"},{"key":"798_CR5","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1613\/jair.1.13666","volume":"74","author":"S Cai","year":"2022","unstructured":"Cai, S., et al.: Better decision heuristics in CDCL through local search and target phases. J. Artif. Intell. Res. 74, 1515\u20131563 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"798_CR6","unstructured":"SAT Competitions (2023). https:\/\/github.com\/satcompetition\/2023"},{"key":"798_CR7","doi-asserted-by":"crossref","unstructured":"Newsham, Z., et al.: Impact of community structure on SAT solver performance. In: Sinz, C., Egly, U. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2014\u201417th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14\u201317, 2014. Proceedings, vol. 8561. Lecture Notes in Computer Science, pp. 252\u2013268. Springer (2014)","DOI":"10.1007\/978-3-319-09284-3_20"},{"issue":"3","key":"798_CR8","first-page":"46:1","volume":"55","author":"TN Al-Yahya","year":"2023","unstructured":"Al-Yahya, T.N., Menai, M.E.B., Mathkour, H.: On the structure of the boolean satisfiability problem: a survey. ACM Comput. Surv. 55(3), 46:1-46:34 (2023)","journal-title":"ACM Comput. Surv."},{"key":"798_CR9","unstructured":"Kilby, P., et al.: Backbones and backdoors in satisfiability. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9\u201313, 2005, Pittsburgh, Pennsylvania, USA. AAAI Press\/The MIT Press, pp. 1368\u20131373 (2005)"},{"key":"798_CR10","doi-asserted-by":"crossref","unstructured":"Previti, A., J\u00e4rvisalo, M.: A preference-based approach to backbone computation with application to argumentation. In: Haddad, H.M., Wainwright, R.L., Chbeir, R. (eds.) Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC 2018, Pau, France, April 09\u201313, 2018, pp. 896\u2013902. ACM (2018)","DOI":"10.1145\/3167132.3167230"},{"key":"798_CR11","doi-asserted-by":"crossref","unstructured":"Guo, S., et al.: Backbone solving algorithm based on heuristic thinking. In: Proceedings of the 3rd International Conference on Machine Learning and Soft Computing, ICMLSC 2019, Da Lat, Vietnam, January 25\u201328, 2019. ACM, pp. 44\u201348 (2019)","DOI":"10.1145\/3310986.3310989"},{"key":"798_CR12","unstructured":"Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: Gottlob, G., Walsh, T. (eds.) IJCAI-03, Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, August 9\u201315, 2003. Morgan Kaufmann, pp. 1173\u20131178 (2003)"},{"key":"798_CR13","doi-asserted-by":"crossref","unstructured":"Soumya, C., Kambhampati, T.L.: Phase transition and network structure in realistic SAT Problems\u201d. In: des Jardins, M., Littman, M.L. (eds.) Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14\u201318, 2013, Bellevue, Washington, USA, pp. 1619\u20131620. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8529"},{"key":"798_CR14","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: On the structure of industrial SAT instances. In: Gent, I.P. (ed.) Principles and Practice of Constraint Programming\u2014CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20\u201324, 2009, Proceedings, vol. 5732. Lecture Notes in Computer Science, pp. 127\u2013141. Springer (2009)","DOI":"10.1007\/978-3-642-04244-7_13"},{"key":"798_CR15","doi-asserted-by":"crossref","unstructured":"Ganian, R., et al.: SAT-encodings for treecut width and treedepth. In: Kobourov, S.G., Meyerhenke, H. (eds.) Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, ALENEX 2019, San Diego, CA, USA, January 7\u20138, 2019, pp. 117\u2013129. SIAM (2019)","DOI":"10.1137\/1.9781611975499.10"},{"key":"798_CR16","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Simon, L.: Eigenvector centrality in industrial SAT instances. In: Milano, M. (ed.) Principles and Practice of Constraint Programming\u201418th International Conference, CP 2012, Qu\u00e9bec City, QC, Canada, October 8\u201312, 2012. Proceedings, vol. 7514. Lecture Notes in Computer Science, pp. 348\u2013356. Springer (2012)","DOI":"10.1007\/978-3-642-33558-7_27"},{"key":"798_CR17","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., Gir\u00e1ldez-Cru, J., Jordi, L.: The community structure of SAT formulas. In: Cimatti, A., Sebastiani, R. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2012\u201415th International Conference, Trento, Italy, June 17\u201320, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7317, pp. 410\u2013423. Springer (2012)","DOI":"10.1007\/978-3-642-31612-8_31"},{"key":"798_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.1.11741","volume":"66","author":"C Ans\u00f3tegui","year":"2019","unstructured":"Ans\u00f3tegui, C., et al.: Community structure in industrial SAT instances. J. Artif. Intell. Res. 66, 443\u2013472 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"798_CR19","unstructured":"Chunxiao, L., et al.: On the hierarchical community structure of practical SAT formulas. arXiv:2103.14992 (2021)"},{"issue":"3","key":"798_CR20","doi-asserted-by":"publisher","first-page":"303","DOI":"10.3390\/e23030303","volume":"23","author":"Z Zhang","year":"2021","unstructured":"Zhang, Z., Xu, D., Zhou, J.: A structural entropy measurement principle of propositional formulas in conjunctive normal form. Entropy 23(3), 303 (2021)","journal-title":"Entropy"},{"key":"798_CR21","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11\u201317, 2009, pp. 399\u2013404 (2009)"},{"key":"798_CR22","doi-asserted-by":"crossref","unstructured":"Liang, J.H., et al.: Understanding VSIDS branching heuristics in conflict-driven clause-learning SAT solvers. In: Piterman, N. (ed.) Hardware and Software: Verification and Testing\u201411th International Haifa Verification Conference, HVC 2015, Haifa, Israel, November 17\u201319, 2015, Proceedings, vol. 9434. Lecture Notes in Computer Science, pp. 225\u2013241. Springer (2015)","DOI":"10.1007\/978-3-319-26287-1_14"},{"key":"798_CR23","doi-asserted-by":"crossref","unstructured":"Liang, J.H., et al.: Learning rate based branching heuristic for SAT solvers. In: Creignou, N., Le Berre, D. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2016\u201419th International Conference, Bordeaux, France, July 5\u20138, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9710, pp.123\u2013140. Springer (2016)","DOI":"10.1007\/978-3-319-40970-2_9"},{"key":"798_CR24","doi-asserted-by":"crossref","unstructured":"Jamali, S., Mitchell, D.: Improving SAT solver performance with structure-based preferential bumping. In: Benzm\u00fcller, C., Lisetti, C.L., Theobald, M. (eds.) GCAI 2017, 3rd Global Conference on Artificial Intelligence, Miami, FL, USA, 18\u201322 October 2017, vol. 50. EPiC Series in Computing. EasyChair, pp. 175\u2013187 (2017)","DOI":"10.29007\/3pxg"},{"key":"798_CR25","doi-asserted-by":"crossref","unstructured":"Jamali, S., Mitchell, D.: Centrality-based improvements to CDCL heuristics. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2018\u201421st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9\u201312, 2018, Proceedings. Lecture Notes in Computer Science, vol. 10929. Springer, pp. 122\u2013131 (2018)","DOI":"10.1007\/978-3-319-94144-8_8"},{"key":"798_CR26","doi-asserted-by":"crossref","unstructured":"Audemard, G., Simon, L.: Refining restarts strategies for SAT and UNSAT. In: Milano, M. (ed.) Principles and Practice of Constraint Programming\u201418th International Conference, CP 2012, Qu\u00e9bec City, QC, Canada, October 8\u201312, 2012. Proceedings, vol. 7514. Lecture Notes in Computer Science. Springer, pp. 118\u2013126 (2012)","DOI":"10.1007\/978-3-642-33558-7_11"},{"key":"798_CR27","unstructured":"Haberlandt, A., Green, H., Heule, M.J.H..: Effective auxiliary variables via structured reencoding. In: Mahajan, M., Slivovsky, F. (eds.) 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4\u20138, 2023, Alghero, Italy, vol. 271. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 11:1\u201311:19 (2023)"},{"key":"798_CR28","unstructured":"Haberlandt, A., Green, H.: SBVA-CADICAL and SBVA-KISSAT: structured bounded variable addition. In: 26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, July 4\u20138, 2023, Alghero, Italy. LIPIcs, p. 18 (2023)"},{"key":"798_CR29","unstructured":"Zulkoski, E., et al.: Relating complexity-theoretic parameters with SAT solver performance. arXiv:1706.08611 (2017)"},{"key":"798_CR30","doi-asserted-by":"crossref","unstructured":"Zulkoski, E., et al.: Learning-sensitive backdoors with restarts. In: John N. Hooker (eds.) Principles and Practice of Constraint Programming\u201424th International Conference, CP 2018, Lille, France, August 27\u201331, 2018, Proceedings, vol. 11008. Lecture Notes in Computer Science, pp. 453\u2013469. Springer (2018)","DOI":"10.1007\/978-3-319-98334-9_30"},{"key":"798_CR31","unstructured":"Biere, A., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba Entering the SAT Competition 2021. In: Balyo, T. et al. (eds.) Proceedings of SAT Competition 2021\u2014Solver and Benchmark Descriptions, vol. B-2021-1. Department of Computer Science Report Series B. University of Helsinki, pp. 10\u201313 (2021)"},{"key":"798_CR32","doi-asserted-by":"crossref","unstructured":"S. Cai, Zhang, X.: Deep cooperation of CDCL and local search for SAT (extended abstract). In: De Raedt, L. (ed.) Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23\u201329 July 2022, pp. 5274\u20135278. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/734"},{"key":"798_CR33","doi-asserted-by":"crossref","unstructured":"Zulkoski, E., et al.: The effect of structural measures and merges on SAT solver performance. In: Hooker, J.N. (ed.) Principles and Practice of Constraint Programming\u201424th International Conference, CP 2018, Lille, France, August 27\u201331, 2018, Proceedings, vol. 11008. Lecture Notes in Computer Science, pp. 436\u2013452. Springer (2018)","DOI":"10.1007\/978-3-319-98334-9_29"},{"key":"798_CR34","unstructured":"Liang, J.H., et al.: Exponential recency weighted average branching heuristic for SAT solvers. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12\u201317, 2016, Phoenix, Arizona, USA, pp. 3434\u20133440. AAAI Press (2016)"},{"key":"798_CR35","doi-asserted-by":"crossref","unstructured":"Xiao, F., et al.: A branching heuristic for SAT solvers based on complete implication graphs. Sci. China Inf. Sci. 62(7), 72103:1\u201372103:13 (2019)","DOI":"10.1007\/s11432-017-9467-7"},{"key":"798_CR36","doi-asserted-by":"crossref","unstructured":"Audemard, G., et al.: A generalized framework for conflict analysis. In: B\u00fcning, H.K., Zhao, X. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12\u201315, 2008. Proceedings, vol. 4996. Lecture Notes in Computer Science, pp. 21\u201327. Springer (2008)","DOI":"10.1007\/978-3-540-79719-7_3"},{"key":"798_CR37","doi-asserted-by":"crossref","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2007, 10th International Conference, Lisbon, Portugal, May 28\u201331, 2007, Proceedings, vol. 4501. Lecture Notes in Computer Science, pp. 294\u2013299. Springer (2007)","DOI":"10.1007\/978-3-540-72788-0_28"},{"key":"798_CR38","doi-asserted-by":"crossref","unstructured":"S\u00f6rensson, N., Biere, A.: Minimizing learned clauses. In: Kullmann, O. (ed.) Theory and Applications of Satisfiability Testing\u2014SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30\u2013July 3, 2009. Proceedings, vol. 5584. Lecture Notes in Computer Science, pp. 237\u2013243. Springer (2009)","DOI":"10.1007\/978-3-642-02777-2_23"},{"key":"798_CR39","doi-asserted-by":"crossref","unstructured":"Luo, M., et al.: An effective learnt clause minimization approach for CDCL SAT solvers. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19\u201325, 2017. ijcai.org, pp. 703\u2013711 (2017)","DOI":"10.24963\/ijcai.2017\/98"},{"key":"798_CR40","unstructured":"Jamali, S., Mitchell, D.: An experimental study of permanently stored learned clauses. arXiv:2110.14187 (2021)"},{"key":"798_CR41","doi-asserted-by":"crossref","unstructured":"Audemard, G., Simon, L.: On the glucose SAT solver. In: Int. J. Artif. Intell. Tools 27(1), 1840001:1\u20131840001:25 (2018)","DOI":"10.1142\/S0218213018400018"},{"key":"798_CR42","doi-asserted-by":"crossref","unstructured":"Chowdhury, Md.S., M\u00fcller, M., You, J.-H.: Guiding CDCL SAT search via random exploration amid conflict depression\u2019. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7\u201312, 2020, pp. 1428\u20131435. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i02.5500"},{"key":"798_CR43","doi-asserted-by":"crossref","unstructured":"Van Gelder, A.: Generalized conflict-clause strengthening for satisfiability solvers. In: Sakallah, K.A., Simon, L. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2011\u201414th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19\u201322, 2011. Proceedings, vol. 6695. Lecture Notes in Computer Science, pp. 329\u2013342. Springer (2011)","DOI":"10.1007\/978-3-642-21581-0_26"},{"key":"798_CR44","doi-asserted-by":"publisher","unstructured":"Iser, M., Jabs, C.: Global benchmark database. In: Chakraborty, S., Jiang, J.-H.R. (eds.) 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024), vol. 305. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, (2024), 18:1\u201318:10. 978-3-95977-334-8. https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2024.18.https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.SAT.2024.18","DOI":"10.4230\/LIPIcs.SAT.2024.18"},{"key":"798_CR45","doi-asserted-by":"crossref","unstructured":"Biere, A.: Adaptive restart strategies for conflict driven SAT solvers. In: B\u00fcning, H.K., Zhao, X. (eds.) Theory and Applications of Satisfiability Testing\u2014SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12\u201315, 2008. Proceedings, vol. 4996. Lecture Notes in Computer Science, pp. 28\u201333. Springer (2008)","DOI":"10.1007\/978-3-540-79719-7_4"},{"key":"798_CR46","doi-asserted-by":"crossref","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL restart schemes. In: Le Berre, D., J\u00e4rvisalo, M. (eds.) Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015\/Pragmatics of SAT 2018, Oxford, UK, July 7, 2018, vol. 59. EPiC Series in Computing. EasyChair, pp. 1\u201317 (2018)","DOI":"10.29007\/89dw"},{"key":"798_CR47","unstructured":"Zhang, X., Cai, S.: Relaxed backtracking with rephasing. In: Proceedings of SAT, pp. 15\u201316 (2020)"},{"key":"798_CR48","doi-asserted-by":"publisher","unstructured":"Balint, A., Sch\u00f6ning, U.: Choosing probability distributions for stochastic local search and the role of make versus break\u2019. In: Theory and Applications of Satisfiability Testing (SAT), pp. 16\u201329. (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_3","DOI":"10.1007\/978-3-642-31612-8_3"}],"container-title":["International Journal of Computational Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-025-00798-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44196-025-00798-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44196-025-00798-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T00:41:05Z","timestamp":1743554465000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44196-025-00798-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":48,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["798"],"URL":"https:\/\/doi.org\/10.1007\/s44196-025-00798-4","relation":{},"ISSN":["1875-6883"],"issn-type":[{"value":"1875-6883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,31]]},"assertion":[{"value":"30 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"70"}}