{"as_of":"2026-08-08T00:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0b43e61ef403a1501e6c8d78f9b83d9fb78c71ffe11bb71dd3f224dc534f6c87","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:43:37.451629Z","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-15T18:50:16.629698Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-08-06T15:43:37.451629Z","title":null,"venue":null,"work_id":null,"year":2024},"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":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:43:37.451629Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2507.15224"},"observation_digest":"sha256:ba6029d5f9428c99fd01c1f17d4a8053bdad60cb74dcf48e8c0ebbb01aa956f4","observation_id":"b2bc22ab-c05a-4bbf-8f4b-00248666aa1e","resolution":{"observed_at":"2026-08-06T15:43:37.451629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":"2402.02037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effibench: Benchmarking the efficiency of automatically generated code. corr abs/2402.02037 (2024)","venue":null,"work_id":"cb99870d-d1dd-414d-9d6d-545506ce1100","year":2024},"citing_paper":{"arxiv_id":"2603.00989","last_updated":"2026-04-13T21:30:35Z","snapshot_observed_at":"2026-07-06T22:47:24.369805Z","submitted_at":"2026-03-01T08:32:36Z","title":"Sustainable Code Generation Using Large Language Models: A Systematic Literature Review","version":3},"reference_index":138,"source":"pdf_text","source_observed_at":"2026-05-15T18:49:01.097179Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2603.00989"},"observation_digest":"sha256:62c36a3d7a6437129988e730d978abefb561698cbf759c3267af217cbde381b1","observation_id":"46433bcf-2b13-4238-b262-6df79bd47ae3","resolution":{"observed_at":"2026-05-15T18:50:16.632309Z","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":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":"2402.02037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effibench: Benchmarking the efficiency of automatically generated code. corr abs/2402.02037 (2024)","venue":null,"work_id":"cb99870d-d1dd-414d-9d6d-545506ce1100","year":2024},"citing_paper":{"arxiv_id":"2604.27001","last_updated":"2026-04-29T03:58:55Z","snapshot_observed_at":"2026-07-06T23:12:33.898150Z","submitted_at":"2026-04-29T03:58:55Z","title":"An Empirical Security Evaluation of LLM-Generated Cryptographic Rust Code","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-07T13:26:17.100399Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2604.27001"},"observation_digest":"sha256:e71a1df7e6e6c9e2ebc71bd2e3b3a6ba654eb370985e90dc07b0bb8244a56df3","observation_id":"fcab639a-931a-4724-ae6f-31714781e62a","resolution":{"observed_at":"2026-05-12T08:56:26.789919Z","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":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":"2402.02037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effibench: Benchmarking the efficiency of automatically generated code. corr abs/2402.02037 (2024)","venue":null,"work_id":"cb99870d-d1dd-414d-9d6d-545506ce1100","year":2024},"citing_paper":{"arxiv_id":"2605.03546","last_updated":"2026-05-05T09:17:02Z","snapshot_observed_at":"2026-07-29T17:17:07.530182Z","submitted_at":"2026-05-05T09:17:02Z","title":"ProgramBench: Can Language Models Rebuild Programs From Scratch?","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-07T16:02:16.598404Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2605.03546"},"observation_digest":"sha256:b763d522cae6878264c1d5737127d1910f5ac6b6e46bcdedf79dca311f71a8fb","observation_id":"3f2c7c33-e23f-4fa7-b197-dbbfec9f3567","resolution":{"observed_at":"2026-05-11T23:56:13.388652Z","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":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":"2402.02037","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Effibench: Benchmarking the efficiency of automatically generated code. corr abs/2402.02037 (2024)","venue":null,"work_id":"cb99870d-d1dd-414d-9d6d-545506ce1100","year":2024},"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":43,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:c160cb00cb12edf59704e205d42fc28baa5b2c1b5be5c35bb75abf507ce79918","observation_id":"09f00a4a-a4c1-4561-bb35-4b223c20ad37","resolution":{"observed_at":"2026-05-11T17:26:04.669345Z","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":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-08-01T12:12:59.021000Z","title":"Available: https://arxiv.org/abs/2402.02037","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19653","last_updated":"2026-07-22T01:19:42Z","snapshot_observed_at":"2026-08-07T20:07:33.820291Z","submitted_at":"2026-07-22T01:19:42Z","title":"PerfAgent: Profiler-Guided Iterative Refinement for Repository-Level Code Optimization","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T12:12:59.021000Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2607.19653"},"observation_digest":"sha256:c2111b0359d9e31319cf092a24cf82c31a49db2186e3119e9dd9e28c709ee927","observation_id":"fba54c07-e27b-4c0a-b522-a74890e9c46a","resolution":{"observed_at":"2026-08-01T12:12:59.021000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02037","last_updated":"2025-05-10T15:11:34Z","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02037","snapshot_observed_at":"2026-07-30T16:26:29.675865Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23665","last_updated":"2026-07-26T14:01:54Z","snapshot_observed_at":"2026-08-06T14:02:04.002993Z","submitted_at":"2026-07-26T14:01:54Z","title":"Multi-level Code Optimization via Mixture of Prompts","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T16:26:29.675865Z"},"links":{"cited_paper":"/paper/2402.02037","citing_paper":"/paper/2607.23665"},"observation_digest":"sha256:8a4612c530e3aa64be537d6a5d00bc2e8c4cbf81540b6d482b190bc3eef9e3ec","observation_id":"b767204d-e43c-479e-a961-81460fe2fc72","resolution":{"observed_at":"2026-07-30T16:26:29.675865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02037/citation-record","integrity":"/paper/2402.02037/integrity","json":"/paper/2402.02037/citation-record.json","paper":"/paper/2402.02037"},"outbound":[],"paper":{"arxiv_id":"2402.02037","last_updated":"2025-05-10T15:11:34Z","latest_version":6,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T17:24:45.062473Z","submitted_at":"2024-02-03T05:24:39Z","title":"EffiBench: Benchmarking the Efficiency of Automatically Generated Code"},"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 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2402.02037."}