{"as_of":"2026-08-18T06:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:07bffad7a804a67ca56c46b99049fb3ae19c4d7281ecc79beb0892d7214a017c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:02:42.874924Z","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-22T05:51:08.774325Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2502.16235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235","venue":null,"work_id":"083bbe1b-b7d3-44f0-af4a-830cc2bd105f","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":157,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:52a5d2c763e98473efa3eec9a1e4534ad7bbca454d7b9eee21927dcd164fb2cf","observation_id":"e96b94be-0872-4c52-a41d-7a78f2c7d0dc","resolution":{"observed_at":"2026-05-12T08:40:42.129488Z","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.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2502.16235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235","venue":null,"work_id":"083bbe1b-b7d3-44f0-af4a-830cc2bd105f","year":2025},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-11T13:10:23.709172Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:934d78e0702d40b86a1db6560512cd1d41b138eeaf51b9aa503b60606896ac85","observation_id":"0de01068-95e7-4745-902d-860a88ca2a81","resolution":{"observed_at":"2026-05-14T01:29:57.530571Z","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.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-16T12:02:42.874924Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.13828","last_updated":"2025-04-28T12:41:07Z","snapshot_observed_at":"2026-08-18T03:47:57.203659Z","submitted_at":"2025-04-18T17:55:58Z","title":"Generative AI Act II: Test Time Scaling Drives Cognition Engineering","version":3},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-16T12:02:42.874924Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2504.13828"},"observation_digest":"sha256:42df8e749658fe09b2cca54367a9622db3645ae743f48615ba2e16b4c5bb2cb4","observation_id":"67516683-57f7-449e-9b19-ab6c8baba553","resolution":{"observed_at":"2026-08-16T12:02:42.874924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-07T15:36:06.251549Z","title":"Dynamic parallel tree search for efficient LLM reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14681","last_updated":"2025-05-27T09:35:12Z","snapshot_observed_at":"2026-08-16T01:58:52.322671Z","submitted_at":"2025-05-20T17:59:16Z","title":"Two Experts Are All You Need for Steering Thinking: Reinforcing Cognitive Effort in MoE Reasoning Models Without Additional Training","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:36:06.251549Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2505.14681"},"observation_digest":"sha256:9ec4d561e1df2f5e0e3d62acf299137c168e2baf677a622223f678926d2e9665","observation_id":"0eef2f8d-8868-4796-b00b-0a76d99d611e","resolution":{"observed_at":"2026-08-07T15:36:06.251549Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-07T14:49:28.703076Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17481","last_updated":"2025-05-23T05:21:11Z","snapshot_observed_at":"2026-08-14T15:36:22.132413Z","submitted_at":"2025-05-23T05:21:11Z","title":"MARCO: Meta-Reflection with Cross-Referencing for Code Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:49:28.703076Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2505.17481"},"observation_digest":"sha256:d7a713481eb033329be5484f129c1c903b79d547131b5dd6ee64bbd8da1ea4e7","observation_id":"a4e7169c-3d25-432a-8431-d7534ce344cd","resolution":{"observed_at":"2026-08-07T14:49:28.703076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-07T13:53:55.776430Z","title":"Dynamic parallel tree search for efficient llm reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.20643","last_updated":"2025-05-27T02:44:00Z","snapshot_observed_at":"2026-08-17T23:06:13.201500Z","submitted_at":"2025-05-27T02:44:00Z","title":"Can Past Experience Accelerate LLM Reasoning?","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T13:53:55.776430Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2505.20643"},"observation_digest":"sha256:747d44a7fc04cdbb23ae42c53659d6d7100535a93a428113fc3a44609924d501","observation_id":"b77cf157-2608-437d-b359-00e3add75c2f","resolution":{"observed_at":"2026-08-07T13:53:55.776430Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-07T04:26:28.407702Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.10716","last_updated":"2025-06-12T14:05:09Z","snapshot_observed_at":"2026-08-17T12:30:13.330618Z","submitted_at":"2025-06-12T14:05:09Z","title":"PREMISE: Scalable and Strategic Prompt Optimization for Efficient Mathematical Reasoning in Large Models","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:28.407702Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:221adc70254f384fab72b633d47ff705e94c43e28b15684bebfaf3fae8a607b0","observation_id":"8836c54a-ce19-4ed0-99dd-33f3f64ef00b","resolution":{"observed_at":"2026-08-07T04:26:28.407702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-06T23:00:45.915401Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.20160","last_updated":"2025-08-08T09:23:42Z","snapshot_observed_at":"2026-08-13T23:08:33.342539Z","submitted_at":"2025-06-25T06:29:18Z","title":"AALC: Large Language Model Efficient Reasoning via Adaptive Accuracy-Length Control","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T23:00:45.915401Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2506.20160"},"observation_digest":"sha256:c4f506b3278f9ea8809ea3dfc047dae56ed9d72abc802e0f360888cb39b7f8da","observation_id":"ad293dbc-b6e4-4eeb-b56f-d774d25b3502","resolution":{"observed_at":"2026-08-06T23:00:45.915401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-06T20:43:10.273660Z","title":"When more is less: Understanding chain-of-thought length in LLMs","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-14T10:43:51.935390Z","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":22,"source":"pdf_text","source_observed_at":"2026-08-06T20:43:10.273660Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2507.02076"},"observation_digest":"sha256:6ec826c29de93d667fed6745e5a100bc3138334d13ed34836ad2580a9339a255","observation_id":"87e5a839-404a-4717-90ad-3c27acf4f4e0","resolution":{"observed_at":"2026-08-06T20:43:10.273660Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-06T19:16:31.278345Z","title":"Dynamic parallel tree search for efficient llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.06087","last_updated":"2025-07-08T15:28:48Z","snapshot_observed_at":"2026-08-17T15:05:46.725212Z","submitted_at":"2025-07-08T15:28:48Z","title":"CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:16:31.278345Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2507.06087"},"observation_digest":"sha256:52c2f3326d1ea8c00c378dc6b9b0341e1942b2f144ce3823176c0df3eb11a00c","observation_id":"a301fece-92c4-454e-8911-5820cb675e10","resolution":{"observed_at":"2026-08-06T19:16:31.278345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-06T15:37:24.874870Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.15512","last_updated":"2025-09-09T08:04:09Z","snapshot_observed_at":"2026-08-17T16:53:41.064760Z","submitted_at":"2025-07-21T11:28:09Z","title":"Step-level Verifier-guided Hybrid Test-Time Scaling for Large Language Models","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T15:37:24.874870Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2507.15512"},"observation_digest":"sha256:4c4f7e3ac7dc162d6702229f48596aa2ed3ce995e6728895ece2e8410ba91971","observation_id":"bf547cc7-471a-431c-a0fa-dd6c01112d2b","resolution":{"observed_at":"2026-08-06T15:37:24.874870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-08-05T23:32:55.001261Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.05282","last_updated":"2026-07-21T08:08:53Z","snapshot_observed_at":"2026-08-15T21:37:12.668599Z","submitted_at":"2025-08-07T11:26:40Z","title":"Not All Errors Are Created Equal: ASCoT Addresses Late-Stage Fragility in Efficient LLM Reasoning","version":6},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T23:32:55.001261Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2508.05282"},"observation_digest":"sha256:d7e2a25bec0c9358172fe80f1c9394608e2f9a2f21930b6d0615744fc9fc0b70","observation_id":"fe04b8f6-826f-4da9-8c1b-731f3803f7ce","resolution":{"observed_at":"2026-08-05T23:32:55.001261Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2502.16235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235","venue":null,"work_id":"083bbe1b-b7d3-44f0-af4a-830cc2bd105f","year":2025},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-08-17T00:27:13.360022Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":131,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:133117ea1f6020c93ae67263492f0c3b0a83d28a1644416402887ce75eef3ebf","observation_id":"eb9c8398-343c-4579-a2fd-633e3188cf9f","resolution":{"observed_at":"2026-05-11T20:06:09.391667Z","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.16235","last_updated":"2025-02-27T06:39:06Z","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning","version":2},"cited_work":{"arxiv_id":"2502.16235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.16235","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dynamic parallel tree search for efficient llm reasoning.arXiv preprint arXiv:2502.16235","venue":null,"work_id":"083bbe1b-b7d3-44f0-af4a-830cc2bd105f","year":2025},"citing_paper":{"arxiv_id":"2605.22106","last_updated":"2026-05-21T07:40:57Z","snapshot_observed_at":"2026-08-17T19:54:16.769347Z","submitted_at":"2026-05-21T07:40:57Z","title":"ArborKV: Structure-Aware KV Cache Management for Scaling Tree-based LLM Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T05:48:30.118982Z"},"links":{"cited_paper":"/paper/2502.16235","citing_paper":"/paper/2605.22106"},"observation_digest":"sha256:57a94ee5efb2faacc0c884daa7f8d95ac80eedaaaf11fe56ecf4b6f85fc40f9e","observation_id":"c49bdb0d-81f4-447a-89c5-7033e0d8c3ed","resolution":{"observed_at":"2026-05-22T05:51:08.777955Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.16235/citation-record","integrity":"/paper/2502.16235/integrity","json":"/paper/2502.16235/citation-record.json","paper":"/paper/2502.16235"},"outbound":[],"paper":{"arxiv_id":"2502.16235","last_updated":"2025-02-27T06:39:06Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T12:56:06.523688Z","submitted_at":"2025-02-22T14:13:37Z","title":"Dynamic Parallel Tree Search for Efficient LLM Reasoning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2502.16235."}