{"as_of":"2026-08-10T01:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc043e91f4d90f2bef98be9304c08e8f2327948f2966dece4013afce0a307b0d","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-09T06:31:02.800959+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-07T21:56:20.449996Z","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-11T18:26:10.405375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.16197","last_updated":"2024-02-25T20:43:55Z","snapshot_observed_at":"2026-08-06T04:51:18.017441Z","submitted_at":"2024-02-25T20:43:55Z","title":"Language Models for Code Completion: A Practical Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16197","snapshot_observed_at":"2026-08-07T21:56:20.449996Z","title":"Language models for code completion: A practical evaluation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09328","last_updated":"2025-02-13T13:40:52Z","snapshot_observed_at":"2026-08-07T21:49:22.645033Z","submitted_at":"2025-02-13T13:40:52Z","title":"Copilot Arena: A Platform for Code LLM Evaluation in the Wild","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:20.449996Z"},"links":{"cited_paper":"/paper/2402.16197","citing_paper":"/paper/2502.09328"},"observation_digest":"sha256:082e7aa31cc45ad9afbff22e80cb116f24d14aca92decce5a0f6a54e3093e779","observation_id":"2b9efc6b-d5d2-4904-884f-2b24fcda3f97","resolution":{"observed_at":"2026-08-07T21:56:20.449996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16197","last_updated":"2024-02-25T20:43:55Z","snapshot_observed_at":"2026-08-06T04:51:18.017441Z","submitted_at":"2024-02-25T20:43:55Z","title":"Language Models for Code Completion: A Practical Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16197","snapshot_observed_at":"2026-08-07T04:15:44.916662Z","title":"Language models for code completion: A practical evaluation, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.11309","last_updated":"2025-06-12T21:15:58Z","snapshot_observed_at":"2026-08-08T01:16:03.022130Z","submitted_at":"2025-06-12T21:15:58Z","title":"SwiftSpec: Ultra-Low Latency LLM Decoding by Scaling Asynchronous Speculative Decoding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:15:44.916662Z"},"links":{"cited_paper":"/paper/2402.16197","citing_paper":"/paper/2506.11309"},"observation_digest":"sha256:1b415ca4f39a09d1af62b6b34a5463b5ae15d5d85e8529224cfd17cacebe60c9","observation_id":"87637fcd-8ea2-4e70-8d37-31eb934ce7ee","resolution":{"observed_at":"2026-08-07T04:15:44.916662Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16197","last_updated":"2024-02-25T20:43:55Z","snapshot_observed_at":"2026-08-06T04:51:18.017441Z","submitted_at":"2024-02-25T20:43:55Z","title":"Language Models for Code Completion: A Practical Evaluation","version":1},"cited_work":{"arxiv_id":"2402.16197","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.16197","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a15df57a-d098-49f4-9e72-3a3cc0cc9f75","year":2024},"citing_paper":{"arxiv_id":"2605.04894","last_updated":"2026-05-06T13:25:34Z","snapshot_observed_at":"2026-08-01T03:51:19.768205Z","submitted_at":"2026-05-06T13:25:34Z","title":"SynConfRoute: Syntax-Aware Routing for Efficient Code Completion with Small CodeLLMs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-08T16:00:26.489264Z"},"links":{"cited_paper":"/paper/2402.16197","citing_paper":"/paper/2605.04894"},"observation_digest":"sha256:5cb5b7161e0789a9e094c9f0787811d6fe70c2fc2a39c912406ec0a373882bb4","observation_id":"2798469b-1400-4ada-bd31-a7f9c8e8ee17","resolution":{"observed_at":"2026-05-11T18:26:10.413508Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.16197/citation-record","integrity":"/paper/2402.16197/integrity","json":"/paper/2402.16197/citation-record.json","paper":"/paper/2402.16197"},"outbound":[],"paper":{"arxiv_id":"2402.16197","last_updated":"2024-02-25T20:43:55Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-06T04:51:18.017441Z","submitted_at":"2024-02-25T20:43:55Z","title":"Language Models for Code Completion: A Practical Evaluation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2402.16197."}