{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EETYSBEFHCR2XTOM7SYAL4UPLV","short_pith_number":"pith:EETYSBEF","schema_version":"1.0","canonical_sha256":"212789048538a3abcdccfcb005f28f5d746ae5d6344668e8c379b0497c7f3ae4","source":{"kind":"arxiv","id":"2403.03193","version":2},"attestation_state":"computed","paper":{"title":"VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.PL","authors_text":"Pinhan Zhao, Xinyu Wang, Yang He, Yuepeng Wang","submitted_at":"2024-03-05T18:30:29Z","abstract_excerpt":"The task of SQL query equivalence checking is important in various real-world applications (including query rewriting and automated grading) that involve complex queries with integrity constraints; yet, state-of-the-art techniques are very limited in their capability of reasoning about complex features (e.g., those that involve sorting, case statement, rich integrity constraints, etc.) in real-life queries. To the best of our knowledge, we propose the first SMT-based approach and its implementation, VeriEQL, capable of proving and disproving bounded equivalence of complex SQL queries. VeriEQL "},"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":"2403.03193","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-03-05T18:30:29Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1657ef2ec90c65eb7ce4c6b8c4c5fbdcefd7e1a64d476c4bc2adbe02eeaa75a8","abstract_canon_sha256":"b42707806267ca8d5e1b8dc7b2fe551418dc17377cf24c5bc9f5d68a7c6c46ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:00.803491Z","signature_b64":"fXp9j3QIuh9Y90jIyKOcpXmPk6Q93zh6MJoPO6V4nYLkjmtEV85HTHb1kV/+vNRC8+ZGogDt+3SPGrBBBf8GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"212789048538a3abcdccfcb005f28f5d746ae5d6344668e8c379b0497c7f3ae4","last_reissued_at":"2026-07-05T07:57:00.802999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:00.802999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.PL","authors_text":"Pinhan Zhao, Xinyu Wang, Yang He, Yuepeng Wang","submitted_at":"2024-03-05T18:30:29Z","abstract_excerpt":"The task of SQL query equivalence checking is important in various real-world applications (including query rewriting and automated grading) that involve complex queries with integrity constraints; yet, state-of-the-art techniques are very limited in their capability of reasoning about complex features (e.g., those that involve sorting, case statement, rich integrity constraints, etc.) in real-life queries. To the best of our knowledge, we propose the first SMT-based approach and its implementation, VeriEQL, capable of proving and disproving bounded equivalence of complex SQL queries. VeriEQL "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03193","kind":"arxiv","version":2},"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/2403.03193/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":"2403.03193","created_at":"2026-07-05T07:57:00.803057+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03193v2","created_at":"2026-07-05T07:57:00.803057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03193","created_at":"2026-07-05T07:57:00.803057+00:00"},{"alias_kind":"pith_short_12","alias_value":"EETYSBEFHCR2","created_at":"2026-07-05T07:57:00.803057+00:00"},{"alias_kind":"pith_short_16","alias_value":"EETYSBEFHCR2XTOM","created_at":"2026-07-05T07:57:00.803057+00:00"},{"alias_kind":"pith_short_8","alias_value":"EETYSBEF","created_at":"2026-07-05T07:57:00.803057+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05561","citing_title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV","json":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV.json","graph_json":"https://pith.science/api/pith-number/EETYSBEFHCR2XTOM7SYAL4UPLV/graph.json","events_json":"https://pith.science/api/pith-number/EETYSBEFHCR2XTOM7SYAL4UPLV/events.json","paper":"https://pith.science/paper/EETYSBEF"},"agent_actions":{"view_html":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV","download_json":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV.json","view_paper":"https://pith.science/paper/EETYSBEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03193&json=true","fetch_graph":"https://pith.science/api/pith-number/EETYSBEFHCR2XTOM7SYAL4UPLV/graph.json","fetch_events":"https://pith.science/api/pith-number/EETYSBEFHCR2XTOM7SYAL4UPLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV/action/storage_attestation","attest_author":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV/action/author_attestation","sign_citation":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV/action/citation_signature","submit_replication":"https://pith.science/pith/EETYSBEFHCR2XTOM7SYAL4UPLV/action/replication_record"}},"created_at":"2026-07-05T07:57:00.803057+00:00","updated_at":"2026-07-05T07:57:00.803057+00:00"}