{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T21:42:41Z","timestamp":1776634961511,"version":"3.51.2"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s11704-024-3631-1","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T04:13:24Z","timestamp":1732076004000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PBCounter: weighted model counting on pseudo-boolean formulas"],"prefix":"10.1007","volume":"19","author":[{"given":"Yong","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenghang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"3631_CR1","first-page":"1249","volume-title":"Proceedings of 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"T Baluta","year":"2019","unstructured":"Baluta T, Shen S, Shinde S, Meel K S, Saxena P. Quantitative verification of neural networks and its security applications. In: Proceedings of 2019 ACM SIGSAC Conference on Computer and Communications Security. 2019, 1249\u20131264."},{"key":"3631_CR2","first-page":"4488","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"L Duenas-Osorio","year":"2017","unstructured":"Duenas-Osorio L, Meel K S, Paredes R, Vardi M Y. Counting-based reliability estimation for power-transmission grids. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2017, 4488\u20134494."},{"key":"3631_CR3","volume-title":"RECOMB Comparative Genomics(RECOMB-CG), Montpellier, France, October 1\u20134","author":"P Sashittal","year":"2019","unstructured":"Palash Sashittal, and Mohammed El-Kebir SharpTNl: counting and sampling parsimonious transmission networks under a weak bottleneck. RECOMB Comparative Genomics(RECOMB-CG), Montpellier, France, October 1\u20134, 2019"},{"issue":"1\u20132","key":"3631_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D Roth","year":"1996","unstructured":"Roth D. On the hardness of approximate reasoning. Artificial Intelligence, 1996, 82(1\u20132): 273\u2013302","journal-title":"Artificial Intelligence"},{"key":"3631_CR5","first-page":"475","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence","author":"T Sang","year":"2005","unstructured":"Sang T, Beame P, Kautz H. Performing Bayesian inference by weighted model counting. In: Proceedings of the 20th National Conference on Artificial Intelligence. 2005, 475\u2013481."},{"issue":"6\u20137","key":"3631_CR6","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.artint.2007.11.002","volume":"172","author":"M Chavira","year":"2008","unstructured":"Chavira M, Darwiche A. On probabilistic inference by weighted model counting. Artificial Intelligence, 2008, 172(6\u20137): 772\u2013799","journal-title":"Artificial Intelligence"},{"key":"3631_CR7","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2289","volume":"30","author":"C Domshlak","year":"2007","unstructured":"Domshlak C, Hoffmann J. Probabilistic planning via heuristic forward search and weighted model counting. Journal of Artificial Intelligence Research, 2007, 30: 565\u2013620","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3\u20134","key":"3631_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1561\/1900000052","volume":"7","author":"G Van Den Broeck","year":"2017","unstructured":"Van Den Broeck G, Suciu D. Query processing on probabilistic data: a survey. Foundations and Trends\u00ae in Databases, 2017, 7(3\u20134): 197\u2013341","journal-title":"Foundations and Trends\u00ae in Databases"},{"issue":"3","key":"3631_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens D, Van Den Broeck G, Renkens J, Shterionov D, Gutmann B, Thon I, Janssens G, Raedt L D. Inference and learning in probabilistic logic programs using weighted Boolean formulas. Theory and Practice of Logic Programming, 2015, 15(3): 358\u2013401","journal-title":"Theory and Practice of Logic Programming"},{"key":"3631_CR10","first-page":"3851","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"Y Lai","year":"2021","unstructured":"Lai Y, Meel K S, Yap R H C. The power of literal equivalence in model counting. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2021, 3851\u20133859."},{"key":"3631_CR11","first-page":"1","volume-title":"Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing","author":"T Sang","year":"2004","unstructured":"Sang T, Bacchus F, Beame P, Kautz H, Pitassi T. Combining component caching and clause learning for effective model counting. In: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing. 2004, 1\u20139."},{"key":"3631_CR12","first-page":"424","volume-title":"Proceedings of the 9th International Conference Theory and Applications of Satisfiability Testing","author":"M Thurley","year":"2006","unstructured":"Thurley M. sharpSAT - counting models with advanced component caching and implicit BCP. In: Proceedings of the 9th International Conference Theory and Applications of Satisfiability Testing. 2006, 424\u2013429."},{"key":"3631_CR13","first-page":"1169","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","author":"S Sharma","year":"2019","unstructured":"Sharma S, Roy S, Soos M, Meel K S. GANAK: a scalable probabilistic exact model counter. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019, 1169\u20131176."},{"key":"3631_CR14","first-page":"667","volume-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","author":"J M Lagniez","year":"2017","unstructured":"Lagniez J M, Marquis P. An improved decision-DNNF compiler. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. 2017, 667\u2013673."},{"key":"3631_CR15","first-page":"1468","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"J Dudek","year":"2020","unstructured":"Dudek J, Phan V, Vardi M. ADDMC: weighted model counting with algebraic decision diagrams. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2020, 1468\u20131476."},{"key":"3631_CR16","first-page":"343","volume-title":"Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing","author":"M Hecher","year":"2020","unstructured":"Hecher M, Thier P, Woltran S. Taming high treewidth with abstraction, nested dynamic programming, and database technology. In: Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing. 2020, 343\u2013360."},{"key":"3631_CR17","first-page":"255","volume-title":"Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence","author":"S Ermon","year":"2012","unstructured":"Ermon S, Gomes C, Selman B. Uniform solution sampling using a constraint solver as an oracle. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence. 2012, 255\u2013264."},{"key":"3631_CR18","first-page":"200","volume-title":"Proceedings of the 19th International Conference on Principles and Practice of Constraint Programing","author":"S Chakraborty","year":"2013","unstructured":"Chakraborty S, Meel K S, Vardi M Y. A scalable approximate model counter. In: Proceedings of the 19th International Conference on Principles and Practice of Constraint Programing. 2013, 200\u2013216."},{"key":"3631_CR19","first-page":"4025","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"Y Lai","year":"2023","unstructured":"Lai Y, Meel K S, Yap R H C. Fast converging anytime model counting. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2023, 4025\u20134034."},{"key":"3631_CR20","first-page":"1891","volume-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","author":"D Le Berre","year":"2018","unstructured":"Le Berre D, Marquis P, Mengel S, Wallon R. Pseudo-Boolean constraints from a knowledge representation perspective. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1891\u20131897."},{"key":"3631_CR21","first-page":"1","volume-title":"Proceedings of 2018 IEEE International Conference on Future IoT Technologies (Future IoT)","author":"G Kov\u00e1sznai","year":"2018","unstructured":"Kov\u00e1sznai G, Erd\u00e9lyi B, Bir\u00f3 C. Investigations of graph properties in terms of wireless sensor network optimization. In: Proceedings of 2018 IEEE International Conference on Future IoT Technologies (Future IoT). 2018, 1\u20138."},{"key":"3631_CR22","first-page":"450","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer Aided Design","author":"F A Aloul","year":"2002","unstructured":"Aloul F A, Ramani A, Markov I L, Sakallah K A. Generic ILP versus specialized 0\u20131 ILP: an update. In: Proceedings of the IEEE\/ACM International Conference on Computer Aided Design. 2002, 450\u2013457."},{"key":"3631_CR23","first-page":"332","volume-title":"Proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing","author":"Z Lei","year":"2021","unstructured":"Lei Z, Cai S, Luo C, Hoos H. Efficient local search for pseudo Boolean optimization. In: Proceedings of the 24th International Conference on Theory and Applications of Satisfiability Testing. 2021, 332\u2013348."},{"key":"3631_CR24","first-page":"346","volume-title":"Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing","author":"F A Aloul","year":"2000","unstructured":"Aloul F A, Ramani A, Markov I L, Sakallah K A. PBS: a backtrack-search pseudo-Boolean solver and optimizer. In: Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing. 2000, 346\u2013353."},{"issue":"1\u20134","key":"3631_CR25","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/SAT190020","volume":"2","author":"H M Sheini","year":"2006","unstructured":"Sheini H M, Sakallah K A. Pueblo: a hybrid pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 2006, 2(1\u20134): 165\u2013189","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"3631_CR26","first-page":"1291","volume-title":"Proceedings of the 27th International Joint Conference on Artificial Intelligence","author":"J Elffers","year":"2018","unstructured":"Elffers J, Nordstr\u00f6m J. Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence. 2018, 1291\u20131299."},{"key":"3631_CR27","first-page":"12","volume-title":"Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming","author":"Y Chu","year":"2023","unstructured":"Chu Y, Cai S, Luo C, Lei Z, Peng C. Towards more efficient local search for pseudo-Boolean optimization. In: Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming. 2023, 12."},{"key":"3631_CR28","first-page":"41","volume-title":"Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming","author":"W Zhou","year":"2023","unstructured":"Zhou W, Zhao Y, Wang Y, Cai S, Wang S, Wang X, Yin M. Improving local search for pseudo Boolean optimization by fragile scoring function and deep optimization. In: Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming. 2023, 41."},{"key":"3631_CR29","first-page":"123","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling","author":"A Huang","year":"2018","unstructured":"Huang A, Lloyd L, Omar M, Boerkoel J. New perspectives on flexibility in simple temporal planning. In: Proceedings of the International Conference on Automated Planning and Scheduling. 2018, 123\u2013131."},{"key":"3631_CR30","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/2642937.2643011","volume-title":"Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering","author":"K Luckow","year":"2014","unstructured":"Luckow K, P\u0103s\u0103reanu C S, Dwyer M B, Filieri A, Visser W. Exact and approximate probabilistic symbolic execution for nondeterministic programs. In: Proceedings of the 29th ACM\/IEEE International Conference on Automated Software Engineering. 2014, 575\u2013586."},{"key":"3631_CR31","first-page":"1697","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence","author":"C Ge","year":"2019","unstructured":"Ge C, Ma F, Ma X, Zhang F, Huang P, Zhang J. Approximating integer solution counting via space quantification for linear constraints. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence. 2019, 1697\u20131703."},{"key":"3631_CR32","first-page":"1389","volume-title":"Proceedings of the 30th International Joint Conference on Artificial Intelligence","author":"C Ge","year":"2021","unstructured":"Ge C, Biere A. Decomposition strategies to count integer solutions over linear constraints. In: Proceedings of the 30th International Joint Conference on Artificial Intelligence. 2021, 1389\u20131395."},{"issue":"2","key":"3631_CR33","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"P G Kolaitis","year":"2000","unstructured":"Kolaitis P G, Vardi M Y. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 2000, 61(2): 302\u2013332","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\u20133","key":"3631_CR34","first-page":"25","volume":"35","author":"G Pan","year":"2005","unstructured":"Pan G, Vardi M Y. Symbolic techniques in satisfiability solving. Journal of Automated Reasoning, 2005, 35(1\u20133): 25\u201350","journal-title":"Journal of Automated Reasoning"},{"issue":"1\u20134","key":"3631_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n N, S\u00f6rensson N. Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2006, 2(1\u20134): 1\u201326","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"3631_CR36","volume-title":"Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation","author":"A Aavani","year":"2013","unstructured":"Aavani A, Mitchell D G, Ternovska E. New encoding for translating pseudo-Boolean constraints into SAT. In: Proceedings of the 10th Symposium on Abstraction, Reformulation, and Approximation. 2013"},{"key":"3631_CR37","doi-asserted-by":"publisher","first-page":"103604","DOI":"10.1016\/j.artint.2021.103604","volume":"302","author":"M Bofill","year":"2022","unstructured":"Bofill M, Coll J, Nightingale P, Suy J, Ulrich-Oltean F, Villaret M. SAT encodings for pseudo-Boolean constraints together with at-most-one constraints. Artificial Intelligence, 2022, 302: 103604","journal-title":"Artificial Intelligence"},{"issue":"2\u20133","key":"3631_CR38","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008699807402","volume":"10","author":"R I Bahar","year":"1997","unstructured":"Bahar R I, Frohm E A, Gaona C M, Hachtel G D, Macii E, Pardo A, Somenzi F. Algebric decision diagrams and their applications. Formal Methods in System Design, 1997, 10(2\u20133): 171\u2013206","journal-title":"Formal Methods in System Design"},{"issue":"3","key":"3631_CR39","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R E Tarjan","year":"1984","unstructured":"Tarjan R E, Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 1984, 13(3): 566\u2013579","journal-title":"SIAM Journal on Computing"},{"key":"3631_CR40","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/S1571-0653(05)80078-2","volume":"8","author":"A M C A Koster","year":"2001","unstructured":"Koster A M C A, Bodlaender H L, Van Hoesel S P M. Treewidth: computational experiments. Electronic Notes in Discrete Mathematics, 2001, 8: 54\u201357","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"3631_CR41","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.3653","volume":"45","author":"I Ab\u00edo","year":"2012","unstructured":"Ab\u00edo I, Nieuwenhuis R, Oliveras A, Rodr\u00edguez-Carbonell E, Mayer-Eichberger V. A new look at BDDs for pseudo-Boolean constraints. Journal of Artificial Intelligence Research, 2012, 45(1): 443\u2013480","journal-title":"Journal of Artificial Intelligence Research"},{"key":"3631_CR42","first-page":"8","volume-title":"Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming","author":"T Korhonen","year":"2021","unstructured":"Korhonen T, J\u00e4rvisalo M. Integrating tree decompositions into decision heuristics of propositional model counters (short paper). In: Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming. 2021, 8."},{"key":"3631_CR43","first-page":"2688","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence","author":"J M Lagniez","year":"2014","unstructured":"Lagniez J M, Marquis P. Preprocessing for propositional model counting. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence. 2014, 2688\u20132694."},{"key":"3631_CR44","doi-asserted-by":"publisher","first-page":"103229","DOI":"10.1016\/j.artint.2019.103229","volume":"281","author":"J M Lagniez","year":"2020","unstructured":"Lagniez J M, Lonca E, Marquis P. Definability for model counting. Artificial Intelligence, 2020, 281: 103229","journal-title":"Artificial Intelligence"},{"issue":"6","key":"3631_CR45","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10009-016-0433-2","volume":"19","author":"T Van Dijk","year":"2017","unstructured":"Van Dijk T, Van De Pol J. Sylvan: multi-core framework for decision diagrams. International Journal on Software Tools for Technology Transfer, 2017, 19(6): 675\u2013696","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"2","key":"3631_CR46","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J P Warners","year":"1998","unstructured":"Warners J P. A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters, 1998, 68(2): 63\u201369","journal-title":"Information Processing Letters"},{"issue":"1\u20134","key":"3631_CR47","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/SAT190021","volume":"2","author":"O Bailleux","year":"2006","unstructured":"Bailleux O, Boufkhad Y, Roussel O. A translation of pseudo-Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2006, 2(1\u20134): 191\u2013200","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"3631_CR48","first-page":"410","volume-title":"Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing","author":"A Morgado","year":"2006","unstructured":"Morgado A, Matos P J, Manquinho V, Marques-Silva J. Counting models in integer domains. In: Proceedings of the 9th International Conference on Theory and Applications of Satisfiability Testing. 2006, 410\u2013423."},{"key":"3631_CR49","first-page":"297","volume-title":"Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming","author":"T Junttila","year":"2010","unstructured":"Junttila T, Kaski P. Exact cover via satisfiability: an empirical study. In: Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming. 2010, 297\u2013304."},{"issue":"1","key":"3631_CR50","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00453-006-1231-0","volume":"48","author":"S Verdoolaege","year":"2007","unstructured":"Verdoolaege S, Seghir R, Beyls K, Loechner V, Bruynooghe M. Counting integer points in parametric polytopes using Barvinok\u2019s rational functions. Algorithmica, 2007, 48(1): 37\u201366","journal-title":"Algorithmica"},{"key":"3631_CR51","first-page":"751","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence","author":"J M Lagniez","year":"2016","unstructured":"Lagniez J M, Lonca E, Marquis P. Improving model counting by leveraging definability. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence. 2016, 751\u2013757."},{"key":"3631_CR52","first-page":"1","volume-title":"Proceedings of the 41st IEEE\/ACM International Conference on Computer Aided Design","author":"M Soos","year":"2022","unstructured":"Soos M, Meel K S. Arjun: an efficient independent support computation technique and its applications to counting and sampling. In: Proceedings of the 41st IEEE\/ACM International Conference on Computer Aided Design. 2022, 1\u20139."}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3631-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-024-3631-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-024-3631-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T21:02:23Z","timestamp":1776632543000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-024-3631-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["3631"],"URL":"https:\/\/doi.org\/10.1007\/s11704-024-3631-1","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"7 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests\n                      The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"193402"}}