{"as_of":"2026-08-13T16:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ed0a40cba7bc197427d6b5f61ec3d48ec433df72e5d6f6202adb89cd38aea4d","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:57:17.981797Z","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-07-03T01:17:30.654378Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.05923","last_updated":"2024-09-09T02:07:41Z","snapshot_observed_at":"2026-08-12T22:48:59.785453Z","submitted_at":"2024-09-09T02:07:41Z","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05923","snapshot_observed_at":"2026-08-11T11:57:17.981797Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14838","last_updated":"2025-05-27T03:08:57Z","snapshot_observed_at":"2026-08-13T00:12:49.239433Z","submitted_at":"2024-12-19T13:28:42Z","title":"DynamicKV: Task-Aware Adaptive KV Cache Compression for Long Context LLMs","version":4},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T11:57:17.981797Z"},"links":{"cited_paper":"/paper/2409.05923","citing_paper":"/paper/2412.14838"},"observation_digest":"sha256:0fea1bebbfc114bd14ab7ec6725f453a573f327a77a7060980f293766b908bdf","observation_id":"fd88d297-31d8-4cd9-8805-712413eff0a2","resolution":{"observed_at":"2026-08-11T11:57:17.981797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05923","last_updated":"2024-09-09T02:07:41Z","snapshot_observed_at":"2026-08-12T22:48:59.785453Z","submitted_at":"2024-09-09T02:07:41Z","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05923","snapshot_observed_at":"2026-08-10T20:35:28.609752Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.07892","last_updated":"2026-07-07T06:56:19Z","snapshot_observed_at":"2026-08-13T10:43:00.244793Z","submitted_at":"2025-01-14T07:16:43Z","title":"Leveraging Metamemory Agent for Enhanced Data-Free Code Generation in Large Language Models","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T20:35:28.609752Z"},"links":{"cited_paper":"/paper/2409.05923","citing_paper":"/paper/2501.07892"},"observation_digest":"sha256:eab902afef9393096a1b09e38474e8f176406538c952349c34b08a7678a5c75c","observation_id":"19b541f4-8deb-4398-81a2-2db940682ac5","resolution":{"observed_at":"2026-08-10T20:35:28.609752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05923","last_updated":"2024-09-09T02:07:41Z","snapshot_observed_at":"2026-08-12T22:48:59.785453Z","submitted_at":"2024-09-09T02:07:41Z","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.05923","snapshot_observed_at":"2026-08-07T10:19:00.321272Z","title":"Uscd: Improving code generation of llms by uncertainty-aware selective contrastive decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02870","last_updated":"2025-06-06T10:50:08Z","snapshot_observed_at":"2026-08-08T01:09:03.836574Z","submitted_at":"2025-06-06T10:50:08Z","title":"Loki's Dance of Illusions: A Comprehensive Survey of Hallucination in Large Language Models","version":1},"reference_index":117,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:00.321272Z"},"links":{"cited_paper":"/paper/2409.05923","citing_paper":"/paper/2507.02870"},"observation_digest":"sha256:5943e5b0797c19b4d7b34a2e58aa8be3a148e30b1ecd7bc7cf7e90b08c595bf2","observation_id":"1d1393c5-6f8f-496c-abdb-3248a4e7af69","resolution":{"observed_at":"2026-08-07T10:19:00.321272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05923","last_updated":"2024-09-09T02:07:41Z","snapshot_observed_at":"2026-08-12T22:48:59.785453Z","submitted_at":"2024-09-09T02:07:41Z","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding","version":1},"cited_work":{"arxiv_id":"2409.05923","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.05923","snapshot_observed_at":"2026-07-03T01:17:30.654378Z","title":"arXiv preprint arXiv:2409.05923 , year=","venue":null,"work_id":"aeba03e1-ba8a-4970-b5a4-d7abd1d23b04","year":null},"citing_paper":{"arxiv_id":"2606.09635","last_updated":"2026-06-08T15:33:13Z","snapshot_observed_at":"2026-08-02T03:20:14.810565Z","submitted_at":"2026-06-08T15:33:13Z","title":"Gradient-Guided Reward Optimization for Inference-time Alignment","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-06-27T16:43:04.984866Z"},"links":{"cited_paper":"/paper/2409.05923","citing_paper":"/paper/2606.09635"},"observation_digest":"sha256:467059c547425ae39feab50f6b5a94ffc839dc096f43c8df16f59388601c3ec4","observation_id":"c00cb608-dd02-4521-aa8c-6648a0036d4d","resolution":{"observed_at":"2026-07-03T01:17:30.656090Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2409.05923/citation-record","integrity":"/paper/2409.05923/integrity","json":"/paper/2409.05923/citation-record.json","paper":"/paper/2409.05923"},"outbound":[],"paper":{"arxiv_id":"2409.05923","last_updated":"2024-09-09T02:07:41Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-12T22:48:59.785453Z","submitted_at":"2024-09-09T02:07:41Z","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2409.05923."}