{"as_of":"2026-08-15T02:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:706dd47e2496028d00d9a79473dc3b5c18f67dc46ae1c9b13540f82e4a3993bd","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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-07T10:35:32.017681Z","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.219301Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.12123","last_updated":"2025-06-06T05:45:58Z","snapshot_observed_at":"2026-08-07T18:11:23.591332Z","submitted_at":"2025-02-17T18:46:32Z","title":"On the Query Complexity of Verifier-Assisted Language Generation","version":2},"cited_work":{"arxiv_id":"2502.12123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12123","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the query complexity of verifier-assisted language generation","venue":null,"work_id":"38cadf25-195c-4541-b04f-5222fa930994","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":57,"source":"pdf_text","source_observed_at":"2026-05-12T08:40:40.910461Z"},"links":{"cited_paper":"/paper/2502.12123","citing_paper":"/paper/2503.09567"},"observation_digest":"sha256:6a92dd0bd84e498ea7cebe3333d954453f469e31637a31a5578660864157dfcd","observation_id":"97692a77-4018-4489-87bd-3d82613808c4","resolution":{"observed_at":"2026-05-12T08:40:41.222493Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12123","last_updated":"2025-06-06T05:45:58Z","snapshot_observed_at":"2026-08-07T18:11:23.591332Z","submitted_at":"2025-02-17T18:46:32Z","title":"On the Query Complexity of Verifier-Assisted Language Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12123","snapshot_observed_at":"2026-08-07T10:35:32.017681Z","title":"Botta, Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05295","last_updated":"2025-06-12T16:25:06Z","snapshot_observed_at":"2026-08-14T06:29:20.553603Z","submitted_at":"2025-06-05T17:48:19Z","title":"Sample Complexity and Representation Ability of Test-time Scaling Paradigms","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T10:35:32.017681Z"},"links":{"cited_paper":"/paper/2502.12123","citing_paper":"/paper/2506.05295"},"observation_digest":"sha256:109a695ca8aec15c86e57bff068a26e078b74a03780420629273bb10f52b4d24","observation_id":"8b46d700-18f4-4b04-8681-1e2041bef902","resolution":{"observed_at":"2026-08-07T10:35:32.017681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12123","last_updated":"2025-06-06T05:45:58Z","snapshot_observed_at":"2026-08-07T18:11:23.591332Z","submitted_at":"2025-02-17T18:46:32Z","title":"On the Query Complexity of Verifier-Assisted Language Generation","version":2},"cited_work":{"arxiv_id":"2502.12123","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12123","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the query complexity of verifier-assisted language generation","venue":null,"work_id":"38cadf25-195c-4541-b04f-5222fa930994","year":2025},"citing_paper":{"arxiv_id":"2604.04855","last_updated":"2026-04-06T16:58:20Z","snapshot_observed_at":"2026-08-11T02:41:21.928926Z","submitted_at":"2026-04-06T16:58:20Z","title":"The Role of Generator Access in Autoregressive Post-Training","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T20:16:46.370831Z"},"links":{"cited_paper":"/paper/2502.12123","citing_paper":"/paper/2604.04855"},"observation_digest":"sha256:7ebc4419831d81c02197322ffbfb9d21c3403f2a1658f2e00a8f750a37150674","observation_id":"a3b7b54b-fd94-4d45-b4de-c7778b4593ad","resolution":{"observed_at":"2026-05-10T22:05:48.114757Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.12123/citation-record","integrity":"/paper/2502.12123/integrity","json":"/paper/2502.12123/citation-record.json","paper":"/paper/2502.12123"},"outbound":[],"paper":{"arxiv_id":"2502.12123","last_updated":"2025-06-06T05:45:58Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T18:11:23.591332Z","submitted_at":"2025-02-17T18:46:32Z","title":"On the Query Complexity of Verifier-Assisted Language Generation"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2502.12123."}