{"as_of":"2026-08-05T11:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:170d72a88cc8c4e40e24efe4564461c1f8dd1bfe776d3a411dbb30808af49ae6","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":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T00:04:00.084214Z","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":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-03T03:23:56.857266Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-05-14T01:29:56.480020Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2503.16419"},"observation_digest":"sha256:8b8d4dabbefe6b907b34dd8f0db254738908238682244dad86df7b4f90bd0be3","observation_id":"bcec02f8-e6ff-473a-8f3b-0cbd1a804409","resolution":{"observed_at":"2026-05-14T01:29:57.246050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2505.15436","last_updated":"2025-12-05T05:44:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T12:18:15Z","title":"Adaptive Chain-of-Focus Reasoning via Dynamic Visual Search and Zooming for Efficient VLMs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-17T05:35:13.118221Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2505.15436"},"observation_digest":"sha256:dcf98df784f0dba85a0f0caf5f1300018de8b472202257bc5c765e511210612f","observation_id":"c7ed6251-5e1d-4de9-a306-712159e8ad51","resolution":{"observed_at":"2026-05-17T05:35:13.236480Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T00:04:00.084214Z","title":"Reward-guided speculative decoding for efficient llm reasoning.arXiv preprint arXiv:2501.19324, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.06174","last_updated":"2025-09-07T19:00:44Z","snapshot_observed_at":"2026-08-05T00:03:56.592916Z","submitted_at":"2025-09-07T19:00:44Z","title":"From Long to Short: LLMs Excel at Trimming Own Reasoning Chains","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T00:04:00.084214Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2509.06174"},"observation_digest":"sha256:d8679ac76b9fa0f3053cb3abac668aa6fce4d51323f9a5856a1a4c6833ab9962","observation_id":"ea256494-2030-4bbb-ba13-a7d696c27044","resolution":{"observed_at":"2026-08-05T00:04:00.084214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-04T14:43:13.834755Z","title":"Reward- Guided Speculative Decoding for Efficient LLM Reasoning , June 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.23876","last_updated":"2026-07-04T08:20:05Z","snapshot_observed_at":"2026-08-04T14:42:51.935900Z","submitted_at":"2025-09-28T13:33:49Z","title":"Rethinking Visual Autoregressive Sampling with Information-Grounding Guidance","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T14:43:13.834755Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2509.23876"},"observation_digest":"sha256:e5903575a8116ee2219cee3139d66d5e8ed2b110ed2e43bc270d54c8d9c79828","observation_id":"f0e449cb-e897-4b6a-9b53-f4b6d1e66884","resolution":{"observed_at":"2026-08-04T14:43:13.834755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-04T13:15:44.660507Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.01167","last_updated":"2026-05-30T06:40:26Z","snapshot_observed_at":"2026-08-04T13:15:39.949629Z","submitted_at":"2025-10-01T17:54:15Z","title":"Simultaneous Multi-objective Alignment Across Verifiable and Non-verifiable Rewards","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T13:15:44.660507Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2510.01167"},"observation_digest":"sha256:ddd6ff9ddc2b6c234d7175ac55680a0b625ed83766a2d633e636ef528ae5f995","observation_id":"b28f02d8-d9ba-475a-8e33-0fd3b860cb39","resolution":{"observed_at":"2026-08-04T13:15:44.660507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-04T11:16:36.269089Z","title":"Reward-guided speculative decoding for efficient llm reasoning.arXiv preprint arXiv:2501.19324,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.06052","last_updated":"2026-06-08T08:05:28Z","snapshot_observed_at":"2026-08-04T11:16:34.304112Z","submitted_at":"2025-10-07T15:46:34Z","title":"MixReasoning: Switching Modes to Think","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T11:16:36.269089Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2510.06052"},"observation_digest":"sha256:5c9f6c079e2256fc273c1417ea8b04429aa2e47780883ada44bfa5f62b4977da","observation_id":"6fcb612f-1c20-47a5-96de-8b4e4f5eda65","resolution":{"observed_at":"2026-08-04T11:16:36.269089Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.06116","last_updated":"2026-05-07T12:26:56Z","snapshot_observed_at":"2026-08-05T05:40:12.122604Z","submitted_at":"2026-05-07T12:26:56Z","title":"Policy-Guided Stepwise Model Routing for Cost-Effective Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T10:29:23.538806Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.06116"},"observation_digest":"sha256:64336ff8d6f4ac7a18d667bfa285453a60e992b6ef1f355e306dd927ed3c75ac","observation_id":"8a082f96-ef59-4865-b01f-3914f9c8a059","resolution":{"observed_at":"2026-05-11T20:01:11.844961Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.06165","last_updated":"2026-05-07T12:51:49Z","snapshot_observed_at":"2026-07-06T23:18:41.400741Z","submitted_at":"2026-05-07T12:51:49Z","title":"Post Reasoning: Improving the Performance of Non-Thinking Models at No Cost","version":1},"reference_index":115,"source":"arxiv_source","source_observed_at":"2026-05-08T10:19:08.451445Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.06165"},"observation_digest":"sha256:33fc70c35f79a8b9ffee63086cab5932a9a28565b062c3f60a2b2a75917f5f1c","observation_id":"beb4d729-6445-4488-a429-aa9471f96554","resolution":{"observed_at":"2026-05-11T20:06:09.780452Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.10195","last_updated":"2026-05-14T07:42:56Z","snapshot_observed_at":"2026-08-03T09:42:12.047946Z","submitted_at":"2026-05-11T08:45:17Z","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-12T03:51:52.375703Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:164dd24ff70013aacbc483302885eacd6b51c35b1487849a73c07524f3f7c679","observation_id":"b1bc2428-7e1f-4d2d-a8f2-886b8997ceac","resolution":{"observed_at":"2026-05-12T06:51:30.110828Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.10195","last_updated":"2026-05-14T07:42:56Z","snapshot_observed_at":"2026-08-03T09:42:12.047946Z","submitted_at":"2026-05-11T08:45:17Z","title":"Breaking the Reward Barrier: Accelerating Tree-of-Thought Reasoning via Speculative Exploration","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-15T05:11:32.053440Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.10195"},"observation_digest":"sha256:1733feb5faa38f7272c9e272a57b359f48643290e4f6f97218228e300ddbd5de","observation_id":"b9aa2bb9-de64-4d15-9a03-810c6695c4bd","resolution":{"observed_at":"2026-05-15T05:15:03.414244Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.14098","last_updated":"2026-05-13T20:33:59Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-13T20:33:59Z","title":"Pause and Reflect: Conformal Aggregation for Chain-of-Thought Reasoning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-15T02:23:22.298606Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.14098"},"observation_digest":"sha256:c08c8523568eb98a5bb9cfc6952413c38e5c4bf574c03c7ac101b51c4a3f57f5","observation_id":"6b4b70f5-f254-4976-8fd3-020ac22a6c20","resolution":{"observed_at":"2026-05-15T02:23:31.576800Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2605.14978","last_updated":"2026-05-15T02:45:40Z","snapshot_observed_at":"2026-07-06T23:26:18.733776Z","submitted_at":"2026-05-14T15:41:57Z","title":"Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-19T16:40:17.370100Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2605.14978"},"observation_digest":"sha256:5fa5f880e38865e4d47989bb33a2731998340aa16eedc38df502bb5ca6ec9e4a","observation_id":"6528dc9d-a31c-44d6-937c-719ad32bb994","resolution":{"observed_at":"2026-05-19T16:42:39.750479Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.03503","last_updated":"2026-06-02T11:21:27Z","snapshot_observed_at":"2026-08-02T04:20:08.895288Z","submitted_at":"2026-06-02T11:21:27Z","title":"ThoughtFold: Folding Reasoning Chains via Introspective Preference Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T10:07:16.700499Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.03503"},"observation_digest":"sha256:6b82984078b1c8628fe30d8235aed99793ca89992d168fc4e9683d89e1ac6c5b","observation_id":"8c66803d-ef90-423c-94bd-8205ca26b35d","resolution":{"observed_at":"2026-07-02T03:26:28.717883Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.10403","last_updated":"2026-06-11T09:33:19Z","snapshot_observed_at":"2026-07-31T16:50:09.777225Z","submitted_at":"2026-06-09T04:25:44Z","title":"KCSAT-ML: Probing Reasoning Models with Nationwide-Cohort Human Difficulty","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T13:07:59.509660Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.10403"},"observation_digest":"sha256:ad462914353b2093093c309fd124df81bcc93c9df2c051437fd81bbebbcbd75a","observation_id":"0486a096-6862-4eef-87df-9433fe9830e1","resolution":{"observed_at":"2026-06-27T13:10:55.947824Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.11470","last_updated":"2026-06-09T21:59:37Z","snapshot_observed_at":"2026-07-06T23:50:35.052764Z","submitted_at":"2026-06-09T21:59:37Z","title":"The Periodic Table of LLM Reasoning: A Structured Survey of Reasoning Paradigms, Methods, and Failure Modes","version":1},"reference_index":145,"source":"arxiv_source","source_observed_at":"2026-06-27T12:59:51.091008Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.11470"},"observation_digest":"sha256:66cc6713f2cf006ce9af0d04bb226aad6fadc8791edfafa52904625d11e5f9fe","observation_id":"d2fb637d-0b15-42bd-9b2f-e1d868ee854d","resolution":{"observed_at":"2026-07-03T05:57:41.512993Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-25T21:29:40.564852Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:ec4323e373b1ee1b47ccd36d26eaf2686792f6ab27bfcc390c9925039417f225","observation_id":"c7a64538-8131-4f38-9c2b-110847bc4108","resolution":{"observed_at":"2026-07-04T19:20:06.711514Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-07-06T23:59:47.542695Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-01T06:33:45.824727Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:8c99e8bd42cc6e4ddd4f5ec13628643750d032c0808c6684390c09b63cb172ed","observation_id":"aac4b144-e9fe-4ae3-a728-0a9b1dbe4f9d","resolution":{"observed_at":"2026-07-01T06:35:29.567228Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":"2501.19324","doi":"10.48550/arxiv.2501.19324","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":"UvA-DARE (University of Amsterdam)","work_id":"460cb265-1bb5-4de5-a476-57fe86423688","year":2025},"citing_paper":{"arxiv_id":"2606.30217","last_updated":"2026-06-29T12:30:24Z","snapshot_observed_at":"2026-08-03T23:12:01.383471Z","submitted_at":"2026-06-29T12:30:24Z","title":"Before Thinking, Learn to Decide: Proactive Routing for Efficient Visual Reasoning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T05:55:19.083517Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2606.30217"},"observation_digest":"sha256:b72930a648b7665508bf0d4e17e470672e9590d8939d462d298c115ce5a413bd","observation_id":"928758a2-7325-4ee5-a6b3-a370bab1e0a7","resolution":{"observed_at":"2026-06-30T13:34:41.134711Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-02T02:42:03.779702Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.14277","last_updated":"2026-07-15T18:36:54Z","snapshot_observed_at":"2026-08-02T02:42:00.070125Z","submitted_at":"2026-07-15T18:36:54Z","title":"Multi-Head Latent Control: A Unified Interface for LLM Agent Decision Making","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T02:42:03.779702Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2607.14277"},"observation_digest":"sha256:879351c071e3c959d448fdae6b17f85433d4e1a54f9653f1e97d0b3c02a4366e","observation_id":"84169b7c-5669-40d0-9f03-9c4d03678213","resolution":{"observed_at":"2026-08-02T02:42:03.779702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-01T21:04:09.724503Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.16421","last_updated":"2026-07-17T18:13:38Z","snapshot_observed_at":"2026-08-04T05:46:36.484315Z","submitted_at":"2026-07-17T18:13:38Z","title":"When to Plan: Learning to Select Between Reactive Control and Deliberative Planning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T21:04:09.724503Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2607.16421"},"observation_digest":"sha256:2213fabef192570bef03455bb075849533fe8180f2d48aba932bb2778fe83672","observation_id":"8ba2f2ae-deba-4dbb-a4f7-8e2ef50281cd","resolution":{"observed_at":"2026-08-01T21:04:09.724503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19324","snapshot_observed_at":"2026-08-01T18:49:28.872386Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17188","last_updated":"2026-07-19T11:00:59Z","snapshot_observed_at":"2026-08-05T08:32:47.677769Z","submitted_at":"2026-07-19T11:00:59Z","title":"Is Your Model Thinking or Just Stagnating? PUMA: Diagnosing Reasoning Pathology via Phase-Momentum Alignment","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T18:49:28.872386Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2607.17188"},"observation_digest":"sha256:b0f988e27367b4980af6144ff8945df3927c769affcab67e35e3ee8201670060","observation_id":"14bc6ab4-22d8-4176-9126-858b46c5137c","resolution":{"observed_at":"2026-08-01T18:49:28.872386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.19324/citation-record","integrity":"/paper/2501.19324/integrity","json":"/paper/2501.19324/citation-record.json","paper":"/paper/2501.19324"},"outbound":[],"paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T20:29:07.258163Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding 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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2501.19324."}