{"as_of":"2026-08-15T11:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68432b1f185709d169a0690cdae9c0e7ef6f9575e782f890168da4250f436fde","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:09:34.399866Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.06463/citation-record","integrity":"/paper/2507.06463/integrity","json":"/paper/2507.06463/citation-record.json","paper":"/paper/2507.06463"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:32.964352Z","title":"A survey on evaluation of large language models,","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-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:32.964352Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:818f5c8b7de9aa5a8dbfa33db0ec271923817fe3bdc91da2c3a6e7191fa553b9","observation_id":"ba7f6e73-fcc7-46a1-a371-b00ae8a00319","resolution":{"observed_at":"2026-08-06T19:09:32.964352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.10397","last_updated":"2022-11-23T07:42:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-07-21T10:18:37Z","title":"CodeT: Code Generation with Generated Tests","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.10397","snapshot_observed_at":"2026-08-06T19:09:33.045458Z","title":"CodeT: Code generation with generated tests,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.045458Z"},"links":{"cited_paper":"/paper/2207.10397","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:b12f5865842c46523af62d29d69185c5b5a62f98e87dbca6d92018df4847fb81","observation_id":"78add78e-708c-4197-8756-aa2e3ef61741","resolution":{"observed_at":"2026-08-06T19:09:33.045458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:36.276577Z","title":"Is your code generated by ChatGPT really correct? rigorous evaluation of large language models for code generation,","venue":null,"work_id":"2eb0c052-5ada-4028-8065-232b4d153b91","year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.123348Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:9f771d4c2e7364e321cc8bed43c17e89dbdf1393562fcc421a2df4aef0f6c3d2","observation_id":"9a5b1af6-ca8f-4586-87fc-4b05d7191f9a","resolution":{"observed_at":"2026-08-06T19:09:36.332727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02184","last_updated":"2024-10-03T03:58:03Z","snapshot_observed_at":"2026-08-13T18:45:39.738577Z","submitted_at":"2024-10-03T03:58:03Z","title":"CodeJudge: Evaluating Code Generation with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02184","snapshot_observed_at":"2026-08-06T19:09:33.177676Z","title":"CodeJudge: Evaluating code generation with large language models,","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-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.177676Z"},"links":{"cited_paper":"/paper/2410.02184","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:aa3722ae801f3b7fbae251b2db87b4ab5f6ed49459fe6d23f123f4c83b151214","observation_id":"993294e3-f724-4824-9305-34f4c5531b9c","resolution":{"observed_at":"2026-08-06T19:09:33.177676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:36.167587Z","title":"An empirical evaluation of GitHub copilot’s code suggestions,","venue":null,"work_id":"065c56a0-735f-4a1f-95c1-c4395b857c93","year":2022},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.240149Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:7e1f6b5f0998851dd94faba35dc57a1793cb133656c5d1d7aee1aad6b5fb94d0","observation_id":"56073c54-b086-4922-9c9d-4d69f8c17269","resolution":{"observed_at":"2026-08-06T19:09:36.194276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:36.114009Z","title":"Large language models of code fail at completing code with potential bugs,","venue":null,"work_id":"a6a8a38c-95a9-4531-b60f-32564fd2cbe3","year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.294041Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:ee47fcc601deedb481dcb51c7300ea836b7c166b32ad5ce8c731e3aeb1ea936b","observation_id":"f06185d4-b840-46c7-a58b-f940fb37f5b6","resolution":{"observed_at":"2026-08-06T19:09:36.160801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.951753Z","title":"Bugs in large language models generated code: An empirical study,","venue":null,"work_id":"2eaf4c25-0254-4a9d-93db-6618d455d323","year":2025},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.350778Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:51be63e7069c2146284f7dae022e85aea3f2add5a5ebdf2cc156a1a946e41746","observation_id":"da2619a2-6570-4b93-ab5e-3db5659a395d","resolution":{"observed_at":"2026-08-06T19:09:36.048114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.784626Z","title":"Large language models and simple, stupid bugs,","venue":null,"work_id":"387d5d24-2fda-4990-abd6-729800512375","year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.429536Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:99e898fe113386cc2cda1ee22a31a41a993c7ba74f5e9a7c01bf4a13f1bda359","observation_id":"2936ff44-e4aa-4ca5-ade9-14fbb27c56ce","resolution":{"observed_at":"2026-08-06T19:09:35.866329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-06T19:09:33.493159Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.493159Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:39661a4de31563080c2ed6ec14b2fefebebd6cc45aa6891afc138c413a64db08","observation_id":"4e890f62-5a39-41a7-a31f-7ddcd66cd7f1","resolution":{"observed_at":"2026-08-06T19:09:33.493159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-06T19:09:33.561579Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.561579Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:c9ba93fedb595310ef8d3e566b10b1b3de83c284232183e59e8ac30de749ed31","observation_id":"ab95d412-92a2-45c6-9b76-29ed5f2973e7","resolution":{"observed_at":"2026-08-06T19:09:33.561579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.651427Z","title":"EffiBench: Benchmarking the efficiency of automatically generated code,","venue":null,"work_id":"ac690c83-60fa-42e6-82d0-14586c4d00b5","year":2024},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.596497Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:817f5e50721ec4ac47c7299d7f4a37cb62e0ce3e68fe363997ba61d0b963f5c4","observation_id":"e2bdff79-83aa-40b0-a4ee-49111c52fb73","resolution":{"observed_at":"2026-08-06T19:09:35.702841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-14T10:16:49.154554Z","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-14T09:08:21.063146Z","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:70e99e81b33d25e2938d3614ad6f43bbef8fa3c3740468cca711d27c2f908b94","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":"2501.16857","last_updated":"2025-01-28T11:11:36Z","snapshot_observed_at":"2026-08-14T00:25:09.895563Z","submitted_at":"2025-01-28T11:11:36Z","title":"Comparing Human and LLM Generated Code: The Jury is Still Out!","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16857","snapshot_observed_at":"2026-08-06T19:09:33.701678Z","title":"Comparing human and LLM generated code: The jury is still out!","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.701678Z"},"links":{"cited_paper":"/paper/2501.16857","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:aff6e49799c1e18cd2c2282d1929cb798e68c610249212c41ac5ba5bf59cf0dc","observation_id":"c134dd97-fc0f-4edb-addd-e1dad793e0b6","resolution":{"observed_at":"2026-08-06T19:09:33.701678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.07844","last_updated":"2024-06-11T17:44:56Z","snapshot_observed_at":"2026-08-14T20:36:54.104023Z","submitted_at":"2024-02-12T17:53:22Z","title":"Mercury: A Code Efficiency Benchmark for Code Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07844","snapshot_observed_at":"2026-08-06T19:09:33.758152Z","title":"Mercury: A code efficiency benchmark for code large language models,","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-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.758152Z"},"links":{"cited_paper":"/paper/2402.07844","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:73a8e172c7127cc7f88e8d5d1a3257adf040c8c50d640072eb7202fafaa2494c","observation_id":"12179005-66ad-4c07-82e8-74ae8c614eb2","resolution":{"observed_at":"2026-08-06T19:09:33.758152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.641174Z","title":"On evaluating the efficiency of source code generated by LLMs,","venue":null,"work_id":"8d6e1234-f4af-45b6-923b-438e80f62f17","year":2024},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.816217Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:05c03295492ce4d2e23fe1470c4cbbac3355bef61aef6e387244e80a8459ec75","observation_id":"7a20717e-57ae-4104-a54e-1c4300066632","resolution":{"observed_at":"2026-08-06T19:09:35.644735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T06:29:54.467813Z","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-14T09:08:21.063146Z","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:1da38298e4fd61e80758c013ef23b938d77a8be6f8ece277ca28f26a5b8dfb24","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.482687Z","title":"FRANC: A lightweight framework for high-quality code generation,","venue":null,"work_id":"67b90c00-5db8-475e-a66e-f73eeaf67bf4","year":2024},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:33.954826Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:dd14044ad8ee6513e45d1ad7f13da5b3c8ac5405f8350d25ab62db7b1ccc9888","observation_id":"fe90a91a-e20b-49c6-865f-7ab341d7b353","resolution":{"observed_at":"2026-08-06T19:09:35.622557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.10778","last_updated":"2023-10-22T01:48:39Z","snapshot_observed_at":"2026-08-14T19:57:41.998981Z","submitted_at":"2023-04-21T07:08:26Z","title":"Evaluating the Code Quality of AI-Assisted Code Generation Tools: An Empirical Study on GitHub Copilot, Amazon CodeWhisperer, and ChatGPT","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.10778","snapshot_observed_at":"2026-08-06T19:09:34.032611Z","title":"Evaluating the code quality of AI-assisted code generation tools: An empirical study on GitHub Copilot, Amazon CodeWhisperer, and ChatGPT,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.032611Z"},"links":{"cited_paper":"/paper/2304.10778","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:c38ccbcff7ef91c13c25d792ab6d650779c011635a62cdb875b1a531c1d60ad0","observation_id":"47f5486b-76b8-41db-82a6-80dd5d887dcf","resolution":{"observed_at":"2026-08-06T19:09:34.032611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18489","last_updated":"2025-02-17T07:01:18Z","snapshot_observed_at":"2026-08-14T23:52:19.057935Z","submitted_at":"2025-02-17T07:01:18Z","title":"LLM4EFFI: Leveraging Large Language Models to Enhance Code Efficiency and Correctness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18489","snapshot_observed_at":"2026-08-06T19:09:34.091736Z","title":"LLM4EFFI: Leveraging large language models to enhance code ef- ficiency and correctness,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.091736Z"},"links":{"cited_paper":"/paper/2502.18489","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:d462c38fe26da995c1a8da0ed30c690e8eadc48e2aaf73569087e8b6dba4b801","observation_id":"5406a1ba-6d88-42f0-83ba-a0f6570c21ac","resolution":{"observed_at":"2026-08-06T19:09:34.091736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.14044","last_updated":"2024-10-09T22:20:40Z","snapshot_observed_at":"2026-08-12T23:18:58.096337Z","submitted_at":"2024-07-19T05:47:40Z","title":"ECCO: Can We Improve Model-Generated Code Efficiency Without Sacrificing Functional Correctness?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.14044","snapshot_observed_at":"2026-08-06T19:09:34.151265Z","title":"ECCO: Can we improve model-generated code efficiency without sacrificing functional correctness?","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-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.151265Z"},"links":{"cited_paper":"/paper/2407.14044","citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:40ee1c6fdf5a664719d39f4b264e4e4256c5b04ed03f8b2f007da6cfc7f6391e","observation_id":"42aa8b5b-43ed-4eff-9ac1-c6246f0184cf","resolution":{"observed_at":"2026-08-06T19:09:34.151265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.361100Z","title":"Fast triangle counting,","venue":null,"work_id":"4b846743-b8c8-4a2d-8dfc-2525893423bb","year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.204114Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:1b6292cca9821081b9e2c95faad726b0d73f28383c0344d4ce93a12e49dcb4d8","observation_id":"0e0344fe-e463-462e-8e40-0d8c5196bd75","resolution":{"observed_at":"2026-08-06T19:09:35.437433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:35.157988Z","title":"Finding, counting and listing all triangles in large graphs, an experimental study,","venue":null,"work_id":"685966b2-9f7d-4e34-a2e0-347259a7b1c6","year":2005},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.266090Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:26ed76ad2f5bf7d9818131b2bebbc9a3877b41480168cdd770a50fb1613d951a","observation_id":"80e5aab6-f105-4b9b-ac5a-1687417224df","resolution":{"observed_at":"2026-08-06T19:09:35.280137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:34.862864Z","title":"Algorithmic aspects of triangle-based network analysis,","venue":null,"work_id":"40eae6a6-5348-4e91-b54a-c751bf023c1a","year":2007},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.330946Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:ebe617e619b6e7c05982adeadd704c73a6cb1754e73913c0f3110dcc90ae8914","observation_id":"b6b2f5b3-0a65-445a-a060-caf308595ca9","resolution":{"observed_at":"2026-08-06T19:09:34.989136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:34.676973Z","title":"Triangle counting through cover-edges,","venue":null,"work_id":"ce1c7327-f03d-44c5-8c78-55d965de8ef3","year":2023},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.396445Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:f17fbed1f9b7f59bbf8971c468eff3c0e897b6d6a2c0a01a599b9f8634e85816","observation_id":"362b0146-03bb-4cf9-a5cc-b2242258c171","resolution":{"observed_at":"2026-08-06T19:09:34.719709Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:09:34.529798Z","title":"R-MAT: A recursive model for graph mining,","venue":null,"work_id":"69fedd11-f33e-47d8-bb9f-f5e14a592d45","year":2004},"citing_paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:09:34.399866Z"},"links":{"citing_paper":"/paper/2507.06463"},"observation_digest":"sha256:b00732d33bc939571f5312d057ca171e3a5b1f92e12948489b4d76697ef4ca03","observation_id":"a6895ef2-917a-45b6-a7ca-3ec3512ef9e8","resolution":{"observed_at":"2026-08-06T19:09:34.600469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.06463","last_updated":"2025-08-28T14:22:23Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-14T09:08:21.063146Z","submitted_at":"2025-07-09T00:46:30Z","title":"Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":25},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2507.06463."}