{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:27Z","timestamp":1787017407986,"version":"build-2736575974"},"reference-count":64,"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\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["Discovery Grant"],"award-info":[{"award-number":["Discovery Grant"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1762299, CCF-1918889, CNS-1908304, CCF-1901376, CNS-2120696, CCF-2210831, CCF-2319471"],"award-info":[{"award-number":["CCF-1762299, CCF-1918889, CNS-1908304, CCF-1901376, CNS-2120696, CCF-2210831, CCF-2319471"]}],"id":[{"id":"10.13039\/100000001","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                    This paper presents an automated reasoning technique for checking equivalence between graph database queries written in Cypher and relational queries in SQL. To formalize a suitable notion of equivalence in this setting, we introduce the concept of\n                    <jats:italic toggle=\"yes\">database transformers<\/jats:italic>\n                    , which transform database instances between graph and relational models. We then propose a novel verification methodology that checks equivalence modulo a given transformer by reducing the original problem to verifying equivalence between a pair of SQL queries. This reduction is achieved by embedding a subset of Cypher into SQL through syntax-directed translation, allowing us to leverage existing research on automated reasoning for SQL while obviating the need for reasoning simultaneously over two different data models. We have implemented our approach in a tool called\n                    <jats:sc>Graphiti<\/jats:sc>\n                    and used it to check equivalence between graph and relational queries. Our experiments demonstrate that\n                    <jats:sc>Graphiti<\/jats:sc>\n                    is useful both for verification and refutation and that it can uncover subtle bugs, including those found in Cypher tutorials and academic papers.\n                  <\/jats:p>","DOI":"10.1145\/3729319","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T16:02:27Z","timestamp":1749830547000},"page":"1716-1740","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Graphiti: Bridging Graph and Relational Database Queries"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7755-3112","authenticated-orcid":false,"given":"Yang","family":"He","sequence":"first","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5348-5468","authenticated-orcid":false,"given":"Ruijie","family":"Fang","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8006-1230","authenticated-orcid":false,"given":"I\u015f\u0131l","family":"Dillig","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, 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"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"AGE. 2024. Apache AGE. https:\/\/age.apache.org."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208017"},{"key":"e_1_3_2_4_2","unstructured":"Amazon. 2024. What\u2019s the Difference Between a Graph Database and a Relational Database?. https:\/\/aws.amazon.com\/compare\/the-difference-between-graph-and-relational-database\/?nc1=h_ls."},{"key":"e_1_3_2_5_2","first-page":"222","article-title":"Towards a Complete Direct Mapping from Relational Databases to Property Graphs","author":"Boudaoud Abdelkrim","year":"2022","unstructured":"Abdelkrim Boudaoud, Houari Mahfoud, and Azeddine Chikh. 2022. Towards a Complete Direct Mapping from Relational Databases to Property Graphs. Proceedings of the International Conference on Model and Data Engineering (MEDI), 222-235. 10.1007\/978-3-031-21595-7_16","journal-title":"Proceedings of the International Conference on Model and Data Engineering (MEDI)"},{"key":"e_1_3_2_6_2","first-page":"77","article-title":"Optimal Implementation of Conjunctive Queries in Relational Data Bases","author":"Chandra Ashok K.","year":"1977","unstructured":"Ashok K. Chandra and Philip M. Merlin. 1977. Optimal Implementation of Conjunctive Queries in Relational Data Bases. Proceedings of the ACM Symposium on Theory of Computing (STOC), 77-90. 10.1145\/800105.803397","journal-title":"Proceedings of the ACM Symposium on Theory of Computing (STOC)"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0395-0"},{"key":"e_1_3_2_8_2","article-title":"Metamorphic testing: a new approach for generating next test cases","author":"Chen Tsong Yueh","year":"2020","unstructured":"Tsong Yueh Chen, S. C. Cheung, and Siu-Ming Yiu. 2020. Metamorphic testing: a new approach for generating next test cases. CoRRabs\/2002.12543 (2020). https:\/\/arxiv.org\/abs\/2002.12543","journal-title":"CoRR"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3563308"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462180"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236200"},{"key":"e_1_3_2_12_2","article-title":"Cosette: An Automated Prover for SQL","author":"Chu Shumo","year":"2017","unstructured":"Shumo Chu, Chenglong Wang, Konstantin Weitz, and Alvin Cheung. 2017. Cosette: An Automated Prover for SQL. Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR). http:\/\/cidrdb.org\/cidr2017\/papers\/p51-chu-cidr17.pdf","journal-title":"Proceedings of the Biennial Conference on Innovative Data Systems Research (CIDR)"},{"key":"e_1_3_2_13_2","first-page":"510","article-title":"HoTTSQL: proving query rewrites with univalent SQL semantics","author":"Chu Shumo","year":"2017","unstructured":"Shumo Chu, Konstantin Weitz, Alvin Cheung, and Dan Suciu. 2017. HoTTSQL: proving query rewrites with univalent SQL semantics. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 510-524. 10.1145\/3062341.3062348","journal-title":"Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation (PLDI)"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0302-x"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453939"},{"key":"e_1_3_2_16_2","first-page":"689","article-title":"Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant","author":"Delaware Benjamin","year":"2015","unstructured":"Benjamin Delaware, Cl\u00e9ment Pit-Claudel, Jason Gross, and Adam Chlipala. 2015. Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant. Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 689-700. 10.1145\/2676726.2677006","journal-title":"Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)"},{"key":"e_1_3_2_17_2","first-page":"2246","article-title":"Graph Pattern Matching in GQL and SQL\/PGQ","author":"Deutsch Alin","year":"2022","unstructured":"Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, and Fred Zemke. 2022. Graph Pattern Matching in GQL and SQL\/PGQ. International Conference on Management of Data (SIGMOD), 2246-2258. 10.1145\/3514221.3526057","journal-title":"International Conference on Management of Data (SIGMOD)"},{"key":"e_1_3_2_18_2","first-page":"198","article-title":"Clio: Schema Mapping Creation and Data Exchange","author":"Fagin Ronald","year":"2009","unstructured":"Ronald Fagin, Laura M. Haas, Mauricio.A. Hern\u00e1ndez, Ren\u00e9e J. Miller, Lucian Popa, and Yannis Velegrakis. 2009. Clio: Schema Mapping Creation and Data Exchange. Conceptual Modeling: Foundations and Applications \u2013 Essays in Honor of John Mylopoulos (Lecture Notes in Computer Science, Vol. 5600), 198-236. 10.1007\/978-3-642-02463-4_12","journal-title":"Conceptual Modeling: Foundations and Applications \u2013 Essays in Honor of John Mylopoulos (Lecture Notes in Computer Science, Vol. 5600)"},{"key":"e_1_3_2_19_2","first-page":"422","article-title":"Component-based synthesis of table consolidation and transformation tasks from examples","author":"Feng Yu","year":"2017","unstructured":"Yu Feng, Ruben Martins, Jacob Van Geffen, Isil Dillig, and Swarat Chaudhuri. 2017. Component-based synthesis of table consolidation and transformation tasks from examples. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 422-436. 10.1145\/3062341.3062351","journal-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_3_2_21_2","first-page":"211","article-title":"Reconciling manual and automatic refactoring","author":"Ge Xi","year":"2012","unstructured":"Xi Ge, Quinton L. D DuBose, and Emerson R Murphy-Hill. 2012. Reconciling manual and automatic refactoring. International Conference on Software Engineering (ICSE), 211-221. 10.1109\/ICSE.2012.6227192","journal-title":"International Conference on Software Engineering (ICSE)"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9327-6"},{"key":"e_1_3_2_23_2","article-title":"Dynamic Provenance for SPARQL Updates Using Named Graphs","author":"Halpin Harry","year":"2011","unstructured":"Harry Halpin and James Cheney. 2011. Dynamic Provenance for SPARQL Updates Using Named Graphs. Workshop on the Theory and Practice of Provenance (TaPP). 10.1145\/2567948.2577357","journal-title":"Workshop on the Theory and Practice of Provenance (TaPP)"},{"key":"e_1_3_2_24_2","first-page":"1155","article-title":"Semantics and Complexity of GraphQL","author":"Hartig Olaf","year":"2018","unstructured":"Olaf Hartig and Jorge P\u00e9rez. 2018. Semantics and Complexity of GraphQL. Proceedings of the World Wide Web Conference (WWW), 1155-1164. 10.1145\/3178876.3186014","journal-title":"Proceedings of the World Wide Web Conference (WWW)"},{"key":"e_1_3_2_25_2","unstructured":"Yang He Ruijie Fang I\u015eil Dillig and Yuepeng Wang. 2025. Artifact Evaluation Graphiti: Bridging Graph and Relational Database Queries. 10.5281\/zenodo.15043281"},{"key":"e_1_3_2_26_2","unstructured":"Yang He Ruijie Fang Isil Dillig and Yuepeng Wang. 2025. Graphiti: Bridging Graph and Relational Database Queries. arXiv:2504.03182."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3649849"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3597926.3598046"},{"key":"e_1_3_2_29_2","article-title":"Detecting Logic Bugs in Graph Database Management Systems via Injective and Surjective Graph Query Transformation","author":"Jiang Yuancheng","year":"2024","unstructured":"Yuancheng Jiang, Jiahao Liu, Jinsheng Ba, Roland HC Yap, Zhenkai Liang, and Manuel Rigger. 2024. Detecting Logic Bugs in Graph Database Management Systems via Injective and Surjective Graph Query Transformation. Proceedings of the International Conference on Software Engineering (ICSE). 10.1145\/3597503.3623307","journal-title":"Proceedings of the International Conference on Software Engineering (ICSE)"},{"key":"e_1_3_2_30_2","first-page":"683","article-title":"Foofah: Transforming Data By Example","author":"Jin Zhongjun","year":"2017","unstructured":"Zhongjun Jin, Michael R. Anderson, Michael J. Cafarella, and H. V Jagadish. 2017. Foofah: Transforming Data By Example. Proceedings of the ACM International Conference on Management of Data (SIGMOD), 683-698. 10.1145\/3035918.3064034","journal-title":"Proceedings of the ACM International Conference on Management of Data (SIGMOD)"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3563336"},{"key":"e_1_3_2_32_2","unstructured":"Jerry Liang. 2025. openCypher Transpiler. https:\/\/github.com\/microsoft\/openCypherTranspiler."},{"key":"e_1_3_2_33_2","article-title":"Fast In-Memory SQL Analytics on Relationships between Entities","author":"Lin Chunbin","year":"2016","unstructured":"Chunbin Lin, Benjamin Mandel, Yannis Papakonstantinou, and Matthias Springer. 2016. Fast In-Memory SQL Analytics on Relationships between Entities. CoRR abs\/1602.00033 (2016). http:\/\/arxiv.org\/abs\/1602.00033","journal-title":"CoRR"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","unstructured":"Qiuyang Mang Aoyang Fang Boxi Yu Hanfei Chen and Pinjia He. 2024. Testing Graph Database Systems via Equivalent Query Rewriting. Proceedings of the International Conference on Software Engineering (ICSE). 10.1145\/3597503.3639200","DOI":"10.1145\/3597503.3639200"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352098"},{"issue":"1","key":"e_1_3_2_36_2","first-page":"100","article-title":"Differential Testing for Software","volume":"10","author":"McKeeman William M.","year":"1998","unstructured":"William M. McKeeman. 1998. Differential Testing for Software. Digital Technical Journal 10, 1 (1998), 100-107.","journal-title":"Digital Technical Journal"},{"key":"e_1_3_2_37_2","doi-asserted-by":"crossref","unstructured":"Zhengjie Miao Sudeepa Roy and Jun Yang. 2019. Explaining Wrong Queries Using Small Examples. Proceedings of the International Conference on Management of Data (SIGMOD) 503-520. 10.1145\/3299869.3319866","DOI":"10.1145\/3299869.3319866"},{"key":"e_1_3_2_38_2","unstructured":"Ren\u00e9e J. Miller Laura M. Haas and Mauricio A. Hern\u00e1ndez. 2000. Schema Mapping as Query Discovery. Proceedings of the International Conference on Very Large Data Bases (VLDB) 77-88. http:\/\/www.vldb.org\/conf\/2000\/P077.pdf"},{"key":"e_1_3_2_39_2","unstructured":"Neo4j. 2024. Cypher for SQL Users. https:\/\/neo4j.com\/docs\/getting-started\/cypher-intro\/cypher-sql\/."},{"key":"e_1_3_2_40_2","unstructured":"Neo4j. 2024. Neo4j Docs. https:\/\/neo4j.com\/docs\/getting-started\/cypher-intro\/cypher-sql\/#_return_customers_without_existing_orders."},{"key":"e_1_3_2_41_2","unstructured":"Neo4j. 2024. Transition from Relational to Graph Database. https:\/\/neo4j.com\/docs\/getting-started\/appendix\/graphdb-concepts\/graphdb-vs-rdbms\/."},{"key":"e_1_3_2_42_2","unstructured":"NLM. 2024. SemMedDB Database Details - Version 2.0. https:\/\/lhncbc.nlm.nih.gov\/ii\/tools\/SemRep_SemMedDB_SKR\/dbinfo20.html."},{"key":"e_1_3_2_43_2","unstructured":"Stack Overflow. 2024. How could I use this SQL on Cypher (Neo4j). https:\/\/stackoverflow.com\/questions\/43438214\/how-could-i-use-this-sql-on-cypherneo4j."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3632870"},{"key":"e_1_3_2_45_2","first-page":"574","article-title":"Synthesizing data structure refinements from integrity constraints","author":"Pailoor Shankara","year":"2021","unstructured":"Shankara Pailoor, Yuepeng Wang, Xinyu Wang, and Isil Dillig. 2021. Synthesizing data structure refinements from integrity constraints. Proceedings of the International Conference on Programming Language Design and Implementation (PLDI), 574-587. 10.1145\/3453483.3454063","journal-title":"Proceedings of the International Conference on Programming Language Design and Implementation (PLDI)"},{"key":"e_1_3_2_46_2","first-page":"32","article-title":"Repairing serializability bugs in distributed database programs via automated schema refactoring","author":"Rahmani Kia","year":"2021","unstructured":"Kia Rahmani, Kartik Nagar, Benjamin Delaware, and Suresh Jagannathan. 2021. Repairing serializability bugs in distributed database programs via automated schema refactoring. ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI), 32-47. 10.1145\/3453483.3454028","journal-title":"ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI)"},{"key":"e_1_3_2_47_2","first-page":"211:1","article-title":"Finding bugs in database systems via query partitioning","volume":"4","author":"Rigger Manuel","year":"2020","unstructured":"Manuel Rigger and Zhendong Su. 2020. Finding bugs in database systems via query partitioning. Proc. of the ACM on Programming Lang. 4,OOPSLA (2020), 211:1-211:30. 10.1145\/3428279","journal-title":"Proc. of the ACM on Programming Lang."},{"key":"e_1_3_2_48_2","first-page":"431","article-title":"Visualization of mappings between schemas","author":"Robertson George G.","year":"2005","unstructured":"George G. Robertson, Mary Czerwinski, and John E. Churchill. 2005. Visualization of mappings between schemas. Proceedings of the Conference on Human Factors in Computing Systems (CHI), 431-439. 10.1145\/1054972.1055032","journal-title":"Proceedings of the Conference on Human Factors in Computing Systems (CHI)"},{"key":"e_1_3_2_49_2","first-page":"1","article-title":"The Gremlin graph traversal machine and language (invited talk)","author":"Rodriguez Marko A.","year":"2015","unstructured":"Marko A. Rodriguez. 2015. The Gremlin graph traversal machine and language (invited talk). Proceedings of the Symposium on Database Programming Languages (DBPL), 1-10. 10.1145\/2815072.2815073","journal-title":"Proceedings of the Symposium on Database Programming Languages (DBPL)"},{"key":"e_1_3_2_50_2","unstructured":"StackOverflow. 2024. Comparison of relational databases and graph databases. https:\/\/stackoverflow.com\/questions\/ 13046442\/comparison-of-relational-databases-and-graph-databases."},{"key":"e_1_3_2_51_2","unstructured":"Kuzu Team. 2025. Kuzu. https:\/\/kuzudb.com\/."},{"key":"e_1_3_2_52_2","first-page":"569","article-title":"Impossibility of an algorithm for the decision problem in finite classes","volume":"70","author":"Trakhtenbrot Boris A.","year":"1950","unstructured":"Boris A. Trakhtenbrot. 1950. Impossibility of an algorithm for the decision problem in finite classes. Doklady Akademii Nauk SSSR 70, 569-572.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2960414.2960421"},{"key":"e_1_3_2_54_2","first-page":"425","article-title":"Qex: Symbolic SQL Query Explorer","author":"Veanes Margus","year":"2010","unstructured":"Margus Veanes, Nikolai Tillmann, and Jonathan de Halleux. 2010. Qex: Symbolic SQL Query Explorer. International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), 425-446. 10.1007\/978-3-642-17511-4_24","journal-title":"International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR)"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/1900008.1900067"},{"key":"e_1_3_2_56_2","first-page":"452","article-title":"Synthesizing highly expressive SQL queries from input-output examples","author":"Wang Chenglong","year":"2017","unstructured":"Chenglong Wang, Alvin Cheung, and Rastislav Bod\u00edk. 2017. Synthesizing highly expressive SQL queries from input-output examples. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 452-466. 10.1145\/3062341.3062365","journal-title":"Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2012.07.014"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/3158144"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314588"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384350"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908088"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3177735"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534409"},{"key":"e_1_3_2_64_2","first-page":"2735","article-title":"SPES: A Symbolic Approach to Proving Query Equivalence Under Bag Semantics","author":"Zhou Qi","year":"2022","unstructured":"Qi Zhou, Joy Arulraj, Shamkant B. Navathe, William Harris, and Jinpeng Wu. 2022. SPES: A Symbolic Approach to Proving Query Equivalence Under Bag Semantics. International Conference on Data Engineering (ICDE), 2735-2748. 10.1109\/ICDE53745.2022.00250","journal-title":"International Conference on Data Engineering (ICDE)"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342267"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729319","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:09:49Z","timestamp":1784196589000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":64,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2025,6,10]]}},"alternative-id":["10.1145\/3729319"],"URL":"https:\/\/doi.org\/10.1145\/3729319","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"2024-11-14","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"}}]}}