{"as_of":"2026-08-18T04:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe340f1f7142d5959c0e51024f15532401766aed53df5c76be2d29813a988f04","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:03:55.216981Z","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-23T03:12:28.532445Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2307.13018","last_updated":"2023-07-24T17:17:13Z","snapshot_observed_at":"2026-08-16T15:13:42.347411Z","submitted_at":"2023-07-24T17:17:13Z","title":"The potential of LLMs for coding with low-resource and domain-specific programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13018","snapshot_observed_at":"2026-08-11T14:03:55.216981Z","title":"arXiv preprint arXiv:2307.13018 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12513","last_updated":"2024-12-17T04:07:45Z","snapshot_observed_at":"2026-08-18T01:53:51.891781Z","submitted_at":"2024-12-17T04:07:45Z","title":"Generating Move Smart Contracts based on Concepts","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T14:03:55.216981Z"},"links":{"cited_paper":"/paper/2307.13018","citing_paper":"/paper/2412.12513"},"observation_digest":"sha256:87e9bfc4b7897f054dcf48c292e5059153eb3517ed87f0ae8638be764a636dad","observation_id":"1bfa483e-785f-4ef6-aa76-67a740e65de6","resolution":{"observed_at":"2026-08-11T14:03:55.216981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13018","last_updated":"2023-07-24T17:17:13Z","snapshot_observed_at":"2026-08-16T15:13:42.347411Z","submitted_at":"2023-07-24T17:17:13Z","title":"The potential of LLMs for coding with low-resource and domain-specific programming languages","version":1},"cited_work":{"arxiv_id":"2307.13018","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.13018","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a7f07802-cb27-40ef-b8d8-91be799a7ad7","year":2023},"citing_paper":{"arxiv_id":"2502.11008","last_updated":"2026-04-11T04:52:11Z","snapshot_observed_at":"2026-08-14T19:14:50.927373Z","submitted_at":"2025-02-16T06:19:37Z","title":"CounterBench: Evaluating and Improving Counterfactual Reasoning in Large Language Models","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-05-23T03:09:38.961123Z"},"links":{"cited_paper":"/paper/2307.13018","citing_paper":"/paper/2502.11008"},"observation_digest":"sha256:4d32d441e1ce21b5b15469ff874caab54456dab3a3ab2658d5778b958bca7beb","observation_id":"50c9dd9f-96bf-4d01-ac05-300a3992cc44","resolution":{"observed_at":"2026-05-23T03:12:28.535299Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.13018","last_updated":"2023-07-24T17:17:13Z","snapshot_observed_at":"2026-08-16T15:13:42.347411Z","submitted_at":"2023-07-24T17:17:13Z","title":"The potential of LLMs for coding with low-resource and domain-specific programming languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.13018","snapshot_observed_at":"2026-08-04T13:26:50.363649Z","title":"The potential of llms for coding with low-resource and domain-specific programming languages","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.00501","last_updated":"2026-08-05T06:01:15Z","snapshot_observed_at":"2026-08-09T15:30:29.509516Z","submitted_at":"2025-10-01T04:33:53Z","title":"CodeChemist: Test-Time Scaling for Low-Resource Code Generation via Functional Knowledge Transfer","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T13:26:50.363649Z"},"links":{"cited_paper":"/paper/2307.13018","citing_paper":"/paper/2510.00501"},"observation_digest":"sha256:10ee1d9f4ed6948e5f9906c19cf1d7ff607e2674a5cb0c325e23a0911484831d","observation_id":"c65892ca-9d8c-49de-9445-8195ff8c8eb5","resolution":{"observed_at":"2026-08-04T13:26:50.363649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2307.13018/citation-record","integrity":"/paper/2307.13018/integrity","json":"/paper/2307.13018/citation-record.json","paper":"/paper/2307.13018"},"outbound":[],"paper":{"arxiv_id":"2307.13018","last_updated":"2023-07-24T17:17:13Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T15:13:42.347411Z","submitted_at":"2023-07-24T17:17:13Z","title":"The potential of LLMs for coding with low-resource and domain-specific programming languages"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2307.13018."}