{"as_of":"2026-08-08T19:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c73115bad6a446fafdd0696944e2ce1af7e6afe80c409bd982899c488644a878","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:54:40.025942Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-21T22:34:24.211114Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.10321","last_updated":"2025-03-12T03:16:27Z","snapshot_observed_at":"2026-08-05T05:22:50.304746Z","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-07T04:54:40.025942Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.09359","last_updated":"2025-06-11T03:16:39Z","snapshot_observed_at":"2026-08-07T04:47:53.823224Z","submitted_at":"2025-06-11T03:16:39Z","title":"Taming SQL Complexity: LLM-Based Equivalence Evaluation for Text-to-SQL","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:54:40.025942Z"},"links":{"cited_paper":"/paper/2312.10321","citing_paper":"/paper/2506.09359"},"observation_digest":"sha256:d3b13707c0eda40717552dbbaa2061fb628620b12d86bbde8dc99a7c5a723d08","observation_id":"672a3ee4-9f4f-4db3-851c-dd44a0700192","resolution":{"observed_at":"2026-08-07T04:54:40.025942Z","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-05T05:22:50.304746Z","submitted_at":"2023-12-16T05:01:23Z","title":"LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?","version":4},"cited_work":{"arxiv_id":"2312.10321","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2312.10321","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"65ef0825-5afd-4775-8be1-951750ebc977","year":2023},"citing_paper":{"arxiv_id":"2509.00303","last_updated":"2026-05-19T23:05:35Z","snapshot_observed_at":"2026-07-06T22:20:54.835986Z","submitted_at":"2025-08-30T01:44:36Z","title":"Access Paths for Efficient Ordering with Large Language Models","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-05-21T22:32:23.352584Z"},"links":{"cited_paper":"/paper/2312.10321","citing_paper":"/paper/2509.00303"},"observation_digest":"sha256:3b1adcf662b546ecaf9880f999f526bf6691c310f19ff84bc57504c2d5993201","observation_id":"2461e15b-87c6-47b5-be38-8bc4f1dc69d8","resolution":{"observed_at":"2026-05-21T22:34:24.213110Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.10321/citation-record","integrity":"/paper/2312.10321/integrity","json":"/paper/2312.10321/citation-record.json","paper":"/paper/2312.10321"},"outbound":[],"paper":{"arxiv_id":"2312.10321","last_updated":"2025-03-12T03:16:27Z","latest_version":4,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-05T05:22:50.304746Z","submitted_at":"2023-12-16T05:01:23Z","title":"LLM-SQL-Solver: Can LLMs Determine SQL Equivalence?"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2312.10321."}