{"as_of":"2026-08-18T13:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:189fff63aa0cb6ef1e981d54a0f369d61b91a81d9303367ed54e15bd1f68859f","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:32:08.097781Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-01T06:33:45.824727Z","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-07-04T19:20:06.659443Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"cited_work":{"arxiv_id":"2506.19830","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.19830","snapshot_observed_at":"2026-07-04T19:20:06.659443Z","title":"Scaling speculative decoding with lookahead reasoning.arXiv preprint arXiv:2506.19830, 2025","venue":null,"work_id":"9473d0d2-01f3-4b83-beb0-97b3ba6dd3a0","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-08-13T15:14:17.866685Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-25T21:29:40.564852Z"},"links":{"cited_paper":"/paper/2506.19830","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:993fd7a1654b67ded9d8eb5b961ec55555357a3984669f34edbbb25799efe9e6","observation_id":"db1ffe45-2c1b-4f04-8758-b1926160c02d","resolution":{"observed_at":"2026-07-04T19:20:06.661156Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"cited_work":{"arxiv_id":"2506.19830","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.19830","snapshot_observed_at":"2026-07-04T19:20:06.659443Z","title":"Scaling speculative decoding with lookahead reasoning.arXiv preprint arXiv:2506.19830, 2025","venue":null,"work_id":"9473d0d2-01f3-4b83-beb0-97b3ba6dd3a0","year":2025},"citing_paper":{"arxiv_id":"2606.25354","last_updated":"2026-06-29T23:57:32Z","snapshot_observed_at":"2026-08-13T15:14:17.866685Z","submitted_at":"2026-06-24T03:42:44Z","title":"Efficient and Trainable Language Model Test-Time Scaling via Local Branch Routing","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-01T06:33:45.824727Z"},"links":{"cited_paper":"/paper/2506.19830","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:42f455ed18f91aee4156bfe52e1c38b184b5da2c0a3bcd9714db182fdb8ee53d","observation_id":"d37e6543-5a21-4604-96e4-da000e941197","resolution":{"observed_at":"2026-07-01T06:35:29.625090Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.19830/citation-record","integrity":"/paper/2506.19830/integrity","json":"/paper/2506.19830/citation-record.json","paper":"/paper/2506.19830"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.925098Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.925098Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:aa9dc8c8b675ff5ece81295b6b8fe00b7290afa6e52f50ed5769b58126434456","observation_id":"f5d38717-b509-4740-9f32-9c116e9dab2a","resolution":{"observed_at":"2026-08-15T18:32:07.925098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.929784Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.929784Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:3727eee7e57d5c722f3a6451b9cb944e1b7588c565c2b5b5fd46e7bd6cdbd82b","observation_id":"3e4cb6e4-fb10-4418-a62e-020b0a638b28","resolution":{"observed_at":"2026-08-15T18:32:07.929784Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.935280Z","title":"Fast inference from transformers via speculative decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.935280Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:cfba2db4b06600f174ea49c9c2562b17e533d16af09c2a9c9871986c1831c6a8","observation_id":"7ddff7f8-bde4-4484-9330-2e165c72034f","resolution":{"observed_at":"2026-08-15T18:32:07.935280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-15T18:32:07.938894Z","title":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning.arXiv preprint arXiv:2501.12948, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.938894Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:f9d93a81c4634a359bedf84f0024bc40e81e0fe64c96a2fbc50d00516ed3981e","observation_id":"5f1d8968-ef6a-40c1-babb-b6432483c1de","resolution":{"observed_at":"2026-08-15T18:32:07.938894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.609922Z","title":"Openai o3 and o4-mini system card","venue":null,"work_id":"824acec5-cba9-48c5-9cc9-c0a8e0808520","year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.942520Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:6e6fd3029661f42438c2e0984952c4dfe36326df48a18fac7120dc6aec7ecc25","observation_id":"566f83b6-bb38-4fd3-bd49-4e9bdef00595","resolution":{"observed_at":"2026-08-15T18:32:08.614487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.596407Z","title":"Qwen3 technical report","venue":null,"work_id":"53fb3859-5945-49dd-a6c8-e5e390301a4c","year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.946271Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:20666d47eca187e4e2fa5004ab99bcbd93e5cd72daee9f05fe0525f0ae02b29a","observation_id":"c713e366-bd20-46e2-9c1a-2ba9baef6635","resolution":{"observed_at":"2026-08-15T18:32:08.601135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.950060Z","title":"Judging llm-as-a-judge with mt-bench and chatbot arena.Advances in Neural Information Processing Systems, 36:46595–46623, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.950060Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:66bdf0bb015689f16d4384b7febcd603768e4f32acfcce091ed851de30b7b5c2","observation_id":"c0b60a8b-6ccd-4c13-8cbe-21ecfa7d2407","resolution":{"observed_at":"2026-08-15T18:32:07.950060Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.954130Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.954130Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:6541a2b3d813082dd8fc145caf8f3f41dd9f8d55099899c193cd58a591f75443","observation_id":"aea39a30-0678-4cce-bdd3-b9f61a87b0af","resolution":{"observed_at":"2026-08-15T18:32:07.954130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.07891","last_updated":"2025-05-16T19:27:32Z","snapshot_observed_at":"2026-08-18T12:17:52.125174Z","submitted_at":"2025-04-10T16:05:19Z","title":"SpecReason: Fast and Accurate Inference-Time Compute via Speculative Reasoning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.07891","snapshot_observed_at":"2026-08-15T18:32:07.957611Z","title":"Specrea- son: Fast and accurate inference-time compute via speculative reasoning.arXiv preprint arXiv:2504.07891, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.957611Z"},"links":{"cited_paper":"/paper/2504.07891","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:948734c8d44b8b6325da86def86bccf1398af128ad8f61e0a0a5306cd08cab7f","observation_id":"c5f7a379-7b18-41d7-979a-65878cfcde1f","resolution":{"observed_at":"2026-08-15T18:32:07.957611Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16858","last_updated":"2024-06-30T15:03:25Z","snapshot_observed_at":"2026-08-18T02:59:48.676488Z","submitted_at":"2024-06-24T17:59:11Z","title":"EAGLE-2: Faster Inference of Language Models with Dynamic Draft Trees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16858","snapshot_observed_at":"2026-08-15T18:32:07.961938Z","title":"Eagle-2: Faster inference of language models with dynamic draft trees.arXiv preprint arXiv:2406.16858, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.961938Z"},"links":{"cited_paper":"/paper/2406.16858","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:ff133782a25749612e260f86295f8d688a3284506157623dae9c0ed7bd14cf4e","observation_id":"0d5f4786-de90-43ef-99cd-6a87b22abfb6","resolution":{"observed_at":"2026-08-15T18:32:07.961938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-08-17T18:50:07.059564Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-15T18:32:07.967277Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.967277Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:2a7ceacc3f7c25a6b935a6f380fca82c38cf9cc40fad845282be1782fdc58c54","observation_id":"9f8cb341-c3d9-448c-8759-49fc01680224","resolution":{"observed_at":"2026-08-15T18:32:07.967277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.02057","last_updated":"2024-02-03T06:37:50Z","snapshot_observed_at":"2026-08-16T14:21:54.969828Z","submitted_at":"2024-02-03T06:37:50Z","title":"Break the Sequential Dependency of LLM Inference Using Lookahead Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-08-15T18:32:07.971833Z","title":"Break the sequential dependency of llm inference using lookahead decoding.arXiv preprint arXiv:2402.02057, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.971833Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:8cf87c742203af6a4eb0ed87100ff9d90b4a945054b1e99cc9c590fa0964ff10","observation_id":"d3024e64-8314-4b8a-999c-d93988f42377","resolution":{"observed_at":"2026-08-15T18:32:07.971833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.01840","last_updated":"2025-04-23T07:08:17Z","snapshot_observed_at":"2026-08-13T11:30:48.832931Z","submitted_at":"2025-03-03T18:59:04Z","title":"EAGLE-3: Scaling up Inference Acceleration of Large Language Models via Training-Time Test","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.01840","snapshot_observed_at":"2026-08-15T18:32:07.976135Z","title":"Eagle-3: Scaling up inference acceleration of large language models via training-time test.arXiv preprint arXiv:2503.01840, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.976135Z"},"links":{"cited_paper":"/paper/2503.01840","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:25d5ce0551a62b6cf47c944c8003468ad153d20e3f32fcba88910f57e3637d3a","observation_id":"dab908b0-3347-4c9d-93b9-4e3e5b447a5f","resolution":{"observed_at":"2026-08-15T18:32:07.976135Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:07.980402Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.980402Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:3b2882e8c712ddeb5ef6fa5b8816c1bc162a4898dabf7bf42fb14fe4a311c3d2","observation_id":"5eb1b114-8c13-4147-b994-98359141e66e","resolution":{"observed_at":"2026-08-15T18:32:07.980402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.07974","last_updated":"2024-06-06T17:41:21Z","snapshot_observed_at":"2026-08-16T07:05:57.323612Z","submitted_at":"2024-03-12T17:58:04Z","title":"LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.07974","snapshot_observed_at":"2026-08-15T18:32:07.984338Z","title":"Livecodebench: Holistic and contamination free evaluation of large language models for code.arXiv preprint arXiv:2403.07974, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.984338Z"},"links":{"cited_paper":"/paper/2403.07974","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:9672e7644a847a0af7ea86093237e399e9478bd102a7ec9d59170b589ac96b7a","observation_id":"022f0560-e4f3-457c-ac3f-d06a86f9e28b","resolution":{"observed_at":"2026-08-15T18:32:07.984338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-15T18:32:07.988503Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168, 2021","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.988503Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:d6c99851315d8c6649c01018bfdbd7b79d4abe0e8a2bfca1950b461ee467eacc","observation_id":"f1ab1454-5e50-47d6-b095-2d4312ced9f3","resolution":{"observed_at":"2026-08-15T18:32:07.988503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.560071Z","title":"Aime problems and solutions, 2025","venue":null,"work_id":"2ec01d64-2840-409a-9a78-89e12f3338be","year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.992882Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:b2eb94c2f94f5c91a48c8721c0e499a12ef46f235c1fa2b1f04b9c9fe696f593","observation_id":"51b39564-5c6b-4b1f-9e78-6998cc7b6993","resolution":{"observed_at":"2026-08-15T18:32:08.564027Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.547455Z","title":"Amc 12 problems and solutions, 2025","venue":null,"work_id":"937cffb8-94a5-4527-9042-2706a538ed77","year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:07.996843Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:27f628464a253984376b7db2e23ed36375fc3099d98ded1f8f7af1cd3fa34f12","observation_id":"95679846-196b-444a-8b6a-0174a579525e","resolution":{"observed_at":"2026-08-15T18:32:08.551404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.000667Z","title":"Gpqa: A graduate-level google-proof q&a benchmark","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.000667Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:402434ff3504df3c5420d3b7ec3cedcf6403d9f2b6ee72a684769d1a133b8c3e","observation_id":"fc502e3a-1141-4609-a450-3942f05a216b","resolution":{"observed_at":"2026-08-15T18:32:08.000667Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.526283Z","title":"Qwen2.5-math: The world’s leading open-sourced mathematical llms, 2024","venue":null,"work_id":"12a55294-786a-40d0-9991-ce6c724863dc","year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.004795Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:9d206c83d43d57d3f33bd98a5d90b42c3ea003b1e073b2a885783652f2b04679","observation_id":"8bd0c4bd-1b4b-40d6-b57c-a65df232e4a6","resolution":{"observed_at":"2026-08-15T18:32:08.531143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.009179Z","title":"Prompt lookup decoding, November 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.009179Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:ae41b191b8f6a6556796d6da9133e8471d5d72f80ffd6881f0b69c28df7edd40","observation_id":"2f5e024e-e42e-4e8e-b373-6feccbdac6a6","resolution":{"observed_at":"2026-08-15T18:32:08.009179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.504672Z","title":"Efficient memory management for large language model serving with pagedattention","venue":null,"work_id":"3872bde4-b607-4700-85e9-21c53daf5033","year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.013302Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:f4a88383e7414ef81852a02de5dfdc76f3ea59e924f8ef62278c8f35cebb0d42","observation_id":"342a5fe4-da50-4ad3-874c-3279a33ead80","resolution":{"observed_at":"2026-08-15T18:32:08.508832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-08-17T10:13:54.763177Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10774","snapshot_observed_at":"2026-08-15T18:32:08.017180Z","title":"Medusa: Simple llm inference acceleration framework with multiple decoding heads","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.017180Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:37b9fe75a6c50a50f8ecf3a56f235ef7b8f257f065daf560910a4e418f3ee176","observation_id":"55373592-97b5-4273-9bc7-9ec7394a3560","resolution":{"observed_at":"2026-08-15T18:32:08.017180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05109","last_updated":"2024-10-07T16:21:29Z","snapshot_observed_at":"2026-08-17T14:00:35.798553Z","submitted_at":"2024-02-07T18:58:50Z","title":"Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05109","snapshot_observed_at":"2026-08-15T18:32:08.020747Z","title":"Hydra: Sequentially-dependent draft heads for medusa decoding.arXiv preprint arXiv:2402.05109, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.020747Z"},"links":{"cited_paper":"/paper/2402.05109","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:9197eaccc3134039bc77c9e06b0f00b125dd8479b22d11902f07bf93e20f64a5","observation_id":"1c106fec-83e5-4331-8ed6-322d8ae1f5b4","resolution":{"observed_at":"2026-08-15T18:32:08.020747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15077","last_updated":"2025-03-04T13:58:39Z","snapshot_observed_at":"2026-08-03T09:40:31.365295Z","submitted_at":"2024-01-26T18:59:01Z","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15077","snapshot_observed_at":"2026-08-15T18:32:08.024399Z","title":"Eagle: Speculative sampling requires rethinking feature uncertainty.arXiv preprint arXiv:2401.15077, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.024399Z"},"links":{"cited_paper":"/paper/2401.15077","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:f18ebcfe12309df95cd5978ef0ac838e291f2cb59a8ea76de4618b84310c1fd7","observation_id":"1ba10939-5524-4d2b-85d0-9dad8fdec7ac","resolution":{"observed_at":"2026-08-15T18:32:08.024399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.491820Z","title":"Cllms: Consistency large language models","venue":null,"work_id":"67151845-b460-4249-a3c3-f5953f0f6b19","year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.028021Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:90def143033c6684dfafd07f3031b2c2d52680a74ea4e880f93a0738a75ed606","observation_id":"74bfa710-1877-4d90-b2dc-c614220fef1e","resolution":{"observed_at":"2026-08-15T18:32:08.496183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.09781","last_updated":"2024-04-01T02:18:42Z","snapshot_observed_at":"2026-08-16T15:32:32.643405Z","submitted_at":"2023-05-16T20:12:59Z","title":"SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.09781","snapshot_observed_at":"2026-08-15T18:32:08.031433Z","title":"Specinfer: Accelerating generative large language model serving with tree-based speculative inference and verification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.031433Z"},"links":{"cited_paper":"/paper/2305.09781","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:78c2dfe68f7d64a2e63de05f617631f0b4ef2f518e61761b83404c21f9c2ec65","observation_id":"30243f37-9666-475c-adfe-612553dde89b","resolution":{"observed_at":"2026-08-15T18:32:08.031433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14066","last_updated":"2025-07-27T03:20:41Z","snapshot_observed_at":"2026-08-16T13:41:12.991651Z","submitted_at":"2024-06-20T07:43:33Z","title":"TurboSpec: Closed-loop Speculation Control System for Optimizing LLM Serving Goodput","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.14066","snapshot_observed_at":"2026-08-15T18:32:08.035559Z","title":"Optimizing speculative decoding for serving large language models using goodput.arXiv preprint arXiv:2406.14066, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.035559Z"},"links":{"cited_paper":"/paper/2406.14066","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:21780aaa1b825a3f5638a70d163250a401e74b27961ed90bf68f14c37fe57f0f","observation_id":"a1fe6167-90e8-4588-b0b9-1a656c3720d1","resolution":{"observed_at":"2026-08-15T18:32:08.035559Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-15T18:32:08.039844Z","title":"Deepseek-v3 technical report.arXiv preprint arXiv:2412.19437, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.039844Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:77697aa3af2f8667ec0c3de3eef4340df6a0b206b127f6016a7d9b5f00664fd8","observation_id":"5dad4dbc-0134-401b-9181-1c9f1c5e83d9","resolution":{"observed_at":"2026-08-15T18:32:08.039844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-17T09:58:46.058102Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-15T18:32:08.043989Z","title":"Gpt-4 technical report.arXiv preprint arXiv:2303.08774, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.043989Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:7ebb50dea14524416b4ee9abf0a273ac3c234c4f7ee9cf4de7ba067f4e463c66","observation_id":"a69af320-8d46-407e-b2e3-046d5656aabe","resolution":{"observed_at":"2026-08-15T18:32:08.043989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-08-17T11:00:39.333660Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-08-15T18:32:08.047857Z","title":"s1: Simple test-time scaling.arXiv preprint arXiv:2501.19393, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.047857Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:6d9085d6b3ba81512104a5218b05a9c7ebca8407cb5fa31130fb0edd083f0581","observation_id":"0b91f016-0995-45e5-8dbc-357301bcac21","resolution":{"observed_at":"2026-08-15T18:32:08.047857Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16838","last_updated":"2024-11-20T17:57:26Z","snapshot_observed_at":"2026-08-16T13:40:02.392308Z","submitted_at":"2024-06-24T17:45:59Z","title":"From Decoding to Meta-Generation: Inference-time Algorithms for Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16838","snapshot_observed_at":"2026-08-15T18:32:08.052030Z","title":"From decoding to meta-generation: Inference-time algorithms for large language models.arXiv preprint arXiv:2406.16838, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.052030Z"},"links":{"cited_paper":"/paper/2406.16838","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:f7ac5aa6841616d20bd3880a5764cca9bf02b115f467b1fb50b187d25b87f6a1","observation_id":"546a28c3-d968-4578-933d-2d8796b9ed9f","resolution":{"observed_at":"2026-08-15T18:32:08.052030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-15T18:32:08.056063Z","title":"Scaling llm test-time compute opti- mally can be more effective than scaling model parameters.arXiv preprint arXiv:2408.03314, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.056063Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:458cf25d8b4f46bd22588daed847e84954562304bc0d14d2d86fcbe341b05ed8","observation_id":"1574ac63-f783-483a-a47e-ec878986a50e","resolution":{"observed_at":"2026-08-15T18:32:08.056063Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12599","last_updated":"2025-06-03T02:14:54Z","snapshot_observed_at":"2026-08-15T22:38:53.825110Z","submitted_at":"2025-01-22T02:48:14Z","title":"Kimi k1.5: Scaling Reinforcement Learning with LLMs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12599","snapshot_observed_at":"2026-08-15T18:32:08.060326Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.060326Z"},"links":{"cited_paper":"/paper/2501.12599","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:71ccf80f187da79c8865e2f98c9b4df55b3cd7ddf0e5cec0be3ef21fe15cd009","observation_id":"4a5a74ab-d67a-46c1-b85a-d3c37daf2e11","resolution":{"observed_at":"2026-08-15T18:32:08.060326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12329","last_updated":"2026-06-02T22:05:11Z","snapshot_observed_at":"2026-08-18T12:16:20.407692Z","submitted_at":"2025-04-12T21:25:32Z","title":"Speculative Thinking: Enhancing Small-Model Reasoning with Large Model Guidance at Inference Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.12329","snapshot_observed_at":"2026-08-15T18:32:08.064506Z","title":"aligned\" or","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.064506Z"},"links":{"cited_paper":"/paper/2504.12329","citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:4f45a5ea31975fd21dd4a746e1e56be0982c50f450206b2f30c8c31ab30b6414","observation_id":"97f082df-3bb4-4d0b-8620-fd461d233def","resolution":{"observed_at":"2026-08-15T18:32:08.064506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.478659Z","title":"The draft model sequentially generate drafts","venue":null,"work_id":"3503f628-a303-45b1-9966-d30a78b9d38d","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.068962Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:22e6ecbdd5e3917b5f06e50dadd92a05019b86dfbfe815e30887f831a37ccb4e","observation_id":"01cef315-3647-45bb-8588-195c5c376384","resolution":{"observed_at":"2026-08-15T18:32:08.483511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.465915Z","title":null,"venue":null,"work_id":"a8dcfcd8-33f1-40cf-a0c9-7b94c49b051a","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.073020Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:5605bd2118c987359c131a1cda7711070a52b178a42db5a1b459ff5bcf451909","observation_id":"1b3eeee9-c196-4637-b32b-403ede5e3bce","resolution":{"observed_at":"2026-08-15T18:32:08.469993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.451930Z","title":"If the draft was reject, fall back to the target model’s original sentence and proceed to the nextDRAFT STAGE","venue":null,"work_id":"aa8396aa-96dd-4010-aed0-f61c63aed4f4","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.077255Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:1c336bdabcd51f3657c098df4e2128330065f8ab3f4d205dfb2514e0f0a92269","observation_id":"5922a616-2347-4814-8b36-198bdb08c561","resolution":{"observed_at":"2026-08-15T18:32:08.456819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.438058Z","title":"The parallel dimension of the target model is ⌈ 1 c1 ⌉, and asn→∞, the asymptotic speedup is S1 = 1 c1 + (1−c 1)(1−α 1)","venue":null,"work_id":"edcc228a-aa2c-4b00-9ec4-ab5944f657a5","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.081169Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:bf87896bd87db80c4083653702e28f9e9ecf751205b2a38a133a9434a40c9373","observation_id":"c87a5fc4-29f7-4cfe-9ff1-bcd7f7b21daf","resolution":{"observed_at":"2026-08-15T18:32:08.442311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.425408Z","title":"The parallel dimension of the target model isγ, and asn→∞, the asymptotic speedup is S2 = 1−α γ 1 (1−α 1) +c 1 α1−αγ+1 1 −γ(1−α 1)αγ 1","venue":null,"work_id":"87e51227-3039-4535-a993-946f8db2be4c","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.085016Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:070e75317148d16efe3008efa2e7f23a4bb21c4c00af6372eb50eb5a53a15d8b","observation_id":"e4c24414-b548-4a8f-9759-68aba93181df","resolution":{"observed_at":"2026-08-15T18:32:08.429842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.412982Z","title":null,"venue":null,"work_id":"86847361-ea3a-430b-8dc4-6fd2730dde39","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.090149Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:df07450f35dbf016ed2118e9ed64c8887ff53aa2f8990f3bf24dc772d62d78b4","observation_id":"e4adfac2-5dbd-4453-8232-06f19a7ce690","resolution":{"observed_at":"2026-08-15T18:32:08.417077Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.400254Z","title":null,"venue":null,"work_id":"ff8b22e0-a17c-4366-87b6-1377229a60e1","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.094095Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:be03ebe89b166453e1cb3043cd3692a4169f3bbaab1e67568dc6261e062079c5","observation_id":"accd12ff-9fab-4038-93a1-81a295fbc3e6","resolution":{"observed_at":"2026-08-15T18:32:08.404058Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:32:08.386076Z","title":"Proof.(i) Monotonicity inx.Fixα∈(0,1)and write f(x) = xαx 1−α x = N(x) D(x), N(x) =xα x, D(x) = 1−α x","venue":null,"work_id":"b32acb7b-48f9-4156-9132-a6578e53e26c","year":null},"citing_paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:08.097781Z"},"links":{"citing_paper":"/paper/2506.19830"},"observation_digest":"sha256:6bd212588a47178ff906cddcf968007ad3dab82063721ea4cec6454a29176b77","observation_id":"2ea6f168-cd0e-4fb9-bb29-380f66329fca","resolution":{"observed_at":"2026-08-15T18:32:08.391178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19830","last_updated":"2025-06-24T17:48:10Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T12:17:13.392670Z","submitted_at":"2025-06-24T17:48:10Z","title":"Scaling Speculative Decoding with Lookahead Reasoning"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":43},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 2 inbound Pith citation observations for arXiv:2506.19830."}