{"as_of":"2026-08-07T20:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca8efd04bfa3fc4234c7183dfc5d43a3d7e56935ee72916439faff893c6cb633","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":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":27,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:06:00.892822Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2412.09413","last_updated":"2024-12-22T10:44:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-12T16:20:36Z","title":"Imitate, Explore, and Self-Improve: A Reproduction Report on Slow-thinking Reasoning Systems","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-18T00:35:31.375020Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2412.09413"},"observation_digest":"sha256:98d49150b3f1269404e335cd456f0fb11b89aab45b483b1336c0b84c04eaaeea","observation_id":"b747b821-6732-41e9-9d67-8e74890b5ad4","resolution":{"observed_at":"2026-05-18T00:35:31.441347Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2501.05366","last_updated":"2025-01-09T16:48:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-09T16:48:17Z","title":"Search-o1: Agentic Search-Enhanced Large Reasoning Models","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-13T17:36:27.515468Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2501.05366"},"observation_digest":"sha256:117eec7ed94215356d5f0742452a5ccc7b87d1e25b6fa4b3c1f9a69dba5bc593","observation_id":"6aa1724b-52d3-41c5-8e25-14eb70d34815","resolution":{"observed_at":"2026-05-13T17:36:27.714815Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2503.12605","last_updated":"2025-03-23T13:47:43Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-03-16T18:39:13Z","title":"Multimodal Chain-of-Thought Reasoning: A Comprehensive Survey","version":2},"reference_index":228,"source":"pdf_text","source_observed_at":"2026-05-15T17:18:52.996467Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2503.12605"},"observation_digest":"sha256:9d75bedd93360728d7ef3ff4bb6d9cb911f049e09abef8e4013583bc2c8f0c76","observation_id":"0826ecf3-81b6-4e94-976d-9fe0cd154d7f","resolution":{"observed_at":"2026-05-15T17:18:53.527788Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2503.21460","last_updated":"2025-03-27T12:50:17Z","snapshot_observed_at":"2026-07-06T20:59:35.694800Z","submitted_at":"2025-03-27T12:50:17Z","title":"Large Language Model Agent: A Survey on Methodology, Applications and Challenges","version":1},"reference_index":108,"source":"pdf_text","source_observed_at":"2026-05-22T21:51:34.309870Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2503.21460"},"observation_digest":"sha256:2ef3bbfca3299f1d73aaec75c3ef4327520a1019c3193dbbbf09edb6485a49db","observation_id":"4731a328-5df5-481d-91b0-31ab3a55478f","resolution":{"observed_at":"2026-05-22T21:52:10.570222Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2505.04588","last_updated":"2026-05-19T11:51:42Z","snapshot_observed_at":"2026-08-04T18:36:41.979541Z","submitted_at":"2025-05-07T17:30:22Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T17:44:13.310155Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.04588"},"observation_digest":"sha256:d615abb60110afd9ffeecbe0e1fde16b1603688e5f8490d93a44263326ed12ae","observation_id":"34a2bdca-22ac-4241-bad8-498eb7451526","resolution":{"observed_at":"2026-05-17T17:44:13.470477Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2505.04588","last_updated":"2026-05-19T11:51:42Z","snapshot_observed_at":"2026-08-04T18:36:41.979541Z","submitted_at":"2025-05-07T17:30:22Z","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T16:05:04.715678Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.04588"},"observation_digest":"sha256:5833c2d038c3953503e6bb25fc7a5267e6b6065f3647878f704fa09556f8dec4","observation_id":"56fe818b-eff3-4366-8fa8-a5ab4045d2de","resolution":{"observed_at":"2026-05-22T16:06:45.978606Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","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-07T15:06:00.892822Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16312","last_updated":"2026-06-22T14:23:30Z","snapshot_observed_at":"2026-08-07T15:01:12.643871Z","submitted_at":"2025-05-22T07:07:43Z","title":"EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:06:00.892822Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.16312"},"observation_digest":"sha256:5728db112ea0e7d7cc899083840bb29ec7bc94197f7c77e8f98571c393268f7f","observation_id":"a80ca779-edbd-4c3a-80ff-78034a3c8734","resolution":{"observed_at":"2026-08-07T15:06:00.892822Z","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-07-06T19:52:03.121993Z","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-07T14:45:17.406362Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17829","last_updated":"2025-05-23T12:42:50Z","snapshot_observed_at":"2026-08-07T14:37:44.536944Z","submitted_at":"2025-05-23T12:42:50Z","title":"Stepwise Reasoning Checkpoint Analysis: A Test Time Scaling Method to Enhance LLMs' Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T14:45:17.406362Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.17829"},"observation_digest":"sha256:c31864e897fed90460de5818e5ceb2c390585205a3a171e352c3b8ce44ad1652","observation_id":"9f9ffe20-ea0b-4f37-9e95-257e32a45eae","resolution":{"observed_at":"2026-08-07T14:45:17.406362Z","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-07-06T19:52:03.121993Z","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-07T14:42:27.309575Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search.arXiv preprint arXiv:2411.11694, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18065","last_updated":"2025-05-23T16:12:12Z","snapshot_observed_at":"2026-08-07T14:42:54.821742Z","submitted_at":"2025-05-23T16:12:12Z","title":"Reward Model Generalization for Compute-Aware Test-Time Reasoning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:42:27.309575Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2505.18065"},"observation_digest":"sha256:32dfdcb42b59c3ac15caee0eb97c903cb6790e023aff0f45e119346d0d594ca3","observation_id":"f9b003d7-32fe-4b32-ab05-8497d578fab5","resolution":{"observed_at":"2026-08-07T14:42:27.309575Z","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-07-06T19:52:03.121993Z","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-07T10:40:21.212589Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.04734","last_updated":"2025-06-10T06:57:23Z","snapshot_observed_at":"2026-08-07T10:32:05.773501Z","submitted_at":"2025-06-05T08:09:11Z","title":"Evaluation is All You Need: Strategic Overclaiming of LLM Reasoning Capabilities Through Evaluation Design","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:40:21.212589Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2506.04734"},"observation_digest":"sha256:cb74ce3d69e4642353366de9f0b5f9a3a51077b794d42d079601a8529138fecd","observation_id":"c4faad56-4c78-4937-9050-740d21861537","resolution":{"observed_at":"2026-08-07T10:40:21.212589Z","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-07-06T19:52:03.121993Z","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-07T05:46:43.398130Z","title":"Takeshi Kojima, Shixiang Shane Gu, Machel Reid, Yu- taka Matsuo, and Yusuke Iwasawa","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07064","last_updated":"2025-06-08T09:53:08Z","snapshot_observed_at":"2026-08-07T05:40:33.675930Z","submitted_at":"2025-06-08T09:53:08Z","title":"Com$^2$: A Causal-Guided Benchmark for Exploring Complex Commonsense Reasoning in Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:46:43.398130Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2506.07064"},"observation_digest":"sha256:cdf784b36a722b8fe56c7f7475907af8a589aea676024c75cf37bd6dba4e1037","observation_id":"fa67507f-6f74-448c-a283-ebf292b38dd5","resolution":{"observed_at":"2026-08-07T05:46:43.398130Z","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-07-06T19:52:03.121993Z","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-07T05:09:19.582648Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.08691","last_updated":"2025-06-10T11:02:36Z","snapshot_observed_at":"2026-08-07T12:16:31.533543Z","submitted_at":"2025-06-10T11:02:36Z","title":"VReST: Enhancing Reasoning in Large Vision-Language Models through Tree Search and Self-Reward Mechanism","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:09:19.582648Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2506.08691"},"observation_digest":"sha256:86921c210e57b50cd33ea41018a6202933f3708785b310c77f9584d3560640c5","observation_id":"a4cc418c-f9fe-4f52-9f47-9608d2518715","resolution":{"observed_at":"2026-08-07T05:09:19.582648Z","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-07-06T19:52:03.121993Z","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-06T22:59:12.842671Z","title":"arXiv:2411.11694 (2024) 24","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20294","last_updated":"2026-07-03T05:27:17Z","snapshot_observed_at":"2026-08-07T04:10:19.521878Z","submitted_at":"2025-06-25T10:01:00Z","title":"Ctrl-Z Sampling: Scaling Diffusion Sampling with Controlled Random Zigzag Explorations","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T22:59:12.842671Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2506.20294"},"observation_digest":"sha256:6bb4e6478fb539311af8085735cddf40fa386892772c5f4802ea3f74deddf8ed","observation_id":"33c4bf2c-0c93-4766-a506-f9a81f20da20","resolution":{"observed_at":"2026-08-06T22:59:12.842671Z","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-07-06T19:52:03.121993Z","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:a76a481f4b06a69447bb34dd0389ade204a705436ece71f85bd9d277ab54f925","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","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:03:28.144048Z","title":"Technical report: Enhancing LLM reasoning with reward-guided tree search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.07534","last_updated":"2025-08-16T10:01:44Z","snapshot_observed_at":"2026-08-07T19:53:24.859763Z","submitted_at":"2025-08-11T01:26:16Z","title":"From Trial-and-Error to Improvement: A Systematic Analysis of LLM Exploration Mechanisms in RLVR","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T22:03:28.144048Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2508.07534"},"observation_digest":"sha256:f6eaa290e384168d7ba77fbe750bf264c97bc31c0c67b5ad6a0d411c511268ee","observation_id":"ea005420-8fac-45fb-be45-2bb5acf2547f","resolution":{"observed_at":"2026-08-05T22:03:28.144048Z","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-07-06T19:52:03.121993Z","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-05T10:31:37.800280Z","title":"Enhancing llm reasoning with reward-guided tree search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.04027","last_updated":"2026-06-09T07:28:31Z","snapshot_observed_at":"2026-08-05T10:31:32.575543Z","submitted_at":"2025-09-04T09:02:16Z","title":"Why Does Reasoning Length Converge? Unveiling the Underfitting-Overfitting Trade-off in Chain-of-Thought","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T10:31:37.800280Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2509.04027"},"observation_digest":"sha256:eb79165956e8761bad511bb9ae18eb4a8b0ff584def0f44d2eefab7cbc25710e","observation_id":"0a8439d8-5404-4d31-926f-f181fcc433c4","resolution":{"observed_at":"2026-08-05T10:31:37.800280Z","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-07-06T19:52:03.121993Z","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-05T05:45:02.737120Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.05007","last_updated":"2025-09-08T03:26:03Z","snapshot_observed_at":"2026-08-05T05:45:00.604843Z","submitted_at":"2025-09-05T11:14:11Z","title":"Sticker-TTS: Learn to Utilize Historical Experience with a Sticker-driven Test-Time Scaling Framework","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T05:45:02.737120Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2509.05007"},"observation_digest":"sha256:1dca60f983c664343a0416f5f8dbbbf758aaeafeb0687a240bf5617bbb71c38c","observation_id":"608e598d-cbc1-4caa-a836-3e3fc350f3af","resolution":{"observed_at":"2026-08-05T05:45:02.737120Z","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-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2509.21743","last_updated":"2026-03-31T22:32:08Z","snapshot_observed_at":"2026-07-06T22:30:50.642382Z","submitted_at":"2025-09-26T01:17:35Z","title":"Retrieval-of-Thought: Efficient Reasoning via Reusing Thoughts","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T13:42:07.883909Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2509.21743"},"observation_digest":"sha256:c15147ac38b6906ad21ee6b0086528e8a6496a1a40d6d4abe37b161bd717fdd4","observation_id":"84507aa2-47d9-400c-a03c-d6af0fc57d8d","resolution":{"observed_at":"2026-05-18T13:42:38.635096Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2602.03433","last_updated":"2026-02-03T11:56:08Z","snapshot_observed_at":"2026-07-06T22:44:18.875334Z","submitted_at":"2026-02-03T11:56:08Z","title":"When control meets large language models: From words to dynamics","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-05-21T14:52:44.632671Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2602.03433"},"observation_digest":"sha256:022626096ef92fcbc3a712dd994dadd7126692c2dfe059c6032ba33a52d7a5aa","observation_id":"98ab1b38-b39d-4c71-bf79-bb57fba73fd2","resolution":{"observed_at":"2026-05-21T14:54:13.213179Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2604.18327","last_updated":"2026-04-20T14:29:08Z","snapshot_observed_at":"2026-07-06T23:05:13.178333Z","submitted_at":"2026-04-20T14:29:08Z","title":"PARM: Pipeline-Adapted Reward Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T05:15:26.015817Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2604.18327"},"observation_digest":"sha256:2bcb636902e4be98f913b2837206031ec663dbace603d9882163fbab2df7420c","observation_id":"537f8259-853b-49fa-bb55-17839a0768ab","resolution":{"observed_at":"2026-05-10T09:28:39.510004Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2605.09121","last_updated":"2026-05-09T19:14:33Z","snapshot_observed_at":"2026-07-06T23:21:16.454273Z","submitted_at":"2026-05-09T19:14:33Z","title":"A Communication-Theoretic Framework for LLM Agents: Cost-Aware Adaptive Reliability","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-05-12T03:03:05.715652Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2605.09121"},"observation_digest":"sha256:7c68423eaac358ea80bd55272bb60312d020774d92bf7eb1b2a5278fd389e997","observation_id":"3bf1b1a0-94ac-456c-b1eb-0ba4e401864d","resolution":{"observed_at":"2026-05-12T07:26:27.522360Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2606.10932","last_updated":"2026-04-28T14:25:10Z","snapshot_observed_at":"2026-08-06T07:28:00.654805Z","submitted_at":"2026-04-28T14:25:10Z","title":"Density Field State Space Models: 1-Bit Distillation, Efficient Inference, and Knowledge Organization in Mamba-2","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-01T08:55:37.926334Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2606.10932"},"observation_digest":"sha256:0affd1fa032c0dfe7489c4e39997cfd68f78071784a0f48762aecb3d84a0ccf4","observation_id":"0d972d20-b559-42bb-839a-8127afaf352d","resolution":{"observed_at":"2026-07-01T09:05:37.131006Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2606.17449","last_updated":"2026-06-16T03:06:35Z","snapshot_observed_at":"2026-07-06T23:53:02.028020Z","submitted_at":"2026-06-16T03:06:35Z","title":"MODE-RAG: Manifold Outlier Diagnosis and Energy-based Retrieval-Augmented Generation Evaluation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T01:35:46.913390Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2606.17449"},"observation_digest":"sha256:45d8260f8c8d83dc20625e9d1fb6b71deee5b1319f998317bac3b89986202f68","observation_id":"cc708544-57ba-42b6-ab7d-8b6a0db9d35b","resolution":{"observed_at":"2026-07-03T20:08:56.384800Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2606.20599","last_updated":"2026-05-19T09:13:21Z","snapshot_observed_at":"2026-08-02T11:31:41.725373Z","submitted_at":"2026-05-19T09:13:21Z","title":"Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T18:38:48.512777Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2606.20599"},"observation_digest":"sha256:7ab7e3f9605cc9f7c302d08bdbb98f1adbfa0ba43e700a99430539d4097051f2","observation_id":"7eb9e57f-a20d-44e6-8a98-f55fef3c7839","resolution":{"observed_at":"2026-06-30T18:44:59.789825Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-02T23:29:21.699637Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":2},"reference_index":285,"source":"arxiv_source","source_observed_at":"2026-06-26T09:19:50.623741Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:76dee599cfb9e1f853df251d9380db08725d4ea88b4eb66d30f0f10527de1f11","observation_id":"1ecd146f-269f-4c5c-9404-be0d44e64969","resolution":{"observed_at":"2026-07-04T09:59:44.800993Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search","version":4},"cited_work":{"arxiv_id":"2411.11694","doi":"10.48550/arxiv.2411.11694","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.11694","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Technical report: Enhancing llm reasoning with reward-guided tree search","venue":"arXiv (Cornell University)","work_id":"8c1b2cf5-9409-42cd-bbd9-255469e68245","year":2024},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-02T23:29:21.699637Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":3},"reference_index":284,"source":"arxiv_source","source_observed_at":"2026-06-29T01:18:19.195007Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:654c52800edf6568150eeff0020d195a1dbaa778473a023792e6e184cfbf4d34","observation_id":"e4709ce6-424a-4ecb-92f6-efdc6d7ccd9d","resolution":{"observed_at":"2026-07-01T18:55:59.426665Z","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":"2411.11694","last_updated":"2024-12-31T01:38:12Z","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","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-07-14T05:57:23.399019Z","title":"arXiv preprint arXiv:2411.11694 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11258","last_updated":"2026-07-13T08:40:33Z","snapshot_observed_at":"2026-08-03T20:32:27.270243Z","submitted_at":"2026-07-13T08:40:33Z","title":"TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs","version":1},"reference_index":123,"source":"arxiv_source","source_observed_at":"2026-07-14T05:57:23.399019Z"},"links":{"cited_paper":"/paper/2411.11694","citing_paper":"/paper/2607.11258"},"observation_digest":"sha256:0de55bca2195bcfb4e536b7b82e5da8217eea5f716c03119b28a2d8dcad07850","observation_id":"40872ebf-2c4b-4d17-ad29-4a171c8d48d5","resolution":{"observed_at":"2026-07-14T05:57:23.399019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.11694/citation-record","integrity":"/paper/2411.11694/integrity","json":"/paper/2411.11694/citation-record.json","paper":"/paper/2411.11694"},"outbound":[],"paper":{"arxiv_id":"2411.11694","last_updated":"2024-12-31T01:38:12Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:52:03.121993Z","submitted_at":"2024-11-18T16:15:17Z","title":"Enhancing LLM Reasoning with Reward-guided Tree Search"},"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 27 inbound Pith citation observations for arXiv:2411.11694."}