{"as_of":"2026-08-09T06:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6cf1359f4cd13ccca69ed735a3800c963786252c632e15ec58c56d40ba76f976","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":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T23:49:14.651526Z","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":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-07T23:49:14.651526Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08767","last_updated":"2025-05-26T01:07:58Z","snapshot_observed_at":"2026-08-09T01:41:22.532098Z","submitted_at":"2025-02-12T20:13:56Z","title":"SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T23:49:14.651526Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2502.08767"},"observation_digest":"sha256:84d8b18e171f24296117ed4cfec264ead91169b73674049418f99c8d4747e8f8","observation_id":"7d2a4cf5-ea26-4afe-b485-b41552f8def0","resolution":{"observed_at":"2026-08-07T23:49:14.651526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-07T14:34:56.978627Z","title":"W., Tong, H., Ezick, J., and Lott, C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18442","last_updated":"2025-05-24T00:45:07Z","snapshot_observed_at":"2026-08-07T22:39:40.933501Z","submitted_at":"2025-05-24T00:45:07Z","title":"Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T14:34:56.978627Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2505.18442"},"observation_digest":"sha256:8c8b84944a83be6c6713ca9aeafdcbbed163bd3fdab36dd72336615e8316f37d","observation_id":"30d9c9c0-b689-4a93-92d7-6778f68f5276","resolution":{"observed_at":"2026-08-07T14:34:56.978627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-07T12:50:27.276056Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark.arXiv preprint arXiv:2406.06647, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23387","last_updated":"2025-06-03T09:55:22Z","snapshot_observed_at":"2026-08-07T12:44:29.008842Z","submitted_at":"2025-05-29T12:14:29Z","title":"Afterburner: Reinforcement Learning Facilitates Self-Improving Code Efficiency Optimization","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:27.276056Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2505.23387"},"observation_digest":"sha256:c53396d8a3441efc4ac931fa48499ffa31a6f6e1a2706b3c28a8598525b673fc","observation_id":"d768de9e-9a5d-4dd6-91bd-2962dc171164","resolution":{"observed_at":"2026-08-07T12:50:27.276056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-06T19:09:33.646855Z","title":"How efficient is LLM-generated code? a rigorous & high-standard benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-09T04:57:39.108213Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.646855Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:5efd9c41a3c30ac6c5b3aa9d39ac0f8653caf690bcb17cef59eb21d40723bfe8","observation_id":"2dec1611-4a8a-4c52-a7a3-d945316cc130","resolution":{"observed_at":"2026-08-06T19:09:33.646855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T22:13:43.518709Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.08332","last_updated":"2025-08-10T14:44:06Z","snapshot_observed_at":"2026-08-06T22:53:59.900089Z","submitted_at":"2025-08-10T14:44:06Z","title":"Energy-Aware Code Generation with LLMs: Benchmarking Small vs. Large Language Models for Sustainable AI Programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T22:13:43.518709Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2508.08332"},"observation_digest":"sha256:41d378fa8d6baae326bd6090ce4dd36d08b1f73cfce803605e73a0e5a948542a","observation_id":"cb0bb92f-2fc3-4a4d-8b01-d2da6116c80e","resolution":{"observed_at":"2026-08-05T22:13:43.518709Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2510.15494","last_updated":"2026-04-09T09:01:12Z","snapshot_observed_at":"2026-08-06T20:17:52.315302Z","submitted_at":"2025-10-17T10:06:52Z","title":"Do AI Models Dream of Faster Code? An Empirical Study on LLM-Proposed Performance Improvements in Real-World Software","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T06:39:42.391102Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2510.15494"},"observation_digest":"sha256:9347e9dd4fb1d2ceeaa7bb06290acfa11410b417213e5ad6f3dd677a493726f1","observation_id":"c293c707-cac1-4ec4-ae8e-dd7aaf8ce2fc","resolution":{"observed_at":"2026-05-18T06:41:00.377223Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2604.24464","last_updated":"2026-04-27T13:33:42Z","snapshot_observed_at":"2026-07-06T23:10:29.508602Z","submitted_at":"2026-04-27T13:33:42Z","title":"Incisor: Ex Ante Cloud Instance Selection for HPC Jobs","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-05-07T17:58:27.359369Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2604.24464"},"observation_digest":"sha256:0afee8476e2f3e1dfa732919a87bd358ed4021088490814965a173e7c1f7c747","observation_id":"b79705da-b2ed-4a60-a7cc-a2ec2bb0b2fe","resolution":{"observed_at":"2026-05-09T01:29:32.641798Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","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":102,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:0e19daf7a0461cb9adeb265c3cc4a1048d9364afd7e622d7985110913a628d14","observation_id":"6cdbc155-8baa-47d9-b227-9f2bf039c6cb","resolution":{"observed_at":"2026-05-11T17:26:04.505509Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2605.11280","last_updated":"2026-05-11T22:09:34Z","snapshot_observed_at":"2026-07-06T23:23:06.755816Z","submitted_at":"2026-05-11T22:09:34Z","title":"Discovery of Interpretable Surrogates via Agentic AI: Application to Gravitational Waves","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-13T01:52:50.908041Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2605.11280"},"observation_digest":"sha256:aab0a4c86e117725069dc88c9f7820fddf17325d7d599363dc3b4a6ddc0e0c38","observation_id":"7017ec4e-d55a-4353-abe7-e587c1287e11","resolution":{"observed_at":"2026-05-13T01:57:04.734018Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2606.04023","last_updated":"2026-06-01T12:55:10Z","snapshot_observed_at":"2026-08-05T23:37:36.587849Z","submitted_at":"2026-06-01T12:55:10Z","title":"CodegenBench: Can LLMs Write Efficient Code Across Architectures?","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-28T13:38:48.308683Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2606.04023"},"observation_digest":"sha256:600024319ba36aebab68c67afd7c6a3ca82d45f472ef7489cb1f94e6d5e11feb","observation_id":"8d852ec3-e499-4966-b42c-fe08046b9255","resolution":{"observed_at":"2026-07-02T00:06:23.728937Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2606.06821","last_updated":"2026-06-05T01:49:20Z","snapshot_observed_at":"2026-08-06T19:29:50.731277Z","submitted_at":"2026-06-05T01:49:20Z","title":"Chiseling Out Efficiency: Structured Skeleton Supervision for Efficient Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T21:43:14.839335Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2606.06821"},"observation_digest":"sha256:59cf7c267efd50e6702ac31c5e20ddb12a7337bb165216f508654f13d3b16559","observation_id":"fdfac164-c18f-47f9-8ef5-28ca3bffd16d","resolution":{"observed_at":"2026-07-02T18:57:17.211389Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":"2406.06647","doi":"10.48550/arxiv.2406.06647","metadata_source":"arxiv_reference","pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How efficient is llm-generated code? a rigorous & high-standard benchmark","venue":"arXiv (Cornell University)","work_id":"2011618b-08f0-4d26-aafc-cbeedd5571f7","year":2024},"citing_paper":{"arxiv_id":"2606.06826","last_updated":"2026-06-05T02:01:38Z","snapshot_observed_at":"2026-08-07T19:01:41.755123Z","submitted_at":"2026-06-05T02:01:38Z","title":"SkelDPO: A Skeleton-Guided Direct Preference Optimization Framework for Efficient Code Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T21:41:02.035059Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2606.06826"},"observation_digest":"sha256:c28d46c7dc8f41c55c39ff4952a3a35741628ec00ce6c1816ae9436aef65faf8","observation_id":"3d4bf8c9-e6ec-4ee8-a30d-61e4370a78c6","resolution":{"observed_at":"2026-07-02T19:07:17.709938Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-07-11T19:02:39.314928Z","title":"How efficient is LLM-generated code? a rigorous & high-standard benchmark,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04454","last_updated":"2026-07-13T19:43:36Z","snapshot_observed_at":"2026-08-06T11:19:47.575635Z","submitted_at":"2026-07-05T18:33:12Z","title":"Correct but Slow: An Empirical Study of the GPU Kernel Evaluation Gap in Modern Domain-Specific Languages","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T19:02:39.314928Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2607.04454"},"observation_digest":"sha256:2290253ffb8c06d5fa1add921e2d44aad1497b3158b9205abd1f6533209385f7","observation_id":"9afc1ee1-36a1-4e3d-8582-c4299f6b5583","resolution":{"observed_at":"2026-07-11T19:02:39.314928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-01T12:12:59.345502Z","title":"Available: https://arxiv.org/abs/2406.06647","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":30,"source":"pdf_text","source_observed_at":"2026-08-01T12:12:59.345502Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2607.19653"},"observation_digest":"sha256:e12da7e663f5acab0d10f2a1f51565958b9fb1aaf5267d2138d69768d33bf9b5","observation_id":"40d11d73-0714-4c4e-808d-fc7a50f7cc5f","resolution":{"observed_at":"2026-08-01T12:12:59.345502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06647","snapshot_observed_at":"2026-08-01T01:01:38.353080Z","title":"good” or “bad","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.25970","last_updated":"2026-07-28T16:52:31Z","snapshot_observed_at":"2026-08-07T15:44:57.874753Z","submitted_at":"2026-07-28T16:52:31Z","title":"Reinforcement Learning for Code Optimization","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T01:01:38.353080Z"},"links":{"cited_paper":"/paper/2406.06647","citing_paper":"/paper/2607.25970"},"observation_digest":"sha256:76c26184aa1c110708ff40362d596abad88d3447b7d0e7afbcfad019859b743f","observation_id":"494ef898-6c9f-4e1c-a8d7-d80367638d85","resolution":{"observed_at":"2026-08-01T01:01:38.353080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.06647/citation-record","integrity":"/paper/2406.06647/integrity","json":"/paper/2406.06647/citation-record.json","paper":"/paper/2406.06647"},"outbound":[],"paper":{"arxiv_id":"2406.06647","last_updated":"2025-02-19T04:16:24Z","latest_version":4,"primary_category":"cs.SE","snapshot_observed_at":"2026-07-06T18:28:24.821865Z","submitted_at":"2024-06-10T04:19:20Z","title":"How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2406.06647."}