{"as_of":"2026-08-15T05:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14197bd227798c8c594151e072ca1f828368e2076205fa7452f3640ef927740e","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T20:39:47.287767Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.05561/citation-record","integrity":"/paper/2412.05561/integrity","json":"/paper/2412.05561/citation-record.json","paper":"/paper/2412.05561"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.022210Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.022210Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:c0340d029c966247818cbace9a514e8e30efceaab36cd601756cd9a2623f3959","observation_id":"607df432-45bd-489a-85cc-2b8650213a2a","resolution":{"observed_at":"2026-08-11T20:39:47.022210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.327803Z","title":"F oundations of D atabases: T he L ogical L evel","venue":null,"work_id":"334d0d14-6bd4-44dc-800e-5d5f868a0d6a","year":1995},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.028785Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:55de1e172749c3ea7dc0749c21aa090bee7ec81b81e46c3848088d0af43bbace","observation_id":"32e9d047-7cea-47fe-85c4-fc49a1b96f15","resolution":{"observed_at":"2026-08-11T20:39:48.333474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.310382Z","title":"Sym KGQA : Few-shot knowledge graph question answering via symbolic program generation and execution","venue":null,"work_id":"f625958a-a8af-4aeb-a244-81119ac901f7","year":2024},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.035419Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:a535fbb9a1e6027296bd71a154e94e6fac4d11dc7842c9033b724780718e1585","observation_id":"5b3cc97b-10d6-4e46-ab6d-a11e70201b16","resolution":{"observed_at":"2026-08-11T20:39:48.315752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16673","last_updated":"2023-10-25T14:38:40Z","snapshot_observed_at":"2026-08-13T05:40:38.950291Z","submitted_at":"2023-10-25T14:38:40Z","title":"Exploring Large Language Models for Code Explanation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16673","snapshot_observed_at":"2026-08-11T20:39:47.040654Z","title":"Exploring large language models for code explanation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.040654Z"},"links":{"cited_paper":"/paper/2310.16673","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:4003af5b35b1cc083f7e5eed656cf38af8a0151f95f1b0f9941af0a43a03a338","observation_id":"b1b51836-de14-449d-b04d-20853ef21a16","resolution":{"observed_at":"2026-08-11T20:39:47.040654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-11T20:39:47.051572Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.051572Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7f3e41926b82aa711518779c986aa201d9f037fd52a25bf5987ef43006274de8","observation_id":"f0963c96-e4af-4f70-8df5-59b9d238a1b4","resolution":{"observed_at":"2026-08-11T20:39:47.051572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.00653","last_updated":"2022-01-17T13:04:31Z","snapshot_observed_at":"2026-08-13T17:42:34.144118Z","submitted_at":"2021-11-01T01:50:28Z","title":"SADGA: Structure-Aware Dual Graph Aggregation Network for Text-to-SQL","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.00653","snapshot_observed_at":"2026-08-11T20:39:47.056774Z","title":"Sadga: Structure-aware dual graph aggregation network for text-to-sql","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.056774Z"},"links":{"cited_paper":"/paper/2111.00653","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:e16fbcb1cf646b344f49e07f64aa07ef980d6a61f0a36590cc4a937956cf40ec","observation_id":"67d5a79a-1d32-465c-a4b9-d04ee48e0519","resolution":{"observed_at":"2026-08-11T20:39:47.056774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.293804Z","title":"Calcite Test Suite , 2021","venue":null,"work_id":"d1e9e88e-b9a2-45a2-98d5-5baa35c97389","year":2021},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.062407Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:a1e305f90aa19ce6226244176eb116b5c1cf1be775344ab193092b00589ff331","observation_id":"08fc0b58-53f7-4353-9141-e2991ee8cf4c","resolution":{"observed_at":"2026-08-11T20:39:48.298934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.276026Z","title":"Chandra and Philip M","venue":null,"work_id":"5cf6422e-7829-4f6a-aeed-e1ce6613decc","year":1977},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.068122Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:dac11e2b76deb08720ba7f85ffbada53949f41214b2d410f1d5c4481906cca4c","observation_id":"793690a9-56f2-4777-a062-5ec5e73cec5b","resolution":{"observed_at":"2026-08-11T20:39:48.281172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.259880Z","title":null,"venue":null,"work_id":"f094d4d9-85e1-460a-af1b-cbb1493c9299","year":2014},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.072857Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:0f1883cacacfe9ae288c56c98872b6720db23189446d10679156df712c7677b2","observation_id":"374a238e-bde1-426c-aff4-3dc643a063bb","resolution":{"observed_at":"2026-08-11T20:39:48.264725Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.243262Z","title":null,"venue":null,"work_id":"8e2b6085-3485-44a8-ac63-953efa633b0c","year":1993},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.077768Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:85befa249517b764e024431f6fd74d9b0570ab5b5bebf4a1697efe14d2514272","observation_id":"43b0c497-9414-485e-803e-bd8f2b50bd63","resolution":{"observed_at":"2026-08-11T20:39:48.248037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.226307Z","title":"Conjunctive query containment revisited","venue":null,"work_id":"d0e37f9d-3c26-4579-9085-153e3e040b50","year":1997},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.082473Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:31d261f434d40721fc751168760d3f8be86be1d4a574f0099ea9e14626119ff6","observation_id":"abdf52d3-6175-4c5f-aa35-1ca25557cf37","resolution":{"observed_at":"2026-08-11T20:39:48.231681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.208587Z","title":"Hottsql: proving query rewrites with univalent sql semantics","venue":null,"work_id":"ccb2fd9d-f9ca-402e-af37-559aaa48e111","year":2016},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.088683Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7eacf1a723671cc53746b7951628ee57de871af5f176d7bdcc32c4fb1aaaa7bc","observation_id":"d95f247b-33d3-45e5-95a1-e68724aa84d7","resolution":{"observed_at":"2026-08-11T20:39:48.214245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.190361Z","title":"Cosette: An A utomated P rover for SQL","venue":null,"work_id":"5ba673e0-d3e3-4aa0-9247-185338d7da87","year":2017},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.093853Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:b935f22aa3179b85820a85de145224b46f231087b8e3a46d063050a3395a8599","observation_id":"8e5e57e1-7071-4322-88cd-ecca079460b3","resolution":{"observed_at":"2026-08-11T20:39:48.196180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.099051Z","title":"Axiomatic foundations and algorithms for deciding semantic equivalences of SQL queries","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.099051Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:b0fb6c890d80e292b922fa47c66667b46a875e2cfa0cb798f679d458d231ce97","observation_id":"9565d66d-088e-4ea8-94cc-74494a689b56","resolution":{"observed_at":"2026-08-11T20:39:47.099051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.173285Z","title":"Equivalence of queries combining set and bag-set semantics","venue":null,"work_id":"5a026731-1346-459e-aaeb-29e7d916d9f4","year":2006},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.105041Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:3d1325e614da0ad4072826cd7649c99d2cd6c63455656e1d48f88e0097eceed0","observation_id":"23ff55b3-5751-4fb1-bd8d-4766b6a3429e","resolution":{"observed_at":"2026-08-11T20:39:48.178714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.154112Z","title":"P roving Q uery E quivalence U sing L inear I nteger A rithmetic","venue":null,"work_id":"1e3de306-97a7-4bc3-ae1e-386da001eb8d","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.111679Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:f76917e8977002976836fb5e42ed6caf8b736d132131b868e8a47e8857dfbbf3","observation_id":"7ea3ff45-a061-4209-833a-5e013be16fba","resolution":{"observed_at":"2026-08-11T20:39:48.160612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15363","last_updated":"2023-11-20T13:59:16Z","snapshot_observed_at":"2026-08-14T02:01:57.285127Z","submitted_at":"2023-08-29T14:59:54Z","title":"Text-to-SQL Empowered by Large Language Models: A Benchmark Evaluation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15363","snapshot_observed_at":"2026-08-11T20:39:47.117182Z","title":"Text-to-sql empowered by large language models: A benchmark evaluation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.117182Z"},"links":{"cited_paper":"/paper/2308.15363","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:8725ed9973e107ac2b391abaa0ec9feca22956e47ccc9c36a4693a60ca1c4a3e","observation_id":"1cdc6275-4938-4855-b123-dd256e05eb76","resolution":{"observed_at":"2026-08-11T20:39:47.117182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.136554Z","title":null,"venue":null,"work_id":"7ac34a1b-becf-481c-9a70-3d6d7dcabfde","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.123072Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:29a240fac2dce554c3be017e2009773387a853ab7865b4673e2355cca00ee656","observation_id":"34d289b6-a729-4828-a5be-04f3c0316eda","resolution":{"observed_at":"2026-08-11T20:39:48.141599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-11T20:39:47.129196Z","title":"Gemini: A family of highly capable multimodal models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.129196Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:897be8681d1d4eedecb43999395708f6c0b4e6b33b188a8aa08aaa3c8f2336e1","observation_id":"b7ef3ecf-4d73-40d6-b8cd-1f02291fc221","resolution":{"observed_at":"2026-08-11T20:39:47.129196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.118308Z","title":"Large language models are few-shot summarizers: Multi-intent comment generation via in-context learning","venue":null,"work_id":"07f4d238-199c-4e38-a7be-1035efec6623","year":2024},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.135524Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:b6e9961da2dc4e26485843b40772dc3f11c5f5c8136365bb3487e417a490b89c","observation_id":"ca388ce8-26d2-4f97-9e66-be19fda25ce6","resolution":{"observed_at":"2026-08-11T20:39:48.123375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.101855Z","title":"GE q O : ML - A ccelerated S emantic E quivalence D etection","venue":null,"work_id":"a0631524-0b66-413b-b7b7-7d12de1d00ba","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.141274Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:130b37f81ead3cf6f369f753753cb1f5fd45ab86307e1a188225e4017456331f","observation_id":"8716a5a8-7ba0-45f1-92a5-b9e849fdfc1e","resolution":{"observed_at":"2026-08-11T20:39:48.107170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.03193","last_updated":"2024-03-15T21:40:22Z","snapshot_observed_at":"2026-08-13T16:35:11.897039Z","submitted_at":"2024-03-05T18:30:29Z","title":"VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints","version":2},"cited_work":{"arxiv_id":"2403.03193","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.03193","snapshot_observed_at":"2026-08-11T20:39:47.728049Z","title":"VeriEQL: Bounded Equivalence Verification for Complex SQL Queries with Integrity Constraints","venue":"cs.PL","work_id":"4045ece4-f068-4114-a2ae-0adcce8b54fb","year":2024},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.146881Z"},"links":{"cited_paper":"/paper/2403.03193","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:08c958ae88ac35c00cb49de4c188233f64f6bf54edf6d42d421fc01c24f05d89","observation_id":"208cc48e-e81f-4b0c-b2c3-df0253167613","resolution":{"observed_at":"2026-08-11T20:39:47.734209Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.085395Z","title":"Ioannidis and Raghu Ramakrishnan","venue":null,"work_id":"10b95883-fd25-4b04-823e-4e0c847a1365","year":1995},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.152743Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:3962eb9f45f383eb5bb8f684c18d7d3e78450fb77f7fe10b6157c8f934812fbc","observation_id":"0938ec6d-ab5f-44c6-b27a-c0e04518c44b","resolution":{"observed_at":"2026-08-11T20:39:48.090347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.158036Z","title":"Query optimization in database systems","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.158036Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:8214a25abbb49b13ab5da8d3e45cec3d2f71c0c58e6449eefacdcd94c6a59e89","observation_id":"acd88edf-b86a-4b25-b297-b598c57d02e3","resolution":{"observed_at":"2026-08-11T20:39:47.158036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.068372Z","title":"Johnson and Anthony C","venue":null,"work_id":"555e2d8e-4032-4826-b642-18c20f97545a","year":1983},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.163488Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7324c001840905f0e1ba45489d35e4276ee1ccd68dea3af6a8e94d8c329f51cd","observation_id":"e188ac71-4e34-45b8-8971-31d75dc0bbe5","resolution":{"observed_at":"2026-08-11T20:39:48.073320Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.11916","last_updated":"2023-01-29T05:14:17Z","snapshot_observed_at":"2026-08-13T05:54:24.242465Z","submitted_at":"2022-05-24T09:22:26Z","title":"Large Language Models are Zero-Shot Reasoners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.11916","snapshot_observed_at":"2026-08-11T20:39:47.168506Z","title":"Large language models are zero-shot reasoners","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.168506Z"},"links":{"cited_paper":"/paper/2205.11916","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:f48ee19a0df81aa53fae2b922cc7a69d13993739396ac6d971605a7928727100","observation_id":"169387f7-4471-49e2-a4ff-5d023d10b02c","resolution":{"observed_at":"2026-08-11T20:39:47.168506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.13547","last_updated":"2023-03-12T04:22:01Z","snapshot_observed_at":"2026-08-14T09:04:59.890586Z","submitted_at":"2023-03-12T04:22:01Z","title":"A comprehensive evaluation of ChatGPT's zero-shot Text-to-SQL capability","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.13547","snapshot_observed_at":"2026-08-11T20:39:47.177664Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.177664Z"},"links":{"cited_paper":"/paper/2303.13547","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:24bf323055820d3c5cb0c4a4ee95a3198569a7c373c296e8c088ca2a4882d67a","observation_id":"9919bc6d-a7a4-4cf4-a488-7dac39e7fda0","resolution":{"observed_at":"2026-08-11T20:39:47.177664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.050694Z","title":"G-eval: Nlg evaluation using gpt-4 with better human alignment","venue":null,"work_id":"3859ad64-78a9-44dc-a0b4-a132297e6a47","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.182995Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:bb6c8b0b68f5a87a801d4b5ad32d404f3d09808f81020a891ed3cf22afe04dbf","observation_id":"49daab1f-389a-4001-ba01-e4bdfaec987a","resolution":{"observed_at":"2026-08-11T20:39:48.056537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.030955Z","title":"R eview: B","venue":null,"work_id":"6726bb7a-5b43-46c1-9052-c6bbb0bcbd45","year":1950},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.187887Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:17f4bd744a60201f916a7082483967e6a8de5172208c3155fa41edde348cf370","observation_id":"2f93514a-2012-4e70-9db4-97316e3c1ef7","resolution":{"observed_at":"2026-08-11T20:39:48.037507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-11T20:39:47.193148Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.193148Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:ea4d292362aeb618198b239c0e17bb523409551d63433924dc25f110be51c7a2","observation_id":"322c0802-ea30-43c8-93d4-069aca56f9ad","resolution":{"observed_at":"2026-08-11T20:39:47.193148Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.11015","last_updated":"2023-11-02T20:30:12Z","snapshot_observed_at":"2026-08-15T04:15:49.734341Z","submitted_at":"2023-04-21T15:02:18Z","title":"DIN-SQL: Decomposed In-Context Learning of Text-to-SQL with Self-Correction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.11015","snapshot_observed_at":"2026-08-11T20:39:47.199667Z","title":"Din-sql: Decomposed in-context learning of text-to-sql with self-correction","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.199667Z"},"links":{"cited_paper":"/paper/2304.11015","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:a7b9db8e3e2eb0ccac3e92218d48d22675a34690245901efb23a167b310996c1","observation_id":"da5cb6eb-1f49-4f4c-9cd0-f378b317534b","resolution":{"observed_at":"2026-08-11T20:39:47.199667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06983","last_updated":"2022-10-09T07:01:11Z","snapshot_observed_at":"2026-08-13T17:25:17.493480Z","submitted_at":"2022-05-14T06:27:40Z","title":"RASAT: Integrating Relational Structures into Pretrained Seq2Seq Model for Text-to-SQL","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06983","snapshot_observed_at":"2026-08-11T20:39:47.205346Z","title":"Rasat: Integrating relational structures into pretrained seq2seq model for text-to-sql","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.205346Z"},"links":{"cited_paper":"/paper/2205.06983","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:4ead30406dcac8737fd2e189607afef9d76060cd08336036cd37e6a6889e62ab","observation_id":"7641527f-f08e-4d3b-bbe9-21ad16ebaa32","resolution":{"observed_at":"2026-08-11T20:39:47.205346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-08-13T04:25:38.282910Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-11T20:39:47.211726Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.211726Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:176b7575304c60885912a591225ff28b2bbbabcdddda76179d3b77540a9ae55c","observation_id":"2dd8c059-87ef-433d-81fb-be974f8a6b7e","resolution":{"observed_at":"2026-08-11T20:39:47.211726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16066","last_updated":"2024-12-07T07:30:16Z","snapshot_observed_at":"2026-08-14T23:45:37.405967Z","submitted_at":"2023-12-26T14:37:55Z","title":"A Prompt Learning Framework for Source Code Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16066","snapshot_observed_at":"2026-08-11T20:39:47.217650Z","title":"A prompt learning framework for source code summarization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.217650Z"},"links":{"cited_paper":"/paper/2312.16066","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:fda15ef1b8af758dfaa0e307c0814ea8e2468f6ac0bba679b51ca1ab546a928a","observation_id":"62a0f259-9d14-474f-9b2e-bb0abe22b46f","resolution":{"observed_at":"2026-08-11T20:39:47.217650Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:48.010975Z","title":"T owards P ractical SQL E quivalence R easoning","venue":null,"work_id":"71eedab8-d1fe-462c-9048-c1dc94c0ec51","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.223636Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:485f6eaf9575c44a8be779a1a771f75cf096844066fe90b56ca05b25c3861ee4","observation_id":"2bbfd983-2bf6-46aa-993f-73ba4f4774f8","resolution":{"observed_at":"2026-08-11T20:39:48.017129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.992245Z","title":"We T une: A utomatic D iscovery and V erification of Q uery R ewrite R ules","venue":null,"work_id":"68fb8942-20fd-4bca-b1d2-42a99b923781","year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.228742Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7fe204f310768516f695784b536f703e5c5cd7c6193853d9f22c70961984d50a","observation_id":"7cf04a7d-a1c6-44b2-a954-4d6a8312743a","resolution":{"observed_at":"2026-08-11T20:39:47.997709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.11903","last_updated":"2023-01-10T23:07:57Z","snapshot_observed_at":"2026-08-13T07:04:41.220509Z","submitted_at":"2022-01-28T02:33:07Z","title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.11903","snapshot_observed_at":"2026-08-11T20:39:47.233608Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.233608Z"},"links":{"cited_paper":"/paper/2201.11903","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7dad2664617e6329e4a91e6f1b9c86f22dd93ccfc555205db7d6bc3de539e6ce","observation_id":"4d3cc782-ca32-458e-ba0a-34337ee24632","resolution":{"observed_at":"2026-08-11T20:39:47.233608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05966","last_updated":"2022-10-18T15:56:01Z","snapshot_observed_at":"2026-08-13T20:55:08.950313Z","submitted_at":"2022-01-16T04:36:18Z","title":"UnifiedSKG: Unifying and Multi-Tasking Structured Knowledge Grounding with Text-to-Text Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.05966","snapshot_observed_at":"2026-08-11T20:39:47.238560Z","title":"Wang, Victor Zhong, Bailin Wang, Chengzu Li, Connor Boyle, Ansong Ni, Ziyu Yao, Dragomir R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.238560Z"},"links":{"cited_paper":"/paper/2201.05966","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:9a05cc96f0ab0add55fc8cc96270066bf3702efacc7eca32de72da4677d4796c","observation_id":"27513089-0aaa-4ef7-82a6-a1185e1ba10a","resolution":{"observed_at":"2026-08-11T20:39:47.238560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08314","last_updated":"2020-05-17T17:26:40Z","snapshot_observed_at":"2026-08-14T14:43:15.638769Z","submitted_at":"2020-05-17T17:26:40Z","title":"TaBERT: Pretraining for Joint Understanding of Textual and Tabular Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08314","snapshot_observed_at":"2026-08-11T20:39:47.243698Z","title":"Tabert: Pretraining for joint understanding of textual and tabular data","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.243698Z"},"links":{"cited_paper":"/paper/2005.08314","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:bdec8564eda4f703c283ad52402bb0d226f955f07f7c6b15a7bfa38a7590e18a","observation_id":"32f2c176-29df-4132-aded-d15157e758a9","resolution":{"observed_at":"2026-08-11T20:39:47.243698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.08887","last_updated":"2019-02-02T23:53:18Z","snapshot_observed_at":"2026-08-14T18:24:27.863819Z","submitted_at":"2018-09-24T13:03:13Z","title":"Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Task","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.08887","snapshot_observed_at":"2026-08-11T20:39:47.248574Z","title":"Spider: A large-scale human-labeled dataset for complex and cross-domain semantic parsing and text-to-sql task","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.248574Z"},"links":{"cited_paper":"/paper/1809.08887","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:eccf0f37993aa77b22be7ff92aaf45387ca616906ee849218bce760b58cdf1f2","observation_id":"bbbcbd18-a2c6-475d-b336-e5768988fb79","resolution":{"observed_at":"2026-08-11T20:39:47.248574Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10321","last_updated":"2025-03-12T03:16:27Z","snapshot_observed_at":"2026-08-13T05:00:30.975631Z","submitted_at":"2023-12-16T05:01:23Z","title":"LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10321","snapshot_observed_at":"2026-08-11T20:39:47.253223Z","title":"Llm-sql-solver: Can llms determine sql equivalence? ArXiv, abs/2312.10321, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.253223Z"},"links":{"cited_paper":"/paper/2312.10321","citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:0f41b62b8a84dc95a2d6db4fac260170f8259f86ff0e2170f808a9ef0b42b30a","observation_id":"6a69c267-8b96-4dbd-a5be-376f709cb635","resolution":{"observed_at":"2026-08-11T20:39:47.253223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.974333Z","title":"Semantic evaluation for text-to-sql with distilled test suite","venue":null,"work_id":"1a0244b1-a3ab-4c36-88f2-8e5c044dc3e5","year":2020},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.258942Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:12fb8cc090eb6bb0c25fcedaaf5247b1e089e013cb28e4976a9dc12fa91e4798","observation_id":"836f05f0-2f5c-4236-8f97-a6a203625d66","resolution":{"observed_at":"2026-08-11T20:39:47.979922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.955506Z","title":"Navathe, William R","venue":null,"work_id":"d7ca36ac-234e-435b-a1f1-32e362fd6823","year":2019},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.264983Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:ed456ebd5cca8c4b8b49754388c30121b6a8b310d9d943060ee9a87fadb361ec","observation_id":"df1a60da-db59-47d1-a39a-2e34ffe6af88","resolution":{"observed_at":"2026-08-11T20:39:47.960820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.937897Z","title":"Navathe, William Harris, and Jinpeng Wu","venue":null,"work_id":"7c38f8ca-93ca-40a3-9164-424a08ffe220","year":2022},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.270460Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:a287d979725d6848ae9692215341bb541228d90ee58ca9305a4d6c29c90f2764","observation_id":"0e2fbcc8-1f11-4889-8a73-1f9925bb9887","resolution":{"observed_at":"2026-08-11T20:39:47.943023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.275633Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.275633Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:7a54ef563610e940ba7a0f47a15bf406306c4bfd4148521c5208fede727b4070","observation_id":"7c2fb4c5-661c-4aec-a1bf-a6f5dedad9f6","resolution":{"observed_at":"2026-08-11T20:39:47.275633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.281297Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.281297Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:ccaaf05aeb8f4d3c33489a905693c6968a65eae84f0d60ed74e31a2491edbbf5","observation_id":"7c23f137-416c-491c-bde9-a4cff292381c","resolution":{"observed_at":"2026-08-11T20:39:47.281297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"scripts/0000775","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T20:39:47.396234Z","title":"Batting\" -- Columns:","venue":null,"work_id":"a9d345c8-1735-4da4-b338-0145846f3fac","year":2023},"citing_paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T20:39:47.287767Z"},"links":{"citing_paper":"/paper/2412.05561"},"observation_digest":"sha256:fccb8b9f5b6560fc0f472fb95d2b6c0e4b3909b1ac74f1a1ffb100b408506525","observation_id":"858f822b-a93d-474e-98a6-774c5f5ba159","resolution":{"observed_at":"2026-08-11T20:39:47.407214Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.05561","last_updated":"2025-06-08T19:02:31Z","latest_version":2,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-13T12:42:43.763208Z","submitted_at":"2024-12-07T06:50:12Z","title":"Can the Rookies Cut the Tough Cookie? Exploring the Use of LLMs for SQL Equivalence Checking"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":2,"verified_fuzzy":20},"total_outbound_references":47},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2412.05561."}