{"as_of":"2026-08-09T22:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c86899cf3a41a40b216dd0e92871f56ed898aaa4d5cf81a1a7a0a0b6c5c0ea93","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T19:23:26.679768Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:05:45.782782Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-12T08:40:41.888381Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"cited_work":{"arxiv_id":"2502.05449","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.05449","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Iterative deepening sampling for large language models","venue":null,"work_id":"5bc450c8-5c3e-4809-b3e8-bf89cc0b6aa0","year":2025},"citing_paper":{"arxiv_id":"2503.09567","last_updated":"2025-07-18T15:57:54Z","snapshot_observed_at":"2026-08-08T22:33:20.124926Z","submitted_at":"2025-03-12T17:35:03Z","title":"Towards Reasoning Era: A Survey of Long Chain-of-Thought for Reasoning Large Language Models","version":5},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.05449","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:415b1b88dc64e9c9780959aa67662e1da8aea64c1a94fdc1d0ebe2fc0110606a","observation_id":"835ce9f5-f6ff-4bba-8d26-548b1f1557a5","resolution":{"observed_at":"2026-05-12T08:40:41.891609Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05449","snapshot_observed_at":"2026-08-07T06:05:45.782782Z","title":"Iterative deepening sampling for large language models.arXiv preprint arXiv:2502.05449,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.06215","last_updated":"2025-06-06T16:21:35Z","snapshot_observed_at":"2026-08-08T05:28:50.305297Z","submitted_at":"2025-06-06T16:21:35Z","title":"Corrector Sampling in Language Models","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T06:05:45.782782Z"},"links":{"cited_paper":"/paper/2502.05449","citing_paper":"/paper/2506.06215"},"observation_digest":"sha256:6c4b1646fba32eeda461e83e388c6617a8baa1704b5fd16d01de44022b0c07b8","observation_id":"b8ece92b-c42e-482c-b094-1ba049dab7c5","resolution":{"observed_at":"2026-08-07T06:05:45.782782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05449","snapshot_observed_at":"2026-08-06T20:43:11.199591Z","title":"Iterative deepening sampling for large language models.arXiv preprint arXiv:2502.05449, 2025c","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.02076","last_updated":"2025-07-02T18:27:42Z","snapshot_observed_at":"2026-08-08T01:09:25.758170Z","submitted_at":"2025-07-02T18:27:42Z","title":"Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T20:43:11.199591Z"},"links":{"cited_paper":"/paper/2502.05449","citing_paper":"/paper/2507.02076"},"observation_digest":"sha256:24c12463614f8fbfae7c6a1932708a69efaa53dda4f7b42e21764f4cd38a5f52","observation_id":"45f3e798-c635-4d6e-b844-b006fe003d35","resolution":{"observed_at":"2026-08-06T20:43:11.199591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.05449/citation-record","integrity":"/paper/2502.05449/integrity","json":"/paper/2502.05449/citation-record.json","paper":"/paper/2502.05449"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08905","last_updated":"2024-12-12T03:37:41Z","snapshot_observed_at":"2026-08-05T04:04:21.846023Z","submitted_at":"2024-12-12T03:37:41Z","title":"Phi-4 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08905","snapshot_observed_at":"2026-08-08T19:23:26.225408Z","title":"J., Javaheripi, M., Kauffmann, P., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.225408Z"},"links":{"cited_paper":"/paper/2412.08905","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:31fd86727453efa9a3bde1e97459453dd7c57923c6e4c81ba9e4376e65898335","observation_id":"2f306317-31aa-4e63-a0e1-c14f30a893f2","resolution":{"observed_at":"2026-08-08T19:23:26.225408Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.11738","last_updated":"2024-02-21T12:59:21Z","snapshot_observed_at":"2026-07-31T18:12:14.483728Z","submitted_at":"2023-05-19T15:19:44Z","title":"CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.11738","snapshot_observed_at":"2026-08-08T19:23:26.300496Z","title":"Critic: Large language models can self- correct with tool-interactive critiquing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.300496Z"},"links":{"cited_paper":"/paper/2305.11738","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:746cab789906dd2ddbd5aaa12a543f0845aca7e3c2d40145de932d1f13df512c","observation_id":"8534e3c7-27d6-40f0-9adc-d2a2bc851856","resolution":{"observed_at":"2026-08-08T19:23:26.300496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.04519","last_updated":"2025-01-08T14:12:57Z","snapshot_observed_at":"2026-08-04T20:57:22.329262Z","submitted_at":"2025-01-08T14:12:57Z","title":"rStar-Math: Small LLMs Can Master Math Reasoning with Self-Evolved Deep Thinking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.04519","snapshot_observed_at":"2026-08-08T19:23:26.305225Z","title":"L., Liu, Y ., Shang, N., Sun, Y ., Zhu, Y ., Yang, F., and Yang, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.305225Z"},"links":{"cited_paper":"/paper/2501.04519","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:ecc3edcda5846a03de4a4d413edb3e9e91f3baceef8f8e196e089dec73f6011c","observation_id":"d9fb27c5-3ba9-4b3c-a5b9-5fc998f8172d","resolution":{"observed_at":"2026-08-08T19:23:26.305225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14992","last_updated":"2023-10-23T07:24:28Z","snapshot_observed_at":"2026-07-06T15:32:25.931739Z","submitted_at":"2023-05-24T10:28:28Z","title":"Reasoning with Language Model is Planning with World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.14992","snapshot_observed_at":"2026-08-08T19:23:26.407410Z","title":"J., Wang, Z., Wang, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.407410Z"},"links":{"cited_paper":"/paper/2305.14992","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:27c194d1dbc7bb1c949ecd44ec1964890aee70bb137150bdf4afce31b17f0a10","observation_id":"0d9bbac5-c843-4e4d-8581-e45a4babaf23","resolution":{"observed_at":"2026-08-08T19:23:26.407410Z","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-07-06T02:11:23.670680Z","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-08T19:23:26.459491Z","title":"S., Yu, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.459491Z"},"links":{"cited_paper":"/paper/2310.01798","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:126e6829e071293968b3fcf21dec88fa906e777760c32d97ccb1775db4b144c8","observation_id":"2c7e76ae-d76d-4b6d-b37f-56a87001c344","resolution":{"observed_at":"2026-08-08T19:23:26.459491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16489","last_updated":"2024-11-25T15:31:27Z","snapshot_observed_at":"2026-07-06T19:56:39.115630Z","submitted_at":"2024-11-25T15:31:27Z","title":"O1 Replication Journey -- Part 2: Surpassing O1-preview through Simple Distillation, Big Progress or Bitter Lesson?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.16489","snapshot_observed_at":"2026-08-08T19:23:26.463205Z","title":"O1 replication journey–part 2: Surpassing o1-preview through simple distillation, big progress or bitter lesson? arXiv preprint arXiv:2411.16489,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.463205Z"},"links":{"cited_paper":"/paper/2411.16489","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:2307db19cdedbba38696b0c04582b2ee64d0bd2f43d0ab6e096d5a1ae9d04642","observation_id":"061c1b28-cf6b-4c55-893e-19b4692aa84a","resolution":{"observed_at":"2026-08-08T19:23:26.463205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-08T19:23:26.467995Z","title":"Openai o1 system card","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.467995Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:57fd19b0095516dc73d9348bab36168b8fcbfdc971c942a9f6d598d6a3755fc3","observation_id":"f8353a63-32f0-4b53-937c-b80b9281e030","resolution":{"observed_at":"2026-08-08T19:23:26.467995Z","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-05T13:11:04.104454Z","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-08T19:23:26.472548Z","title":"Let’s verify step by step","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.472548Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:5ea5b4a00d41cc4fe7443ef22df118c37d7163a720b009b73e2164b0c0df7e02","observation_id":"20fb32f0-d7df-4e6e-bba7-eebf365e0b47","resolution":{"observed_at":"2026-08-08T19:23:26.472548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15028","last_updated":"2024-04-02T17:51:49Z","snapshot_observed_at":"2026-07-06T16:23:53.247204Z","submitted_at":"2023-09-26T15:57:57Z","title":"Don't throw away your value model! Generating more preferable text with Value-Guided Monte-Carlo Tree Search decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15028","snapshot_observed_at":"2026-08-08T19:23:26.477154Z","title":"Making ppo even better: Value- guided monte-carlo tree search decoding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.477154Z"},"links":{"cited_paper":"/paper/2309.15028","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:7a1fbeeb02335036fc82e5901df4dafdb00c026c771344d018998a292855838d","observation_id":"694b5fa9-d7b8-4431-8935-9c5c175328de","resolution":{"observed_at":"2026-08-08T19:23:26.477154Z","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-08T19:23:26.481446Z","title":"V ., Patel, A., Adlakha, V ., Aghajohari, M., BehnamGhader, P., Bhatia, M., Khandelwal, A., Kraft, A., Krojer, B., L`u, X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.481446Z"},"links":{"citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:9396e1a5dfc277482ce831ad74095779480f99e0538b794d7d7fb113f9fdbbe5","observation_id":"2812767a-59a3-40a0-bdd3-4cb9571ef80f","resolution":{"observed_at":"2026-08-08T19:23:26.481446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-07-06T20:29:11.710285Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-08-08T19:23:26.486210Z","title":"L., Fei-Fei, L., Hajishirzi, H., Zettlemoyer, L., Liang, P., Cand `es, E., and Hashimoto, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.486210Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:eb4ed13cd01512bc681b0a0252a9614985d27bf45e0d41f9c74fb694efac5229","observation_id":"64e2d68f-2521-42a6-8b6e-fdf272c43642","resolution":{"observed_at":"2026-08-08T19:23:26.486210Z","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-08T19:23:26.490001Z","title":"nips.cc/paper_files/paper/2023/file/ 1b44b878bb782e6954cd888628510e90-Paper-Conference","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.490001Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:8828c0b636df5fee4ce7aef947145399d872e13f4b6de4b77250d1ba820418a9","observation_id":"8f15e729-070c-482a-a992-d11b32dffbf2","resolution":{"observed_at":"2026-08-08T19:23:26.490001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.20290","last_updated":"2024-10-31T18:27:13Z","snapshot_observed_at":"2026-08-03T23:26:49.562857Z","submitted_at":"2024-10-26T23:20:48Z","title":"Fast Best-of-N Decoding via Speculative Rejection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.20290","snapshot_observed_at":"2026-08-08T19:23:26.494254Z","title":"Fast best- of-n decoding via speculative rejection","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.494254Z"},"links":{"cited_paper":"/paper/2410.20290","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:9042d2b1ddeccc0c467f6a393a5ae69ee5fd82d403f3c192e2860aa8c478c92c","observation_id":"e6ad192f-0599-483d-999e-8250c61e21f5","resolution":{"observed_at":"2026-08-08T19:23:26.494254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13966","last_updated":"2024-05-22T20:05:49Z","snapshot_observed_at":"2026-07-06T18:18:12.096996Z","submitted_at":"2024-05-22T20:05:49Z","title":"On the Brittle Foundations of ReAct Prompting for Agentic Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.13966","snapshot_observed_at":"2026-08-08T19:23:26.537298Z","title":"On the brittle foundations of react prompting for agentic large language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.537298Z"},"links":{"cited_paper":"/paper/2405.13966","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:a7b1600ccc6ec4eda2d339c581826cc1532b8bc31284289dd6f3f8f0bb247763","observation_id":"f5d2c2d7-13e9-4188-b4e8-92ef5ead0439","resolution":{"observed_at":"2026-08-08T19:23:26.537298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14047","last_updated":"2026-08-01T01:08:19Z","snapshot_observed_at":"2026-08-07T16:01:01.608880Z","submitted_at":"2025-04-18T19:32:55Z","title":"Rethinking Inference-Time Scaling: Efficiency Limits and Linguistic Signals","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.14047","snapshot_observed_at":"2026-08-08T19:23:26.596654Z","title":"L., Zhang, C., Dhingra, B., and Zou, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.596654Z"},"links":{"cited_paper":"/paper/2504.14047","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:45774082a991940379f363fe33f785a9166ed9c68c464ce19e292cbef77fe371","observation_id":"15c831c6-742f-4d5a-b80f-194e6211e26c","resolution":{"observed_at":"2026-08-08T19:23:26.596654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10200","last_updated":"2024-05-23T20:53:59Z","snapshot_observed_at":"2026-07-06T17:30:47.845775Z","submitted_at":"2024-02-15T18:55:41Z","title":"Chain-of-Thought Reasoning Without Prompting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10200","snapshot_observed_at":"2026-08-08T19:23:26.649729Z","title":"and Zhou, D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.649729Z"},"links":{"cited_paper":"/paper/2402.10200","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:57c8fda94cb8555d2dece299fda8b4c0e250029d0b1f843f6ffcbbc0013770d2","observation_id":"8340434e-fe6f-4a0a-b3ed-f2631ad74a61","resolution":{"observed_at":"2026-08-08T19:23:26.649729Z","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-07-06T12:50:22.773056Z","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-08T19:23:26.654411Z","title":"Self-consistency im- proves chain of thought reasoning in language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.654411Z"},"links":{"cited_paper":"/paper/2203.11171","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:13e9963b16c5b3b06288b784b5524a415e33f0b931cbebba75df9d1d38446313","observation_id":"f301cddc-bc5a-4ddb-b0f9-5aacbd8f5363","resolution":{"observed_at":"2026-08-08T19:23:26.654411Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14135","last_updated":"2024-12-18T18:24:47Z","snapshot_observed_at":"2026-08-09T21:09:30.612905Z","submitted_at":"2024-12-18T18:24:47Z","title":"Scaling of Search and Learning: A Roadmap to Reproduce o1 from Reinforcement Learning Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14135","snapshot_observed_at":"2026-08-08T19:23:26.662779Z","title":"Zeng, Z., Cheng, Q., Yin, Z., Wang, B., Li, S., Zhou, Y ., Guo, Q., Huang, X., and Qiu, X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.662779Z"},"links":{"cited_paper":"/paper/2412.14135","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:ea1bd990013bb81f33cbf82c2570a736791507d7c52739e5e88691b306b0631f","observation_id":"9b05b5d7-10b5-4be4-b02b-bf5b52ae3a55","resolution":{"observed_at":"2026-08-08T19:23:26.662779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07394","last_updated":"2024-06-13T07:19:06Z","snapshot_observed_at":"2026-07-06T18:29:00.001236Z","submitted_at":"2024-06-11T16:01:07Z","title":"Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8B","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07394","snapshot_observed_at":"2026-08-08T19:23:26.666844Z","title":"Accessing gpt-4 level mathematical olympiad solutions via monte carlo tree self-refine with llama-3 8b","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.666844Z"},"links":{"cited_paper":"/paper/2406.07394","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:b7f84355acd0d2aa083492da3463dd2a14d09f67bbb3faeae29ab5ed870fc83c","observation_id":"59fb88ec-0b79-46a6-bdbf-8e746a0419f3","resolution":{"observed_at":"2026-08-08T19:23:26.666844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.07301","last_updated":"2025-06-05T16:34:24Z","snapshot_observed_at":"2026-08-03T11:11:25.359494Z","submitted_at":"2025-01-13T13:10:16Z","title":"The Lessons of Developing Process Reward Models in Mathematical Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07301","snapshot_observed_at":"2026-08-08T19:23:26.670683Z","title":"The lessons of developing process reward models in mathematical reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.670683Z"},"links":{"cited_paper":"/paper/2501.07301","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:ec643accd4694563bc635fd1d0e4b717b8e8bd5556fe91f4f0114c6795fe33df","observation_id":"6ed22220-ff2d-49c2-936c-5b22c09d76bb","resolution":{"observed_at":"2026-08-08T19:23:26.670683Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.04406","last_updated":"2024-06-06T02:51:17Z","snapshot_observed_at":"2026-08-06T23:53:10.606737Z","submitted_at":"2023-10-06T17:55:11Z","title":"Language Agent Tree Search Unifies Reasoning Acting and Planning in Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.04406","snapshot_observed_at":"2026-08-08T19:23:26.675851Z","title":"Language agent tree search unifies reasoning acting and planning in language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.675851Z"},"links":{"cited_paper":"/paper/2310.04406","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:84a5d05fa9b080c2a4a949ad26ce5a4b8e4bce606119fbed15581a58b7fec017","observation_id":"df0aedc1-2d1d-49f2-b7b6-eea041a7b389","resolution":{"observed_at":"2026-08-08T19:23:26.675851Z","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-08T19:23:27.180272Z","title":"As a re- sult, most standard non-mathematical datasets are not well aligned with the objectives of this study","venue":null,"work_id":"89308cd8-813f-4b16-a70a-29d2d63a383e","year":2025},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.679768Z"},"links":{"citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:45f0a80d98e666fcc7a1d9fca456e900b7d7ec45dfd6371d6f89f79d93013c17","observation_id":"bb835118-62d6-47e1-9634-e318baa76cb0","resolution":{"observed_at":"2026-08-08T19:23:27.248904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.03553","last_updated":"2024-09-27T08:16:28Z","snapshot_observed_at":"2026-08-08T14:49:36.757543Z","submitted_at":"2024-05-06T15:20:30Z","title":"AlphaMath Almost Zero: Process Supervision without Process","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.03553","snapshot_observed_at":"2026-08-08T19:23:26.279454Z","title":"findings-emnlp.463","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":463,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.279454Z"},"links":{"cited_paper":"/paper/2405.03553","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:cdd95bfe0dc84670955bcbee8e9ef86198670db3d6eae3026b3ced1da2aa2480","observation_id":"cea037dc-7b08-46f4-8717-cedc7b7d32eb","resolution":{"observed_at":"2026-08-08T19:23:26.279454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11132","last_updated":"2025-02-13T21:38:42Z","snapshot_observed_at":"2026-07-06T18:31:53.591578Z","submitted_at":"2024-06-17T01:23:11Z","title":"RePrompt: Planning by Automatic Prompt Engineering for Large Language Models Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11132","snapshot_observed_at":"2026-08-08T19:23:26.286580Z","title":"Reprompt: Plan- ning by automatic prompt engineering for large language models agents","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.286580Z"},"links":{"cited_paper":"/paper/2406.11132","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:aeebe2740315015b741976c024025fb0c24413dcc5475e72b4b84b09af139343","observation_id":"fd05ab1f-b1c7-452e-a023-64c57dacae3b","resolution":{"observed_at":"2026-08-08T19:23:26.286580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01574","last_updated":"2024-11-06T02:54:00Z","snapshot_observed_at":"2026-08-06T00:29:17.674418Z","submitted_at":"2024-06-03T17:53:00Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01574","snapshot_observed_at":"2026-08-08T19:23:26.658678Z","title":"Mmlu-pro: A more robust and challenging multi-task language under- standing benchmark","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.658678Z"},"links":{"cited_paper":"/paper/2406.01574","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:8a8c764d2b2d37e5df0e0949d7d2593f73156dfb1a7e122c7c7c3998c1289fdb","observation_id":"a7172746-87d7-40c3-b7fd-2a5d87048863","resolution":{"observed_at":"2026-08-08T19:23:26.658678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10890","last_updated":"2024-06-06T14:55:40Z","snapshot_observed_at":"2026-07-06T17:31:17.058043Z","submitted_at":"2024-02-16T18:45:58Z","title":"When is Tree Search Useful for LLM Planning? It Depends on the Discriminator","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10890","snapshot_observed_at":"2026-08-08T19:23:26.291156Z","title":"When is tree search useful for llm plan- ning? it depends on the discriminator","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.291156Z"},"links":{"cited_paper":"/paper/2402.10890","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:373746049d367ab8047bb2c4076fc30b78230e1a6fa5b04df6b7f4bcaee73968","observation_id":"00fdb688-d4b2-4cbf-8f2c-63fa32f4f3dd","resolution":{"observed_at":"2026-08-08T19:23:26.291156Z","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-08T19:23:26.273352Z","title":"Step-level value preference optimization for mathematical reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.273352Z"},"links":{"citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:907e6c1cca90a6b37b4bea88b425836ccf90429b6cd36682cb1bfc962c13d5a7","observation_id":"fbdb90fd-1f53-45b1-be04-5b62826ea277","resolution":{"observed_at":"2026-08-08T19:23:26.273352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-08T19:23:26.295697Z","title":"Dubey, A., Jauhri, A., Pandey, A., Kadian, A., Al-Dahle, A., Letman, A., Mathur, A., Schelten, A., Yang, A., Fan, A., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T19:23:26.295697Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2502.05449"},"observation_digest":"sha256:e4d15f4e68ae61fe109995cc04d1750be5ad7c66b748d06de73b12d8b51c7099","observation_id":"910d3997-4738-4fba-b24b-34351b4fddb5","resolution":{"observed_at":"2026-08-08T19:23:26.295697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.05449","last_updated":"2025-06-01T20:14:16Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T21:10:05.771233Z","submitted_at":"2025-02-08T04:39:51Z","title":"Iterative Deepening Sampling as Efficient Test-Time Scaling"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":28},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 3 inbound Pith citation observations for arXiv:2502.05449."}