{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:U3KEUTASYP4XE4Z2UNQIHJTTYK","short_pith_number":"pith:U3KEUTAS","schema_version":"1.0","canonical_sha256":"a6d44a4c12c3f972733aa36083a673c2a5c7942990dd17107099be3974c5d55d","source":{"kind":"arxiv","id":"2312.10321","version":4},"attestation_state":"computed","paper":{"title":"LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.DB","authors_text":"Amr El Abbadi, Divyakant Agrawal, Fuheng Zhao, Ishtiyaque Ahmad, Jiayue Chen, Lawrence Lim","submitted_at":"2023-12-16T05:01:23Z","abstract_excerpt":"Judging the equivalence between two SQL queries is a fundamental problem with many practical applications in data management and SQL generation (i.e., evaluating the quality of generated SQL queries in text-to-SQL task). While the research community has reasoned about SQL equivalence for decades, it poses considerable difficulties and no complete solutions exist. Recently, Large Language Models (LLMs) have shown strong reasoning capability in conversation, question answering and solving mathematics challenges. In this paper, we study if LLMs can be used to determine the equivalence between SQL"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2312.10321","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-16T05:01:23Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"6c9f03b785391b3d69ded18ebfce56cee691a7794985ea2f0086795bb1369b50","abstract_canon_sha256":"062c3858d2c4efa327dae4df5f5d34b118b8195fcc37cd79c4fac781ba83fc26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:14.526638Z","signature_b64":"IgY1yx7FJ857Cwpw6ZDs37nmNLnliiJw5FuCqwlIaR7PZTLcQSOWLgJtaMiOXd0msirzyDOZ+R53rcAM9EiUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6d44a4c12c3f972733aa36083a673c2a5c7942990dd17107099be3974c5d55d","last_reissued_at":"2026-07-05T10:29:14.526142Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:14.526142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.DB","authors_text":"Amr El Abbadi, Divyakant Agrawal, Fuheng Zhao, Ishtiyaque Ahmad, Jiayue Chen, Lawrence Lim","submitted_at":"2023-12-16T05:01:23Z","abstract_excerpt":"Judging the equivalence between two SQL queries is a fundamental problem with many practical applications in data management and SQL generation (i.e., evaluating the quality of generated SQL queries in text-to-SQL task). While the research community has reasoned about SQL equivalence for decades, it poses considerable difficulties and no complete solutions exist. Recently, Large Language Models (LLMs) have shown strong reasoning capability in conversation, question answering and solving mathematics challenges. In this paper, we study if LLMs can be used to determine the equivalence between SQL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.10321","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.10321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2312.10321","created_at":"2026-07-05T10:29:14.526201+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.10321v4","created_at":"2026-07-05T10:29:14.526201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.10321","created_at":"2026-07-05T10:29:14.526201+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3KEUTASYP4X","created_at":"2026-07-05T10:29:14.526201+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3KEUTASYP4XE4Z2","created_at":"2026-07-05T10:29:14.526201+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3KEUTAS","created_at":"2026-07-05T10:29:14.526201+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.00303","citing_title":"Access Paths for Efficient Ordering with Large Language Models","ref_index":76,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK","json":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK.json","graph_json":"https://pith.science/api/pith-number/U3KEUTASYP4XE4Z2UNQIHJTTYK/graph.json","events_json":"https://pith.science/api/pith-number/U3KEUTASYP4XE4Z2UNQIHJTTYK/events.json","paper":"https://pith.science/paper/U3KEUTAS"},"agent_actions":{"view_html":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK","download_json":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK.json","view_paper":"https://pith.science/paper/U3KEUTAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.10321&json=true","fetch_graph":"https://pith.science/api/pith-number/U3KEUTASYP4XE4Z2UNQIHJTTYK/graph.json","fetch_events":"https://pith.science/api/pith-number/U3KEUTASYP4XE4Z2UNQIHJTTYK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK/action/storage_attestation","attest_author":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK/action/author_attestation","sign_citation":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK/action/citation_signature","submit_replication":"https://pith.science/pith/U3KEUTASYP4XE4Z2UNQIHJTTYK/action/replication_record"}},"created_at":"2026-07-05T10:29:14.526201+00:00","updated_at":"2026-07-05T10:29:14.526201+00:00"}