{"as_of":"2026-08-07T08:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0510e9885c1aac14ee271699fed2b2ade0099d23933bf5089c7feabd94013bc5","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":16,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:45:53.376594Z","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-02T15:27:06.057125Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-05-10T17:34:42.565806Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2403.07974"},"observation_digest":"sha256:08ffba29f69a28cd0a96616f4bd6a490c0d2dd42df36b366707745099b76f781","observation_id":"88d61122-3e14-43e5-a49f-f00af6986c17","resolution":{"observed_at":"2026-05-10T17:34:43.028255Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-06T20:45:53.376594Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.02057","last_updated":"2025-07-02T18:00:49Z","snapshot_observed_at":"2026-08-06T20:36:51.169138Z","submitted_at":"2025-07-02T18:00:49Z","title":"MGC: A Compiler Framework Exploiting Compositional Blindness in Aligned LLMs for Malware Generation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T20:45:53.376594Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2507.02057"},"observation_digest":"sha256:c4f5744eee3cbc0986823b45fa6b7464452d226514e52dad435c5a3f670dbbb9","observation_id":"bf01b3ea-3b6f-49b1-b42a-e7343e402e18","resolution":{"observed_at":"2026-08-06T20:45:53.376594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-06T17:41:43.727541Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.10182","last_updated":"2025-07-14T11:44:04Z","snapshot_observed_at":"2026-08-06T17:35:11.816357Z","submitted_at":"2025-07-14T11:44:04Z","title":"Breaking the Myth: Can Small Models Infer Postconditions Too?","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-06T17:41:43.727541Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2507.10182"},"observation_digest":"sha256:4baafe0084e7ef421baef0ec8aa7514a9db7edb93c303c61630224a41d0377f9","observation_id":"315e0a0a-d7ef-4091-bd05-5f507d35b534","resolution":{"observed_at":"2026-08-06T17:41:43.727541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-06T16:09:06.934747Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.14419","last_updated":"2025-07-19T00:28:10Z","snapshot_observed_at":"2026-08-06T15:54:27.723680Z","submitted_at":"2025-07-19T00:28:10Z","title":"It's Not That Simple. An Analysis of Simple Test-Time Scaling","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T16:09:06.934747Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2507.14419"},"observation_digest":"sha256:1050fd2e3fb3775745c5ac9c5cb263339976e493428f110c533e27f4d71db241","observation_id":"bbdf5ee1-a7e9-4875-926d-c0dd4acb0659","resolution":{"observed_at":"2026-08-06T16:09:06.934747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-06T14:17:34.208822Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.19598","last_updated":"2025-07-25T18:11:10Z","snapshot_observed_at":"2026-08-06T14:36:53.214750Z","submitted_at":"2025-07-25T18:11:10Z","title":"MOCHA: Are Code Language Models Robust Against Multi-Turn Malicious Coding Prompts?","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T14:17:34.208822Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2507.19598"},"observation_digest":"sha256:7bd27305c0f6b05ecda9e8484af57bc99a0efde4e11a969367af42acf19ff92d","observation_id":"3290d4ab-23ea-4fea-bacf-ac6cc6ab5f09","resolution":{"observed_at":"2026-08-06T14:17:34.208822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-05T14:29:26.568182Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21294","last_updated":"2025-08-29T01:23:28Z","snapshot_observed_at":"2026-08-06T11:56:50.801115Z","submitted_at":"2025-08-29T01:23:28Z","title":"BLUEX Revisited: Enhancing Benchmark Coverage with Automatic Captioning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T14:29:26.568182Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2508.21294"},"observation_digest":"sha256:8ff6e0507cce50e3bff84635e4eae008c6cfeb84e36ff4c3ff07713d43412929","observation_id":"ee31c22d-fae6-4f86-91b1-7438f039009d","resolution":{"observed_at":"2026-08-05T14:29:26.568182Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2510.14703","last_updated":"2026-04-28T18:17:43Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-10-16T14:06:03Z","title":"ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-18T06:30:39.858246Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2510.14703"},"observation_digest":"sha256:dd456ba663efa81af270eeb605de27ba6b10b3816353b3fbf80b37997b7d59f4","observation_id":"e001f309-f4d6-41ee-8021-b8e119e89a4b","resolution":{"observed_at":"2026-05-18T06:30:59.583413Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-03T23:05:54.598627Z","title":"Planning with large language models for code generation.arXiv preprint arXiv:2303.05510,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.08307","last_updated":"2026-06-27T15:13:24Z","snapshot_observed_at":"2026-08-07T06:08:08.436143Z","submitted_at":"2025-11-11T14:37:05Z","title":"Concentration bounds on response-based vector embeddings of black-box generative models","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T23:05:54.598627Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2511.08307"},"observation_digest":"sha256:9b92b6b1cb31742951cedc12dcb7e80e5a39e993b54642e7b606a95ca41e7677","observation_id":"25b8fa40-a5a2-40f6-9391-3e07277ee9da","resolution":{"observed_at":"2026-08-03T23:05:54.598627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-02T20:07:14.885883Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.24108","last_updated":"2026-07-14T02:27:48Z","snapshot_observed_at":"2026-08-06T11:39:06.489239Z","submitted_at":"2026-02-27T15:47:37Z","title":"LogiDroid: Individual Functional Test Generation via Business Logic Extraction and Adaptation","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T20:07:14.885883Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2602.24108"},"observation_digest":"sha256:29dd7eaa4587d8d37db569a18d96ae9f8f24f2bbeff016254fa390827b833367","observation_id":"419d005a-2df9-472e-b2b9-bea050c57dc7","resolution":{"observed_at":"2026-08-02T20:07:14.885883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2604.10449","last_updated":"2026-04-12T04:15:31Z","snapshot_observed_at":"2026-07-06T22:59:05.519456Z","submitted_at":"2026-04-12T04:15:31Z","title":"AdverMCTS: Combating Pseudo-Correctness in Code Generation via Adversarial Monte Carlo Tree Search","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-05-10T16:35:16.056397Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2604.10449"},"observation_digest":"sha256:9b4298b4dab592ff1d0df8c7b92dc5cede93ccb15cbb9939c7795ce4eb6aca2c","observation_id":"ee7fbfed-afad-44b8-9522-ea5202a331fc","resolution":{"observed_at":"2026-05-11T08:40:57.536889Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2604.16198","last_updated":"2026-04-17T16:08:05Z","snapshot_observed_at":"2026-07-06T23:03:34.795570Z","submitted_at":"2026-04-17T16:08:05Z","title":"Bridging the Gap between User Intent and LLM: A Requirement Alignment Approach for Code Generation","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-10T08:13:43.804756Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2604.16198"},"observation_digest":"sha256:5f00a32c42e29e4f4d926721aede7a388efe9e0a2d6aac7f251b8b53382235a9","observation_id":"4e6da0e5-8c2b-4cff-b4aa-a2e04cbe7176","resolution":{"observed_at":"2026-05-10T08:17:37.635236Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2604.18907","last_updated":"2026-04-20T23:14:48Z","snapshot_observed_at":"2026-08-02T07:41:12.503888Z","submitted_at":"2026-04-20T23:14:48Z","title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-05-10T04:29:33.858344Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2604.18907"},"observation_digest":"sha256:ca902e8793d3ba1d200e6fa91c522fdfceeb1943b565b1fb557e641926e00805","observation_id":"e5906daa-29c8-4d12-be27-690c7ba9c88f","resolution":{"observed_at":"2026-05-11T11:56:08.276528Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2604.24621","last_updated":"2026-04-27T15:51:22Z","snapshot_observed_at":"2026-07-06T23:10:38.548416Z","submitted_at":"2026-04-27T15:51:22Z","title":"Evaluation of LLM-Based Software Engineering Tools: Practices, Challenges, and Future Directions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-08T02:52:55.120013Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2604.24621"},"observation_digest":"sha256:a67b6cee0c668863fe2bbdbe1c02b4d0e86b3ee6ed3bd7fbb0f0ac822de844fd","observation_id":"89eb1cb7-b2ea-4682-beac-454cdb4b8f23","resolution":{"observed_at":"2026-05-11T22:21:53.020009Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2605.03356","last_updated":"2026-05-05T04:29:38Z","snapshot_observed_at":"2026-08-06T23:24:38.436110Z","submitted_at":"2026-05-05T04:29:38Z","title":"POSTCONDBENCH: Benchmarking Correctness and Completeness in Formal Postcondition Inference","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-07T16:04:48.394294Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2605.03356"},"observation_digest":"sha256:077b5ce0afc59c6d6da3c38d65562da7154240ff67d4ee2fd84e59e59d8fc528","observation_id":"60b85cac-c470-42a2-8d5b-9fe2c1b20dac","resolution":{"observed_at":"2026-05-11T23:56:12.225239Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":"2303.05510","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-07-02T15:27:06.057125Z","title":"arXiv preprint arXiv:2303.05510 , year=","venue":null,"work_id":"57fbbeda-95db-4e3d-aeaa-542766e51730","year":2024},"citing_paper":{"arxiv_id":"2606.05933","last_updated":"2026-06-04T09:36:40Z","snapshot_observed_at":"2026-07-06T23:45:51.910263Z","submitted_at":"2026-06-04T09:36:40Z","title":"Beyond Greedy Chunking: SLO-Aware Sliding-Window Scheduling for LLM Inference","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T23:49:28.318260Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2606.05933"},"observation_digest":"sha256:ad99a350efcf5324e1334b793183f9b8072fe031ea66d2029184e765d1854ff7","observation_id":"a246ac53-96b3-4705-9a7c-09e3a5f28f6c","resolution":{"observed_at":"2026-07-02T15:27:06.058795Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.05510","snapshot_observed_at":"2026-08-05T18:51:31.240272Z","title":"Limitations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.03461","last_updated":"2026-08-04T10:57:31Z","snapshot_observed_at":"2026-08-07T07:37:29.234743Z","submitted_at":"2026-08-04T10:57:31Z","title":"Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T18:51:31.240272Z"},"links":{"cited_paper":"/paper/2303.05510","citing_paper":"/paper/2608.03461"},"observation_digest":"sha256:f28da39b17468eae8395c996eb4731f5ed4a55434bffadcc3e179d4223872dea","observation_id":"34c9818c-a02b-4a85-975d-a0df969a136d","resolution":{"observed_at":"2026-08-05T18:51:31.240272Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2303.05510/citation-record","integrity":"/paper/2303.05510/integrity","json":"/paper/2303.05510/citation-record.json","paper":"/paper/2303.05510"},"outbound":[],"paper":{"arxiv_id":"2303.05510","last_updated":"2023-03-09T18:59:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T15:00:58.804337Z","submitted_at":"2023-03-09T18:59:47Z","title":"Planning with Large Language Models for Code Generation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 16 inbound Pith citation observations for arXiv:2303.05510."}