{"as_of":"2026-08-17T13:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b0a08c4ca1356072af8f6a51e483bb69af7019a7641c6049339cedcabdc274fd","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:20:31.971505Z","state":"measured"},{"denominator":81,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":81,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T00:45:00.847714Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T00:45:49.122831Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"cited_work":{"arxiv_id":"2502.06813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06813","snapshot_observed_at":"2026-07-09T00:45:49.122831Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","venue":"cs.LG","work_id":"3d3caf5a-c0c9-4ed9-98e0-1c5c1558bcf6","year":2025},"citing_paper":{"arxiv_id":"2606.20625","last_updated":"2026-05-26T15:48:09Z","snapshot_observed_at":"2026-08-16T13:01:24.111624Z","submitted_at":"2026-05-26T15:48:09Z","title":"AlphaMemo: Structured Search-Process Memory for Self-Evolving Alpha Mining Agents","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-06-29T16:55:21.649886Z"},"links":{"cited_paper":"/paper/2502.06813","citing_paper":"/paper/2606.20625"},"observation_digest":"sha256:5f81908dc3f928fa06c111f1b62527db05574990efa93ea5afca48bb80c4d769","observation_id":"52916082-75b5-40ba-a7ea-def69baa47a2","resolution":{"observed_at":"2026-06-29T17:03:41.292335Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"cited_work":{"arxiv_id":"2502.06813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06813","snapshot_observed_at":"2026-07-09T00:45:49.122831Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","venue":"cs.LG","work_id":"3d3caf5a-c0c9-4ed9-98e0-1c5c1558bcf6","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-08-13T15:14:17.866685Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-25T21:29:40.564852Z"},"links":{"cited_paper":"/paper/2502.06813","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:0e9d6e6c4e9864e634483f4595a9a43635a6074df0fdfd6aa8a4cfb0c3f71ff7","observation_id":"44ac1250-0ed4-47c0-867f-4b945ac0f73c","resolution":{"observed_at":"2026-07-04T19:20:06.692526Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"cited_work":{"arxiv_id":"2502.06813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06813","snapshot_observed_at":"2026-07-09T00:45:49.122831Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","venue":"cs.LG","work_id":"3d3caf5a-c0c9-4ed9-98e0-1c5c1558bcf6","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-08-13T15:14:17.866685Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-01T06:33:45.824727Z"},"links":{"cited_paper":"/paper/2502.06813","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:349d72aefe9b159710f5b239769cd55333d1a7863ae9a22c2138b77fde406f0f","observation_id":"16ab1b89-1f16-401a-a9c0-beb8ccc4eebc","resolution":{"observed_at":"2026-07-01T06:35:29.610925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"cited_work":{"arxiv_id":"2502.06813","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06813","snapshot_observed_at":"2026-07-09T00:45:49.122831Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","venue":"cs.LG","work_id":"3d3caf5a-c0c9-4ed9-98e0-1c5c1558bcf6","year":2025},"citing_paper":{"arxiv_id":"2607.06974","last_updated":"2026-07-08T03:51:37Z","snapshot_observed_at":"2026-08-16T17:17:21.546350Z","submitted_at":"2026-07-08T03:51:37Z","title":"MILES: Modular Instruction Memory with Learnable Selection for Self-Improving LLM Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T00:45:00.847714Z"},"links":{"cited_paper":"/paper/2502.06813","citing_paper":"/paper/2607.06974"},"observation_digest":"sha256:46c352b183ddcc522fcb1ec1425783e0b110566af67955a42954a8d0729e7708","observation_id":"2ecb3394-cd05-4048-a1aa-f79a237b0754","resolution":{"observed_at":"2026-07-09T00:45:49.124174Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.06813/citation-record","integrity":"/paper/2502.06813/integrity","json":"/paper/2502.06813/citation-record.json","paper":"/paper/2502.06813"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T11:20:31.699067Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.699067Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:6e9124e21aafdab62dda1cdfa7a082ebbd74b63dd3e1171464f23a7072e57642","observation_id":"f118f27f-9ac2-4118-bfb1-8bc681efe191","resolution":{"observed_at":"2026-08-09T11:20:31.699067Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","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-09T11:20:31.703893Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.703893Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:c7aa51a2ec28f5c441fed243d1276ac34911f4728f6a8f7e17aa7496fa3e3354","observation_id":"7cda15ef-6e8a-4415-bf5e-0c31c00ee476","resolution":{"observed_at":"2026-08-09T11:20:31.703893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-15T07:10:22.387933Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-09T11:20:31.707926Z","title":"and Yahav, E","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.707926Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:4ea26320dddd31717a39e74f09b924b7874cde470d38c1f1677c9251fb9ca234","observation_id":"521ee828-f36d-4836-8127-b83234e6343f","resolution":{"observed_at":"2026-08-09T11:20:31.707926Z","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-09T11:20:32.823006Z","title":"Graph of thoughts: Solving elaborate problems with large language models","venue":null,"work_id":"2285adc0-f2a8-4f73-8f9c-90ccc43d68eb","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.711962Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:2d794c98c1b2f38e249cb2bef2c30eed35a550a8d7f3f4054a1796fe14c56b76","observation_id":"424ed346-75f6-4d6b-a0de-c10a262eb682","resolution":{"observed_at":"2026-08-09T11:20:32.826455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21787","last_updated":"2024-12-30T19:03:24Z","snapshot_observed_at":"2026-08-14T10:00:52.343929Z","submitted_at":"2024-07-31T17:57:25Z","title":"Large Language Monkeys: Scaling Inference Compute with Repeated Sampling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21787","snapshot_observed_at":"2026-08-09T11:20:31.715617Z","title":"V., R \\'e , C., and Mirhoseini, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.715617Z"},"links":{"cited_paper":"/paper/2407.21787","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:9c1fe9c636453569c1cb0d6ae6464e7fcc7bfc64058a701c891d39fdb0137fe3","observation_id":"358e0789-95bb-482e-a85e-b84ad6b10d50","resolution":{"observed_at":"2026-08-09T11:20:31.715617Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.02419","last_updated":"2024-06-04T21:20:33Z","snapshot_observed_at":"2026-08-16T14:12:54.897914Z","submitted_at":"2024-03-04T19:12:48Z","title":"Are More LLM Calls All You Need? Towards Scaling Laws of Compound Inference Systems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.02419","snapshot_observed_at":"2026-08-09T11:20:31.719368Z","title":"Q., Hanin, B., Bailis, P., Stoica, I., Zaharia, M., and Zou, J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.719368Z"},"links":{"cited_paper":"/paper/2403.02419","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:aa7a7693f694e6f5711d6cbb4f21d8827934e98a8686137c5259ea5ec0d34db9","observation_id":"d5864c9c-a105-4feb-acb5-eb68ad1222df","resolution":{"observed_at":"2026-08-09T11:20:31.719368Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16247","last_updated":"2024-11-10T12:54:35Z","snapshot_observed_at":"2026-08-16T20:17:19.946842Z","submitted_at":"2024-05-25T14:11:44Z","title":"AutoManual: Constructing Instruction Manuals by LLM Agents via Interactive Environmental Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16247","snapshot_observed_at":"2026-08-09T11:20:31.723133Z","title":"Automanual: Generating instruction manuals by llm agents via interactive environmental learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.723133Z"},"links":{"cited_paper":"/paper/2405.16247","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:8cb39c57e5723bf81782f24603e2281bbceb7135083aa87cdb032e2abda69018","observation_id":"2c4e8457-5087-4387-96ce-9071b2628413","resolution":{"observed_at":"2026-08-09T11:20:31.723133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12588","last_updated":"2023-10-23T01:27:38Z","snapshot_observed_at":"2026-08-02T13:06:11.850456Z","submitted_at":"2022-11-22T21:06:00Z","title":"Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12588","snapshot_observed_at":"2026-08-09T11:20:31.727353Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.727353Z"},"links":{"cited_paper":"/paper/2211.12588","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:d4b37c85df7d3fe1f4c45b5640b0bf24afeff618f88344e60361d68b25da3a09","observation_id":"2de69ca6-b006-4c9c-bb3b-ce789d55485e","resolution":{"observed_at":"2026-08-09T11:20:31.727353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.21187","last_updated":"2025-02-01T07:57:37Z","snapshot_observed_at":"2026-08-01T16:43:44.704797Z","submitted_at":"2024-12-30T18:55:12Z","title":"Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21187","snapshot_observed_at":"2026-08-09T11:20:31.731422Z","title":"Do not think that much for 2+ 3=? on the overthinking of o1-like llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.731422Z"},"links":{"cited_paper":"/paper/2412.21187","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:25ee9020c52733e882dc04045a7d4affda8075f6ddca352b37359fa4cfabb30a","observation_id":"0b605823-9856-4717-a0d6-38c6b29370c4","resolution":{"observed_at":"2026-08-09T11:20:31.731422Z","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-14T02:43:01.480086Z","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-09T11:20:31.736133Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.736133Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:2cfbb7ef961272d86a93d1a3445def253684085505a02d2f99268351252019f3","observation_id":"c20159ef-305c-4225-b259-8f28a4aaf78d","resolution":{"observed_at":"2026-08-09T11:20:31.736133Z","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-09T11:20:31.739771Z","title":"Opencompass: A universal evaluation platform for foundation models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.739771Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:85bab07e0f745f3ff71bd7f14fae604e3fbd83213cfc7d0962dcd9021d56c685","observation_id":"6b424d76-ff8d-4726-86b0-f2df89c1b702","resolution":{"observed_at":"2026-08-09T11:20:31.739771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-13T17:20:44.002518Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-09T11:20:31.743145Z","title":"The llama 3 herd of models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.743145Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:3b8df5022961c7c534f64faadd6e71ac4bbdd9e2fc2a75e22224675f253513e4","observation_id":"b24d0833-f800-47ef-b496-df20bcde9757","resolution":{"observed_at":"2026-08-09T11:20:31.743145Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.09699","last_updated":"2021-01-24T09:38:54Z","snapshot_observed_at":"2026-08-17T09:51:04.568396Z","submitted_at":"2020-12-17T16:11:47Z","title":"A Generalization of Transformer Networks to Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.09699","snapshot_observed_at":"2026-08-09T11:20:31.746699Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.746699Z"},"links":{"cited_paper":"/paper/2012.09699","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:84d98764425c05c1d3061d002030b51a35def77a498fdc6147242a339fa9db6b","observation_id":"14d03701-0746-40b7-a80d-933ec45adb87","resolution":{"observed_at":"2026-08-09T11:20:31.746699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.07875","last_updated":"2022-02-10T07:56:13Z","snapshot_observed_at":"2026-08-16T17:49:07.020117Z","submitted_at":"2021-10-15T05:59:15Z","title":"Graph Neural Networks with Learnable Structural and Positional Representations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.07875","snapshot_observed_at":"2026-08-09T11:20:31.750244Z","title":"P., Luu, A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.750244Z"},"links":{"cited_paper":"/paper/2110.07875","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:4c94cf714a16f5f65de41ca5814a727ad11935e1afc971ad1ec03a0ac5018925","observation_id":"42826f10-840a-476b-8e95-c03692270f8a","resolution":{"observed_at":"2026-08-09T11:20:31.750244Z","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-08-16T14:56:32.402721Z","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-09T11:20:31.753947Z","title":"M., Wen, Y., Zhang, W., and Wang, J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.753947Z"},"links":{"cited_paper":"/paper/2309.17179","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:0927336e8921a7c51710a9bfde1ce96e97920e609778b4a58f039d75d5ae591d","observation_id":"4ef57d7c-c201-481b-b7ab-80775d952152","resolution":{"observed_at":"2026-08-09T11:20:31.753947Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01707","last_updated":"2024-12-25T13:32:54Z","snapshot_observed_at":"2026-08-16T13:13:17.454194Z","submitted_at":"2024-10-02T16:15:31Z","title":"Interpretable Contrastive Monte Carlo Tree Search Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01707","snapshot_observed_at":"2026-08-09T11:20:31.757466Z","title":"Interpretable contrastive monte carlo tree search reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.757466Z"},"links":{"cited_paper":"/paper/2410.01707","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:3cefae565fc4dff7c165d40716d707fafb85ca402627ff635361ef245437f981","observation_id":"384b8047-8f33-4ab7-b5be-456709c5c2bb","resolution":{"observed_at":"2026-08-09T11:20:31.757466Z","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-09T11:20:31.761155Z","title":"Did aristotle use a laptop? a question answering benchmark with implicit reasoning strategies","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.761155Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:3cea7c7ce2b2e455445ffeb9db9aaf1ed52ca03b52f3e78cd9c1ec3ea00fafb5","observation_id":"5a89156c-c02a-4631-9b16-4993c6963023","resolution":{"observed_at":"2026-08-09T11:20:31.761155Z","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-09T11:20:32.801459Z","title":"Monte-carlo tree search as regularized policy optimization","venue":null,"work_id":"7d038f03-8a1b-4638-b7d0-3677cc2050fe","year":2020},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.764558Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:5c55911c1d9d6bcd08be5d58f0d477f07cfc4d2bd9dd6859b79d7ee4b01c379f","observation_id":"f4a5b532-5837-4693-a6b8-3820b1f548cc","resolution":{"observed_at":"2026-08-09T11:20:32.805102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-15T11:39:07.998070Z","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-09T11:20:31.767853Z","title":"J., Wang, Z., Wang, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.767853Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:1f66b6a6318d0cb2c72d1d82d19ff6ea4a46132b688f2cd21c4611e9621a38e3","observation_id":"79310749-c6d7-44e4-8dfc-338637dfe9ee","resolution":{"observed_at":"2026-08-09T11:20:31.767853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05221","last_updated":"2024-08-11T22:20:19Z","snapshot_observed_at":"2026-08-16T14:02:52.207183Z","submitted_at":"2024-04-08T06:35:09Z","title":"LLM Reasoners: New Evaluation, Library, and Analysis of Step-by-Step Reasoning with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05221","snapshot_observed_at":"2026-08-09T11:20:31.771367Z","title":"Llm reasoners: New evaluation, library, and analysis of step-by-step reasoning with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.771367Z"},"links":{"cited_paper":"/paper/2404.05221","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:849f5b7e921f32ebd3adb696db43b264dc1d83e4bc85acc2dece052928f2e0b0","observation_id":"9e76c176-aa0a-4cfc-bfd0-464c0244565c","resolution":{"observed_at":"2026-08-09T11:20:31.771367Z","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-09T11:20:31.775056Z","title":"E., Nilsson, N","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.775056Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:0b4bde931d8d07466d80365b3560c9c40f450f31753fdf966bf64159330373fb","observation_id":"e25244ba-94d1-4422-a4f4-a64516b26871","resolution":{"observed_at":"2026-08-09T11:20:31.775056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10963","last_updated":"2024-06-25T03:14:10Z","snapshot_observed_at":"2026-08-16T14:18:50.765820Z","submitted_at":"2024-02-13T20:16:29Z","title":"GLoRe: When, Where, and How to Improve LLM Reasoning via Global and Local Refinements","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10963","snapshot_observed_at":"2026-08-09T11:20:31.778590Z","title":"Glore: When, where, and how to improve llm reasoning via global and local refinements","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.778590Z"},"links":{"cited_paper":"/paper/2402.10963","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:e35ba8960b5271056ce1492b3be8e893a07ad50bc54e5f8891b2ebf2ed7d7b49","observation_id":"610fd814-6513-4da7-9499-bed96ecb4d2b","resolution":{"observed_at":"2026-08-09T11:20:31.778590Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03874","last_updated":"2021-11-08T21:30:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-03-05T18:59:39Z","title":"Measuring Mathematical Problem Solving With the MATH Dataset","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03874","snapshot_observed_at":"2026-08-09T11:20:31.782099Z","title":"Measuring mathematical problem solving with the math dataset","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.782099Z"},"links":{"cited_paper":"/paper/2103.03874","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:4bd329c88c308079b83bd36c6636a005bbc422e5de075562fb5eeda773a87d65","observation_id":"c58d6740-0b55-4a45-9afc-a8a40ffc14db","resolution":{"observed_at":"2026-08-09T11:20:31.782099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.07954","last_updated":"2024-03-23T13:54:44Z","snapshot_observed_at":"2026-08-16T14:43:32.384701Z","submitted_at":"2023-11-14T07:13:10Z","title":"A Closer Look at the Self-Verification Abilities of Large Language Models in Logical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.07954","snapshot_observed_at":"2026-08-09T11:20:31.785806Z","title":"A closer look at the self-verification abilities of large language models in logical reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.785806Z"},"links":{"cited_paper":"/paper/2311.07954","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:ab19f62090c063827f7ccb76faf829f75ee9fd80f5a6cbacfaa51a0f311bf5fd","observation_id":"694c9302-820a-455e-8074-ea8432b2dda7","resolution":{"observed_at":"2026-08-09T11:20:31.785806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10403","last_updated":"2023-05-26T17:59:33Z","snapshot_observed_at":"2026-08-06T19:23:30.079167Z","submitted_at":"2022-12-20T16:29:03Z","title":"Towards Reasoning in Large Language Models: A Survey","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10403","snapshot_observed_at":"2026-08-09T11:20:31.789530Z","title":"and Chang, K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.789530Z"},"links":{"cited_paper":"/paper/2212.10403","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:8ad774abefeffd455d2f1ce42896f2e97789b251071301a4d2f5434564321cbf","observation_id":"e93f86b6-a9b4-4430-aaf4-8555735818a9","resolution":{"observed_at":"2026-08-09T11:20:31.789530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01798","last_updated":"2024-03-14T04:27:52Z","snapshot_observed_at":"2026-08-13T03:11:04.678829Z","submitted_at":"2023-10-03T04:56:12Z","title":"Large Language Models Cannot Self-Correct Reasoning Yet","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01798","snapshot_observed_at":"2026-08-09T11:20:31.793430Z","title":"S., Yu, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.793430Z"},"links":{"cited_paper":"/paper/2310.01798","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:6d60c7734b7d6cbeb0fb2234484066267797c419d08e1fb3652547e41c7ad3f7","observation_id":"8cda804f-7155-4452-8dc3-5de7a2055668","resolution":{"observed_at":"2026-08-09T11:20:31.793430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-08-17T02:13:39.510069Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-09T11:20:31.797186Z","title":"Q., Sablayrolles, A., Mensch, A., Bamford, C., Chaplot, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.797186Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:a2f6e5102f1df5cba1eb1e21443ae26ff1b842be37726cf650d67fdf928ac7c2","observation_id":"8f7deca7-1356-44be-9fb7-c91c1e474d18","resolution":{"observed_at":"2026-08-09T11:20:31.797186Z","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-09T11:20:32.785095Z","title":"Can large language models reason and plan? Annals of the New York Academy of Sciences, 1534 0 (1): 0 15--18, 2024","venue":null,"work_id":"1025e2c4-e58b-4d0e-949c-3d285154d2e5","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.800950Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:d778e0d552d7cb3b12fe9fb7ec1cf41acd467e2287954b3565cd95525ae3b486","observation_id":"2ff43ab7-7195-408e-a605-50e2d6d8fb76","resolution":{"observed_at":"2026-08-09T11:20:32.789185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01817","last_updated":"2024-06-12T01:13:11Z","snapshot_observed_at":"2026-08-16T14:22:07.383531Z","submitted_at":"2024-02-02T14:43:18Z","title":"LLMs Can't Plan, But Can Help Planning in LLM-Modulo Frameworks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01817","snapshot_observed_at":"2026-08-09T11:20:31.804544Z","title":"Llms can't plan, but can help planning in llm-modulo frameworks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.804544Z"},"links":{"cited_paper":"/paper/2402.01817","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:6d793e55b316b45c914110c2c11a49abc6bcccf595733c437c871c71088eed6d","observation_id":"03cc6b19-91f4-42af-b502-393f4edf18d8","resolution":{"observed_at":"2026-08-09T11:20:31.804544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05134","last_updated":"2024-07-06T17:01:04Z","snapshot_observed_at":"2026-08-16T13:36:31.903893Z","submitted_at":"2024-07-06T17:01:04Z","title":"Solving for X and Beyond: Can Large Language Models Solve Complex Math Problems with More-Than-Two Unknowns?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.05134","snapshot_observed_at":"2026-08-09T11:20:31.808143Z","title":"Solving for x and beyond: Can large language models solve complex math problems with more-than-two unknowns? arXiv preprint arXiv:2407.05134, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.808143Z"},"links":{"cited_paper":"/paper/2407.05134","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:cbdd0bb669f4a2415f4b8657bbd0af9c14aef01d71f76f63e9751f393f53daf2","observation_id":"8a1bc270-94f6-4c71-b1b3-8cc6d3ef6b62","resolution":{"observed_at":"2026-08-09T11:20:31.808143Z","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-09T11:20:32.774739Z","title":null,"venue":null,"work_id":"f1e2ec42-0772-4165-af3b-7884706c0d0a","year":2019},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.811669Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:da930debc0e432d1d91964ef869f56d74cf84f2825696cbfcd3459315c595ed0","observation_id":"e4ecee8c-1157-4e74-ac92-72308834ce73","resolution":{"observed_at":"2026-08-09T11:20:32.778249Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T11:20:31.814944Z","title":"Grace: Discriminator-guided chain-of-thought reasoning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.814944Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:56a915fcb86adcb6bebc4897d299a3ff2e98f622a76221c4c754c83aeb9982b3","observation_id":"e85eba5f-3949-4ef9-a36d-3238801862fd","resolution":{"observed_at":"2026-08-09T11:20:31.814944Z","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-09T11:20:31.818263Z","title":"S., Reid, M., Matsuo, Y., and Iwasawa, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.818263Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:13a96871230bcba2cb2b7228adc2961c9224b4353ed1cf6b8d669e8250b62946","observation_id":"82d17d86-d6ad-4a3c-aa98-d55e4f6a6255","resolution":{"observed_at":"2026-08-09T11:20:31.818263Z","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-09T11:20:31.821720Z","title":"Rethinking graph transformers with spectral attention","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.821720Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:fc6bf2449fad4ebf9b88d42ec15a8832039abb2ef4c16ea7be2e858f80dc52dc","observation_id":"34a6b8ff-83d4-4c05-9b23-9069f4a7b6a3","resolution":{"observed_at":"2026-08-09T11:20:31.821720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.04474","last_updated":"2024-07-29T20:21:37Z","snapshot_observed_at":"2026-08-16T14:36:45.583038Z","submitted_at":"2023-12-07T17:51:43Z","title":"Chain of Code: Reasoning with a Language Model-Augmented Code Emulator","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.04474","snapshot_observed_at":"2026-08-09T11:20:31.824871Z","title":"Chain of code: Reasoning with a language model-augmented code emulator","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.824871Z"},"links":{"cited_paper":"/paper/2312.04474","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:2626f880e4ccadc09981cb3c6eb292200b31d3917e27cdfd79941fa56acf8398","observation_id":"9dff5b69-8f07-46c1-8c7b-1734cd5a5c81","resolution":{"observed_at":"2026-08-09T11:20:31.824871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.02336","last_updated":"2023-05-24T04:08:08Z","snapshot_observed_at":"2026-08-16T16:55:09.947238Z","submitted_at":"2022-06-06T03:38:36Z","title":"Making Large Language Models Better Reasoners with Step-Aware Verifier","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.02336","snapshot_observed_at":"2026-08-09T11:20:31.828323Z","title":"Making large language models better reasoners with step-aware verifier","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.828323Z"},"links":{"cited_paper":"/paper/2206.02336","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:1f9f6bb7d176bc1651c1d04c7d9b17f6811443f38dc9da949b078eec90d1f973","observation_id":"b629c2ea-858f-4963-acf6-9b26600e017b","resolution":{"observed_at":"2026-08-09T11:20:31.828323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-17T09:42:34.746112Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-09T11:20:31.831749Z","title":"Let's verify step by step","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.831749Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:b2cc6ea5ab12cc83b37739c2b037237d31508be582f9041a3151c8c675326627","observation_id":"7a0d4a6f-b75e-4b60-ba10-07f1c979025b","resolution":{"observed_at":"2026-08-09T11:20:31.831749Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.04146","last_updated":"2017-10-23T16:45:03Z","snapshot_observed_at":"2026-08-14T21:01:22.490456Z","submitted_at":"2017-05-11T13:04:47Z","title":"Program Induction by Rationale Generation : Learning to Solve and Explain Algebraic Word Problems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.04146","snapshot_observed_at":"2026-08-09T11:20:31.835298Z","title":"Program induction by rationale generation: Learning to solve and explain algebraic word problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.835298Z"},"links":{"cited_paper":"/paper/1705.04146","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:9dec065fe587ae4e72256610800b5bd5b5257683df01c019cf339c9b4b4023da","observation_id":"8e34e2e1-dd0f-4d51-9774-3d11ac69efbe","resolution":{"observed_at":"2026-08-09T11:20:31.835298Z","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-09T11:20:32.751069Z","title":"Optimistic tree searches for combinatorial black-box optimization","venue":null,"work_id":"20974f32-73bd-4e2a-bdc6-f24c3d0cec93","year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.838967Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:892fa750ee03e9439d7b0bf8c4e3f8c0f9d5d15cefba415ce5f9ba710ef986da","observation_id":"a65a5588-43f4-4ad1-9fd6-eed05ecf2ea5","resolution":{"observed_at":"2026-08-09T11:20:32.755128Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T11:20:32.739631Z","title":"Skeleton-of-thought: Prompting llms for efficient parallel generation","venue":null,"work_id":"5c9d7ca3-e0be-4cf3-8362-46fab9b9d707","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.842418Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:cac50570d911f526ba7181d7c6fe9cfde9228f74f1a141da95361b6320984c3a","observation_id":"f2e049d4-3b78-4a7d-be61-f12ab04f6682","resolution":{"observed_at":"2026-08-09T11:20:32.743794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06195","last_updated":"2024-08-12T14:42:13Z","snapshot_observed_at":"2026-08-16T22:23:21.433393Z","submitted_at":"2024-08-12T14:42:13Z","title":"Mutual Reasoning Makes Smaller LLMs Stronger Problem-Solvers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06195","snapshot_observed_at":"2026-08-09T11:20:31.845722Z","title":"L., Yang, F., and Yang, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.845722Z"},"links":{"cited_paper":"/paper/2408.06195","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:eec01f11bc8e56da75532533b7a9415162cf2a31b935270086e9c673cc7a9b17","observation_id":"45588ba6-0ae0-450f-92ae-55e8bd3face8","resolution":{"observed_at":"2026-08-09T11:20:31.845722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18219","last_updated":"2024-07-26T17:50:27Z","snapshot_observed_at":"2026-08-16T13:31:00.467034Z","submitted_at":"2024-07-25T17:35:59Z","title":"Recursive Introspection: Teaching Language Model Agents How to Self-Improve","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18219","snapshot_observed_at":"2026-08-09T11:20:31.849766Z","title":"Recursive introspection: Teaching language model agents how to self-improve","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.849766Z"},"links":{"cited_paper":"/paper/2407.18219","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:1329c1a0bf7664032779b17eab200802c17bd463f3b48e05e82f2373c6705235","observation_id":"36a6d151-b82f-4be7-b598-15273dcadec1","resolution":{"observed_at":"2026-08-09T11:20:31.849766Z","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-09T11:20:31.853543Z","title":"P., Luu, A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.853543Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:68f16f18c9adfd520ece3558a6c1cc741a4b60c09288699e21ba3f903d7cc938","observation_id":"b87320e4-3764-4a19-a6a9-8a37579481da","resolution":{"observed_at":"2026-08-09T11:20:31.853543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.12022","last_updated":"2023-11-20T18:57:34Z","snapshot_observed_at":"2026-08-16T07:06:07.822225Z","submitted_at":"2023-11-20T18:57:34Z","title":"GPQA: A Graduate-Level Google-Proof Q&A Benchmark","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.12022","snapshot_observed_at":"2026-08-09T11:20:31.856867Z","title":"L., Stickland, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.856867Z"},"links":{"cited_paper":"/paper/2311.12022","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:435b60a768f814c61dbff505f2ede6331f5d5d39321e94d6631a24013877fd6e","observation_id":"ac371c2a-356a-4ac1-931a-72604fc809f2","resolution":{"observed_at":"2026-08-09T11:20:31.856867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01240","last_updated":"2023-03-02T03:54:28Z","snapshot_observed_at":"2026-08-16T16:27:11.895195Z","submitted_at":"2022-10-03T21:34:32Z","title":"Language Models Are Greedy Reasoners: A Systematic Formal Analysis of Chain-of-Thought","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01240","snapshot_observed_at":"2026-08-09T11:20:31.860444Z","title":"and He, H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.860444Z"},"links":{"cited_paper":"/paper/2210.01240","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:e160a5478fe8fdaf4e313f0c937d300427dfaf8508fd6b9fef92bacc2fa0aa09","observation_id":"7c178857-a19b-40fc-9347-5ef56bc3817f","resolution":{"observed_at":"2026-08-09T11:20:31.860444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-09T11:20:31.864048Z","title":"Proximal policy optimization algorithms","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.864048Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:b4f77857285a3c52234fb90567e8f5c9c024edbb023f37a5c2df1d8915c21eaa","observation_id":"cf9e5f39-eaa1-4445-857a-c07289c019aa","resolution":{"observed_at":"2026-08-09T11:20:31.864048Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.10379","last_updated":"2024-06-02T16:01:35Z","snapshot_observed_at":"2026-08-16T15:07:09.713974Z","submitted_at":"2023-08-20T22:36:23Z","title":"Algorithm of Thoughts: Enhancing Exploration of Ideas in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.10379","snapshot_observed_at":"2026-08-09T11:20:31.867518Z","title":"Algorithm of thoughts: Enhancing exploration of ideas in large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.867518Z"},"links":{"cited_paper":"/paper/2308.10379","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:4fe96d7f9073ead9a2935c79df175ce225b68db8bd41278572fd9709453a6988","observation_id":"dc58ba97-7b8b-46ee-b3b5-792575f69e19","resolution":{"observed_at":"2026-08-09T11:20:31.867518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01815","last_updated":"2017-12-05T18:45:38Z","snapshot_observed_at":"2026-08-14T20:06:37.819179Z","submitted_at":"2017-12-05T18:45:38Z","title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01815","snapshot_observed_at":"2026-08-09T11:20:31.870961Z","title":"Mastering chess and shogi by self-play with a general reinforcement learning algorithm","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.870961Z"},"links":{"cited_paper":"/paper/1712.01815","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:24f3b1bd0114304f756383199c01cd311fb57511eea9cf8bd47579f140f5e8e8","observation_id":"51fffe79-a280-413d-b851-57e036a9be1b","resolution":{"observed_at":"2026-08-09T11:20:31.870961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06585","last_updated":"2024-04-18T03:12:09Z","snapshot_observed_at":"2026-08-16T14:35:47.075840Z","submitted_at":"2023-12-11T18:17:43Z","title":"Beyond Human Data: Scaling Self-Training for Problem-Solving with Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06585","snapshot_observed_at":"2026-08-09T11:20:31.874537Z","title":"D., Agarwal, R., Anand, A., Patil, P., Garcia, X., Liu, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.874537Z"},"links":{"cited_paper":"/paper/2312.06585","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:09afdc41a6a15a7c5b1a7683d2570e38d02ddeb4601bdd69d2f47e5eb3fc49fc","observation_id":"984f8bfb-1d13-4390-9e06-041949791329","resolution":{"observed_at":"2026-08-09T11:20:31.874537Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-09T11:20:31.878454Z","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":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.878454Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:94dd446aa40ab72c42568625148bcdc7b0e159995ca835868e25d3d3ee17a176","observation_id":"70267e28-23b8-4550-9c1e-000c7637a123","resolution":{"observed_at":"2026-08-09T11:20:31.878454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08115","last_updated":"2024-08-03T21:25:31Z","snapshot_observed_at":"2026-08-16T14:19:09.154257Z","submitted_at":"2024-02-12T23:11:01Z","title":"On the Self-Verification Limitations of Large Language Models on Reasoning and Planning Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.08115","snapshot_observed_at":"2026-08-09T11:20:31.881871Z","title":"On the self-verification limitations of large language models on reasoning and planning tasks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.881871Z"},"links":{"cited_paper":"/paper/2402.08115","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:97353e4b433d6291c3523c1975cebca7b999ff3e2ba4548792b50809bcb66267","observation_id":"3e133e31-c9c4-4849-a627-9515d23e3b3a","resolution":{"observed_at":"2026-08-09T11:20:31.881871Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.11805","last_updated":"2025-05-09T21:04:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-19T02:39:27Z","title":"Gemini: A Family of Highly Capable Multimodal Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.11805","snapshot_observed_at":"2026-08-09T11:20:31.885310Z","title":"M., Hauth, A., Millican, K., et al","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.885310Z"},"links":{"cited_paper":"/paper/2312.11805","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:e6c994785b3cc500f089cf86ab1e331e868d274c6f1bb93b65a888fcbb787fde","observation_id":"04e1a2a4-25e6-4c0b-92c7-ea9851e61490","resolution":{"observed_at":"2026-08-09T11:20:31.885310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2111.14522","last_updated":"2022-11-12T16:11:19Z","snapshot_observed_at":"2026-08-16T17:38:39.072995Z","submitted_at":"2021-11-29T13:27:56Z","title":"Understanding over-squashing and bottlenecks on graphs via curvature","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.14522","snapshot_observed_at":"2026-08-09T11:20:31.888835Z","title":"P., Dong, X., and Bronstein, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.888835Z"},"links":{"cited_paper":"/paper/2111.14522","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:d3a5e5d4425e2f8fb643226f9209b3936c68a35a8d9ef62c2bf216f36e36f98c","observation_id":"91496b6a-26f4-4be2-983d-56cfc670bc5d","resolution":{"observed_at":"2026-08-09T11:20:31.888835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.14275","last_updated":"2022-11-25T18:19:44Z","snapshot_observed_at":"2026-08-01T02:16:43.109337Z","submitted_at":"2022-11-25T18:19:44Z","title":"Solving math word problems with process- and outcome-based feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.14275","snapshot_observed_at":"2026-08-09T11:20:31.892078Z","title":"Solving math word problems with process-and outcome-based feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.892078Z"},"links":{"cited_paper":"/paper/2211.14275","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:da854bedf3d5a05a676ff02859bbf6847f047747aedb183f4b090fa3995fd937","observation_id":"00791e3b-8eea-40fd-a9aa-0fc4851a3a2a","resolution":{"observed_at":"2026-08-09T11:20:31.892078Z","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-09T11:20:32.721495Z","title":"Large language models still can't plan (a benchmark for llms on planning and reasoning about change)","venue":null,"work_id":"f1d5857f-0bad-4681-ac3e-aa8c010eb6ae","year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.895462Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:20afce77f61f4717607c5334c7523e386fdd6bdfecf97b14618c6bba17e5885e","observation_id":"0de27048-ee96-4a40-8899-0bfc5f2ae7a3","resolution":{"observed_at":"2026-08-09T11:20:32.725174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14283","last_updated":"2024-07-22T10:01:49Z","snapshot_observed_at":"2026-08-16T13:41:07.256700Z","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-09T11:20:31.898539Z","title":"Q*: Improving multi-step reasoning for llms with deliberative planning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.898539Z"},"links":{"cited_paper":"/paper/2406.14283","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:bdd2ec0ba41ef7f54bf588b62d68c1816a342ef85a69bab4bc5b42297613a2f5","observation_id":"76cd48da-cc93-4392-b2b0-fee689104cab","resolution":{"observed_at":"2026-08-09T11:20:31.898539Z","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-09T11:20:32.710158Z","title":"Learning search space partition for black-box optimization using monte carlo tree search","venue":null,"work_id":"6c1a8b66-f7ab-46c1-aec9-5fef41d2bf90","year":2020},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.902029Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:d6fd7ee906115f764c25ef340153e0df54f626679d50b24458c731c5a05675c2","observation_id":"9578d9f2-2921-499e-b562-f4ce9ac9f907","resolution":{"observed_at":"2026-08-09T11:20:32.714066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T11:20:32.700083Z","title":"Math-shepherd: Verify and reinforce llms step-by-step without human annotations","venue":null,"work_id":"db512597-4e30-4ca8-baa0-09206d3c10d8","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.905513Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:36180d17c40b117d68741027614571e26eae62204a4f4eb211083c851491f575","observation_id":"70ad7418-e212-4c64-9a39-290ae1173e2d","resolution":{"observed_at":"2026-08-09T11:20:32.703762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.07186","last_updated":"2024-12-10T04:52:26Z","snapshot_observed_at":"2026-08-12T18:10:23.024795Z","submitted_at":"2024-12-10T04:52:26Z","title":"Monte Carlo Tree Search based Space Transfer for Black-box Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.07186","snapshot_observed_at":"2026-08-09T11:20:31.908661Z","title":"Monte carlo tree search based space transfer for black-box optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.908661Z"},"links":{"cited_paper":"/paper/2412.07186","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:723aba568ab16e74217be6ae1b5c05140b59d6f8bf8b65f358abed6abafffa8d","observation_id":"b6975ffe-006f-4d35-b561-7fe03d7377f8","resolution":{"observed_at":"2026-08-09T11:20:31.908661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.11171","last_updated":"2023-03-07T17:57:37Z","snapshot_observed_at":"2026-08-16T01:49:22.176843Z","submitted_at":"2022-03-21T17:48:52Z","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.11171","snapshot_observed_at":"2026-08-09T11:20:31.912088Z","title":"Self-consistency improves chain of thought reasoning in language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.912088Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:90d0921f30970e2be75b64122b511df75a3ad21297dec7033317bbcdc1254728","observation_id":"d2e3f5b4-ca17-4bca-aac6-eaf7bf3b7f7f","resolution":{"observed_at":"2026-08-09T11:20:31.912088Z","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-09T11:20:31.915463Z","title":"V., Zhou, D., et al","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.915463Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:24c3ff0b7fd94624b5b1ba3b3d3168293ff4b4a8a6eee52564af795521dcca1c","observation_id":"e9980911-9661-4ee6-875a-c37568ea3d7b","resolution":{"observed_at":"2026-08-09T11:20:31.915463Z","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-09T11:20:32.683046Z","title":"An empirical analysis of compute-optimal inference for problem-solving with language models","venue":null,"work_id":"9c4aba41-00c9-4369-a5b8-799ef148089b","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.918609Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:7c9ca30e24e2e86921c90417eb2976f7f1ae8b53e3879e281b0e52149f782117","observation_id":"59c5bea6-61bf-4867-bfb7-88fed0c17f79","resolution":{"observed_at":"2026-08-09T11:20:32.687460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-09T11:20:31.921896Z","title":"E., and Stoica, I","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.921896Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:3cdc351bb6fcb0e3abe41f97a6cdc05b272a1d4ccce2593ecff730a34b7d6191","observation_id":"5fb65346-75f3-40e8-8ca6-a85a62814023","resolution":{"observed_at":"2026-08-09T11:20:31.921896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00451","last_updated":"2024-06-17T22:11:49Z","snapshot_observed_at":"2026-08-16T13:56:19.546679Z","submitted_at":"2024-05-01T11:10:24Z","title":"Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00451","snapshot_observed_at":"2026-08-09T11:20:31.925154Z","title":"P., Kawaguchi, K., and Shieh, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.925154Z"},"links":{"cited_paper":"/paper/2405.00451","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:e5907b2b9235e1f7108d1c2bba2478394ab236b8f0d5fa8131680e9416fb4f8a","observation_id":"54b0c245-e256-405e-8ae9-67f8c9c35f16","resolution":{"observed_at":"2026-08-09T11:20:31.925154Z","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-09T11:20:32.667392Z","title":"X., Kan, M.-Y., He, J., and Xie, M","venue":null,"work_id":"7f39014f-b6bb-4e77-8a19-6841d5f4442b","year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.928713Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:9adf0c16bfa310161496e426ed04dcdd703932f7c11af0403b930ba3db6e9113","observation_id":"74382a74-53a6-4133-8eea-70071656f3a3","resolution":{"observed_at":"2026-08-09T11:20:32.671036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04271","last_updated":"2024-10-14T07:12:27Z","snapshot_observed_at":"2026-08-16T13:45:26.278808Z","submitted_at":"2024-06-06T17:22:08Z","title":"Buffer of Thoughts: Thought-Augmented Reasoning with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04271","snapshot_observed_at":"2026-08-09T11:20:31.932348Z","title":"E., and Cui, B","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.932348Z"},"links":{"cited_paper":"/paper/2406.04271","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:0931461a116ca39f73b5b936317b9ff7d37b90164c7d1eb8732d02ca16dc34bf","observation_id":"ed060289-a0df-4830-b955-ca663622149f","resolution":{"observed_at":"2026-08-09T11:20:31.932348Z","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-09T11:20:31.935906Z","title":"Tree of thoughts: Deliberate problem solving with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.935906Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:c71e6fde4e12eab70c8081c8ca3efbe7a0dd4a890a0ef84cbd8d31975420d8a8","observation_id":"6967a217-d91d-4bc0-9904-44b8ed4e6c87","resolution":{"observed_at":"2026-08-09T11:20:31.935906Z","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-09T11:20:31.939353Z","title":"Do transformers really perform badly for graph representation? Advances in neural information processing systems, 34: 0 28877--28888, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.939353Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:5c2049d495cfc15654bb15bdcdc5ac758767395ee0bc3596aedb9d3ea5a84b36","observation_id":"176ca526-b4e5-407d-b01a-254519327832","resolution":{"observed_at":"2026-08-09T11:20:31.939353Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.01825","last_updated":"2023-09-13T03:57:29Z","snapshot_observed_at":"2026-08-16T18:17:11.146813Z","submitted_at":"2023-08-03T15:34:01Z","title":"Scaling Relationship on Learning Mathematical Reasoning with Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.01825","snapshot_observed_at":"2026-08-09T11:20:31.942681Z","title":"Scaling relationship on learning mathematical reasoning with large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.942681Z"},"links":{"cited_paper":"/paper/2308.01825","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:e6db0827f59e2c800cd325493269de5c463ce36e781eabcfaf327512018a3ca1","observation_id":"cfa470f6-c27c-4f23-a3f3-b733823087db","resolution":{"observed_at":"2026-08-09T11:20:31.942681Z","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-09T11:20:31.946092Z","title":"Star: Bootstrapping reasoning with reasoning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.946092Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:1cb5f77062299872462c921a93f0bae3b1984edcc3fb5cf9c2f718cfbe467981","observation_id":"5ea26b77-66fd-4983-8764-58dfa8264b06","resolution":{"observed_at":"2026-08-09T11:20:31.946092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09629","last_updated":"2024-03-18T07:56:48Z","snapshot_observed_at":"2026-08-14T11:24:43.688110Z","submitted_at":"2024-03-14T17:58:16Z","title":"Quiet-STaR: Language Models Can Teach Themselves to Think Before Speaking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09629","snapshot_observed_at":"2026-08-09T11:20:31.949922Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.949922Z"},"links":{"cited_paper":"/paper/2403.09629","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:455cd79e45b4ae9bcc10bd4093dbc36c45eadcbab8536c0f025338d0d7500845","observation_id":"abaf1b98-c8b5-43c9-9b3d-d279852df8cd","resolution":{"observed_at":"2026-08-09T11:20:31.949922Z","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-09T11:20:32.637892Z","title":"and Gao, S","venue":null,"work_id":"96f29b1d-a0c7-4961-b87e-869abfe1405f","year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.953546Z"},"links":{"citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:48db865a35bc8044fe044a68b64f9d2547031473e67e8774b1ec5cda75972530","observation_id":"a64589d9-e0ca-4da1-a245-07214d3ec100","resolution":{"observed_at":"2026-08-09T11:20:32.642416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15240","last_updated":"2025-02-22T10:21:46Z","snapshot_observed_at":"2026-08-17T07:45:48.419891Z","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-09T11:20:31.956829Z","title":"Generative verifiers: Reward modeling as next-token prediction, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.956829Z"},"links":{"cited_paper":"/paper/2408.15240","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:8afc18d9dce20ac6cdaa5f70dc150c5ad7c82f19eb8f3ec11b4f7160268d4c56","observation_id":"958edd1b-4014-4ef3-9bd3-e318dce674e2","resolution":{"observed_at":"2026-08-09T11:20:31.956829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03493","last_updated":"2022-10-07T12:28:21Z","snapshot_observed_at":"2026-07-06T14:01:50.333970Z","submitted_at":"2022-10-07T12:28:21Z","title":"Automatic Chain of Thought Prompting in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03493","snapshot_observed_at":"2026-08-09T11:20:31.960855Z","title":"Automatic chain of thought prompting in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.960855Z"},"links":{"cited_paper":"/paper/2210.03493","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:a9bf50a87f21e354f8350872fb037c6b9981267569209497b700ff32f95cbd04","observation_id":"b0fea989-6671-4fb9-8803-db527ecd73f6","resolution":{"observed_at":"2026-08-09T11:20:31.960855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03268","last_updated":"2023-05-05T03:49:14Z","snapshot_observed_at":"2026-08-16T15:35:27.455987Z","submitted_at":"2023-05-05T03:49:14Z","title":"Verify-and-Edit: A Knowledge-Enhanced Chain-of-Thought Framework","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03268","snapshot_observed_at":"2026-08-09T11:20:31.964267Z","title":"Verify-and-edit: A knowledge-enhanced chain-of-thought framework","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.964267Z"},"links":{"cited_paper":"/paper/2305.03268","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:dd75589bf7fb56a66ffa6357ae034fba5eaafc7c029ed406efe861ec34e6a16d","observation_id":"fbf46d1e-1e33-42d2-bdfd-ae37ef5f27fe","resolution":{"observed_at":"2026-08-09T11:20:31.964267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.14405","last_updated":"2024-11-25T17:57:55Z","snapshot_observed_at":"2026-08-12T15:10:50.113705Z","submitted_at":"2024-11-21T18:37:33Z","title":"Marco-o1: Towards Open Reasoning Models for Open-Ended Solutions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.14405","snapshot_observed_at":"2026-08-09T11:20:31.967745Z","title":"Marco-o1: Towards open reasoning models for open-ended solutions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.967745Z"},"links":{"cited_paper":"/paper/2411.14405","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:cd16b8eefc128c8aae69b26697647fe9cfa13ca6187f6ed69e5932d955ed4931","observation_id":"869d8319-b006-4919-be74-e3315e0e7c52","resolution":{"observed_at":"2026-08-09T11:20:31.967745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.10625","last_updated":"2023-04-16T22:08:08Z","snapshot_observed_at":"2026-08-16T05:27:41.446467Z","submitted_at":"2022-05-21T15:34:53Z","title":"Least-to-Most Prompting Enables Complex Reasoning in Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.10625","snapshot_observed_at":"2026-08-09T11:20:31.971505Z","title":"Least-to-most prompting enables complex reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-09T11:20:31.971505Z"},"links":{"cited_paper":"/paper/2205.10625","citing_paper":"/paper/2502.06813"},"observation_digest":"sha256:97660439c5cc1643836dd5390e3ccf0b641e4e0bfcdcea6d46a845cb5bbcf28c","observation_id":"b8f4a539-3f95-4c88-9c3c-265b6d2536ab","resolution":{"observed_at":"2026-08-09T11:20:31.971505Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.06813","last_updated":"2025-02-04T22:08:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T07:18:35.760709Z","submitted_at":"2025-02-04T22:08:20Z","title":"Policy Guided Tree Search for Enhanced LLM Reasoning"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":66,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":77},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 4 inbound Pith citation observations for arXiv:2502.06813."}