Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
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.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T23:49:14.651526Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
0 of 0 outbound references displayed
External citation measurements
2
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
No outbound reference observations are available for this paper version.
Observation 7d2a4cf5-ea26-4afe-b485-b41552f8def0 · inbound
SelfElicit: Your Language Model Secretly Knows Where is the Relevant Evidence How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 49
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 30d9c9c0-b689-4a93-92d7-6778f68f5276 · inbound
Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 60
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d768de9e-9a5d-4dd6-91bd-2962dc171164 · inbound
Afterburner: Reinforcement Learning Facilitates Self-Improving Code Efficiency Optimization How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 45
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2dec1611-4a8a-4c52-a7a3-d945316cc130 · inbound
Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 12
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cb0bb92f-2fc3-4a4d-8b01-d2da6116c80e · inbound
Energy-Aware Code Generation with LLMs: Benchmarking Small vs. Large Language Models for Sustainable AI Programming How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 21
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c293c707-cac1-4ec4-ae8e-dd7aaf8ce2fc · inbound
Do AI Models Dream of Faster Code? An Empirical Study on LLM-Proposed Performance Improvements in Real-World Software How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 34
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation b79705da-b2ed-4a60-a7cc-a2ec2bb0b2fe · inbound
Incisor: Ex Ante Cloud Instance Selection for HPC Jobs How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 61
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 6cdbc155-8baa-47d9-b227-9f2bf039c6cb · inbound
Bridging Generation and Training: A Systematic Review of Quality Issues in LLMs for Code How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 102
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 7017ec4e-d55a-4353-abe7-e587c1287e11 · inbound
Discovery of Interpretable Surrogates via Agentic AI: Application to Gravitational Waves How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 8d852ec3-e499-4966-b42c-fe08046b9255 · inbound
CodegenBench: Can LLMs Write Efficient Code Across Architectures? How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 39
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation fdfac164-c18f-47f9-8ef5-28ca3bffd16d · inbound
Chiseling Out Efficiency: Structured Skeleton Supervision for Efficient Code Generation How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 3d4bf8c9-e6ec-4ee8-a30d-61e4370a78c6 · inbound
SkelDPO: A Skeleton-Guided Direct Preference Optimization Framework for Efficient Code Generation How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.
Observation 9afc1ee1-36a1-4e3d-8582-c4299f6b5583 · inbound
Correct but Slow: An Empirical Study of the GPU Kernel Evaluation Gap in Modern Domain-Specific Languages How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 37
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 40d11d73-0714-4c4e-808d-fc7a50f7cc5f · inbound
PerfAgent: Profiler-Guided Iterative Refinement for Repository-Level Code Optimization How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 30
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 494ef898-6c9f-4e1c-a8d7-d80367638d85 · inbound
Reinforcement Learning for Code Optimization How Efficient is LLM-Generated Code? A Rigorous & High-Standard Benchmark
Reference 2025
Source-reported events for the cited work
Unavailable: canonical work link unavailable.