{"as_of":"2026-08-09T00:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9731e9d4d5b9674802e2764d805151217c64a7de08afd6a5b552c7b8ec9b51ee","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-08T06:32:00.761636+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-07-14T19:54:08.600196Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.13745","last_updated":"2024-10-16T15:07:41Z","snapshot_observed_at":"2026-07-06T19:05:36.210400Z","submitted_at":"2024-08-25T07:10:36Z","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13745","snapshot_observed_at":"2026-07-13T12:00:02.401705Z","title":"DOCE: Finding the sweet spot for execution- based code generation.Arxiv Preprint Arxiv:2408.13745,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.03922","last_updated":"2026-07-12T05:30:15Z","snapshot_observed_at":"2026-07-16T23:18:41.605526Z","submitted_at":"2026-04-05T01:15:57Z","title":"ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T12:00:02.401705Z"},"links":{"cited_paper":"/paper/2408.13745","citing_paper":"/paper/2604.03922"},"observation_digest":"sha256:3bcb7bb6426fa77a166e3b685b059332eca6f82f3e395079e874a47d5c392856","observation_id":"0c943291-c181-44eb-b4eb-869d831b4b63","resolution":{"observed_at":"2026-07-13T12:00:02.401705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13745","last_updated":"2024-10-16T15:07:41Z","snapshot_observed_at":"2026-07-06T19:05:36.210400Z","submitted_at":"2024-08-25T07:10:36Z","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.13745","snapshot_observed_at":"2026-07-14T19:54:08.600196Z","title":"DOCE: Finding the sweet spot for execution- based code generation.Arxiv Preprint Arxiv:2408.13745,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2604.03922","last_updated":"2026-07-12T05:30:15Z","snapshot_observed_at":"2026-07-16T23:18:41.605526Z","submitted_at":"2026-04-05T01:15:57Z","title":"ACES: Who Tests the Tests? Leave-One-Out AUC Consistency for Code Generation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T19:54:08.600196Z"},"links":{"cited_paper":"/paper/2408.13745","citing_paper":"/paper/2604.03922"},"observation_digest":"sha256:20a3c0de4d4a11f65d3a6420dc983ce2e2dd9f5471cd4d513f4866d27229db19","observation_id":"cae1fb30-1f0d-401f-93fc-39df798c1181","resolution":{"observed_at":"2026-07-14T19:54:08.600196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13745","last_updated":"2024-10-16T15:07:41Z","snapshot_observed_at":"2026-07-06T19:05:36.210400Z","submitted_at":"2024-08-25T07:10:36Z","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation","version":4},"cited_work":{"arxiv_id":"2408.13745","doi":"10.48550/arxiv.2408.13745","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13745","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DOCE: finding the sweet spot for execution-based code generation,","venue":"TUbilio (Technical University of Darmstadt)","work_id":"3905456c-21d7-4ac8-b05d-1c3e8ab58a6f","year":2024},"citing_paper":{"arxiv_id":"2605.19365","last_updated":"2026-05-19T04:55:49Z","snapshot_observed_at":"2026-08-02T04:54:03.773076Z","submitted_at":"2026-05-19T04:55:49Z","title":"On-the-Fly Input Adaptation for Reliable Code Intelligence","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T04:58:36.163866Z"},"links":{"cited_paper":"/paper/2408.13745","citing_paper":"/paper/2605.19365"},"observation_digest":"sha256:e80c8db1efb4953182e2a7d9059cf74919fa7984fcaf5f50aa9958ce8c598424","observation_id":"5d9a7c99-196f-4b68-bf9d-77752e78f820","resolution":{"observed_at":"2026-05-20T05:03:03.824734Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2408.13745","last_updated":"2024-10-16T15:07:41Z","snapshot_observed_at":"2026-07-06T19:05:36.210400Z","submitted_at":"2024-08-25T07:10:36Z","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation","version":4},"cited_work":{"arxiv_id":"2408.13745","doi":"10.48550/arxiv.2408.13745","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.13745","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DOCE: finding the sweet spot for execution-based code generation,","venue":"TUbilio (Technical University of Darmstadt)","work_id":"3905456c-21d7-4ac8-b05d-1c3e8ab58a6f","year":2024},"citing_paper":{"arxiv_id":"2607.01953","last_updated":"2026-07-02T09:43:15Z","snapshot_observed_at":"2026-08-05T12:45:21.081391Z","submitted_at":"2026-07-02T09:43:15Z","title":"Underspecification does not imply Incoherence: The Risks of Semantic Collapse in Coding Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-03T09:01:48.501745Z"},"links":{"cited_paper":"/paper/2408.13745","citing_paper":"/paper/2607.01953"},"observation_digest":"sha256:3afccbcc08063ad99cda52f0f10d007117e85e5684610390cc82035a3ddb3f28","observation_id":"2698fdc3-eed6-4b49-baed-be5c9681fe5f","resolution":{"observed_at":"2026-07-03T09:07:47.017955Z","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/2408.13745/citation-record","integrity":"/paper/2408.13745/integrity","json":"/paper/2408.13745/citation-record.json","paper":"/paper/2408.13745"},"outbound":[],"paper":{"arxiv_id":"2408.13745","last_updated":"2024-10-16T15:07:41Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:05:36.210400Z","submitted_at":"2024-08-25T07:10:36Z","title":"DOCE: Finding the Sweet Spot for Execution-Based Code Generation"},"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 4 inbound Pith citation observations for arXiv:2408.13745."}