{"as_of":"2026-08-07T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:326f5e1ab4618c67ba874add51bf3ef09e95d106e28d4e7b65dc34fdb363d764","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:39:57.465250Z","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-19T12:22:17.217268Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02827","snapshot_observed_at":"2026-08-07T12:39:57.465250Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24098","last_updated":"2025-05-30T01:00:34Z","snapshot_observed_at":"2026-08-07T12:32:37.644168Z","submitted_at":"2025-05-30T01:00:34Z","title":"HardTests: Synthesizing High-Quality Test Cases for LLM Coding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:57.465250Z"},"links":{"cited_paper":"/paper/2502.02827","citing_paper":"/paper/2505.24098"},"observation_digest":"sha256:72e06b8abc2b5d6efee4a282d561b2046a9b99db1fe9d77ca1e778763a269714","observation_id":"aa34b9b4-ffad-4aa3-83ca-aa3829bb7f6f","resolution":{"observed_at":"2026-08-07T12:39:57.465250Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.02827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02827","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coffe: A code efficiency benchmark for code generation","venue":null,"work_id":"bc14d79c-9350-488f-a844-364c7bd17229","year":2025},"citing_paper":{"arxiv_id":"2506.01249","last_updated":"2026-05-05T18:10:55Z","snapshot_observed_at":"2026-08-05T06:38:21.064744Z","submitted_at":"2025-06-02T01:57:21Z","title":"SysLLMatic: Large Language Models are Software System Optimizers","version":3},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-05-19T12:17:34.743290Z"},"links":{"cited_paper":"/paper/2502.02827","citing_paper":"/paper/2506.01249"},"observation_digest":"sha256:07266f083ef66126f5bdbd2d838a77067a25c7e878cf9f29abde4d4dc1f8143a","observation_id":"803e126c-3653-467b-bf88-4e12d2e5e7fa","resolution":{"observed_at":"2026-05-19T12:22:17.219309Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02827","snapshot_observed_at":"2026-08-06T15:43:39.090108Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.15224","last_updated":"2025-07-21T03:55:41Z","snapshot_observed_at":"2026-08-07T02:44:19.282770Z","submitted_at":"2025-07-21T03:55:41Z","title":"SimdBench: Benchmarking Large Language Models for SIMD-Intrinsic Code Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:39.090108Z"},"links":{"cited_paper":"/paper/2502.02827","citing_paper":"/paper/2507.15224"},"observation_digest":"sha256:4a7c82b0ac18cfd3cb6859631422f7ac39da4e98e24219b90bc25cd5638760ac","observation_id":"2d7b2803-3b92-4247-a6d5-4b876b2ff61f","resolution":{"observed_at":"2026-08-06T15:43:39.090108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02827","snapshot_observed_at":"2026-08-05T20:04:42.799703Z","title":"Coffe: A code efficiency benchmark for code generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.11307","last_updated":"2026-05-23T15:47:53Z","snapshot_observed_at":"2026-08-05T20:04:41.079241Z","submitted_at":"2025-08-15T08:22:01Z","title":"Approximating the universal thermal climate index using sparse regression with orthogonal polynomials","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T20:04:42.799703Z"},"links":{"cited_paper":"/paper/2502.02827","citing_paper":"/paper/2508.11307"},"observation_digest":"sha256:809015e096dfa47660fed14908bb1331d9d8b39571756d28c2c1bc438e0b1868","observation_id":"9600db74-d376-4cf2-b7c4-38c2cce36eb4","resolution":{"observed_at":"2026-08-05T20:04:42.799703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"cited_work":{"arxiv_id":"2502.02827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.02827","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coffe: A code efficiency benchmark for code generation","venue":null,"work_id":"bc14d79c-9350-488f-a844-364c7bd17229","year":2025},"citing_paper":{"arxiv_id":"2605.05267","last_updated":"2026-05-06T09:38:31Z","snapshot_observed_at":"2026-08-04T17:41:12.164736Z","submitted_at":"2026-05-06T09:38:31Z","title":"Bridging Generation and Training: A Systematic Review of Quality Issues in LLMs for Code","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2502.02827","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:75cff2cc236bc3ff75a78d33a59cbe24d814a8c4336f39b75db0695bab529492","observation_id":"cb1aaeb0-0d75-417b-8e2d-a269497b3c15","resolution":{"observed_at":"2026-05-11T17:26:04.815262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02827/citation-record","integrity":"/paper/2502.02827/integrity","json":"/paper/2502.02827/citation-record.json","paper":"/paper/2502.02827"},"outbound":[],"paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T20:31:17.809419Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2502.02827."}