{"as_of":"2026-08-09T02:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:863e53db0ac16f6f3700c79c23a85154acae436927fd6f65ecfcf1ef5ddd68fb","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-08T06:32:00.761636+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-07T15:20:52.902763Z","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-16T12:17:51.982044Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.06537","last_updated":"2022-05-13T09:53:25Z","snapshot_observed_at":"2026-07-06T13:09:35.754882Z","submitted_at":"2022-05-13T09:53:25Z","title":"Productivity Assessment of Neural Code Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06537","snapshot_observed_at":"2026-08-07T15:20:52.902763Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15469","last_updated":"2025-05-21T12:45:49Z","snapshot_observed_at":"2026-08-07T15:15:00.422360Z","submitted_at":"2025-05-21T12:45:49Z","title":"A Qualitative Investigation into LLM-Generated Multilingual Code Comments and Automatic Evaluation Metrics","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T15:20:52.902763Z"},"links":{"cited_paper":"/paper/2205.06537","citing_paper":"/paper/2505.15469"},"observation_digest":"sha256:c16f1b2c0cb68768f3fec27d1e5dc8a8ad671617198728c060d9188ad9f3c1c6","observation_id":"89e40cbe-707c-4e72-b339-0d0b12a6cfcc","resolution":{"observed_at":"2026-08-07T15:20:52.902763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06537","last_updated":"2022-05-13T09:53:25Z","snapshot_observed_at":"2026-07-06T13:09:35.754882Z","submitted_at":"2022-05-13T09:53:25Z","title":"Productivity Assessment of Neural Code Completion","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.06537","snapshot_observed_at":"2026-08-05T21:47:54.658964Z","title":"Productivity assessment of neural code completion,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.07966","last_updated":"2025-08-11T13:26:48Z","snapshot_observed_at":"2026-08-05T21:47:53.622683Z","submitted_at":"2025-08-11T13:26:48Z","title":"Exploring the Challenges and Opportunities of AI-assisted Codebase Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T21:47:54.658964Z"},"links":{"cited_paper":"/paper/2205.06537","citing_paper":"/paper/2508.07966"},"observation_digest":"sha256:e0c80e8b824ff3dc0d2478f169754e5b9d9be4b1330991704636624127695408","observation_id":"63d22099-0302-4219-bfae-8f3071e09e07","resolution":{"observed_at":"2026-08-05T21:47:54.658964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.06537","last_updated":"2022-05-13T09:53:25Z","snapshot_observed_at":"2026-07-06T13:09:35.754882Z","submitted_at":"2022-05-13T09:53:25Z","title":"Productivity Assessment of Neural Code Completion","version":1},"cited_work":{"arxiv_id":"2205.06537","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2205.06537","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"77e82550-345f-4815-91d6-f813b529aeb8","year":2022},"citing_paper":{"arxiv_id":"2601.16456","last_updated":"2026-05-05T04:47:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-01-23T05:28:48Z","title":"RubberDuckBench: A Benchmark for AI Coding Assistants","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-16T12:16:40.086291Z"},"links":{"cited_paper":"/paper/2205.06537","citing_paper":"/paper/2601.16456"},"observation_digest":"sha256:db86586ac719327114b6791263e7ae9c2d37addb47996ecf5faa3be8a729d0c0","observation_id":"3a074287-32ce-4e5e-bf00-ba9434c706b4","resolution":{"observed_at":"2026-05-16T12:17:51.983579Z","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/2205.06537/citation-record","integrity":"/paper/2205.06537/integrity","json":"/paper/2205.06537/citation-record.json","paper":"/paper/2205.06537"},"outbound":[],"paper":{"arxiv_id":"2205.06537","last_updated":"2022-05-13T09:53:25Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T13:09:35.754882Z","submitted_at":"2022-05-13T09:53:25Z","title":"Productivity Assessment of Neural Code Completion"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2205.06537."}