{"as_of":"2026-08-12T12:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdcb3578aee2a349cf99a69fc3bd6ff065939adef53443e269590dd918367f5d","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:42:49.380605Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T12:28:04.662036Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T20:26:12.312629Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23953","snapshot_observed_at":"2026-08-05T12:28:04.662036Z","title":"Enhancing LLM-based code gen- eration with complexity metrics: A feedback-driven approach","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.01619","last_updated":"2025-09-01T16:56:16Z","snapshot_observed_at":"2026-08-10T21:58:26.227754Z","submitted_at":"2025-09-01T16:56:16Z","title":"Throttling Web Agents Using Reasoning Gates","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-05T12:28:04.662036Z"},"links":{"cited_paper":"/paper/2505.23953","citing_paper":"/paper/2509.01619"},"observation_digest":"sha256:5489ddaa01f5eb80b73cae1578db2302ff67bf0b6f979514beee5e8706913f08","observation_id":"405a92cd-5fca-4046-aff2-35c4a4fa2a0a","resolution":{"observed_at":"2026-08-05T12:28:04.662036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"cited_work":{"arxiv_id":"2505.23953","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.23953","snapshot_observed_at":"2026-07-01T20:26:12.312629Z","title":"Enhancing LLM-based code generation with complexity metrics: A feedback-driven approach,","venue":null,"work_id":"9201fe43-fc16-43e8-9f22-1758b39640fa","year":2025},"citing_paper":{"arxiv_id":"2606.00308","last_updated":"2026-05-29T19:34:15Z","snapshot_observed_at":"2026-07-06T23:41:01.066075Z","submitted_at":"2026-05-29T19:34:15Z","title":"How Generation Architecture Shapes Code Complexity in Multi-Agent LLM Systems: A Paired Study on HumanEval","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-28T21:14:01.070601Z"},"links":{"cited_paper":"/paper/2505.23953","citing_paper":"/paper/2606.00308"},"observation_digest":"sha256:e2c58e04fc114a631648fc78349817427d9f6c8c352f8b23f7db4eb083311375","observation_id":"003f8466-7227-4149-919d-d3db5316f2e2","resolution":{"observed_at":"2026-07-01T20:26:12.314142Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.23953/citation-record","integrity":"/paper/2505.23953/integrity","json":"/paper/2505.23953/citation-record.json","paper":"/paper/2505.23953"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.03267","last_updated":"2024-09-05T06:24:29Z","snapshot_observed_at":"2026-08-10T21:30:45.512916Z","submitted_at":"2024-09-05T06:24:29Z","title":"No Man is an Island: Towards Fully Automatic Programming by Code Search, Code Generation and Program Repair","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.03267","snapshot_observed_at":"2026-08-07T12:42:47.266982Z","title":"No man is an island: Towards fully automatic programming by code search, code generation and program repair,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.266982Z"},"links":{"cited_paper":"/paper/2409.03267","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:04e4ede8f0c9a4874bdab8aa6fc9b5c5cd083e51492d14b27d384ae2bbdd4900","observation_id":"2d1d413a-cfde-4218-8e67-a108ba5800ef","resolution":{"observed_at":"2026-08-07T12:42:47.266982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-07T12:42:47.301532Z","title":"Gpt-4 technical report,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.301532Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:4206b4b7af075cdc7efdd9bb256d87f874ab8aba0bbb78c5ae4cf9516663f4dc","observation_id":"adf27e45-5821-4b0a-abf3-72d96962fd46","resolution":{"observed_at":"2026-08-07T12:42:47.301532Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:47.399613Z","title":"Chain-of-thought prompting elicits reasoning in large language models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.399613Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:8f49dc7154b6cb99b5f5324ffca0c99c21863fd494d73d7eee82b60efec7ebe3","observation_id":"c597eb55-f80a-413c-bfe7-e8d94f4ddcd1","resolution":{"observed_at":"2026-08-07T12:42:47.399613Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:47.489296Z","title":"Reflex- ion: Language agents with verbal reinforcement learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.489296Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:b1a0c0074e882b0c3e6f8a4b4ce68a9f0fc638ed29205665186260a084377187","observation_id":"ca7c204f-bb87-42c0-919e-75cc28bd74a8","resolution":{"observed_at":"2026-08-07T12:42:47.489296Z","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-07T12:42:52.214429Z","title":"Cyclomatic complexity,","venue":null,"work_id":"10092e58-97bd-4c61-b9ba-296b5d12b4de","year":2016},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.542890Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:022793f1a68e9183cd88bf9c3e0c60d11329d1128751e811a465649181c800aa","observation_id":"f7538d63-9f61-4f7a-a4be-3a284c70d6bf","resolution":{"observed_at":"2026-08-07T12:42:52.347125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:52.025479Z","title":"Software complexity analysis using halstead metrics,","venue":null,"work_id":"63c3309d-66d1-45b7-ad99-dcf95ec1bdd9","year":2017},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.598822Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:aea16cb9d89d65c378b4464f35acb028e2fae1078c3bcb7ac9e25830ec81ad3c","observation_id":"eff05077-bdf4-4797-a461-b66d3eb9981a","resolution":{"observed_at":"2026-08-07T12:42:52.107139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:51.873377Z","title":null,"venue":null,"work_id":"6248c3ce-b166-4d38-9e3e-4fc7e6aca747","year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.649809Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:3b7f892517725103bd26014acd9a5a7bd08430a949e12a4e628716e1b8869446","observation_id":"a54ee7bc-c2a9-4800-8493-f81cc38ad761","resolution":{"observed_at":"2026-08-07T12:42:51.970786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:47.707195Z","title":"Evaluating large language models trained on code,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.707195Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:340077276328de3f78c335ca55908c97de18452a7ea3743dfe595323f90d5198","observation_id":"bc4b5b42-8b38-4b00-b62c-b926372ff371","resolution":{"observed_at":"2026-08-07T12:42:47.707195Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:47.745640Z","title":"Logistic regression,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.745640Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:ddd2d478e7f02403c6254010d757e8f0c8ea92ac5c1c0bdec3cf1bf1350c2096","observation_id":"8da40589-7982-481c-a1a6-af257376fc47","resolution":{"observed_at":"2026-08-07T12:42:47.745640Z","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-07T12:42:51.699208Z","title":"Gpt-3.5-turbo,","venue":null,"work_id":"f250830a-d1dc-4e54-be04-9020f929e53d","year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.787975Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:bdc20a4111fbabecdd4cd2ba076f89df9494591b4d5e4af3d2823303f69a3c8e","observation_id":"1492496d-7328-45a2-86c2-bb1931a9ee8b","resolution":{"observed_at":"2026-08-07T12:42:51.754048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T12:42:47.844950Z","title":"The llama 3 herd of models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.844950Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:55fda80b6b091ef9a461d7c9bb21e2ed9e1201beb391fe5f51c428fc31f05fc6","observation_id":"82e6b995-8548-454b-954b-262c4aee58aa","resolution":{"observed_at":"2026-08-07T12:42:47.844950Z","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-07T12:42:47.884835Z","title":"Program synthesis with large language models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.884835Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:2d970ac9f4e87587bf29b2ec9e36b7cbf391f71a493242c79dfb8c2134cd6013","observation_id":"ec3497aa-42b8-4687-9535-00a18fd6a349","resolution":{"observed_at":"2026-08-07T12:42:47.884835Z","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-07T12:42:51.527058Z","title":"Leetcode dataset,","venue":null,"work_id":"e73e4bca-2539-487b-91fb-31482aa538d2","year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.919535Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:80fa553a3ed348ee353827d6c939e35a9864a1755a837f843f616e006de22c04","observation_id":"28fd7036-9151-4c9e-8d6d-786dd1e43b5f","resolution":{"observed_at":"2026-08-07T12:42:51.576495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:51.490102Z","title":"Introduction to the shapley value,","venue":null,"work_id":"f5111394-164e-4c51-9e4d-ac880b25da22","year":1988},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.953398Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:c9401e084006a2d9ec98fd3a3fa77adc047af3b0fcc86d885865be855b8bc0c4","observation_id":"9d0603c5-dbf5-4981-8e85-c8684cdfcc6f","resolution":{"observed_at":"2026-08-07T12:42:51.499699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15877","last_updated":"2025-04-01T08:36:44Z","snapshot_observed_at":"2026-07-31T19:00:59.311189Z","submitted_at":"2024-06-22T15:52:04Z","title":"BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15877","snapshot_observed_at":"2026-08-07T12:42:47.989730Z","title":"Bigcodebench: Benchmarking code generation with diverse function calls and complex instructions,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:47.989730Z"},"links":{"cited_paper":"/paper/2406.15877","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:8bfe28b07935493f44516480c284e7e05149cf7f407f90b5bdd49983103e4ad5","observation_id":"93263ceb-5838-459e-aa0e-6fbd614f96ef","resolution":{"observed_at":"2026-08-07T12:42:47.989730Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-07T12:42:48.021836Z","title":"Code llama: Open foundation models for code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.021836Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:3f5cc4b23847b1c51ba5e9813750dcd6afcdf60d779804e242bc1bef0fab704f","observation_id":"b64ace2c-b152-405f-86e2-9ca9929c968f","resolution":{"observed_at":"2026-08-07T12:42:48.021836Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-07T12:42:48.052643Z","title":"Llama 2: Open foundation and fine-tuned chat models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.052643Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:fd9ab9c6c1d40a0935f796f8db42566f9150eee5a1670e7efb451285ba87f0a9","observation_id":"906bae7e-5d62-4d27-b5a8-569c83fd7569","resolution":{"observed_at":"2026-08-07T12:42:48.052643Z","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-07T12:42:51.354052Z","title":"Gpt-o3-mini,","venue":null,"work_id":"3a29be18-2d79-4bf0-9dae-7fc28533ddda","year":2025},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.095355Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:1700e2984cb19f835ac2f2254686c3c269cb20857960e9f5a16f6b36e555db85","observation_id":"d4355666-d183-4f00-ae0c-a92f4165f873","resolution":{"observed_at":"2026-08-07T12:42:51.411825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:51.195101Z","title":"Parsel: Algorithmic reasoning with language models by composing decompositions,","venue":null,"work_id":"0ee154a3-5e4a-448b-95ef-eecba2f7f39c","year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.160504Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:80d291939ef7a598677b60bb7bc2fe19b5f82880ed91c91b21c35dbe8bd43446","observation_id":"281931f0-19f6-45a7-8144-e57f288e0805","resolution":{"observed_at":"2026-08-07T12:42:51.273873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:51.065592Z","title":"Anpl: towards natural programming with interactive decomposition,","venue":null,"work_id":"2e0b92f7-735c-4079-b808-4a65885d4304","year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.244656Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:9cf5db6b1cba0866a38519c8500d5850ec14fe568d1bf14ea0e7f82f322957a1","observation_id":"953d045a-dbd6-40b1-a877-2de29bcb9a02","resolution":{"observed_at":"2026-08-07T12:42:51.126668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.02170","last_updated":"2024-11-15T04:30:04Z","snapshot_observed_at":"2026-08-07T04:49:42.215176Z","submitted_at":"2023-10-03T16:05:48Z","title":"A Dynamic LLM-Powered Agent Network for Task-Oriented Agent Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.02170","snapshot_observed_at":"2026-08-07T12:42:48.283041Z","title":"Dynamic llm-agent network: An llm-agent collaboration framework with agent team op- timization,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.283041Z"},"links":{"cited_paper":"/paper/2310.02170","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:1b5d35b38a6b48c03a2a571bc292f61952b9ae318bbcdebad26feb807bd19f82","observation_id":"ca285ce8-5ec6-45db-9b4f-e1da5d77c7e6","resolution":{"observed_at":"2026-08-07T12:42:48.283041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.13010","last_updated":"2024-05-24T11:47:24Z","snapshot_observed_at":"2026-07-06T17:05:56.282078Z","submitted_at":"2023-12-20T13:22:41Z","title":"AgentCoder: Multi-Agent-based Code Generation with Iterative Testing and Optimisation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.13010","snapshot_observed_at":"2026-08-07T12:42:48.318234Z","title":"Agentcoder: Multi-agent-based code generation with iterative testing and optimisation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.318234Z"},"links":{"cited_paper":"/paper/2312.13010","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:4d9e0cdeb3973c8a7c18f46e6a1183cf37dccdf8403973c5b4a5bdba7c436a59","observation_id":"4a02b37f-f55b-4716-ae10-2eb43e116c62","resolution":{"observed_at":"2026-08-07T12:42:48.318234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16906","last_updated":"2024-06-06T06:01:41Z","snapshot_observed_at":"2026-08-09T12:26:08.682226Z","submitted_at":"2024-02-25T00:56:27Z","title":"Debug like a Human: A Large Language Model Debugger via Verifying Runtime Execution Step-by-step","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16906","snapshot_observed_at":"2026-08-07T12:42:48.385369Z","title":"Ldb: A large language model debugger via verifying runtime execution step-by-step,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.385369Z"},"links":{"cited_paper":"/paper/2402.16906","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:e0abd7f8d06686118f9d46074073442cfcdf38e0252448515e219dd9bf82867f","observation_id":"e48c0abb-38b3-46e7-a054-709324835ec9","resolution":{"observed_at":"2026-08-07T12:42:48.385369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11198","last_updated":"2025-07-29T23:53:49Z","snapshot_observed_at":"2026-07-06T19:03:43.883872Z","submitted_at":"2024-08-20T21:15:36Z","title":"Automated Prompt Engineering for Cost-Effective Code Generation Using Evolutionary Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11198","snapshot_observed_at":"2026-08-07T12:42:48.458168Z","title":"Epic: Cost-effective search-based prompt engineering of llms for code generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.458168Z"},"links":{"cited_paper":"/paper/2408.11198","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:c52f873920f2f655734f95c1a48882f0eef23ba5b4c242870515a8db7879181b","observation_id":"7797ed5c-8f72-47d5-8ceb-9483a04ecb80","resolution":{"observed_at":"2026-08-07T12:42:48.458168Z","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-07T12:42:50.897094Z","title":"A survey on metric of software complexity,","venue":null,"work_id":"6233e46a-d8fc-4027-acb8-344280361d7b","year":2010},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.556930Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:e8e182586c415d9d3c3deabb7a3c080590694af6cd695c9cf77ddd49947cf1a9","observation_id":"ff59a357-265e-48f6-a87e-d5e16b697141","resolution":{"observed_at":"2026-08-07T12:42:50.990468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:50.785960Z","title":"A pragmatic approach for hyper-parameter tuning in search-based test case generation,","venue":null,"work_id":"1bc00e53-76e6-428c-a152-f4387a08814d","year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.653316Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:2d5778b74f6beebe5261ee5701a6fabec0b07d6b0a5785ba2e5ab334ec7c2c7b","observation_id":"9ec0a775-57bd-472c-b842-d1579a8404bd","resolution":{"observed_at":"2026-08-07T12:42:50.839308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:50.597289Z","title":"An empirical study on bug severity estimation using source code metrics and static analysis,","venue":null,"work_id":"35b8721e-6afb-4ceb-83c0-60f6e91cd047","year":2024},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.733294Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:5ecfc8df1a6f7d182b365391ea9322b349f5961ae978fe47b96ee8ca9b0bc3f1","observation_id":"673717ef-94b6-46bf-b2c2-6d97721eb6df","resolution":{"observed_at":"2026-08-07T12:42:50.694054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:50.429063Z","title":"Analysis and modeling conditional mutual dependency of metrics in software defect prediction using latent variables,","venue":null,"work_id":"09d625f2-4bd2-4849-aac9-dfcaf3dcd467","year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.810001Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:566c2f8f214a34d43ec36689523d971c9e485ee3f87d2082e2f06815e4490f90","observation_id":"ddfa489d-6048-4707-9dd4-5cec615d4a90","resolution":{"observed_at":"2026-08-07T12:42:50.513519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:50.282025Z","title":"Automatically learning semantic features for defect prediction,","venue":null,"work_id":"31942ab1-9f73-4559-a3d1-548214eed211","year":2016},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:48.887609Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:c06182355cd44303e76f27f03286513e05259dc4231e2cfc3fd3131a7ce9d4d7","observation_id":"459817a3-daf6-4175-bf9a-2f21768c9b4a","resolution":{"observed_at":"2026-08-07T12:42:50.326852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:50.095432Z","title":"Continuous software bug prediction,","venue":null,"work_id":"60c079ca-5a6e-4b03-b0e2-db12e8257fac","year":2021},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:49.016709Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:32997ec897de93546c35a91f1819fabd54a962f8543e86406885e25ebd975c2c","observation_id":"5a289458-ded9-4002-8664-1cd0659948e7","resolution":{"observed_at":"2026-08-07T12:42:50.193140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:49.921277Z","title":"Feature selection, l 1 vs. l 2 regularization, and rotational invariance,","venue":null,"work_id":"68766a3e-0e74-4993-8c15-463a8a0f5b01","year":2004},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:49.119679Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:d1e96dab0a7809658eb923501e8c0ccac2f13357da0094492e90abe8165f94a0","observation_id":"8f402f69-8672-4bb9-b03e-1491686418ac","resolution":{"observed_at":"2026-08-07T12:42:50.010422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-07T12:42:49.744903Z","title":"Gene selection for cancer classification using support vector machines,","venue":null,"work_id":"41ebb8b8-7bbd-45d0-bdf5-a633e4bb711d","year":2002},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:49.186518Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:a1d5d39c931a6b564b4586a58c3f9338ae2aacab7688fcb73e3ba07806015b62","observation_id":"0e59e6a2-15b4-48ff-828a-257c8bc737b9","resolution":{"observed_at":"2026-08-07T12:42:49.826918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:42:49.263703Z","title":"Correlation-based feature selection for machine learning,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:49.263703Z"},"links":{"citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:b2f0732c7d69067f07baf4cde690d40097e10a1ac3750d65e43fdea3b631e72d","observation_id":"82f7346e-64af-492f-8e2b-43b5bc6fdbab","resolution":{"observed_at":"2026-08-07T12:42:49.263703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07874","last_updated":"2017-11-25T03:53:32Z","snapshot_observed_at":"2026-07-06T05:43:42.722222Z","submitted_at":"2017-05-22T17:38:10Z","title":"A Unified Approach to Interpreting Model Predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07874","snapshot_observed_at":"2026-08-07T12:42:49.380605Z","title":"A unified approach to interpreting model predictions,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:49.380605Z"},"links":{"cited_paper":"/paper/1705.07874","citing_paper":"/paper/2505.23953"},"observation_digest":"sha256:68016f6ad9557402e4c7ffd8541d4a1db34c4a6a42b6fb2d431b6c0623386ffb","observation_id":"ad89ffdc-a058-4693-8f79-c2b736181a4f","resolution":{"observed_at":"2026-08-07T12:42:49.380605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.23953","last_updated":"2025-05-29T19:06:14Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-10T19:29:20.946880Z","submitted_at":"2025-05-29T19:06:14Z","title":"Enhancing LLM-Based Code Generation with Complexity Metrics: A Feedback-Driven Approach"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":34},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 2 inbound Pith citation observations for arXiv:2505.23953."}