{"as_of":"2026-08-23T15:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8484ca1ea4cdefc3b9aad17f705851d85618ee4cbfb8ada8e0a1346cbb492147","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:12:22.465488Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T17:37:51.790000Z","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-05-11T17:26:04.769785Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"cited_work":{"arxiv_id":"2504.21276","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.21276","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Cummings","venue":null,"work_id":"8a67b960-28e1-460b-b0aa-87289fc93ac3","year":2025},"citing_paper":{"arxiv_id":"2605.05267","last_updated":"2026-05-06T09:38:31Z","snapshot_observed_at":"2026-08-04T17:41:12.164736Z","submitted_at":"2026-05-06T09:38:31Z","title":"Bridging Generation and Training: A Systematic Review of Quality Issues in LLMs for Code","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-08T17:37:51.790000Z"},"links":{"cited_paper":"/paper/2504.21276","citing_paper":"/paper/2605.05267"},"observation_digest":"sha256:f276964524174385f84edc843e269e8528bafe725849297b7d61ccaa044b519a","observation_id":"77dac9ba-e623-4a19-b774-dd688636d54c","resolution":{"observed_at":"2026-05-11T17:26:04.771577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.21276/citation-record","integrity":"/paper/2504.21276/integrity","json":"/paper/2504.21276/citation-record.json","paper":"/paper/2504.21276"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T05:12:22.923597Z","title":"https://pypi.org/project/pylint/","venue":null,"work_id":"532b4658-1414-4038-85e7-64f648167fac","year":2025},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.326090Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:2d3cc3e1bb908d2c40503145aaef2da0bdf0646e8b7319206433240b253360a2","observation_id":"b10cbd82-d4ce-4f42-9000-3ea21a690673","resolution":{"observed_at":"2026-08-16T05:12:22.928139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.908466Z","title":"https://pylint.readthedocs.io/ en/latest/user_guide/messages/messages_overview.html","venue":null,"work_id":"b61b8485-a0a3-4faa-b9fd-f5ddd8dc44f5","year":2025},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.332435Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:00d6556a207e292041f99c4c298adaea0a51437a5e7cedbd81da408b0bd17eb6","observation_id":"88d5782c-ecd4-44e1-97ba-c06680a4048d","resolution":{"observed_at":"2026-08-16T05:12:22.912936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06992","last_updated":"2024-10-10T13:13:09Z","snapshot_observed_at":"2026-08-20T00:06:09.426132Z","submitted_at":"2024-10-09T15:38:53Z","title":"SWE-Bench+: Enhanced Coding Benchmark for LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06992","snapshot_observed_at":"2026-08-16T05:12:22.338438Z","title":"M., N NOROM , E., U DDIN , G., AND WANG , S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.338438Z"},"links":{"cited_paper":"/paper/2410.06992","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:adb77346ffd8e0fb28af0bb8e4f75a1e0d002560a57e87d0a8d8faf60d3bcd5a","observation_id":"5e1861e5-ec76-4c55-ad36-1f2c7e2595b4","resolution":{"observed_at":"2026-08-16T05:12:22.338438Z","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-16T05:12:22.893809Z","title":null,"venue":null,"work_id":"5442e937-f63d-4feb-b7ea-6fbc12ed1d41","year":2002},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.345449Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:40b79ef6c53f5fccb961a344436addea87de1abc75202bc3788ea91f7d819091","observation_id":"a9551bc1-f591-4756-bb32-ec914c6f19fb","resolution":{"observed_at":"2026-08-16T05:12:22.898129Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.879879Z","title":"V oronoi diagrams—a survey of a fundamental geometric data structure","venue":null,"work_id":"e1b8270b-d305-444a-8311-124648a5ca95","year":1991},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.352453Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:7e00ad02804f5392f1da7bd4c4be3ebacaaaf9d046e261174860b2d8e2392684","observation_id":"46f2b687-578a-4e6a-aa28-68a410b334cd","resolution":{"observed_at":"2026-08-16T05:12:22.884131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-20T20:50:23.483838Z","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-16T05:12:22.358678Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.358678Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:9ed13aba451698525d9c0a376488329611f16c44e3387933197201b905cf6261","observation_id":"440cd8f1-9481-4095-885f-d6186d10cb73","resolution":{"observed_at":"2026-08-16T05:12:22.358678Z","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-16T05:12:22.865021Z","title":"A note on two problems in connexion with graphs","venue":null,"work_id":"c5b06ac3-3c56-453d-a171-8f6fda59f1b6","year":1959},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.365212Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:56f591b2328ae73c302f77c87478f9fbaba926e5b44cb180872147e9a715e98c","observation_id":"a23002a7-605a-4475-98a1-0078b0f94c11","resolution":{"observed_at":"2026-08-16T05:12:22.869696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.849481Z","title":"H., B ENTLEY , J","venue":null,"work_id":"3575d014-3add-478a-b676-9ba1549f1005","year":1977},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.371901Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:1f68e248292568d51feeca65f661f821fb57b071ce8534f5f58bae083757b93e","observation_id":"474be97a-20e7-4e1e-94cd-a8e898bf58d1","resolution":{"observed_at":"2026-08-16T05:12:22.853774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.834929Z","title":"Programming guidelines","venue":null,"work_id":"643515a2-ba71-42a2-b103-b599d736cf0f","year":2025},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.378791Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:12f6cf0772360fd4b867f23934a53cd68324bf4cca8c2e97556ff93c3bd0c682","observation_id":"c879d8d9-091c-4d19-8e3c-03200bfdfb0a","resolution":{"observed_at":"2026-08-16T05:12:22.839304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.819576Z","title":"E., E VERHART , K., S TEVENS , R., B ABBITT III, N., C LEMENS , P., AND STOUT, L","venue":null,"work_id":"dc0c558f-17e8-4830-b9f3-c14801c96c6b","year":1994},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.384978Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:76a6a508670f7aeb68adf85503f53d041430ea14ffdbc810c39c2f585f4d5085","observation_id":"015ce890-e18d-4f7d-80b0-46f545b2df2d","resolution":{"observed_at":"2026-08-16T05:12:22.824219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.804692Z","title":"A path-planning approach based on potential and dynamic q-learning for mobile robots in unknown environment","venue":null,"work_id":"9fc1c1f9-33ea-4ff3-bfc5-8cdca323fbc0","year":2022},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.392036Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:ba14d904866c6ec781828b3722a86bc94da541b3817025ff548d763b78f76a3b","observation_id":"1232038e-2114-4af4-8f7c-d3236b5b9a26","resolution":{"observed_at":"2026-08-16T05:12:22.809642Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00515","last_updated":"2024-11-10T22:02:27Z","snapshot_observed_at":"2026-08-14T16:40:35.729198Z","submitted_at":"2024-06-01T17:48:15Z","title":"A Survey on Large Language Models for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00515","snapshot_observed_at":"2026-08-16T05:12:22.398478Z","title":"A survey on large language models for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.398478Z"},"links":{"cited_paper":"/paper/2406.00515","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:fa4668eb0ba5434a11bb38f35ec97d948586097990ed92b2501622847eefdfa5","observation_id":"d43cde4c-de35-4d90-a46f-5dd705b17557","resolution":{"observed_at":"2026-08-16T05:12:22.398478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06770","last_updated":"2024-11-11T23:05:04Z","snapshot_observed_at":"2026-08-18T08:11:45.716032Z","submitted_at":"2023-10-10T16:47:29Z","title":"SWE-bench: Can Language Models Resolve Real-World GitHub Issues?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06770","snapshot_observed_at":"2026-08-16T05:12:22.404458Z","title":"E., Y ANG , J., W ETTIG , A., Y AO, S., P EI, K., P RESS , O., AND NARASIMHAN , K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.404458Z"},"links":{"cited_paper":"/paper/2310.06770","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:dfa59a6e2808f80042791e2861d336005ba3c2d32f46087608124326860ac467","observation_id":"4d9efac8-bddf-4f25-8dec-e8c105544e38","resolution":{"observed_at":"2026-08-16T05:12:22.404458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.14157","last_updated":"2022-07-25T20:44:40Z","snapshot_observed_at":"2026-08-18T19:05:42.965327Z","submitted_at":"2022-07-25T20:44:40Z","title":"A Hazard Analysis Framework for Code Synthesis Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.14157","snapshot_observed_at":"2026-08-16T05:12:22.411700Z","title":"A hazard analysis framework for code synthesis large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.411700Z"},"links":{"cited_paper":"/paper/2207.14157","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:b3d16e539bc5121f873c3daec86a4dc681b3654da3d2898712a29c2f40ee64f9","observation_id":"1cb357bb-49a5-429e-9a0a-311420df8e0f","resolution":{"observed_at":"2026-08-16T05:12:22.411700Z","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-16T05:12:22.789698Z","title":null,"venue":null,"work_id":"2a2c9b9f-0d51-4fa3-924f-18ff887f27f5","year":1998},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.418313Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:123a270c41895af54fd5476d791a59b4a51e8687d8ced7fdb0b14d9d040043f1","observation_id":"8eb08601-3781-4b8f-bf35-22678bbb65af","resolution":{"observed_at":"2026-08-16T05:12:22.794139Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.772278Z","title":"M., AND KUFFNER JR, J","venue":null,"work_id":"71054fe5-e5bc-4179-b7e5-1743d22564cb","year":2001},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.423831Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:2be180bf2ef6e4480301b9fee4835a140d732faff9f9278e1e6f02f2865eb530","observation_id":"db5499d1-4f11-42ff-b6f8-412244b450e9","resolution":{"observed_at":"2026-08-16T05:12:22.777610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.430192Z","title":"Exploring and evaluating hallucinations in llm-powered code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.430192Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:0ceb0f2b4e90aab09ee218ad0de005a4004ab72ee8e772fd29708012b54dfd28","observation_id":"4ec9f20a-52d9-46af-a0bb-a23c9851a0fa","resolution":{"observed_at":"2026-08-16T05:12:22.430192Z","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-16T05:12:22.756228Z","title":"M., Z I, Y., G UHA , A., A NDERSON , C","venue":null,"work_id":"b7c1b329-8d17-4116-a5bb-aff636f62675","year":2024},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.438604Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:415197dc98291931b699de806dd0fba9f5a0338745ed0e4801fab77f9d73e135","observation_id":"fefd5bd8-abc6-481d-828b-6f689cd3f679","resolution":{"observed_at":"2026-08-16T05:12:22.760641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.740420Z","title":"M., H ARMAN , M., AND WANG , M","venue":null,"work_id":"d2f99e2d-79c1-44d8-9e96-4b069a8045e1","year":2023},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.444827Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:23b11379daf462c1b0aadba9a863343e53b3abf43450e211ee5f49bc059d10a2","observation_id":"4ffcd3d2-b868-4e1d-a5ee-050df8a37ea0","resolution":{"observed_at":"2026-08-16T05:12:22.745295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15324","last_updated":"2023-09-22T18:48:42Z","snapshot_observed_at":"2026-08-18T23:10:44.101812Z","submitted_at":"2023-05-24T16:38:43Z","title":"Model evaluation for extreme risks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15324","snapshot_observed_at":"2026-08-16T05:12:22.450409Z","title":"Model evaluation for extreme risks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.450409Z"},"links":{"cited_paper":"/paper/2305.15324","citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:e164f28583aa9553401e9767fcf020f73d368f480fdb9670abcccba01c80f5fc","observation_id":"206158ca-e75c-452e-ac5c-8386ca56610e","resolution":{"observed_at":"2026-08-16T05:12:22.450409Z","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-16T05:12:22.724501Z","title":"C., AND ANTONIOL , G","venue":null,"work_id":"19b0259b-6f88-43dc-8f88-0774d29f1ddd","year":2025},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.456213Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:bf95c30bc04b2b3cf0862b0b20f06f9ec6c5ad53890a5391d79184980165042d","observation_id":"b0059841-e56c-425d-917e-abd78558b78c","resolution":{"observed_at":"2026-08-16T05:12:22.729405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.709413Z","title":"M., AND RASHID , M","venue":null,"work_id":"2316ee47-c4c7-4047-a536-86a3014c12a5","year":2022},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.461589Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:bf4b3fe15c3b9f352db93a0579e3e42017e0c6f972c4737e1dc8f57d627851aa","observation_id":"0e15a59c-de3c-416c-9721-40b16a5e1f8d","resolution":{"observed_at":"2026-08-16T05:12:22.713744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-16T05:12:22.692190Z","title":"Balanced","venue":null,"work_id":"a0c5f96e-6561-48ce-8097-d95d3dc58163","year":2023},"citing_paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:12:22.465488Z"},"links":{"citing_paper":"/paper/2504.21276"},"observation_digest":"sha256:c4a8fc4a3000c2b1ffb9d127b53a65753b48ae0afe0404c4c888875e052cdbc1","observation_id":"017efc12-c29d-4bed-8487-3deac8003198","resolution":{"observed_at":"2026-08-16T05:12:22.697705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.21276","last_updated":"2025-04-30T03:11:54Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-20T00:36:04.082780Z","submitted_at":"2025-04-30T03:11:54Z","title":"Assessing LLM code generation quality through path planning tasks"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":23},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2504.21276."}