{"as_of":"2026-08-10T18:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f6ec1d6f2cb2402435512858b19ea18ca3855016e9f7e395d47300f7d1443bd","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T22:09:46.562592Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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-05-20T10:54:54.558241Z","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-20T10:58:14.539642Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"cited_work":{"arxiv_id":"2508.07434","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.07434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Let’s revise step-by-step: A unified local search framework for code generation with llms","venue":null,"work_id":"72ad2290-b33d-4a28-a066-e4bfbc875ac8","year":2025},"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":36,"source":"arxiv_source","source_observed_at":"2026-05-10T16:35:16.056397Z"},"links":{"cited_paper":"/paper/2508.07434","citing_paper":"/paper/2604.10449"},"observation_digest":"sha256:d0fb282885d528082fc3642190300f0ef9e0e3b001f297c902b66282d6378025","observation_id":"12c0d974-183c-4e46-8a98-88d9002d58cf","resolution":{"observed_at":"2026-05-11T08:40:57.630376Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"cited_work":{"arxiv_id":"2508.07434","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.07434","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Let’s revise step-by-step: A unified local search framework for code generation with llms","venue":null,"work_id":"72ad2290-b33d-4a28-a066-e4bfbc875ac8","year":2025},"citing_paper":{"arxiv_id":"2605.18747","last_updated":"2026-05-18T17:59:03Z","snapshot_observed_at":"2026-07-06T23:29:33.702647Z","submitted_at":"2026-05-18T17:59:03Z","title":"Code as Agent Harness","version":1},"reference_index":164,"source":"pdf_text","source_observed_at":"2026-05-20T10:54:54.558241Z"},"links":{"cited_paper":"/paper/2508.07434","citing_paper":"/paper/2605.18747"},"observation_digest":"sha256:723e8241bc94f6025efe3495bd1c819a5541b7e0463a324a16b3412bec5a2c44","observation_id":"8f8f53c8-5c95-48a3-bea3-182e33473d17","resolution":{"observed_at":"2026-05-20T10:58:14.541307Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.07434/citation-record","integrity":"/paper/2508.07434/integrity","json":"/paper/2508.07434/citation-record.json","paper":"/paper/2508.07434"},"outbound":[{"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-05T22:09:46.286452Z","title":"GPT -4 technical report","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.286452Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:df3031b8c51319ca855bae400ccff877a90d8e706c0deea610fd48b5034b0111","observation_id":"7dba50c2-338e-44cc-9bb5-6b51c1d6ef0d","resolution":{"observed_at":"2026-08-05T22:09:46.286452Z","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-05T22:09:47.595623Z","title":"Openhands: A n open platform for AI software developers as generalist agents","venue":null,"work_id":"daa6a69f-8b1d-4386-baa9-7de16cbbc8ca","year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.292600Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:46e17960ce6634a72ff5c511d977f159428f1ba962fa272ce9699509f5faa469","observation_id":"729300db-ddd9-4184-b728-4c91f06656b7","resolution":{"observed_at":"2026-08-05T22:09:47.600601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:46.297501Z","title":"Evaluating large language models trained on code","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.297501Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:50cc591c9340d5bb1ad754069d526334cfe1ee75eb9549e5760ba4d7b1186a2d","observation_id":"e3438dd7-8c5c-4195-b451-3770da16f3a9","resolution":{"observed_at":"2026-08-05T22:09:46.297501Z","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-05T22:09:46.302831Z","title":"Program synthesis with large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.302831Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:abae16fd9a9a2c9e2fc8929f2410d0136d8b9f960538c872cc0fbf9e622333fe","observation_id":"f6b919bd-77b7-47bb-8b7c-d14029700ffc","resolution":{"observed_at":"2026-08-05T22:09:46.302831Z","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-05T22:09:47.580609Z","title":"Less training, more repairing please: R evisiting automated program repair via zero-shot learning","venue":null,"work_id":"33926c39-f48d-4b32-b605-ad09b16ac647","year":2022},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.308698Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:29d429ea1ed8cb3cd112c8ed1efe8683c9af0c0ab8241a7d8ed10593f676eefe","observation_id":"554356cd-3e6a-4c0d-919d-823fd2713447","resolution":{"observed_at":"2026-08-05T22:09:47.585761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.566020Z","title":"Impact of code language models on automated program repair","venue":null,"work_id":"fdba4853-ec43-462d-aa37-b24a4b84eb9e","year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.313638Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:4b7fab790cd394df4209f436f52ecca0909b6d7d2fee1bd74218546d3e3b2ab1","observation_id":"9f9654c3-e677-4bf9-8f1c-4840ff8fa351","resolution":{"observed_at":"2026-08-05T22:09:47.570788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.548893Z","title":"Inferfix: E nd-to-end program repair with LLM s","venue":null,"work_id":"71220701-7922-42b3-9f07-59ee2d242a94","year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.318947Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:f5278f64b746b5548a10705210897baf3346d83829b452cb7f9998239c4d660f","observation_id":"c5b26618-624b-4c73-ae40-6c4b57213be5","resolution":{"observed_at":"2026-08-05T22:09:47.554432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07867","last_updated":"2024-04-26T16:41:55Z","snapshot_observed_at":"2026-08-09T00:08:03.125473Z","submitted_at":"2023-02-15T18:59:21Z","title":"Learning Performance-Improving Code Edits","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.07867","snapshot_observed_at":"2026-08-05T22:09:46.323775Z","title":"Learning performance-improving code edits","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.323775Z"},"links":{"cited_paper":"/paper/2302.07867","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:06d3701bbdbd4497175b04b32bb87e63cd04533fe52b62f1dfed1c7e97211af9","observation_id":"635cfb79-3d2c-41ee-b627-7c3768874d3d","resolution":{"observed_at":"2026-08-05T22:09:46.323775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07062","last_updated":"2023-09-11T22:11:46Z","snapshot_observed_at":"2026-08-08T22:17:08.501147Z","submitted_at":"2023-09-11T22:11:46Z","title":"Large Language Models for Compiler Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07062","snapshot_observed_at":"2026-08-05T22:09:46.328597Z","title":"Large language models for compiler optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.328597Z"},"links":{"cited_paper":"/paper/2309.07062","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:4ffe53adf6e45f0c0628170985765a97048c94f8edc29df2491b3a0dd2509cb2","observation_id":"fc33c1c9-2b9f-4797-978a-b6af6ad0a5bc","resolution":{"observed_at":"2026-08-05T22:09:46.328597Z","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-05T22:09:47.532171Z","title":"Tree of thoughts: D eliberate problem solving with large language models","venue":null,"work_id":"cabd03d2-9e39-4278-8340-69ebd97f37fe","year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.334298Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:36d00495bd7a02d951ac65601455ab67438224dd6670e1b844875b3cd0905fc9","observation_id":"f63cd078-23f0-47d5-ae2b-bc77dcebcd72","resolution":{"observed_at":"2026-08-05T22:09:47.536801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-05T22:09:46.338954Z","title":"Scaling LLM test-time compute optimally can be more effective than scaling model parameters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.338954Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:4a76ef14374dc40afe7f51f1fbae44a2d7a37be923ea699e15f22bc12f44be84","observation_id":"be11a8e5-52af-49c7-8aa1-0af6b1c0f252","resolution":{"observed_at":"2026-08-05T22:09:46.338954Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17179","last_updated":"2024-02-09T00:13:46Z","snapshot_observed_at":"2026-07-06T16:25:25.534843Z","submitted_at":"2023-09-29T12:20:19Z","title":"Alphazero-like Tree-Search can Guide Large Language Model Decoding and Training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17179","snapshot_observed_at":"2026-08-05T22:09:46.343818Z","title":"Alphazero-like tree-search can guide large language model decoding and training","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.343818Z"},"links":{"cited_paper":"/paper/2309.17179","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:0c6ff0d02702220dde485265656e7d117489699ee864369353105fb1569d2135","observation_id":"84845823-462d-4b71-adb7-056d11f47575","resolution":{"observed_at":"2026-08-05T22:09:46.343818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14283","last_updated":"2024-07-22T10:01:49Z","snapshot_observed_at":"2026-08-09T13:14:49.508020Z","submitted_at":"2024-06-20T13:08:09Z","title":"Q*: Improving Multi-step Reasoning for LLMs with Deliberative Planning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14283","snapshot_observed_at":"2026-08-05T22:09:46.348559Z","title":"Q*: I mproving multi-step reasoning for LLM s with deliberative planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.348559Z"},"links":{"cited_paper":"/paper/2406.14283","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:ef4d0e259abcee74f97d5a45516c84f6f3e19ab695258692b518c4ec9440b36f","observation_id":"22076380-86b1-435c-9ce2-0aebe7c31ed4","resolution":{"observed_at":"2026-08-05T22:09:46.348559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08935","last_updated":"2024-02-19T14:07:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-14T13:41:54Z","title":"Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotations","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.08935","snapshot_observed_at":"2026-08-05T22:09:46.354061Z","title":"Math-shepherd: V erify and reinforce LLM s step-by-step without human annotations","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.354061Z"},"links":{"cited_paper":"/paper/2312.08935","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:9b1a0e33985bbf49138cd8a49718801df6b2ed4ce12704bc58825cdc470bd562","observation_id":"f62a5e84-cd25-49b3-838a-0db214bd6c67","resolution":{"observed_at":"2026-08-05T22:09:46.354061Z","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-05T22:09:47.517348Z","title":"Let's verify step by step","venue":null,"work_id":"3f38e50e-3d31-41a5-bad0-2b7f45832fe4","year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.358809Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:ba3b89492765d0c8ef4ef4d87b0466f0964f6f737badc7c23513ef45c2022ec3","observation_id":"fadd8d32-6e73-48cb-84c1-7b9dd454e1ff","resolution":{"observed_at":"2026-08-05T22:09:47.522088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.502213Z","title":"Using anytime algorithms in intelligent systems","venue":null,"work_id":"08d5fd84-f9d3-47d5-94d0-3016702a3794","year":1996},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.363199Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:0e4f9323f1736b9d3c5688fd4d9464a23e52dcb515be3cc2f7b644dc5d8a69a8","observation_id":"e5f8e6a8-aeb2-460a-8468-f03655f8a426","resolution":{"observed_at":"2026-08-05T22:09:47.507122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04329","last_updated":"2024-11-12T19:37:20Z","snapshot_observed_at":"2026-08-02T04:28:22.816405Z","submitted_at":"2024-11-07T00:09:54Z","title":"CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04329","snapshot_observed_at":"2026-08-05T22:09:46.368200Z","title":"Codetree: A gent-guided tree search for code generation with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.368200Z"},"links":{"cited_paper":"/paper/2411.04329","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:6cba90e60c3b32ff295b30045c66d3c61b1b314214179d93f0f92baaeaeaf7cd","observation_id":"e4b4d4fd-d855-419b-bcc6-841a31dfd9b1","resolution":{"observed_at":"2026-08-05T22:09:46.368200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05010","last_updated":"2025-02-25T03:17:46Z","snapshot_observed_at":"2026-07-06T19:46:54.707852Z","submitted_at":"2024-10-22T01:58:29Z","title":"Scattered Forest Search: Smarter Code Space Exploration with LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05010","snapshot_observed_at":"2026-08-05T22:09:46.374893Z","title":"Scattered forest search: S marter code space exploration with LLM s","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.374893Z"},"links":{"cited_paper":"/paper/2411.05010","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:32f28958d51c5713ed739487cc9fd163dd7131c491f7751559ed52e0b1dbd410","observation_id":"128fcbf7-3888-40bf-bb96-8ca28f1c4ab4","resolution":{"observed_at":"2026-08-05T22:09:46.374893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08105","last_updated":"2025-04-07T21:05:50Z","snapshot_observed_at":"2026-07-06T19:31:18.802964Z","submitted_at":"2024-10-10T16:53:10Z","title":"What Makes Large Language Models Reason in (Multi-Turn) Code Generation?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08105","snapshot_observed_at":"2026-08-05T22:09:46.379986Z","title":"What makes large language models reason in (multi-turn) code generation? arXiv preprint arXiv:2410.08105, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.379986Z"},"links":{"cited_paper":"/paper/2410.08105","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:56811ee994b9197c1e0b8e56c47c720dfad4e12df7ec320e41cb21387135c035","observation_id":"3e7c7666-4e82-4b45-b29b-0b4165eb7439","resolution":{"observed_at":"2026-08-05T22:09:46.379986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01489","last_updated":"2024-10-29T17:29:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-01T17:24:45Z","title":"Agentless: Demystifying LLM-based Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01489","snapshot_observed_at":"2026-08-05T22:09:46.385268Z","title":"Agentless: D emystifying LLM -based software engineering agents","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.385268Z"},"links":{"cited_paper":"/paper/2407.01489","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:f76eccd3215eef91ab9b1fa54959bc168c1b360538403f5e72132a70347f98e5","observation_id":"0b6471bc-d9c8-464b-8914-7f4d1d361cde","resolution":{"observed_at":"2026-08-05T22:09:46.385268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.09896","last_updated":"2024-02-02T18:31:34Z","snapshot_observed_at":"2026-08-06T10:06:10.773161Z","submitted_at":"2023-06-16T15:13:17Z","title":"Is Self-Repair a Silver Bullet for Code Generation?","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.09896","snapshot_observed_at":"2026-08-05T22:09:46.390474Z","title":"Is self-repair a silver bullet for code generation? arXiv preprint arXiv:2306.09896, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.390474Z"},"links":{"cited_paper":"/paper/2306.09896","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:eb68f4f1c3539c531dd459eafcb0ef89726ef50c26ae9967f970eddb5aa0ae4b","observation_id":"70354d8b-f5e8-4b42-97b8-6ff12d4096fc","resolution":{"observed_at":"2026-08-05T22:09:46.390474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09267","last_updated":"2024-06-11T12:22:14Z","snapshot_observed_at":"2026-08-06T13:05:16.904399Z","submitted_at":"2024-02-14T15:52:42Z","title":"Self-Alignment for Factuality: Mitigating Hallucinations in LLMs via Self-Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09267","snapshot_observed_at":"2026-08-05T22:09:46.395536Z","title":"Self-alignment for factuality: M itigating hallucinations in LLM s via self-evaluation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.395536Z"},"links":{"cited_paper":"/paper/2402.09267","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:a194df091bc5cd2a8caa226d443b3d462c7912838cfdf834211f8864859c2f32","observation_id":"1daf6d9f-f489-4564-8362-245540113197","resolution":{"observed_at":"2026-08-05T22:09:46.395536Z","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-05T22:09:46.399883Z","title":"RethinkMCTS : R efining erroneous thoughts in monte carlo tree search for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.399883Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:0cf5d3799e74beadfb88192a2b09478ca2fe38d7ed6bc1540141beb99917490b","observation_id":"01558576-367b-4284-b271-d980d69ad7ce","resolution":{"observed_at":"2026-08-05T22:09:46.399883Z","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-05T22:09:47.487864Z","title":"Artificial Intelligence: A Modern Approach","venue":null,"work_id":"647ae34c-f8a9-462d-ae13-bbb774893a88","year":2016},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.404189Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:59aa91896f34dc997f79b4c90fae0cf3a2ab9a92438edf63707ce2db2390ccc1","observation_id":"248089c0-3e20-41c5-bb02-5032ab573b68","resolution":{"observed_at":"2026-08-05T22:09:47.492911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.473578Z","title":"An Introduction to Genetic Algorithms","venue":null,"work_id":"9805e696-8fc1-42a5-93cf-4a7098cce34b","year":1998},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.409159Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:7c445ab9a46486195073aaeecbc2a73dbc4080ef2a48bcb207e2c3dd984b8095","observation_id":"2a838034-9db4-4ed8-94e3-4f0691c0f2a4","resolution":{"observed_at":"2026-08-05T22:09:47.478002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:46.413705Z","title":"Rank analysis of incomplete block designs: I","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.413705Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:edacefe442326d9249f6e242cf20da39beb2f315b670a866a5403e3c6c5aa2d7","observation_id":"dd839d15-b014-4c9d-8050-9a0b7585881e","resolution":{"observed_at":"2026-08-05T22:09:46.413705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-10T03:07:35.408836Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-05T22:09:46.418362Z","title":"Livecodebench: H olistic and contamination free evaluation of large language models for code","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.418362Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:8996d81cc19a799e6383779d0307f2662e3ad5dc5c18c65719b7eeea31e01526","observation_id":"21f0e52b-0251-4d10-9b74-16b4ff93ed32","resolution":{"observed_at":"2026-08-05T22:09:46.418362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14852","last_updated":"2023-12-27T10:09:18Z","snapshot_observed_at":"2026-07-06T17:07:14.412645Z","submitted_at":"2023-12-22T17:25:42Z","title":"TACO: Topics in Algorithmic COde generation dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14852","snapshot_observed_at":"2026-08-05T22:09:46.423661Z","title":"TACO : T opics in algorithmic code generation dataset","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.423661Z"},"links":{"cited_paper":"/paper/2312.14852","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:1d61708869f74fd1c03242bef6c7927ed885028ceb33195cd766cb71bb5f9f27","observation_id":"a1db59e0-b932-48fc-bd81-c713a38520f9","resolution":{"observed_at":"2026-08-05T22:09:46.423661Z","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-05T22:09:47.448566Z","title":"General local search methods","venue":null,"work_id":"683344cb-82d9-4e9a-ac4d-90a50b1cc58d","year":1996},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.428572Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:d9838f9cfe8e33ffa9aa6e60d9dc1637efb629589c413fb364acc6477d943186","observation_id":"4375161a-494f-499c-87c4-02c9b7d1c412","resolution":{"observed_at":"2026-08-05T22:09:47.453737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.06957","last_updated":"2025-06-07T02:45:11Z","snapshot_observed_at":"2026-07-06T19:13:33.255300Z","submitted_at":"2024-09-11T02:40:38Z","title":"Policy Filtration for RLHF to Mitigate Noise in Reward Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.06957","snapshot_observed_at":"2026-08-05T22:09:46.433018Z","title":"Policy filtration in rlhf to fine-tune llm for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.433018Z"},"links":{"cited_paper":"/paper/2409.06957","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:4a97a047c8129315669d20c4540c2150108f8d8af0b662f79290687390c0c699","observation_id":"ba761c82-2742-4e55-9535-f21adb5bad26","resolution":{"observed_at":"2026-08-05T22:09:46.433018Z","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-05T22:09:47.430855Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":"50f89e44-f97a-41ef-87d9-3252f3b43549","year":2022},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.438795Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:411bf5e53a225871346a7131f5dfa2e0f7b3193bc2ebd177fb6efca044d85d6b","observation_id":"f86c948d-a7f0-485a-b715-10f5f230b717","resolution":{"observed_at":"2026-08-05T22:09:47.437800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.414277Z","title":"Iterated local search: F ramework and applications","venue":null,"work_id":"381129c8-75a4-4bfa-9a17-ba0ddefe50d0","year":2018},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.443559Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:3637d21d74116e6d438b4d62d69c8190562227de84dbc4824491271c603e0f64","observation_id":"7b5312fa-4c6c-4e8f-a20a-7d63bfcb1dc7","resolution":{"observed_at":"2026-08-05T22:09:47.418912Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.398431Z","title":"Course of Theoretical Physics","venue":null,"work_id":"d30a019f-693f-416c-b130-e478ab344094","year":2013},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.448843Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:d6ad3f0a90ca65860d2583c856541a89d31f4c43db326cfb50e35fa7737104b2","observation_id":"06ce58c5-aa98-4c66-b303-560a7be1d3fd","resolution":{"observed_at":"2026-08-05T22:09:47.403877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-05T22:09:47.383140Z","title":"Simulated annealing: F rom basics to applications","venue":null,"work_id":"03654702-9676-4be5-bd4c-a9711172c862","year":2018},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.453733Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:d8a5019416ce1ba983290cb6865d7868b62c932ee4961ffb4fc1f392443f8984","observation_id":"c8d8a287-7cff-4ed2-af20-ea17be86bce0","resolution":{"observed_at":"2026-08-05T22:09:47.387834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.09938","last_updated":"2021-11-08T21:16:44Z","snapshot_observed_at":"2026-08-04T23:13:25.514661Z","submitted_at":"2021-05-20T17:58:42Z","title":"Measuring Coding Challenge Competence With APPS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.09938","snapshot_observed_at":"2026-08-05T22:09:46.458405Z","title":"Measuring coding challenge competence with APPS","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.458405Z"},"links":{"cited_paper":"/paper/2105.09938","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:8b30ceab4b1192c0ee0e6b4df8edd67ec84ea78eb0f141762a67fb6bd7181446","observation_id":"9cd941a5-7c51-4a54-af53-688159c04ad6","resolution":{"observed_at":"2026-08-05T22:09:46.458405Z","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-05T22:09:47.366466Z","title":"TRL : Transformer reinforcement learning","venue":null,"work_id":"7251ec57-0174-4011-89d1-57195020e6b3","year":2020},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.462996Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:9e3176634e0f2a8a687282609a2a58b3659f594f48ce7dd32fe17424c27729fa","observation_id":"fed6ee51-7eb3-48cf-bb47-566e73e7e7c9","resolution":{"observed_at":"2026-08-05T22:09:47.371354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14992","last_updated":"2023-10-23T07:24:28Z","snapshot_observed_at":"2026-07-06T15:32:25.931739Z","submitted_at":"2023-05-24T10:28:28Z","title":"Reasoning with Language Model is Planning with World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14992","snapshot_observed_at":"2026-08-05T22:09:46.467293Z","title":"Reasoning with language model is planning with world model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.467293Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:ace914064efb10b14ccb30c492ccd584475c291e9ef96347cc48ef14a4630a47","observation_id":"9e24064b-a19d-4e79-95ad-59d55fbcdff4","resolution":{"observed_at":"2026-08-05T22:09:46.467293Z","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-05T22:09:47.349565Z","title":"Reflexion: L anguage agents with verbal reinforcement learning","venue":null,"work_id":"92ea9d69-50c9-42ee-837b-7194639dcb93","year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.472541Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:67abff865d4534d469e0e9e38ca48a208ecbe30c5137bf82ca4833a07dec96df","observation_id":"84e13dcf-c0ca-4438-8094-e81927529126","resolution":{"observed_at":"2026-08-05T22:09:47.356001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.03733","last_updated":"2024-10-18T23:53:07Z","snapshot_observed_at":"2026-07-06T19:11:09.921186Z","submitted_at":"2024-09-05T17:44:49Z","title":"Planning In Natural Language Improves LLM Search For Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.03733","snapshot_observed_at":"2026-08-05T22:09:46.476577Z","title":"Planning in natural language improves LLM search for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.476577Z"},"links":{"cited_paper":"/paper/2409.03733","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:4b8d3e0ab5c04c301288410ea5a361326c172429e342d3eab4619dae2be9c283","observation_id":"e4819110-3a3e-42f0-a5e3-247f8c70cdf4","resolution":{"observed_at":"2026-08-05T22:09:46.476577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-07T01:45:38.840969Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-05T22:09:46.481131Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.481131Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:a640e51573610b66a4f6e840964d8c26a5789ee1a4cbb5097a28416cbab301c4","observation_id":"1988d942-00da-4538-9f1a-f66590333066","resolution":{"observed_at":"2026-08-05T22:09:46.481131Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15118","last_updated":"2025-06-06T12:13:42Z","snapshot_observed_at":"2026-07-06T20:10:19.704368Z","submitted_at":"2024-12-19T17:59:42Z","title":"Reasoning Through Execution: Unifying Process and Outcome Rewards for Code Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15118","snapshot_observed_at":"2026-08-05T22:09:46.486332Z","title":"Outcome-refining process supervision for code generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.486332Z"},"links":{"cited_paper":"/paper/2412.15118","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:49038564902654ff924fe82ac18cdeffa4c982e2356e8de65285de373ffbec71","observation_id":"17a017c2-4a37-4946-8c7f-74c9554f0182","resolution":{"observed_at":"2026-08-05T22:09:46.486332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.18451","last_updated":"2024-10-24T06:06:26Z","snapshot_observed_at":"2026-08-07T05:53:12.643515Z","submitted_at":"2024-10-24T06:06:26Z","title":"Skywork-Reward: Bag of Tricks for Reward Modeling in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.18451","snapshot_observed_at":"2026-08-05T22:09:46.491142Z","title":"Skywork-reward: B ag of tricks for reward modeling in LLM s","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.491142Z"},"links":{"cited_paper":"/paper/2410.18451","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:83eb32a5b6389bc48d1be492d46d80ab90641f83603e714d2add9ae689881f50","observation_id":"de768fc2-29dc-496b-a8e5-3320719f5fed","resolution":{"observed_at":"2026-08-05T22:09:46.491142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.04664","last_updated":"2021-03-16T08:28:37Z","snapshot_observed_at":"2026-07-06T10:39:42.676631Z","submitted_at":"2021-02-09T06:16:25Z","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.04664","snapshot_observed_at":"2026-08-05T22:09:46.495797Z","title":"Codexglue: A machine learning benchmark dataset for code understanding and generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.495797Z"},"links":{"cited_paper":"/paper/2102.04664","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:f765e4e1c3416e1df54f8d2c68dceda76aee86cab153218ac630c49309dfd86d","observation_id":"ad2cf4a6-4514-4084-8741-0a36004e956e","resolution":{"observed_at":"2026-08-05T22:09:46.495797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.11280","last_updated":"2022-07-22T18:08:16Z","snapshot_observed_at":"2026-08-09T10:05:59.684326Z","submitted_at":"2022-07-22T18:08:16Z","title":"PanGu-Coder: Program Synthesis with Function-Level Language Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.11280","snapshot_observed_at":"2026-08-05T22:09:46.500170Z","title":"Pangu-coder: P rogram synthesis with function-level language modeling","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.500170Z"},"links":{"cited_paper":"/paper/2207.11280","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:6e7cd811a46d276468d625f09888a14dfa3a94c9d52376752da6200283d658f6","observation_id":"5694f089-1000-4f3c-8212-63184f1e1131","resolution":{"observed_at":"2026-08-05T22:09:46.500170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14196","last_updated":"2024-01-26T09:23:11Z","snapshot_observed_at":"2026-08-06T22:40:28.707813Z","submitted_at":"2024-01-25T14:17:53Z","title":"DeepSeek-Coder: When the Large Language Model Meets Programming -- The Rise of Code Intelligence","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14196","snapshot_observed_at":"2026-08-05T22:09:46.504731Z","title":"DeepSeek-Coder : W hen the large language model meets programming--the rise of code intelligence","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.504731Z"},"links":{"cited_paper":"/paper/2401.14196","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:eb05a5067377cf1a4d51c33de5e4811f99df0a87089b1c0a10d02ecef1714fd3","observation_id":"a84ee40d-19f9-4ad5-998c-9987e17e9902","resolution":{"observed_at":"2026-08-05T22:09:46.504731Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-05T22:09:46.509739Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.509739Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:3ab682b2ce4d5104295a6169f19e10c1b802c62de8abba16336aaf2ef76ba28a","observation_id":"2278c954-4689-44af-b7b0-99984abbe5da","resolution":{"observed_at":"2026-08-05T22:09:46.509739Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04406","last_updated":"2024-06-06T02:51:17Z","snapshot_observed_at":"2026-08-06T23:53:10.606737Z","submitted_at":"2023-10-06T17:55:11Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04406","snapshot_observed_at":"2026-08-05T22:09:46.514342Z","title":"Language agent tree search unifies reasoning acting and planning in language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.514342Z"},"links":{"cited_paper":"/paper/2310.04406","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:59a9a4041052fdcf532c9a0d60f951511e88b95bafdf3d69ee74c42a9c38055c","observation_id":"78515099-a3ab-4044-832b-423e53ada154","resolution":{"observed_at":"2026-08-05T22:09:46.514342Z","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-05T22:09:46.518940Z","title":"Debug like a human: A large language model debugger via verifying runtime execution step-by-step","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.518940Z"},"links":{"cited_paper":"/paper/2402.16906","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:eb0afe2600b010734de4d47dda7f92e01ac0c853048f6cd3aea5a7f5ad60d0d1","observation_id":"138b9b54-5a36-400d-9835-0d97c8b54655","resolution":{"observed_at":"2026-08-05T22:09:46.518940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07339","last_updated":"2024-08-09T06:16:55Z","snapshot_observed_at":"2026-07-06T17:15:22.551637Z","submitted_at":"2024-01-14T18:12:03Z","title":"CodeAgent: Enhancing Code Generation with Tool-Integrated Agent Systems for Real-World Repo-level Coding Challenges","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07339","snapshot_observed_at":"2026-08-05T22:09:46.523430Z","title":"Codeagent: E nhancing code generation with tool-integrated agent systems for real-world repo-level coding challenges","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.523430Z"},"links":{"cited_paper":"/paper/2401.07339","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:a0999bd9ee1372185d92d7873192ffab8d1f7f6abac5a3a878b13a8cd60db60a","observation_id":"97a66095-5eaa-4988-950c-c688b2e02cc1","resolution":{"observed_at":"2026-08-05T22:09:46.523430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.14354","last_updated":"2024-08-26T15:30:05Z","snapshot_observed_at":"2026-08-10T08:31:31.282748Z","submitted_at":"2024-08-26T15:30:05Z","title":"SWE-bench-java: A GitHub Issue Resolving Benchmark for Java","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.14354","snapshot_observed_at":"2026-08-05T22:09:46.528699Z","title":"Swe-bench-java: A github issue resolving benchmark for java","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.528699Z"},"links":{"cited_paper":"/paper/2408.14354","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:aa45d55cc62b9e9e0201d56fb435a8ab245b1fa811ce37272f5b1111cbd323b2","observation_id":"3e9c2c79-849a-4d6e-bda5-edaa726a7580","resolution":{"observed_at":"2026-08-05T22:09:46.528699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00267","last_updated":"2024-09-03T14:01:54Z","snapshot_observed_at":"2026-07-06T16:13:07.384791Z","submitted_at":"2023-09-01T05:53:33Z","title":"RLAIF vs. RLHF: Scaling Reinforcement Learning from Human Feedback with AI Feedback","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00267","snapshot_observed_at":"2026-08-05T22:09:46.533667Z","title":"Rlaif vs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.533667Z"},"links":{"cited_paper":"/paper/2309.00267","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:d998c129933b2d3e32914960282bb898535bb0e4aa12070dc29c3584b165a340","observation_id":"fc704216-e457-4e35-b9ae-a245b4274197","resolution":{"observed_at":"2026-08-05T22:09:46.533667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07301","last_updated":"2025-06-05T16:34:24Z","snapshot_observed_at":"2026-08-03T11:11:25.359494Z","submitted_at":"2025-01-13T13:10:16Z","title":"The Lessons of Developing Process Reward Models in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07301","snapshot_observed_at":"2026-08-05T22:09:46.538453Z","title":"The lessons of developing process reward models in mathematical reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.538453Z"},"links":{"cited_paper":"/paper/2501.07301","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:d47ed337c58dffa36bd692315f54f7112ed62cef10456f60ac9130aa7e3b2d89","observation_id":"954858a4-2436-4a32-8a10-662f822aeaa5","resolution":{"observed_at":"2026-08-05T22:09:46.538453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-08-09T03:55:09.041328Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T22:09:46.543585Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.543585Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:960019bd07d2a1e08aa344e8e9b3ff9f61b9a1dc167454e548cf3e854c28e2db","observation_id":"a1bcfbea-21e6-46dd-96b8-9aa36ae0c15b","resolution":{"observed_at":"2026-08-05T22:09:46.543585Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12832","last_updated":"2024-10-02T17:58:39Z","snapshot_observed_at":"2026-08-03T10:06:52.418096Z","submitted_at":"2024-10-02T17:58:39Z","title":"Generative Reward Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.12832","snapshot_observed_at":"2026-08-05T22:09:46.548724Z","title":"Generative reward models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.548724Z"},"links":{"cited_paper":"/paper/2410.12832","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:57a5fabbf699dd8f533ac2c02f918cc688e028f3e2fc3bc78870b41db708a090","observation_id":"7a4484db-d459-44f1-b5f9-e9e0afa93d63","resolution":{"observed_at":"2026-08-05T22:09:46.548724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00215","last_updated":"2024-06-28T19:53:17Z","snapshot_observed_at":"2026-08-10T12:31:19.058935Z","submitted_at":"2024-06-28T19:53:17Z","title":"LLM Critics Help Catch LLM Bugs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00215","snapshot_observed_at":"2026-08-05T22:09:46.553605Z","title":"Llm critics help catch llm bugs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.553605Z"},"links":{"cited_paper":"/paper/2407.00215","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:a2c59bfe9ca8b10da03907114b2cea9d9b5b6b19b6b56f6c484c727ccaa0339e","observation_id":"48faffc0-1935-46f9-a8d2-a314fba9378f","resolution":{"observed_at":"2026-08-05T22:09:46.553605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15240","last_updated":"2025-02-22T10:21:46Z","snapshot_observed_at":"2026-08-10T18:32:18.501904Z","submitted_at":"2024-08-27T17:57:45Z","title":"Generative Verifiers: Reward Modeling as Next-Token Prediction","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15240","snapshot_observed_at":"2026-08-05T22:09:46.557994Z","title":"Generative verifiers: Reward modeling as next-token prediction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.557994Z"},"links":{"cited_paper":"/paper/2408.15240","citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:add1a332e4d6d1c6019663cb4eb562ee7cddce8f07afdad6ba246b56182773eb","observation_id":"418bb1bb-72bd-43d4-95ae-8614a08c161c","resolution":{"observed_at":"2026-08-05T22:09:46.557994Z","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-05T22:09:46.562592Z","title":"Rm-r1: Reward modeling as reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-05T22:09:46.562592Z"},"links":{"citing_paper":"/paper/2508.07434"},"observation_digest":"sha256:8fd34039addca82f99163a14061668de4695cd9ed79427614ae4ae7886e86178","observation_id":"39c87926-b511-4da3-940d-bf9cb662250f","resolution":{"observed_at":"2026-08-05T22:09:46.562592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.07434","last_updated":"2025-08-10T17:11:56Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T02:35:17.826871Z","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":57},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 2 inbound Pith citation observations for arXiv:2508.07434."}