{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T11:08:20Z","timestamp":1784200100181,"version":"3.55.0"},"reference-count":78,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,10,9]]},"abstract":"<jats:p>We present a comprehensive overview of the Datalog facilities in the Flix programming language. We show how programmers can write functions implemented as Datalog programs and we demonstrate how to build modular and reusable families of Datalog programs using first-class Datalog program values, rho abstraction, parametric polymorphism, and type classes. We describe several features that improve the ergonomics, flexibility, and expressive power of Datalog programming in Flix, including the inject and query program constructs, head and guard expressions, functional predicates, lattice semantics, and more.<\/jats:p>\n                  <jats:p>We illustrate Datalog programming in Flix with several applications, including implementations of Ullman's algorithm to stratify Datalog programs, the Ford-Fulkerson algorithm for maximum flow, and the IFDS and IDE algorithms for context-sensitive program analysis. The implementations of IFDS and IDE fulfill a long-term goal: to have fully modular, polymorphic, typed, and declarative formulations of these algorithms that can be instantiated with any abstract domain.<\/jats:p>","DOI":"10.1145\/3763126","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T08:49:50Z","timestamp":1759999790000},"page":"2115-2143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Flix: A Design for Language-Integrated Datalog"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7510-8724","authenticated-orcid":false,"given":"Magnus","family":"Madsen","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9066-1889","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Lhot\u00e1k","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632928"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24206-9_16"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90024-8"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16767-6_5"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3371090"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951948"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25543-5_14"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/6012.15399"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428209"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Martin Bravenboer and Yannis Smaragdakis. 2009. Strictly declarative specification of sophisticated points-to analyses. In Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications. doi:10.1145\/1640089.1640108","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350250"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.43410"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","unstructured":"Neil Conway William R. Marczak Peter Alvaro Joseph M. Hellerstein and David Maier. 2012. Logic and lattices for distributed programming. In Proceedings of the Third ACM Symposium on Cloud Computing. doi:10.1145\/2391229.2391230","DOI":"10.1145\/2391229.2391230"},{"key":"e_1_3_1_17_2","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","year":"2022","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_3_1_18_2","volume-title":"Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers","author":"De Moor Oege","year":"2012","unstructured":"Oege De Moor, Georg Gottlob, Tim Furche, and Andrew Sellers. 2012. Datalog Reloaded: First International Workshop, Datalog 2010, Oxford, UK, March 16-19, 2010. Revised Selected Papers. Vol. 6702. Springer."},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Daniel Deutch Tova Milo Sudeepa Roy and Val Tannen. 2014. Circuits for Datalog Provenance. doi:10.5441\/002\/ICDT.2014.22","DOI":"10.5441\/002\/ICDT.2014.22"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","unstructured":"Jens Dietrich Nicholas Hollingum and Bernhard Scholz. 2015. Giga-scale exhaustive points-to analysis for Java in under a minute. In Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming Systems Languages and Applications. doi:10.1145\/2814270.2814307","DOI":"10.1145\/2814270.2814307"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Neville Grech Lexi Brent Bernhard Scholz and Yannis Smaragdakis. 2019. Gigahorse: Thorough Declarative Decompilation of Smart Contracts. In 2019 IEEE\/ACM 41st International Conference on Software Engineering (ICSE). doi:10.1109\/icse.2019.00120","DOI":"10.1109\/icse.2019.00120"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3416262"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01854-1"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","unstructured":"Todd J. Green Grigoris Karvounarakis and Val Tannen. 2007. Provenance semirings. In Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. doi:10.1145\/1265530.1265535","DOI":"10.1145\/1265530.1265535"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","unstructured":"Daniel Halperin Victor Teixeira de Almeida Lee Lee Choo Shumo Chu Paraschos Koutris Dominik Moritz Jennifer Ortiz Vaspol Ruamviboonsuk Jingjing Wang Andrew Whitaker Shengliang Xu Magdalena Balazinska Bill Howe and Dan Suciu. 2014. Demonstration of the Myria big data management service. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. doi:10.1145\/2588555.2594530","DOI":"10.1145\/2588555.2594530"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Xiaowen Hu David Zhao Herbert Jordan and Bernhard Scholz. 2021. Artifact for Paper: An Efficient Interpreter for Datalog by De-specializing Relations. doi:10.1145\/3410297","DOI":"10.1145\/3410297"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Shan Shan Huang Todd Jeffrey Green and Boon Thau Loo. 2011. Datalog and emerging applications: an interactive tutorial. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. doi:10.1145\/1989323.1989456","DOI":"10.1145\/1989323.1989456"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Herbert Jordan Pavle Suboti\u0107 David Zhao and Bernhard Scholz. 2019a. Brie: A Specialized Trie for Concurrent Datalog. In Proceedings of the 10th International Workshop on Programming Models and Applications for Multicores and Manycores. doi:10.1145\/3303084.3309490","DOI":"10.1145\/3303084.3309490"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Herbert Jordan Pavle Suboti\u0107 David Zhao and Bernhard Scholz. 2019b. A specialized B-tree for concurrent datalog evaluation. In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. doi:10.1145\/3293883.3295719","DOI":"10.1145\/3293883.3295719"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Herbert Jordan Pavle Suboti\u0107 David Zhao and Bernhard Scholz. 2019c. A specialized B-tree for concurrent datalog evaluation. In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming. doi:10.1145\/3293883.3295719","DOI":"10.1145\/3293883.3295719"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Sven K\u00f6hler Bertram Lud\u00e4scher and Yannis Smaragdakis. 2012. Declarative Datalog Debugging for Mere Mortals. Springer Berlin Heidelberg. doi:10.1007\/978-3-642-32925-8_12","DOI":"10.1007\/978-3-642-32925-8_12"},{"key":"e_1_3_1_32_2","unstructured":"Daan Leijen. 2004. First-class labels for extensible rows. (2004)."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1592761.1592785"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3607846"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Magnus Madsen and Ondrej Lhot\u00e1k. 2018. Safe and sound program analysis with Flix. In Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis. doi:10.1145\/3213846.3213847","DOI":"10.1145\/3213846.3213847"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428193"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","unstructured":"Magnus Madsen and Ondrej Lhot\u00e1k. 2025. Flix: A Design for Language-Integrated Datalog (artifact). doi:10.5281\/zenodo.15743443","DOI":"10.5281\/zenodo.15743443"},{"key":"e_1_3_1_39_2","unstructured":"Magnus Madsen Jonathan Lindegaard Starup and Ondrej Lhot\u00e1k. 2022. Flix: A meta programming language for datalog. In Datalog 2.0 2022: 4th International Workshop on the Resurgence of Datalog in Academia and Industry."},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","unstructured":"Magnus Madsen Jonathan Lindegaard Starup and Matthew Lutze. 2023a. Restrictable Variants: A Simple and Practical Alternative to Extensible Variants. doi:10.4230\/LIPICS.ECOOP.2023.17","DOI":"10.4230\/LIPICS.ECOOP.2023.17"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428222"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485487"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3622816"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","unstructured":"Magnus Madsen Ming-Ho Yee and Ondrej Lhot\u00e1k. 2016. From Datalog to flix: a declarative language for fixed points on lattices. In Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145\/2908080.2908096","DOI":"10.1145\/2908080.2908096"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","unstructured":"Carlos Alberto Mart\u00ednez-Angeles In\u00eas Dutra V\u00edtor Santos Costa and Jorge Buenabad-Ch\u00e1vez. 2014. A Datalog Engine for GPUs. Springer International Publishing. doi:10.1007\/978-3-319-08909-6_10","DOI":"10.1007\/978-3-319-08909-6_10"},{"key":"e_1_3_1_46_2","unstructured":"Frank McSherry. 2018. Rust-Lang\/datafrog: A Lightweight Datalog engine in Rust. https:\/\/github.com\/rust-lang\/datafrog. [Accessed 23-06-2025]."},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","unstructured":"Erik Meijer Brian Beckman and Gavin Bierman. 2006. Linq: reconciling object relations and xml in the .net framework. In Proceedings of the 2006 ACM SIGMOD international conference on Management of data. doi:10.1145\/1142473.1142552","DOI":"10.1145\/1142473.1142552"},{"key":"e_1_3_1_48_2","unstructured":"Jack Minker. 1988. Foundations of deductive databases and logic programming. Morgan Kaufmann."},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3290325"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","unstructured":"Nomair A. Naeem Ondrej Lhot\u00e1k and Jonathan Rodriguez. 2010. Practical Extensions to the IFDS Algorithm. Springer Berlin Heidelberg. doi:10.1007\/978-3-642-11970-5_8","DOI":"10.1007\/978-3-642-11970-5_8"},{"key":"e_1_3_1_51_2","unstructured":"Casper Dalgaard Nielsen and Adam Yasser Tallouzi. 2025. Improving the Datalog Engine of Flix. Master\u2019s thesis. Aarhus University. Master\u2019s Thesis."},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","unstructured":"Andr\u00e9 Pacak and Sebastian Erdweg. 2022. Functional Programming with Datalog. doi:10.4230\/LIPICS.ECOOP.2022.7","DOI":"10.4230\/LIPICS.ECOOP.2022.7"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3622824"},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","unstructured":"Andr\u00e9 Pacak Tam\u00e1s Szab\u00f3 and Sebastian Erdweg. 2022. Incremental Processing of Structured Data in Datalog. In Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. doi:10.1145\/3564719.3568686","DOI":"10.1145\/3564719.3568686"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","unstructured":"Adam Paszke and Ningning Xie. 2023. Infix-Extensible Record Types for Tabular Data. In Proceedings of the 8th ACM SIGPLAN International Workshop on Type-Driven Development. doi:10.1145\/3609027.3609406","DOI":"10.1145\/3609027.3609406"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","unstructured":"Thomas Reps Susan Horwitz and Mooly Sagiv. 1995. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL \u201995. doi:10.1145\/199448.199462","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_1_57_2","unstructured":"Leonid Ryzhyk and Mihai Budiu. 2019. Differential Datalog. Datalog 2 (2019)."},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00072-2"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3622840"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","unstructured":"Arash Sahebolamri Thomas Gilray and Kristopher Micinski. 2022. Seamless deductive inference via macros. In Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction. doi:10.1145\/3497776.3517779","DOI":"10.1145\/3497776.3517779"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","unstructured":"Bernhard Scholz Herbert Jordan Pavle Suboti\u0107 and Till Westmann. 2016. On fast large-scale program analysis in Datalog. In Proceedings of the 25th International Conference on Compiler Construction. doi:10.1145\/2892208.2892226","DOI":"10.1145\/2892208.2892226"},{"key":"e_1_3_1_62_2","doi-asserted-by":"crossref","unstructured":"P Griffiths Selinger Morton M Astrahan Donald D Chamberlin Raymond A Lorie and Thomas G Price. 1979. Access path selection in a relational database management system. In Proceedings of the 1979 ACM SIGMOD international conference on Management of data.","DOI":"10.1145\/582095.582099"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","unstructured":"Jiwon Seo. 2018. Datalog Extensions for Bioinformatic Data Analysis. In 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC). doi:10.1109\/embc.2018.8512571","DOI":"10.1109\/embc.2018.8512571"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","unstructured":"Jiwon Seo S. Guo and M. S. Lam. 2013. SociaLite: Datalog extensions for efficient social network analysis. In 2013 IEEE 29th International Conference on Data Engineering (ICDE). doi:10.1109\/icde.2013.6544832","DOI":"10.1109\/icde.2013.6544832"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","unstructured":"Alexander Shkapsky Mohan Yang Matteo Interlandi Hsuan Chiu Tyson Condie and Carlo Zaniolo. 2016. Big Data Analytics with Datalog Queries on Spark. In Proceedings of the 2016 International Conference on Management of Data. doi:10.1145\/2882903.2915229","DOI":"10.1145\/2882903.2915229"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","unstructured":"Ahmedur Rahman Shovon Landon Richard Dyken Oded Green Thomas Gilray and Sidharth Kumar. 2022. Accelerating Datalog applications with cuDF. In 2022 IEEE\/ACM Workshop on Irregular Applications: Architectures and Algorithms (IA3). doi:10.1109\/ia356718.2022.00012","DOI":"10.1109\/ia356718.2022.00012"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","unstructured":"Yannis Smaragdakis and Martin Bravenboer. 2011. Using Datalog for Fast and Easy Program Analysis. Springer Berlin Heidelberg. doi:10.1007\/978-3-642-24206-9_14","DOI":"10.1007\/978-3-642-24206-9_14"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","unstructured":"Yannis Smaragdakis Martin Bravenboer and Ondrej Lhot\u00e1k. 2011. Pick your contexts well: understanding object-sensitivity. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. doi:10.1145\/1926385.1926390","DOI":"10.1145\/1926385.1926390"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","unstructured":"Jonathan Lindegaard Starup Magnus Madsen and Ondrej Lhot\u00e1k. 2023. Breaking the Negative Cycle: Exploring the Design Space of Stratification for First-Class Datalog Constraints. doi:10.4230\/LIPICS.ECOOP.2023.31","DOI":"10.4230\/LIPICS.ECOOP.2023.31"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282500"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","unstructured":"Yihao Sun Ahmedur Rahman Shovon Thomas Gilray Kristopher Micinski and Sidharth Kumar. 2023. Optimizing Datalog for the GPU. doi:10.48550\/ARXIV.2311.02206","DOI":"10.48550\/ARXIV.2311.02206"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/3276509"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","unstructured":"Tam\u00e1s Szab\u00f3 Sebastian Erdweg and G\u00e1bor Bergmann. 2021. Incremental whole-program analysis in Datalog with lattices. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. doi:10.1145\/3453483.3454026","DOI":"10.1145\/3453483.3454026"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","unstructured":"Tam\u00e1s Szab\u00f3 Sebastian Erdweg and Markus Voelter. 2016. IncA: a DSL for the definition of incremental program analyses. In Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering. doi:10.1145\/2970276.2970298","DOI":"10.1145\/2970276.2970298"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.5555\/42790"},{"key":"e_1_3_1_76_2","unstructured":"Todd L Veldhuizen. 2014. Leapfrog triejoin: A simple worst-case optimal join algorithm. In Proc. International Conference on Database Theory."},{"key":"e_1_3_1_77_2","doi-asserted-by":"publisher","unstructured":"John Whaley and Monica S. Lam. 2004. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation. doi:10.1145\/996841.996859","DOI":"10.1145\/996841.996859"},{"key":"e_1_3_1_78_2","doi-asserted-by":"publisher","unstructured":"Carlo Zaniolo Natraj Arni and Kayliang Ong. 1993. Negation and aggregates in recursive rules: the LDL++ approach. Springer Berlin Heidelberg. doi:10.1007\/3-540-57530-8_13","DOI":"10.1007\/3-540-57530-8_13"},{"key":"e_1_3_1_79_2","doi-asserted-by":"publisher","DOI":"10.1145\/3379446"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:09:18Z","timestamp":1784196558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3763126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":78,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2025,10,9]]}},"alternative-id":["10.1145\/3763126"],"URL":"https:\/\/doi.org\/10.1145\/3763126","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"2025-03-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}