{"as_of":"2026-08-05T03:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:55e3e3646cee1954c35c2d7d9da5560588ad425886b59565d80bac60a3d1d88b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T05:57:23.399019Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.11183","last_updated":"2025-03-22T09:25:06Z","snapshot_observed_at":"2026-07-06T20:37:23.683063Z","submitted_at":"2025-02-16T16:12:01Z","title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls","version":2},"cited_work":{"arxiv_id":"2502.11183","doi":"10.48550/arxiv.2502.11183","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.11183","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InACL: Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics","venue":"ArXiv.org","work_id":"73927996-5e19-403b-8598-8b53d1d2e956","year":null},"citing_paper":{"arxiv_id":"2606.20599","last_updated":"2026-05-19T09:13:21Z","snapshot_observed_at":"2026-08-02T11:31:41.725373Z","submitted_at":"2026-05-19T09:13:21Z","title":"Beyond Fixed Budgets: Characterizing the Inelasticity and Limitations of Tree-of-Thought Reasoning Strategies","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T18:38:48.512777Z"},"links":{"cited_paper":"/paper/2502.11183","citing_paper":"/paper/2606.20599"},"observation_digest":"sha256:818bea0348ed0506b96461c5c2d3a08d65c4ff51a249a4b25091dda03cd7490c","observation_id":"5763fdd1-f621-4eb0-a288-723ab3f551f0","resolution":{"observed_at":"2026-06-30T18:44:59.803872Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11183","last_updated":"2025-03-22T09:25:06Z","snapshot_observed_at":"2026-07-06T20:37:23.683063Z","submitted_at":"2025-02-16T16:12:01Z","title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11183","snapshot_observed_at":"2026-07-14T05:57:23.399019Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11258","last_updated":"2026-07-13T08:40:33Z","snapshot_observed_at":"2026-08-03T20:32:27.270243Z","submitted_at":"2026-07-13T08:40:33Z","title":"TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-14T05:57:23.399019Z"},"links":{"cited_paper":"/paper/2502.11183","citing_paper":"/paper/2607.11258"},"observation_digest":"sha256:7eac404219713f98633f5773fd785d7a5d219d223bd454cd59f275ccddbd4d7f","observation_id":"c83ef373-e90f-4b5d-b982-43e6c8f32776","resolution":{"observed_at":"2026-07-14T05:57:23.399019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.11183/citation-record","integrity":"/paper/2502.11183/integrity","json":"/paper/2502.11183/citation-record.json","paper":"/paper/2502.11183"},"outbound":[],"paper":{"arxiv_id":"2502.11183","last_updated":"2025-03-22T09:25:06Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T20:37:23.683063Z","submitted_at":"2025-02-16T16:12:01Z","title":"Don't Get Lost in the Trees: Streamlining LLM Reasoning by Overcoming Tree Search Exploration Pitfalls"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2502.11183."}