{"as_of":"2026-08-09T17:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:24e905f9d2eef0037e578f8af836be26096012d18851627ee190c187d5295410","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":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:23:03.610978Z","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-07T04:27:23.738927Z","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:5580835992c95d874bca44546187ce8bcf6c4756ae011262c15ce0e0c5be783d","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-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":"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-07T15:23:03.610978Z","title":"InProceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 24312–24320","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15400","last_updated":"2025-05-23T02:38:57Z","snapshot_observed_at":"2026-08-08T07:06:45.509430Z","submitted_at":"2025-05-21T11:41:39Z","title":"When to Continue Thinking: Adaptive Thinking Mode Switching for Efficient Reasoning","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:23:03.610978Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2505.15400"},"observation_digest":"sha256:6b1e3d6166906180a2e7306dd2509ff47263cbf87704678feaa722fe3ddaa60e","observation_id":"611322b8-23fc-4a20-81c5-a72412382bc8","resolution":{"observed_at":"2026-08-07T15:23:03.610978Z","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":"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:adc6d023fabb6b5cee8355fed954de4620d91be25f36037e21be518ae33d02ce","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-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":"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-07T14:42:12.665171Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.17941","last_updated":"2025-05-23T14:17:56Z","snapshot_observed_at":"2026-08-09T06:05:38.396561Z","submitted_at":"2025-05-23T14:17:56Z","title":"VeriThinker: Learning to Verify Makes Reasoning Model Efficient","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:42:12.665171Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2505.17941"},"observation_digest":"sha256:b6e8fdd70ccb433a46bc9ad20c656b47872a2a0146675daa74aecbca70959038","observation_id":"32740862-8c87-4e4b-861e-6b4eee0e0851","resolution":{"observed_at":"2026-08-07T14:42:12.665171Z","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-07T14:32:41.836423Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18629","last_updated":"2025-05-24T10:26:27Z","snapshot_observed_at":"2026-08-08T01:06:18.417714Z","submitted_at":"2025-05-24T10:26:27Z","title":"Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T14:32:41.836423Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2505.18629"},"observation_digest":"sha256:d6ae08487d4b88254567bf6784b76eddb24b927ac20cf8f3f128a59fd728e3c7","observation_id":"038d5e65-a888-4af9-9498-e1d5a6d4bae4","resolution":{"observed_at":"2026-08-07T14:32:41.836423Z","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-07T05:52:18.444052Z","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":"2506.06998","last_updated":"2025-06-08T05:08:32Z","snapshot_observed_at":"2026-08-09T10:47:10.657931Z","submitted_at":"2025-06-08T05:08:32Z","title":"What makes Reasoning Models Different? Follow the Reasoning Leader for Efficient Decoding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:52:18.444052Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.06998"},"observation_digest":"sha256:ea80c16026c3a14185109f9deaa69f6a7dc9ba2f890255a4c2e0b4e59bba7efb","observation_id":"c0ce5cfc-5745-4f52-bb92-fee9490dc8af","resolution":{"observed_at":"2026-08-07T05:52:18.444052Z","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-07T05:49:36.717578Z","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":"2506.07104","last_updated":"2025-09-10T09:03:04Z","snapshot_observed_at":"2026-08-07T16:09:05.593491Z","submitted_at":"2025-06-08T12:18:50Z","title":"How Far Are We from Optimal Reasoning Efficiency?","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:49:36.717578Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.07104"},"observation_digest":"sha256:771db27f802838e0f3af2f82c1294995c2a60babf64693698360360f26c270a9","observation_id":"1a1662d7-9fd7-4836-a74c-7d216dbed935","resolution":{"observed_at":"2026-08-07T05:49:36.717578Z","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-07T05:19:16.691688Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.08343","last_updated":"2025-06-18T14:43:36Z","snapshot_observed_at":"2026-08-07T08:58:45.702180Z","submitted_at":"2025-06-10T01:54:04Z","title":"Wait, We Don't Need to \"Wait\"! Removing Thinking Tokens Improves Reasoning Efficiency","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:19:16.691688Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.08343"},"observation_digest":"sha256:3dc31893f1c33fdb9940c9f98bb57221cf03cee9f8454a0029c522ae98b13575","observation_id":"c7301252-0f20-4fba-a57c-29f0ce93276f","resolution":{"observed_at":"2026-08-07T05:19:16.691688Z","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-07T04:26:29.108342Z","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-09T03:27:12.818075Z","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":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:26:29.108342Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.10716"},"observation_digest":"sha256:b71bd54f9dbfea16a03b62cc365dde55c4477ecf93c9208f0a7d6cdcd69b2700","observation_id":"388b0d75-619c-4211-984d-b25b88b294e2","resolution":{"observed_at":"2026-08-07T04:26:29.108342Z","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-07T00:57:01.524906Z","title":"Reward-guided speculative decoding for efficient Ilm reasoning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12353","last_updated":"2025-06-14T05:30:09Z","snapshot_observed_at":"2026-08-07T08:59:45.729814Z","submitted_at":"2025-06-14T05:30:09Z","title":"Efficient Reasoning Through Suppression of Self-Affirmation Reflections in Large Reasoning Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T00:57:01.524906Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.12353"},"observation_digest":"sha256:4f0b1842cc0b8d71ca4c21bf4d6040a6ca5c1b5b69f576afc1f070eb0d379b35","observation_id":"35cbcd96-7426-4654-aa51-2ea55b5f6645","resolution":{"observed_at":"2026-08-07T00:57:01.524906Z","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-06T23:00:45.946584Z","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-09T00:22:30.440989Z","submitted_at":"2025-06-25T06:29:18Z","title":"AALC: Large Language Model Efficient Reasoning via Adaptive Accuracy-Length Control","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T23:00:45.946584Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2506.20160"},"observation_digest":"sha256:2b374a79496419d4e139c588c2ee5f5763766d3870078f5b04c9cad6ffd20144","observation_id":"87c8092e-3e82-4317-b042-40fe4076d637","resolution":{"observed_at":"2026-08-06T23:00:45.946584Z","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-06T19:16:31.326240Z","title":"Reward-guided speculative decoding 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-08T16:47:13.638421Z","submitted_at":"2025-07-08T15:28:48Z","title":"CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:16:31.326240Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2507.06087"},"observation_digest":"sha256:bb6e04f9c8f5dcd68c1cf5f2f5c18fbe6f2f2546d871b924382878fc8ce10a2a","observation_id":"ed7eaab6-c0a9-410b-84ce-95380584986d","resolution":{"observed_at":"2026-08-06T19:16:31.326240Z","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-06T16:45:58.173827Z","title":"Reward-guided speculative decoding for efficient LLM reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.12759","last_updated":"2025-07-17T03:31:36Z","snapshot_observed_at":"2026-08-07T21:57:01.893066Z","submitted_at":"2025-07-17T03:31:36Z","title":"Logit Arithmetic Elicits Long Reasoning Capabilities Without Training","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:45:58.173827Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2507.12759"},"observation_digest":"sha256:c46606be859355e3851e8f814ef80c87e5017f29b613b3e89a9f21dab0a93c1d","observation_id":"c7e65240-89f6-420b-8825-cc760c589dcf","resolution":{"observed_at":"2026-08-06T16:45:58.173827Z","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-06T16:34:25.083207Z","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":"2507.13158","last_updated":"2025-07-17T14:22:24Z","snapshot_observed_at":"2026-08-07T07:16:46.127762Z","submitted_at":"2025-07-17T14:22:24Z","title":"Inverse Reinforcement Learning Meets Large Language Model Post-Training: Basics, Advances, and Opportunities","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T16:34:25.083207Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2507.13158"},"observation_digest":"sha256:ff3c96ec5234a285930222fca1b9a6db59a6e3ec5d6a6a0db1b24e6eff5e21b6","observation_id":"bbf519a6-9680-4607-8070-a3251649d9d9","resolution":{"observed_at":"2026-08-06T16:34:25.083207Z","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-06T15:06:47.952749Z","title":"Reward-guided speculative decoding for efficient llm reasoning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16731","last_updated":"2025-07-22T16:13:43Z","snapshot_observed_at":"2026-08-07T22:15:08.576638Z","submitted_at":"2025-07-22T16:13:43Z","title":"Collaborative Inference and Learning between Edge SLMs and Cloud LLMs: A Survey of Algorithms, Execution, and Open Challenges","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:06:47.952749Z"},"links":{"cited_paper":"/paper/2501.19324","citing_paper":"/paper/2507.16731"},"observation_digest":"sha256:cf99f26f8abf804921b48be1c8bc3a6b8ebb239f9ae7a51fe92c37c2bc9a5700","observation_id":"b879e10c-fcb3-4518-83f2-40c8eacad096","resolution":{"observed_at":"2026-08-06T15:06:47.952749Z","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-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-07T08:58:49.156790Z","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:050e62e352fa63d72a328c309aa7cf58f257b151649b1bd904b92758f364eba5","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-07T20:39:02.578525Z","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:2bcb9d629930b18f160743c40dee696ecd87f518e2844ad0190074c4b4b94643","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-09T12:10:30.690264Z","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:ac56b8fd1dea8dc39c6b8c2448dcd9a431212988af8d703c118cf0b57d98f59e","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:3eec0e299a5affc2486da9388c21f617f3150f9a418d980ed97d43d892eb590d","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-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":"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:76b8f22875761942099d5f044e14498b7a73e7b1a2b0ac45055263aaa4f2d38d","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-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":"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:6bc4fd538787ff47386e07b72a6042fadc61baf49f6f049d6e0a061f5fb5cb95","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-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":"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:0cd9c8ea1279e820b73790a8e875eeefad14f9710e3c80c5701b5e83ae665260","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-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":"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:7a77d2cf4edba9151ba1429bfc9d50bbd74cd63333be7e6ac64d13bf1a9a6f57","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-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":"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:ee2c9be6ddb682b7177330cc82b1c5609656136a6468cd35dc53f505a74eac23","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-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":"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:8a31c25e6d6c9808d254a15d6ddb3b2363ac93beb2360a9e0aee7161ff36fa24","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-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":"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:3c9a05b7bcef1b1722832a0449293f9a5532ae387b6650e26f61dec9f21c84d1","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-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":"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:db568b867011e31f18525d088ccc63971e3553c1de8c5db4d8fed77b0ca855e0","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-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":"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:0dbda7d1d48a6857baf9e38defb07e371b4b84653ddeef94085936cd6f71f98b","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-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":"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:49962454d27192d699b54e36f6792a5d4628625f762697067217aacdd3b24d88","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-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":"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:ee26de7c82d9ea7fc9de358e4ce8c66a5648aa3530a357423ac31240f996c822","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-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":"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-07T07:50:01.322857Z","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:f03e315aaf0df502fbb55f8f90e5be50bcf412b75c64d81ae88a615b74c0b4f9","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-09T11:41:09.065974Z","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:33af8b5cc4f69f740f8933de7014b7698ccf70e45c2a10f7fbcc07889aaaa48f","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-07T17:24:54.089188Z","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:afb9a41e03f0aa9cf8f95424f34ae261c165223657b0ab8c2bc15ef069801acb","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-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 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:2501.19324."}