{"as_of":"2026-08-09T22:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74fd111a45ae653ea02e1e45b543a97b571b141ef850f66ed6256e594b14b5c5","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":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":22,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:18:49.074682Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","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":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-09T12:18:49.074682Z","title":"Evaluating language models for efficient code generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02412","last_updated":"2025-02-04T15:32:34Z","snapshot_observed_at":"2026-08-09T14:05:03.415709Z","submitted_at":"2025-02-04T15:32:34Z","title":"AI-Powered, But Power-Hungry? Energy Efficiency of LLM-Generated Code","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:18:49.074682Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2502.02412"},"observation_digest":"sha256:4844b9b9701ba3f4413ce3c889770da91d1aa6f2f50662d3509e104431a5288b","observation_id":"92af4e47-120b-4794-91bb-615aa660321b","resolution":{"observed_at":"2026-08-09T12:18:49.074682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-09T11:01:27.848936Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02827","last_updated":"2025-02-05T02:08:51Z","snapshot_observed_at":"2026-08-09T21:02:29.655021Z","submitted_at":"2025-02-05T02:08:51Z","title":"COFFE: A Code Efficiency Benchmark for Code Generation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T11:01:27.848936Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2502.02827"},"observation_digest":"sha256:25d700a677c29152aba8f3af61ea1832cc4fe62a00f18470c7ee7610971f3c4c","observation_id":"6ef479bb-d7bd-4a3c-a3b4-d7d6147f8e8b","resolution":{"observed_at":"2026-08-09T11:01:27.848936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-07T15:37:05.745275Z","title":"Evaluating language models for efficient code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14631","last_updated":"2025-05-21T05:17:34Z","snapshot_observed_at":"2026-08-07T15:28:58.246731Z","submitted_at":"2025-05-20T17:23:25Z","title":"Think Only When You Need with Large Hybrid-Reasoning Models","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:37:05.745275Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2505.14631"},"observation_digest":"sha256:02ec8f7bfda6701887163a5df8cd8b0547296d5a6a07b9e09d5be3101809ab17","observation_id":"d98699e6-9a86-48e7-a4ad-1c808cfa95d3","resolution":{"observed_at":"2026-08-07T15:37:05.745275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-07T12:50:26.404596Z","title":"Evaluating language models for efficient code generation.arXiv preprint arXiv:2408.06450, 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":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:50:26.404596Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2505.23387"},"observation_digest":"sha256:70f7254b4d2348a764c7516ab16dba2c952b945946fbaa3b8cd4be69bd1d7964","observation_id":"901b1cf3-73e3-462e-8e60-18cfe99e9c15","resolution":{"observed_at":"2026-08-07T12:50:26.404596Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"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":64,"source":"pdf_text","source_observed_at":"2026-05-19T12:17:34.743290Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2506.01249"},"observation_digest":"sha256:e65c59b224175e556b5bb31813c2aebbe015e2d5ba45e4fffcf7e3e77d23673e","observation_id":"76d11502-2cb7-4123-b3ef-80fa9bce9369","resolution":{"observed_at":"2026-05-19T12:22:17.190257Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-07T10:19:08.859635Z","title":"Evaluating language models for efficient code generation.arXiv preprint arXiv:2408.06450, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05767","last_updated":"2025-06-06T05:51:29Z","snapshot_observed_at":"2026-08-07T10:11:06.565253Z","submitted_at":"2025-06-06T05:51:29Z","title":"dots.llm1 Technical Report","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T10:19:08.859635Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2506.05767"},"observation_digest":"sha256:9bb75581a96236ce2e2f459846595b93839af92ffd0c98f01579796676a724c0","observation_id":"8527008f-023f-43a9-bbdc-fe0330356534","resolution":{"observed_at":"2026-08-07T10:19:08.859635Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-06T19:09:33.889386Z","title":"Evalu- ating language models for efficient code generation,","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":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.889386Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:68e1fef4850dd457b1bd2ef5fb6aaeeca5403b5ed0c5332aff5ed7fae66182a9","observation_id":"1cb1e528-f75e-4bfe-b75c-94514f89637c","resolution":{"observed_at":"2026-08-06T19:09:33.889386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-06T17:54:17.261360Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09662","last_updated":"2025-07-13T14:51:59Z","snapshot_observed_at":"2026-08-07T01:15:50.475193Z","submitted_at":"2025-07-13T14:51:59Z","title":"Towards Concise and Adaptive Thinking in Large Reasoning Models: A Survey","version":1},"reference_index":110,"source":"arxiv_source","source_observed_at":"2026-08-06T17:54:17.261360Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2507.09662"},"observation_digest":"sha256:082fb5fbbcabc59f9409ca32d8dc958cb7593fd341bb73d7629548e09a3a123b","observation_id":"4caa578f-7d72-44e6-a954-29a3595cabb4","resolution":{"observed_at":"2026-08-06T17:54:17.261360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-06T16:54:57.264899Z","title":"Evaluating language models for efficient code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12415","last_updated":"2026-07-01T03:29:05Z","snapshot_observed_at":"2026-08-06T16:43:57.286862Z","submitted_at":"2025-07-16T17:05:17Z","title":"SWE-Perf: Can Language Models Optimize Code Performance on Real-World Repositories?","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:54:57.264899Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2507.12415"},"observation_digest":"sha256:1bf277eb2272be8831571ca19372efe62639ee1ef92c06f3e568a63f8fadc593","observation_id":"3f3c7ba5-c68a-49a0-9b5a-3187e87b7d62","resolution":{"observed_at":"2026-08-06T16:54:57.264899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T14:29:44.466731Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21302","last_updated":"2025-12-09T02:27:24Z","snapshot_observed_at":"2026-08-09T01:26:02.661729Z","submitted_at":"2025-08-29T01:47:07Z","title":"Locus: Agentic Predicate Synthesis for Directed Fuzzing","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-05T14:29:44.466731Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2508.21302"},"observation_digest":"sha256:134dfbbd6cdc4ef65c4f3ccf8a1196abeac50d582d6f34b5472d4455cbb987e7","observation_id":"1a122857-1c28-47c5-87a2-69cc6f2365ea","resolution":{"observed_at":"2026-08-05T14:29:44.466731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","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":25,"source":"pdf_text","source_observed_at":"2026-05-18T06:39:42.391102Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2510.15494"},"observation_digest":"sha256:e913701fa3fe075207299a3c8d81aafaf044815ef1baa5cd6eeef263d0997262","observation_id":"fa93ce4b-b593-4e43-b06b-4ba34bc225dc","resolution":{"observed_at":"2026-05-18T06:41:00.443445Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-03T01:12:25.863510Z","title":"Luo, M., Jain, N., Singh, J., Tan, S., Patel, A., Wu, Q., Ariyak, A., Cai, C., Tarun Venkat, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.11210","last_updated":"2026-05-30T08:29:14Z","snapshot_observed_at":"2026-08-03T01:12:23.821627Z","submitted_at":"2026-02-11T02:33:04Z","title":"SWE-MiniSandbox: Container-Free Reinforcement Learning for Building Software Engineering Agents","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:12:25.863510Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2602.11210"},"observation_digest":"sha256:86e842e441ca8c4173efa3943f5ef412574109963a359ca944789843ace28a8a","observation_id":"19e6dc80-47e3-40c2-93f9-06fd7ff60be1","resolution":{"observed_at":"2026-08-03T01:12:25.863510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2605.10890","last_updated":"2026-05-11T17:33:32Z","snapshot_observed_at":"2026-07-06T23:22:47.781940Z","submitted_at":"2026-05-11T17:33:32Z","title":"CppPerf: An Automated Pipeline and Dataset for Performance-Improving C++ Commits","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-12T03:49:34.909838Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2605.10890"},"observation_digest":"sha256:a4daa3a55154632789d5880ab1f84f88dae54bdb427f57bf4c1917e43c77535f","observation_id":"e055c82e-e143-477b-ba95-068d236da384","resolution":{"observed_at":"2026-05-12T06:56:27.864123Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2605.26842","last_updated":"2026-05-26T10:56:20Z","snapshot_observed_at":"2026-08-02T04:41:45.987582Z","submitted_at":"2026-05-26T10:56:20Z","title":"MONA: Muon Optimizer with Nesterov Acceleration for Scalable Language Model Training","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-06-29T19:15:49.229099Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2605.26842"},"observation_digest":"sha256:877cfe1a7e8d819ae273bca31993e2fc0dc479cb33dbdcc3d9a97611d26fab3a","observation_id":"feef782f-0f2e-428a-a4d7-bdc7c26cb5be","resolution":{"observed_at":"2026-06-29T19:23:54.195640Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-02T06:38:25.005814Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:7fd2da420e255805a884bbe192d0b807687106dfef5617bb4213efc90fc0fc92","observation_id":"23a2c20a-b34b-45f7-a31a-019910a879bc","resolution":{"observed_at":"2026-06-29T15:43:32.575800Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","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":26,"source":"pdf_text","source_observed_at":"2026-06-27T21:43:14.839335Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2606.06821"},"observation_digest":"sha256:68fe657eed0655351c119474f6c948fc2cd1bd3233c757bc7b53e42b78456ca2","observation_id":"9b0dbc47-a690-409c-8c21-725502f72578","resolution":{"observed_at":"2026-07-02T18:57:17.208751Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","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":27,"source":"pdf_text","source_observed_at":"2026-06-27T21:41:02.035059Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2606.06826"},"observation_digest":"sha256:c4fb3aab5ee311b832f587969daa2f91ff51aa686b8f24aeb66f6c017cb7971f","observation_id":"2380a893-f5dc-494f-9bed-59a0a7a99fcd","resolution":{"observed_at":"2026-07-02T19:07:17.715879Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2606.31767","last_updated":"2026-07-26T15:33:07Z","snapshot_observed_at":"2026-08-02T09:24:33.966140Z","submitted_at":"2026-06-30T14:54:25Z","title":"JETO-Bench: A Reproducible Benchmark for Execution Time Improvement Patches in Java","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-01T04:12:02.043499Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2606.31767"},"observation_digest":"sha256:86bf14543608e6336377d32ed8acb65571bc3d369978960e4b732774991aa250","observation_id":"259ab365-eba6-430a-9da6-79aef9f3eef6","resolution":{"observed_at":"2026-07-01T11:35:43.633656Z","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-02T09:24:35.679140Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.31767","last_updated":"2026-07-26T15:33:07Z","snapshot_observed_at":"2026-08-02T09:24:33.966140Z","submitted_at":"2026-06-30T14:54:25Z","title":"JETO-Bench: A Reproducible Benchmark for Execution Time Improvement Patches in Java","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T09:24:35.679140Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2606.31767"},"observation_digest":"sha256:87f59743bfdee1c158bbbd7349071d42ef0a87259089eff96ef0f210396d84c6","observation_id":"bc977e92-c32c-4683-9177-b2a659d2a7bb","resolution":{"observed_at":"2026-08-02T09:24:35.679140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2607.07619","last_updated":"2026-07-08T16:36:03Z","snapshot_observed_at":"2026-08-07T18:03:39.958190Z","submitted_at":"2026-07-08T16:36:03Z","title":"Rethinking Code Performance Benchmarks for LLMs","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-07-09T05:16:58.549058Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2607.07619"},"observation_digest":"sha256:88f25f99d2467432cf24709772c6ecbca10289675c27346b0cf34447ba52b4c9","observation_id":"2c284cb9-cfad-49e7-a13b-aa1c28eee140","resolution":{"observed_at":"2026-07-09T05:26:01.186731Z","resolver_source":"local_arxiv","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-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-01T12:12:58.662932Z","title":"Evaluating language models for efficient code generation,","venue":null,"work_id":null,"year":2024},"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":24,"source":"pdf_text","source_observed_at":"2026-08-01T12:12:58.662932Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2607.19653"},"observation_digest":"sha256:9eb650f98a34e426335de1658b773efc3e1561215e526cf3c6bda1b0c0a31240","observation_id":"b71ffaf4-a3a4-484c-a664-37928b1876f7","resolution":{"observed_at":"2026-08-01T12:12:58.662932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-01T07:55:25.234146Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27409","last_updated":"2026-07-29T19:28:32Z","snapshot_observed_at":"2026-08-09T12:13:16.124336Z","submitted_at":"2026-07-29T19:28:32Z","title":"SWE-NFI: Studying and Benchmarking Coding Agents for Non-Functional Improvements","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T07:55:25.234146Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2607.27409"},"observation_digest":"sha256:b38a50cc13c753a20924c5ebc7e5d392c0708590ee6ed846e3ae0eeddaeec6d6","observation_id":"3a5b1627-d869-434b-a7ce-df886d889d99","resolution":{"observed_at":"2026-08-01T07:55:25.234146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.06450/citation-record","integrity":"/paper/2408.06450/integrity","json":"/paper/2408.06450/citation-record.json","paper":"/paper/2408.06450"},"outbound":[],"paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-07T08:27:28.863794Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient 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-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 22 inbound Pith citation observations for arXiv:2408.06450."}