{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:09:46Z","timestamp":1784196586015,"version":"3.55.0"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:00:00Z","timestamp":1749772800000},"content-version":"vor","delay-in-days":3,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2210832, CCF-2318937, CCF-2236233, CCF-2123654"],"award-info":[{"award-number":["CCF-2210832, CCF-2318937, CCF-2236233, CCF-2123654"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Grant"],"award-info":[{"award-number":["Discovery Grant"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,6,10]]},"abstract":"<jats:p>\n                    We present a novel symbolic reasoning engine for SQL which can efficiently generate an input\n                    <jats:italic toggle=\"yes\">I<\/jats:italic>\n                    for\n                    <jats:italic toggle=\"yes\">n<\/jats:italic>\n                    queries\n                    <jats:italic toggle=\"yes\">P<\/jats:italic>\n                    <jats:sub>1<\/jats:sub>\n                    , \u22ef,\n                    <jats:italic toggle=\"yes\">\n                      P\n                      <jats:sub>n<\/jats:sub>\n                    <\/jats:italic>\n                    , such that their outputs on\n                    <jats:italic toggle=\"yes\">I<\/jats:italic>\n                    satisfy a given property (expressed in SMT). This is useful in different contexts, such as disproving equivalence of two SQL queries and disambiguating a set of queries. Our first idea is to reason about an\n                    <jats:italic toggle=\"yes\">under-approximation<\/jats:italic>\n                    of each\n                    <jats:italic toggle=\"yes\">\n                      P\n                      <jats:sub>i<\/jats:sub>\n                    <\/jats:italic>\n                    \u2013that is, a subset of\n                    <jats:italic toggle=\"yes\">\n                      P\n                      <jats:sub>i<\/jats:sub>\n                    <\/jats:italic>\n                    \u2019s input-output behaviors. While it makes our approach both semantics-aware and lightweight, this idea alone is incomplete (as a fixed under-approximation might miss some behaviors of interest). Therefore, our second idea is to perform\n                    <jats:italic toggle=\"yes\">search<\/jats:italic>\n                    over an\n                    <jats:italic toggle=\"yes\">expressive family<\/jats:italic>\n                    of under-approximations (which collectively cover all program behaviors of interest), thereby making our approach complete. We have implemented these ideas in a tool,\n                    <jats:sc>Polygon<\/jats:sc>\n                    , and evaluated it on over 30,000 benchmarks across two tasks (namely, SQL equivalence refutation and query disambiguation). Our evaluation results show that\n                    <jats:sc>Polygon<\/jats:sc>\n                    significantly outperforms all prior techniques.\n                  <\/jats:p>","DOI":"10.1145\/3729303","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T16:02:27Z","timestamp":1749830547000},"page":"1315-1340","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1149-0706","authenticated-orcid":false,"given":"Pinhan","family":"Zhao","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3370-2431","authenticated-orcid":false,"given":"Yuepeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1836-0202","authenticated-orcid":false,"given":"Xinyu","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54580-5_12"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_28"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3182657"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_8"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276514"},{"key":"e_1_3_2_7_2","unstructured":"Ricardo Brancas Miguel Terra-Neves Miguel Ventura Vasco Manquinho and Ruben Martins. 2022. CUBES: a parallel synthesizer for SQL using examples. arXiv preprint arXiv:2203.04995 (2022)."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Jeroen Castelein Maur\u00edcio Aniche Mozhan Soltani Annibale Panichella and Arie van Deursen. 2018. Search-based test data generation for SQL queries. In Proceedings of the 40th international conference on software engineering. 1220\u20131230. doi:10.1145\/3180155.3180202","DOI":"10.1145\/3180155.3180202"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88806-0_3"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00159"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0395-0"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Satish Chandra Stephen J Fink and Manu Sridharan. 2009. Snugglebug: a powerful approach to weakest preconditions. In Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation. 363\u2013374.","DOI":"10.1145\/1542476.1542517"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.14778\/3611540.3611635"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Shumo Chu Daniel Li Chenglong Wang Alvin Cheung and Dan Suciu. 2017. Demonstration of the cosette automated sql prover. In Proceedings of the 2017 ACM International Conference on Management of Data. 1591\u20131594.","DOI":"10.1145\/3035918.3058728"},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Shumo Chu Brendan Murphy Jared Roesch Alvin Cheung and Dan Suciu. 2018. Axiomatic foundations and algorithms for deciding semantic equivalences of SQL queries. arXiv preprint arXiv:1802.02229 (2018).","DOI":"10.14778\/3236187.3236200"},{"key":"e_1_3_2_16_2","unstructured":"Shumo Chu Chenglong Wang Konstantin Weitz and Alvin Cheung. 2017. Cosette: An Automated Prover for SQL.. In CIDR."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3140587.3062348"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Koen Claessen and John Hughes. 2000. QuickCheck: a lightweight tool for random testing of Haskell programs. In Proceedings of the fifth ACM SIGPLAN international conference on Functional programming. 268\u2013279.","DOI":"10.1145\/351240.351266"},{"key":"e_1_3_2_19_2","unstructured":"Fabien Coelho. 2013. DataFiller \u2013 generate random data from database schema. https:\/\/github.com\/memsql\/datafiller."},{"key":"e_1_3_2_20_2","unstructured":"Cosette. 2018. Cosette website. https:\/\/cosette.cs.washington.edu\/."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3656437"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Leonardo Mendon\u00e7a de Moura and Nikolaj S. Bj\u00f8rner. 2008. Z3: An Efficient SMT Solver. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (Lecture Notes in Computer Science Vol. 4963). 337\u2013340. doi:10.1007\/978-3-540-78800-324","DOI":"10.1007\/978-3-540-78800-324"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3338112"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192382"},{"key":"e_1_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Patrice Godefroid. 2007. Compositional dynamic test generation. In Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. 47\u201354.","DOI":"10.1145\/1190216.1190226"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Harrison Goldstein Joseph W Cutler Daniel Dickstein Benjamin C Pierce and Andrew Head. 2024. Property-Based Testing in Practice. In Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering. 1\u201313.","DOI":"10.1145\/3597503.3639581"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3290370"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Todd J Green. 2009. Containment of conjunctive queries on annotated relations. In Proceedings of the 12th international conference on database theory. 296\u2013309.","DOI":"10.1145\/1514894.1514930"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3649849"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/505145.505149"},{"key":"e_1_3_2_31_2","volume-title":"Software Abstractions: logic, language, and analysis","author":"Jackson Daniel","year":"2012","unstructured":"Daniel Jackson. 2012. Software Abstractions: logic, language, and analysis. MIT press."},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Joxan Jaffar Vijayaraghavan Murali and Jorge A Navas. 2013. Boosting concolic testing via interpolation. In Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering. 48\u201358.","DOI":"10.1145\/2491411.2491425"},{"key":"e_1_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Susmit Jha Sumit Gulwani Sanjit A Seshia and Ashish Tiwari. 2010. Oracle-guided component-based program synthesis. In Proceedings of the 32nd ACM\/IEEE International Conference on Software Engineering-Volume 1. 215\u2013224.","DOI":"10.1145\/1806799.1806833"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","unstructured":"Ruyi Ji Jingjing Liang Yingfei Xiong Lu Zhang and Zhenjiang Hu. 2020. Question selection for interactive program synthesis. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. 1143\u20131158.","DOI":"10.1145\/3385412.3386025"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-015-0228-1"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/2345156.2254088"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Leonidas Lampropoulos Diane Gallois-Wong C\u0103t\u0103lin Hri\u0163cu John Hughes Benjamin C Pierce and Li-yao Xia. 2017. Beginner\u2019s luck: a language for property-based generators. In Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages. 114\u2013129.","DOI":"10.1145\/3009837.3009868"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3360607"},{"key":"e_1_3_2_39_2","first-page":"1","volume-title":"Proceedings of the ACM on Programming Languages","author":"Lampropoulos Leonidas","year":"2017","unstructured":"Leonidas Lampropoulos, Zoe Paraskevopoulou, and Benjamin C Pierce. 2017. Generating good generators for inductive relations. Proceedings of the ACM on Programming Languages 2, POPL (2017), 1\u201330."},{"key":"e_1_3_2_40_2","article-title":"QuickChick: Property-Based Testing in Coq","volume":"4","author":"Lampropoulos Leonidas","year":"2018","unstructured":"Leonidas Lampropoulos and Benjamin C Pierce. 2018. QuickChick: Property-Based Testing in Coq. Software Foundations series 4 (2018).","journal-title":"Software Foundations series"},{"key":"e_1_3_2_41_2","first-page":"1","volume-title":"Proceedings of the ACM on Programming Languages","author":"Loc Le Quang","year":"2022","unstructured":"Quang Loc Le, Azalea Raad, Jules Villard, Josh Berdine, Derek Dreyer, and Peter W O\u2019Hearn. 2022. Finding real bugs in big programs with incorrectness logic. Proceedings of the ACM on Programming Languages 6, OOPSLA1 (2022), 1\u201327."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3571209"},{"key":"e_1_3_2_43_2","first-page":"232","volume-title":"FASE 2024","author":"Manquinho Vasco","year":"2024","unstructured":"Vasco Manquinho and Ruben Martins. 2024. Towards Reliable SQL Synthesis: Fuzzing-Based Evaluation and Disambiguation. In FASE 2024, Vol. 14573. Springer Nature, 232."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA200987"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352098"},{"key":"e_1_3_2_46_2","volume-title":"Tools for Discovery, Refinement and Generalization of Functional Properties by Enumerative Testing. Ph.D. Dissertation","author":"Braquehais Rudy Matela","year":"2017","unstructured":"Rudy Matela Braquehais. 2017. Tools for Discovery, Refinement and Generalization of Functional Properties by Enumerative Testing. Ph.D. Dissertation. University of York."},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","unstructured":"Mika\u00ebl Mayer Gustavo Soares Maxim Grechkin Vu Le Mark Marron Oleksandr Polozov Rishabh Singh Benjamin Zorn and Sumit Gulwani. 2015. User interaction models for disambiguation in programming by example. In Proceedings of the 28th Annual ACM Symposium on User Interface Software & Technology. 291\u2013301.","DOI":"10.1145\/2807442.2807459"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_10"},{"key":"e_1_3_2_49_2","unstructured":"Toby Murray. 2020. An under-approximate relational logic: heralding logics of insecurity incorrect implementation & more. arXiv preprint arXiv:2003.04791 (2020)."},{"key":"e_1_3_2_50_2","first-page":"1","volume-title":"Proceedings of the ACM on Programming Languages","author":"O\u2019Hearn Peter W","year":"2019","unstructured":"Peter W O\u2019Hearn. 2019. Incorrectness logic. Proceedings of the ACM on Programming Languages 4, POPL (2019), 1\u201332."},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Rohan Padhye Caroline Lemieux and Koushik Sen. 2019. Jqf: Coverage-guided property-based testing in java. In Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis. 398\u2013401.","DOI":"10.1145\/3293882.3339002"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_7"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3498709"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53291-8_14"},{"key":"e_1_3_2_55_2","volume-title":"34th International Conference on Concurrency Theory (CONCUR 2023)","author":"Raad Azalea","year":"2023","unstructured":"Azalea Raad, Julien Vanegue, Josh Berdine, and Peter O\u2019Hearn. 2023. A General Approach to Under-Approximate Reasoning About Concurrent Programs. In 34th International Conference on Concurrency Theory (CONCUR 2023). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3689720"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/1543134.1411292"},{"key":"e_1_3_2_58_2","first-page":"327","volume-title":"NASA Formal Methods: 7th International Symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings 7","author":"Daniel","year":"2015","unstructured":"Daniel Schwartz-Narbonne, Martin Sch\u00e4f, Dejan Jovanovi\u0107, Philipp R\u00fcmmer, and Thomas Wies. 2015. Conflict-directed graph coverage. In NASA Formal Methods: 7th International Symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings 7. Springer, 327\u2013342."},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","unstructured":"Koushik Sen George Necula Liang Gong and Wontae Choi. 2015. Multise: Multi-path symbolic execution using value summaries. In Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering. 842\u2013853.","DOI":"10.1145\/2786805.2786830"},{"key":"e_1_3_2_60_2","first-page":"160","volume-title":"Haifa verification conference","author":"Sery Ondrej","year":"2011","unstructured":"Ondrej Sery, Grigory Fedyukovich, and Natasha Sharygina. 2011. Interpolation-based function summaries in bounded model checking. In Haifa verification conference. Springer, 160\u2013175."},{"key":"e_1_3_2_61_2","first-page":"114","volume-title":"2012 Formal Methods in Computer-Aided Design (FMCAD)","author":"Sery Ondrej","year":"2012","unstructured":"Ondrej Sery, Grigory Fedyukovich, and Natasha Sharygina. 2012. Incremental upgrade checking by means of interpolation-based function summaries. In 2012 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 114\u2013121."},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3622847"},{"key":"e_1_3_2_63_2","doi-asserted-by":"crossref","unstructured":"Emina Torlak and Rastislav Bodik. 2013. Growing solver-aided languages with Rosette. In Proceedings of the 2013 ACM international symposium on New ideas new paradigms and reflections on programming & software. 135\u2013152.","DOI":"10.1145\/2509578.2509586"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","unstructured":"Emina Torlak and Rastislav Bod\u00edk. 2014. A lightweight symbolic virtual machine for solver-aided host languages. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). 530\u2013541. doi:10.1145\/2594291.2594340","DOI":"10.1145\/2594291.2594340"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_49"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.5555\/1857982.1857985"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17511-4_24"},{"key":"e_1_3_2_68_2","doi-asserted-by":"crossref","unstructured":"Chenglong Wang Alvin Cheung and Rastislav Bodik. 2017. Interactive query synthesis from input-output examples. In Proceedings of the 2017 ACM International Conference on Management of Data. 1631\u20131634.","DOI":"10.1145\/3035918.3058738"},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","unstructured":"Chenglong Wang Alvin Cheung and Rastislav Bodik. 2017. Synthesizing highly expressive SQL queries from input-output examples. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. 452\u2013466.","DOI":"10.1145\/3062341.3062365"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276527"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384350"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.14778\/3685800.3685894"},{"key":"e_1_3_2_73_2","doi-asserted-by":"crossref","unstructured":"Pinhan Zhao Yuepeng Wang and Xinyu Wang. 2025. Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search. arXiv:2504.06542","DOI":"10.1145\/3729303"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","unstructured":"Pinhan Zhao Yuepeng Wang and Xinyu Wang. 2025. Polygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search. doi:10.5281\/zenodo.15059866","DOI":"10.5281\/zenodo.15059866"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342267"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00250"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.1145\/3591271"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729303","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:02:12Z","timestamp":1784196132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":76,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2025,6,10]]}},"alternative-id":["10.1145\/3729303"],"URL":"https:\/\/doi.org\/10.1145\/3729303","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"2024-11-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}