{"as_of":"2026-08-15T21:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:145e55d297a05d120000cea8eb301a3912a6a63c96e94170bd7e56fcbc44c89d","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-15T06:32:42.880941+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-12T10:20:15.907347Z","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-02T06:06:40.688752Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.12504","last_updated":"2025-02-08T01:27:57Z","snapshot_observed_at":"2026-08-12T23:20:24.735352Z","submitted_at":"2024-07-17T11:35:00Z","title":"Case2Code: Scalable Synthetic Data for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12504","snapshot_observed_at":"2026-08-11T23:05:38.355236Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.02906","last_updated":"2024-12-03T23:19:40Z","snapshot_observed_at":"2026-08-15T04:44:04.372418Z","submitted_at":"2024-12-03T23:19:40Z","title":"Does Few-Shot Learning Help LLM Performance in Code Synthesis?","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T23:05:38.355236Z"},"links":{"cited_paper":"/paper/2407.12504","citing_paper":"/paper/2412.02906"},"observation_digest":"sha256:04eaf76a872b33a69ff5a9d9c5b96861e6bbad30571b321e6464793c207b117e","observation_id":"beaf1392-8052-4a25-b171-27661b63ec9b","resolution":{"observed_at":"2026-08-11T23:05:38.355236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12504","last_updated":"2025-02-08T01:27:57Z","snapshot_observed_at":"2026-08-12T23:20:24.735352Z","submitted_at":"2024-07-17T11:35:00Z","title":"Case2Code: Scalable Synthetic Data for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12504","snapshot_observed_at":"2026-08-12T10:20:15.907347Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04494","last_updated":"2025-01-10T22:22:41Z","snapshot_observed_at":"2026-08-12T10:14:34.765115Z","submitted_at":"2024-11-28T19:36:11Z","title":"MAG-V: A Multi-Agent Framework for Synthetic Data Generation and Verification","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T10:20:15.907347Z"},"links":{"cited_paper":"/paper/2407.12504","citing_paper":"/paper/2412.04494"},"observation_digest":"sha256:cb816d72a80efcafbcedb2dd74c84fb2762fb10d7b0dd1a646c78021efd3ed99","observation_id":"f48b7746-4570-466a-ab73-44af6b1c6296","resolution":{"observed_at":"2026-08-12T10:20:15.907347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12504","last_updated":"2025-02-08T01:27:57Z","snapshot_observed_at":"2026-08-12T23:20:24.735352Z","submitted_at":"2024-07-17T11:35:00Z","title":"Case2Code: Scalable Synthetic Data for Code Generation","version":2},"cited_work":{"arxiv_id":"2407.12504","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12504","snapshot_observed_at":"2026-07-02T06:06:40.688752Z","title":"URLhttps://arxiv.org/abs/ 2407.12504","venue":null,"work_id":"30815201-ebdc-4090-832f-78ee1dedba83","year":2024},"citing_paper":{"arxiv_id":"2606.04214","last_updated":"2026-06-02T21:01:40Z","snapshot_observed_at":"2026-08-12T21:53:56.094074Z","submitted_at":"2026-06-02T21:01:40Z","title":"Plateau That Never Comes: When Efficiency Claims in Datacenters and AI Become Greenwashing","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-28T07:47:37.054686Z"},"links":{"cited_paper":"/paper/2407.12504","citing_paper":"/paper/2606.04214"},"observation_digest":"sha256:c12e7fabc5502147f59bd97b7a0c08795aa54a5a5fed9cddc94e6e7c93c0e28d","observation_id":"b2bc3937-b30d-4bd7-9a81-a27a4b8a9cc7","resolution":{"observed_at":"2026-07-02T06:06:40.690300Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.12504/citation-record","integrity":"/paper/2407.12504/integrity","json":"/paper/2407.12504/citation-record.json","paper":"/paper/2407.12504"},"outbound":[],"paper":{"arxiv_id":"2407.12504","last_updated":"2025-02-08T01:27:57Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-12T23:20:24.735352Z","submitted_at":"2024-07-17T11:35:00Z","title":"Case2Code: Scalable Synthetic Data for 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2407.12504."}