{"as_of":"2026-08-22T22:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:16924f9deadaf60890114c23f6a3984c165ebf8c614d9db2c9e153b34977d360","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":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":61,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:10:15.392505Z","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.719647Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-12T19:32:52.187415Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.10666","last_updated":"2024-12-16T10:48:28Z","snapshot_observed_at":"2026-08-16T18:25:02.061121Z","submitted_at":"2024-11-16T02:02:49Z","title":"SAM Decoding: Speculative Decoding via Suffix Automaton","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T19:32:52.187415Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2411.10666"},"observation_digest":"sha256:a5b22289025b0dfef42f4fa679812e08f32e28f933b8dfea2d052b3bfcc76a5d","observation_id":"2dc9cb81-ef4c-445f-91e8-f222bfd2cd1d","resolution":{"observed_at":"2026-08-12T19:32:52.187415Z","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-12T11:42:30.982273Z","title":"Break the Sequential Dependency of LLM Inference Using Lookahead Decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17992","last_updated":"2024-11-27T02:17:34Z","snapshot_observed_at":"2026-08-13T02:15:38.262748Z","submitted_at":"2024-11-27T02:17:34Z","title":"New Faithfulness-Centric Interpretability Paradigms for Natural Language Processing","version":1},"reference_index":249,"source":"pdf_text","source_observed_at":"2026-08-12T11:42:30.982273Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2411.17992"},"observation_digest":"sha256:dfa0c9753c498113b1294c58528a82f5b7902c1bd4aa01850cca7721d291fd21","observation_id":"04046587-add2-4c55-89a5-e26b4f72f2f5","resolution":{"observed_at":"2026-08-12T11:42:30.982273Z","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-12T04:26:59.566128Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.01447","last_updated":"2024-12-02T12:36:27Z","snapshot_observed_at":"2026-08-14T13:03:25.432235Z","submitted_at":"2024-12-02T12:36:27Z","title":"PLD+: Accelerating LLM inference by leveraging Language Model Artifacts","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T04:26:59.566128Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2412.01447"},"observation_digest":"sha256:72010dce203cfcd677dcb7b661950fb9a7bcf810214f541bfbdbb6b2f79ea746","observation_id":"dc103ce0-8319-43b2-a2e8-2c5a98db2277","resolution":{"observed_at":"2026-08-12T04:26:59.566128Z","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-11T21:54:15.645271Z","title":"Break the se- quential dependency of llm inference using lookahead decoding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04062","last_updated":"2025-06-29T07:13:36Z","snapshot_observed_at":"2026-08-14T01:36:02.031381Z","submitted_at":"2024-12-05T10:57:08Z","title":"ZipAR: Parallel Auto-regressive Image Generation through Spatial Locality","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T21:54:15.645271Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2412.04062"},"observation_digest":"sha256:8de9da1750f691fe175121f1dd8f6c47861d789877c4a87872a8c637d086a0ff","observation_id":"c0a50ac7-e1dd-4a20-affb-db20d9e524ce","resolution":{"observed_at":"2026-08-11T21:54:15.645271Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2501.05465","last_updated":"2026-05-14T16:52:31Z","snapshot_observed_at":"2026-08-14T18:35:28.225116Z","submitted_at":"2025-01-03T19:53:57Z","title":"Small Language Models (SLMs) Can Still Pack a Punch: A survey (updated 2026)","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-23T05:47:48.488826Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2501.05465"},"observation_digest":"sha256:5e9e89a1d4a8938038350525d9ed4d089fce55120af22944df43868e384c21b3","observation_id":"77b3ad3e-6f36-40e3-9058-6991421ce36b","resolution":{"observed_at":"2026-05-23T05:52:37.392964Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-09T20:42:44.096964Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19324","last_updated":"2025-06-26T03:14:46Z","snapshot_observed_at":"2026-08-18T12:33:04.555555Z","submitted_at":"2025-01-31T17:19:57Z","title":"Reward-Guided Speculative Decoding for Efficient LLM Reasoning","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-09T20:42:44.096964Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2501.19324"},"observation_digest":"sha256:2cd7f6e31e6968ac8dcff2ddb2a8b010c4ba7e479950f575b17bc080c69f37f8","observation_id":"09b45938-ff0d-42b4-a847-3a7b3579bf19","resolution":{"observed_at":"2026-08-09T20:42:44.096964Z","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-07T23:17:51.164390Z","title":"arXiv preprint arXiv:2402.02057","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.08923","last_updated":"2025-05-23T00:51:17Z","snapshot_observed_at":"2026-08-20T12:32:34.831182Z","submitted_at":"2025-02-13T03:19:50Z","title":"CopySpec: Accelerating LLMs with Speculative Copy-and-Paste Without Compromising Quality","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T23:17:51.164390Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2502.08923"},"observation_digest":"sha256:106cc367322f38abbfb4ea8f8c06bf8209d3b68d3794ff7c25d045ad9c78d46a","observation_id":"95d78aee-3486-4971-bc3b-734391255c7f","resolution":{"observed_at":"2026-08-07T23:17:51.164390Z","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-16T11:10:15.392505Z","title":"Break the sequential dependency of llm inference using lookahead decoding, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16379","last_updated":"2025-04-23T03:00:02Z","snapshot_observed_at":"2026-08-20T08:02:25.220437Z","submitted_at":"2025-04-23T03:00:02Z","title":"SplitReason: Learning To Offload Reasoning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:10:15.392505Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2504.16379"},"observation_digest":"sha256:2e62a3cff8a4732de7b05c8cf2ae8fded8139ca4257e86e3cee5ab4347c6ae90","observation_id":"d631aeb9-8513-4d5d-9f62-1aa7901ec040","resolution":{"observed_at":"2026-08-16T11:10:15.392505Z","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-16T04:21:45.427866Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.01572","last_updated":"2025-05-02T20:29:31Z","snapshot_observed_at":"2026-08-18T05:09:46.995431Z","submitted_at":"2025-05-02T20:29:31Z","title":"PipeSpec: Breaking Stage Dependencies in Hierarchical LLM Decoding","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T04:21:45.427866Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.01572"},"observation_digest":"sha256:72eb61ab2cce269d9bf2a6d5bc38514d58ca76c8a0cb0293616c0c88c4020c19","observation_id":"5e4d4656-9eb0-4a15-8dab-280faae347f2","resolution":{"observed_at":"2026-08-16T04:21:45.427866Z","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-15T23:17:34.805214Z","title":"Break the sequential dependency of LLM inference using lookahead decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07858","last_updated":"2025-05-08T11:10:15Z","snapshot_observed_at":"2026-08-19T09:49:10.619210Z","submitted_at":"2025-05-08T11:10:15Z","title":"Scaling Laws for Speculative Decoding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T23:17:34.805214Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.07858"},"observation_digest":"sha256:0e2f618ecf0d39cc44c79609ed5a52c9648466be1ca3e113f4c2ae465f6a0d0f","observation_id":"585b9b35-7c6c-4cd5-a061-e62d9f26b8eb","resolution":{"observed_at":"2026-08-15T23:17:34.805214Z","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-15T21:05:57.701011Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.11183","last_updated":"2025-05-16T12:38:45Z","snapshot_observed_at":"2026-08-22T12:53:48.136698Z","submitted_at":"2025-05-16T12:38:45Z","title":"On Next-Token Prediction in LLMs: How End Goals Determine the Consistency of Decoding Algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T21:05:57.701011Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.11183"},"observation_digest":"sha256:d6ba57d4f0ba8b248aff64af294f69b4d36d0e450fe0020d5a81d0982938b870","observation_id":"5f30d67c-2053-4895-8e18-d40dd1e87e45","resolution":{"observed_at":"2026-08-15T21:05:57.701011Z","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-07T15:42:52.964039Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14260","last_updated":"2025-05-20T12:12:17Z","snapshot_observed_at":"2026-08-18T12:10:38.635591Z","submitted_at":"2025-05-20T12:12:17Z","title":"Speculative Decoding Reimagined for Multimodal Large Language Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:52.964039Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.14260"},"observation_digest":"sha256:ceccf4ed65f9ef3c4224f9a00e48e33b093de78f885a3851cf1ed046b711c34b","observation_id":"40c1840c-6422-42a9-9344-4dacfb33782b","resolution":{"observed_at":"2026-08-07T15:42:52.964039Z","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-07T14:47:55.240002Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17694","last_updated":"2026-03-28T10:14:51Z","snapshot_observed_at":"2026-08-15T04:43:19.645752Z","submitted_at":"2025-05-23T10:03:28Z","title":"CoDec: Prefix-Shared Decoding Kernel for LLMs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:55.240002Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.17694"},"observation_digest":"sha256:dba53ac066902b18e4d0188bb75b7cbdc756fd287c9b55f47de28309a8c7afba","observation_id":"dca665e3-b590-4a66-965f-6dca443a955e","resolution":{"observed_at":"2026-08-07T14:47:55.240002Z","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-07T12:35:26.878891Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24584","last_updated":"2025-08-18T16:52:22Z","snapshot_observed_at":"2026-08-09T10:10:52.166144Z","submitted_at":"2025-05-30T13:32:00Z","title":"AutoChemSchematic AI: Agentic Physics-Aware Automation for Chemical Manufacturing Scale-Up","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:26.878891Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2505.24584"},"observation_digest":"sha256:5261b36bda9daa58c5fea776b3b1235281ef1f45c2622cd889fab85c25718441","observation_id":"95399fe2-9958-48b3-81f7-48399dedba3f","resolution":{"observed_at":"2026-08-07T12:35:26.878891Z","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-07T11:55:12.326986Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01206","last_updated":"2025-06-01T22:52:47Z","snapshot_observed_at":"2026-08-16T21:55:12.873955Z","submitted_at":"2025-06-01T22:52:47Z","title":"Mamba Drafters for Speculative Decoding","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T11:55:12.326986Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2506.01206"},"observation_digest":"sha256:a66fb67b10bfcb6379ce6ff1705c78cffdd79f9abf1eaac2848ec53fd104ca57","observation_id":"5edc1148-de69-4e6f-9427-6c4c22e66d0d","resolution":{"observed_at":"2026-08-07T11:55:12.326986Z","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-07T11:30:55.107331Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02391","last_updated":"2025-06-03T03:13:27Z","snapshot_observed_at":"2026-08-14T22:18:48.532123Z","submitted_at":"2025-06-03T03:13:27Z","title":"Consultant Decoding: Yet Another Synergistic Mechanism","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T11:30:55.107331Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2506.02391"},"observation_digest":"sha256:eac07f75a3c747610e95ee96109f8cc4ada645325ac2557665faa5692818c36d","observation_id":"32c05481-ad55-4ea9-aadc-1b1f9b46b55c","resolution":{"observed_at":"2026-08-07T11:30:55.107331Z","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-07T00:22:44.539645Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14158","last_updated":"2025-06-17T03:38:19Z","snapshot_observed_at":"2026-08-13T04:12:11.632927Z","submitted_at":"2025-06-17T03:38:19Z","title":"S$^4$C: Speculative Sampling with Syntactic and Semantic Coherence for Efficient Inference of Large Language Models","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T00:22:44.539645Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2506.14158"},"observation_digest":"sha256:3a687ba24878fb39b7afda9a801b69c6cafe381c9d851dc111b407b723f6631d","observation_id":"b544baf3-a714-4c4d-b7e8-c31ffbd3353b","resolution":{"observed_at":"2026-08-07T00:22:44.539645Z","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-19T06:22:30.914089Z","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:91817211837b963a25be56c11f2d05b0cb664758a7d035a6bf1f79429f424623","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":"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-06T10:29:56.326027Z","title":"Break the sequen- tial dependency of llm inference using lookahead decoding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.23777","last_updated":"2025-08-06T09:51:03Z","snapshot_observed_at":"2026-08-15T14:05:55.866293Z","submitted_at":"2025-07-31T17:58:30Z","title":"XSpecMesh: Quality-Preserving Auto-Regressive Mesh Generation Acceleration via Multi-Head Speculative Decoding","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T10:29:56.326027Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2507.23777"},"observation_digest":"sha256:c1cb5bb33e214127abc1dd4c45406cfae76c477fc6f4df96bbb902ae8fe01ee6","observation_id":"cb2996ac-adaf-43d5-9628-bfbb5126691a","resolution":{"observed_at":"2026-08-06T10:29:56.326027Z","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-15T16:49:49.664355Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.20559","last_updated":"2025-08-28T08:51:51Z","snapshot_observed_at":"2026-08-16T05:37:04.865066Z","submitted_at":"2025-08-28T08:51:51Z","title":"Leveraging Generative Models for Real-Time Query-Driven Text Summarization in Large-Scale Web Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:49:49.664355Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2508.20559"},"observation_digest":"sha256:c8e4b6bcc652c9e00eeb68c7dc18f563c82df66c6095ff1f8a8126c8108dfe81","observation_id":"e6b9765c-75ed-4e60-9767-555d16cdd50d","resolution":{"observed_at":"2026-08-15T16:49:49.664355Z","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-05T13:48:21.420932Z","title":"Break the sequential dependency of llm infer- ence using lookahead decoding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.04474","last_updated":"2025-08-30T01:54:55Z","snapshot_observed_at":"2026-08-17T14:22:16.859857Z","submitted_at":"2025-08-30T01:54:55Z","title":"Scaling Up, Speeding Up: A Benchmark of Speculative Decoding for Efficient LLM Test-Time Scaling","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-05T13:48:21.420932Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2509.04474"},"observation_digest":"sha256:bc55a8729676b50e557861e0555fdcb0d2d1d0e534f480f06291902c09e733ed","observation_id":"c386ed0c-2dca-44de-98e1-0ab2d484f2ae","resolution":{"observed_at":"2026-08-05T13:48:21.420932Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2509.12052","last_updated":"2026-04-20T18:20:15Z","snapshot_observed_at":"2026-08-13T00:57:42.458936Z","submitted_at":"2025-09-15T15:34:02Z","title":"FluentAvatar: Flicker-Free Talking-Head Animation via Phoneme-Guided Autoregressive Modeling","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T16:42:25.803856Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2509.12052"},"observation_digest":"sha256:bb0bfd895d4f3ee87dce65cbaddc95f0fec58b12c926eb689af3f366f306c09b","observation_id":"5aa796af-2c72-4e44-94bc-67574961d506","resolution":{"observed_at":"2026-05-18T16:42:43.871069Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-04T15:58:13.252756Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.18085","last_updated":"2026-06-11T00:26:51Z","snapshot_observed_at":"2026-08-13T05:15:01.921580Z","submitted_at":"2025-09-22T17:58:21Z","title":"Structuring The Future: Diffusion LLM Speculative Decoding via Calibrated Draft Graphs","version":4},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T15:58:13.252756Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2509.18085"},"observation_digest":"sha256:60b59cb9667acf592ea795671e7dca0edc8b93dae5d8061e1f28c0cf8d28af96","observation_id":"d876c74f-08e6-47df-871a-30eda85d946a","resolution":{"observed_at":"2026-08-04T15:58:13.252756Z","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-04T13:15:30.143680Z","title":"Break the sequential dependency of llm infer- ence using lookahead decoding.arXiv preprint arXiv:2402.02057,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01336","last_updated":"2026-05-26T05:53:44Z","snapshot_observed_at":"2026-08-13T06:18:33.029708Z","submitted_at":"2025-10-01T18:04:14Z","title":"HiSpec: Hierarchical Speculative Decoding for LLMs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T13:15:30.143680Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2510.01336"},"observation_digest":"sha256:b918a38f4a9977e8d48b041612fcd03d0fe4663602d10eef47edb2b577d1ce63","observation_id":"c277a0cf-1183-4a1e-9961-cf16eaf8edc9","resolution":{"observed_at":"2026-08-04T13:15:30.143680Z","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-15T15:51:39.133988Z","title":"Break the sequential dependency of llm inference using lookahead decoding, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.02329","last_updated":"2026-05-27T14:45:35Z","snapshot_observed_at":"2026-08-19T21:51:39.545824Z","submitted_at":"2025-09-26T02:21:12Z","title":"SelfJudge: Faster Speculative Decoding via Self-Supervised Judge Verification","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T15:51:39.133988Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2510.02329"},"observation_digest":"sha256:6e4ea0d74d316525dffa9afbc9d3a0721f88ed0d5bcdb9bc528fdbd2a5e15661","observation_id":"e87571e5-1335-4918-8a8d-04f5a91143c3","resolution":{"observed_at":"2026-08-15T15:51:39.133988Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2510.15545","last_updated":"2026-05-04T14:46:49Z","snapshot_observed_at":"2026-08-13T15:11:11.571202Z","submitted_at":"2025-10-17T11:25:36Z","title":"TokenTiming: A Dynamic Alignment Method for Universal Speculative Decoding Model Pairs","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T06:27:08.991426Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2510.15545"},"observation_digest":"sha256:c50d5b57d1ea8b9d9ca65a1510a1056f9efb453611cdcc039eec672905ce22eb","observation_id":"8c6ed277-5f95-4911-bc79-30a7c17631f3","resolution":{"observed_at":"2026-05-18T06:30:59.768495Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2511.13587","last_updated":"2026-05-06T17:25:23Z","snapshot_observed_at":"2026-08-13T20:20:16.747997Z","submitted_at":"2025-11-17T16:50:58Z","title":"VVS: Accelerating Speculative Decoding for Visual Autoregressive Generation via Partial Verification Skipping","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T21:34:14.371914Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2511.13587"},"observation_digest":"sha256:88af8bb8900136363b8b11ae5b2771e3eda6a5e393a71d2c572d495863ee0e86","observation_id":"80266967-58e9-41da-b603-9312dc9620b6","resolution":{"observed_at":"2026-05-17T21:35:17.556880Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2511.14617","last_updated":"2026-04-03T12:47:37Z","snapshot_observed_at":"2026-08-20T12:38:06.758101Z","submitted_at":"2025-11-18T16:12:21Z","title":"Seer: Online Context Learning for Fast Synchronous LLM Reinforcement Learning","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T20:38:30.169363Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2511.14617"},"observation_digest":"sha256:8f1a15bc79ad5cb8996435cbd9ab9ba68cf5e0ee8b92819941b14e9b78251a48","observation_id":"6c35afb9-f427-46b6-9e0e-4251eb1ff016","resolution":{"observed_at":"2026-05-17T20:40:14.499075Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-03T17:22:04.351657Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2512.10054","last_updated":"2026-07-18T20:06:01Z","snapshot_observed_at":"2026-08-20T12:38:50.214259Z","submitted_at":"2025-12-10T20:19:10Z","title":"Parallel Decoder Transformer: Planner-Conditioned Latent Coordination for Model-Intrinsic Parallel Generation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T17:22:04.351657Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2512.10054"},"observation_digest":"sha256:902e38db92ef5ab741887261f388bc2c188e94f24947444344a26572e1e97909","observation_id":"481e23c1-0330-41b3-8a55-bb43383367f4","resolution":{"observed_at":"2026-08-03T17:22:04.351657Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2601.05524","last_updated":"2026-04-14T05:38:03Z","snapshot_observed_at":"2026-08-15T00:07:47.413663Z","submitted_at":"2026-01-09T04:35:21Z","title":"Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T16:39:26.611704Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2601.05524"},"observation_digest":"sha256:5072edb6f2b377541cffcedc5caf39b6f0b2e2b88af1489c79267d0f3ca0ab48","observation_id":"7249766e-3642-4230-9cc2-f6d02175e045","resolution":{"observed_at":"2026-05-16T16:41:06.261854Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2602.06932","last_updated":"2026-05-02T06:02:57Z","snapshot_observed_at":"2026-08-13T08:39:06.155037Z","submitted_at":"2026-02-06T18:28:54Z","title":"When RL Meets Adaptive Speculative Training: A Unified Training-Serving System","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T06:33:41.860803Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2602.06932"},"observation_digest":"sha256:b953bc33df8b845e8ebdb456565e4f25af87db3b46e25379db8c7b0071778db1","observation_id":"d7f34214-710f-4744-bca7-da9fc428576a","resolution":{"observed_at":"2026-05-16T06:37:28.926667Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.05417","last_updated":"2026-04-07T04:25:26Z","snapshot_observed_at":"2026-08-12T13:07:55.012204Z","submitted_at":"2026-04-07T04:25:26Z","title":"Multi-Drafter Speculative Decoding with Alignment Feedback","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T19:31:20.953726Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.05417"},"observation_digest":"sha256:22a3c5602f535e6dabf3f871f39f64a7019abcc9de65afa42271ce4272af244f","observation_id":"161bbc7d-5dd7-417e-917d-614dc66196c9","resolution":{"observed_at":"2026-05-10T22:50:51.608091Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.09603","last_updated":"2026-05-14T06:18:54Z","snapshot_observed_at":"2026-08-21T14:42:01.905148Z","submitted_at":"2026-03-10T03:51:24Z","title":"ECHO: Elastic Speculative Decoding with Sparse Gating for High-Concurrency Scenarios","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-15T14:09:59.938676Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.09603"},"observation_digest":"sha256:e65e2d2fa92c96c442899218bb0859ca3186a12c9836394ce795c0a9e4cb35a6","observation_id":"cad5c742-0010-4ab2-bb08-eeee2d1f2243","resolution":{"observed_at":"2026-05-15T14:10:03.124996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.12247","last_updated":"2026-04-14T03:47:04Z","snapshot_observed_at":"2026-07-06T23:00:28.036409Z","submitted_at":"2026-04-14T03:47:04Z","title":"SpecBound: Adaptive Bounded Self-Speculation with Layer-wise Confidence Calibration","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T16:22:05.049712Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.12247"},"observation_digest":"sha256:b8cb56cf459b18f2b3932d8ccae0fb72803f58ba91fb68bd4f552b2bc2c8bbfc","observation_id":"9f8f78f0-47cf-44a7-8162-5a6ebfcda569","resolution":{"observed_at":"2026-05-11T09:00:58.706352Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.13634","last_updated":"2026-04-15T09:01:54Z","snapshot_observed_at":"2026-08-15T03:59:33.844764Z","submitted_at":"2026-04-15T09:01:54Z","title":"Calibrated Speculative Decoding: Frequency-Guided Candidate Selection for Efficient Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T13:26:05.910987Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.13634"},"observation_digest":"sha256:3ceb87407fcc9d90e9c9641c516186ea010c7c6a6fb4d43d90368f43731c8777","observation_id":"18aa11fd-0887-4c7b-b36d-29c82d93012d","resolution":{"observed_at":"2026-05-10T13:30:26.836168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.25698","last_updated":"2026-07-07T03:27:09Z","snapshot_observed_at":"2026-08-12T23:35:39.690472Z","submitted_at":"2026-04-28T14:24:58Z","title":"Reference-Augmented Learning for Precise Tracking Policy of Tendon-Driven Continuum Robots","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-01T08:53:21.013613Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.25698"},"observation_digest":"sha256:cf9863ae73517b45181482b46fead239261505770892bc7271e08473383b85ec","observation_id":"10e278ea-df8d-4c25-aa1d-c2c913b7ff78","resolution":{"observed_at":"2026-07-01T08:55:34.764013Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2604.25699","last_updated":"2026-08-04T17:18:30Z","snapshot_observed_at":"2026-08-19T08:27:16.485936Z","submitted_at":"2026-04-28T14:26:22Z","title":"NVLLM: A 3D NAND-Centric Architecture Enabling Edge on-Device LLM Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-07T14:14:33.939889Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2604.25699"},"observation_digest":"sha256:48c7221b63463c35c22deae1779f44b4128ecb61f09d902557a8a07238c298d0","observation_id":"62095661-8c01-44df-8209-e04431b7cf4a","resolution":{"observed_at":"2026-05-12T00:46:13.421697Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.06548","last_updated":"2026-05-07T16:44:56Z","snapshot_observed_at":"2026-08-14T20:14:56.366023Z","submitted_at":"2026-05-07T16:44:56Z","title":"Continuous Latent Diffusion Language Model","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-08T10:04:09.646578Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.06548"},"observation_digest":"sha256:5f7f529fb7485668b7deafde9c2e02f3ffa8e1e4978421b0fd581676585c38e5","observation_id":"15ef1948-d9e8-4303-888c-333cc1e5568f","resolution":{"observed_at":"2026-05-11T20:11:10.714208Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.07243","last_updated":"2026-05-21T16:49:20Z","snapshot_observed_at":"2026-08-16T12:38:42.049714Z","submitted_at":"2026-05-08T04:59:48Z","title":"SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-11T02:27:45.880587Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.07243"},"observation_digest":"sha256:07cee32fdc7dd4d5884414abef3d22479d0417cd748bdba93bc6ac739972875d","observation_id":"0d58b655-de0b-4c97-8463-a009ac734da2","resolution":{"observed_at":"2026-05-11T03:30:57.267208Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.07243","last_updated":"2026-05-21T16:49:20Z","snapshot_observed_at":"2026-08-16T12:38:42.049714Z","submitted_at":"2026-05-08T04:59:48Z","title":"SpecBlock: Block-Iterative Speculative Decoding with Dynamic Tree Drafting","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T10:49:25.448580Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.07243"},"observation_digest":"sha256:f7814df139a84de45f71eaff6bfe074044487c920451d3f1e31a9842077dd5ff","observation_id":"66ef52a5-aef0-4a1c-a1f4-4a15bf6cdf36","resolution":{"observed_at":"2026-05-22T10:51:26.023476Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.11186","last_updated":"2026-05-11T19:50:08Z","snapshot_observed_at":"2026-08-11T13:29:21.900695Z","submitted_at":"2026-05-11T19:50:08Z","title":"CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-13T04:06:24.409303Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.11186"},"observation_digest":"sha256:c54523f34ac5a42412ab0a11c33da23ace4d42378c08ff79043e519f8104f46b","observation_id":"92ef94dd-642f-4c83-9ab2-1ab4232b359b","resolution":{"observed_at":"2026-05-13T04:07:13.051959Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.14978","last_updated":"2026-05-15T02:45:40Z","snapshot_observed_at":"2026-08-15T09:29:55.598371Z","submitted_at":"2026-05-14T15:41:57Z","title":"Performance-Driven Policy Optimization for Speculative Decoding with Adaptive Windowing","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T16:40:17.370100Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.14978"},"observation_digest":"sha256:d21e2ca22911166c540b6723f01e150f0845f15179da040115c16e0d1083091b","observation_id":"59756922-f0fc-4822-b19c-ba12820ebacb","resolution":{"observed_at":"2026-05-19T16:42:39.741861Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.15051","last_updated":"2026-05-14T16:45:28Z","snapshot_observed_at":"2026-08-15T01:50:07.860287Z","submitted_at":"2026-05-14T16:45:28Z","title":"An Interpretable Latency Model for Speculative Decoding in LLM Serving","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T21:23:39.721900Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.15051"},"observation_digest":"sha256:c822e4d76b00443219e0f6180e0e69727fe26a3d52784db366b424f35bc2a182","observation_id":"b5927a08-cf39-4b7b-984f-aceebefb64a3","resolution":{"observed_at":"2026-06-30T21:25:04.280613Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.20104","last_updated":"2026-05-19T16:55:48Z","snapshot_observed_at":"2026-08-13T01:08:05.116524Z","submitted_at":"2026-05-19T16:55:48Z","title":"Draft Less, Retrieve More: Hybrid Tree Construction for Speculative Decoding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T06:58:07.996335Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.20104"},"observation_digest":"sha256:ed3c83d7c88ea290466ec6848968ed81ffb1af5a0b3a447fd092425400045a14","observation_id":"35c9858a-8f70-41ad-a659-b32f0896c7d2","resolution":{"observed_at":"2026-05-20T07:03:06.430726Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.26558","last_updated":"2026-05-26T05:12:44Z","snapshot_observed_at":"2026-08-12T18:15:32.484112Z","submitted_at":"2026-05-26T05:12:44Z","title":"Cassandra: Enabling Reasoning LLMs at Edge via Self-Speculative Decoding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-01T16:19:54.910430Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.26558"},"observation_digest":"sha256:7e6bf58f8eb169c0fd7d54dd53bdc9192594eab545cfd468cd5f885e338d7f91","observation_id":"4514b904-9626-4883-9502-53c081bc6c97","resolution":{"observed_at":"2026-07-01T16:25:49.800642Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2605.29727","last_updated":"2026-05-28T10:21:34Z","snapshot_observed_at":"2026-08-14T09:22:35.528617Z","submitted_at":"2026-05-28T10:21:34Z","title":"Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T08:51:11.662084Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2605.29727"},"observation_digest":"sha256:cd53f82530e6cc03d1d4fc2c4246678b06098170d3b4cecf2a3707452fe67b39","observation_id":"a0f701da-1319-4f55-bcd5-2867ec4ac1b4","resolution":{"observed_at":"2026-06-29T08:53:15.729175Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2606.05158","last_updated":"2026-08-01T06:36:12Z","snapshot_observed_at":"2026-08-16T08:39:20.419971Z","submitted_at":"2026-06-03T17:57:04Z","title":"Streaming Communication in Multi-Agent Reasoning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T06:24:07.052856Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.05158"},"observation_digest":"sha256:8bd3bb6d435bf6d07935cbf8ec05728a6b4d91b6dd9a2e79bdd96456de100f49","observation_id":"0fbb1dca-ea4b-4b0d-97a4-2c7dd80da296","resolution":{"observed_at":"2026-07-02T08:06:47.912337Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-04T04:58:39.126792Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.05158","last_updated":"2026-08-01T06:36:12Z","snapshot_observed_at":"2026-08-16T08:39:20.419971Z","submitted_at":"2026-06-03T17:57:04Z","title":"Streaming Communication in Multi-Agent Reasoning","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T04:58:39.126792Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.05158"},"observation_digest":"sha256:15098720d71224eba342921c0e0cf4606620977fafc8ad1dbb2be5f4a3f94cf8","observation_id":"ec146b83-2ad8-44c3-8b30-57a8f444efe9","resolution":{"observed_at":"2026-08-04T04:58:39.126792Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2606.10935","last_updated":"2026-06-09T14:45:12Z","snapshot_observed_at":"2026-08-17T17:13:08.490848Z","submitted_at":"2026-06-09T14:45:12Z","title":"CLP: Collocation-Length Prediction for Zero-Loss Adaptive Multi-Token Inference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T13:49:06.097882Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.10935"},"observation_digest":"sha256:04fe16f4942b0b17878c099cbd1050332b37e67e38f8c880efb5e4902fadff92","observation_id":"699eda5f-81cf-411f-b685-706dc01c62be","resolution":{"observed_at":"2026-07-03T04:37:36.698018Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2606.24937","last_updated":"2026-07-27T15:17:17Z","snapshot_observed_at":"2026-08-20T13:10:26.183805Z","submitted_at":"2026-06-22T17:48:54Z","title":"The Hitchhiker's Guide to Agentic AI: From Foundations to Systems","version":1},"reference_index":157,"source":"pdf_text","source_observed_at":"2026-06-26T08:09:57.542558Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.24937"},"observation_digest":"sha256:e50db38655675f3442c26e200187cf37a74014e6e97e0c8767f8ec9e103c71a3","observation_id":"99224362-d687-4528-8979-9d822902a361","resolution":{"observed_at":"2026-07-04T11:09:46.520199Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-02T10:27:18.314340Z","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":"2606.24937","last_updated":"2026-07-27T15:17:17Z","snapshot_observed_at":"2026-08-20T13:10:26.183805Z","submitted_at":"2026-06-22T17:48:54Z","title":"The Hitchhiker's Guide to Agentic AI: From Foundations to Systems","version":2},"reference_index":157,"source":"pdf_text","source_observed_at":"2026-08-02T10:27:18.314340Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.24937"},"observation_digest":"sha256:5251f13ff6bab46d7f17f9a8642bf85a58ef5416ab0ddef40755802395b1d3d6","observation_id":"4c1a0877-baac-4beb-b2f5-d869f41fdb0a","resolution":{"observed_at":"2026-08-02T10:27:18.314340Z","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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2606.25097","last_updated":"2026-06-23T19:06:42Z","snapshot_observed_at":"2026-08-13T06:10:21.793942Z","submitted_at":"2026-06-23T19:06:42Z","title":"Speculative Decoding at Temperature Zero: A Scoped Safety-Invariance Screen with a 48,072-Sample Expansion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T00:05:06.647295Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.25097"},"observation_digest":"sha256:bc43560293983dfb86c773270f814febd7e3058eaa8283643bc5f9bfef6aef32","observation_id":"cc8ff558-417d-4586-90b9-a81634a57f18","resolution":{"observed_at":"2026-07-04T16:59:58.336242Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-06-25T21:29:40.564852Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:3b5e82b75f0709200a8284ccf5cb343d891e2e74f1fd6cc083d3295aaddd798d","observation_id":"66173187-ef08-445e-adba-c83020c6cd3b","resolution":{"observed_at":"2026-07-04T19:20:06.721558Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-07-01T06:33:45.824727Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.25354"},"observation_digest":"sha256:a84decb335c2d0b32f827e4b2ecd9a9b2c5e77410162dd7746112e6cc929e22d","observation_id":"f76e1e01-6c36-4a4f-bbe0-e07acf9f7e7d","resolution":{"observed_at":"2026-07-01T06:35:29.632224Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.02057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.02057","snapshot_observed_at":"2026-07-04T19:20:06.719647Z","title":"Break the sequential dependency of llm inference using lookahead decoding","venue":null,"work_id":"5d606304-705f-47b1-a8e4-78c05e49dcda","year":2024},"citing_paper":{"arxiv_id":"2606.27538","last_updated":"2026-06-25T20:39:26Z","snapshot_observed_at":"2026-08-16T14:44:12.662461Z","submitted_at":"2026-06-25T20:39:26Z","title":"The Context-Ready Transformer","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-06-29T01:59:43.093422Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2606.27538"},"observation_digest":"sha256:c1887ce65664ee5eb305ea24fdd82990133361ab29d449608dea079b524b5d81","observation_id":"24e0f59b-fd67-45d2-9a86-e7bd98e77307","resolution":{"observed_at":"2026-07-01T18:25:58.302117Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-07-12T09:50:23.266920Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02574","last_updated":"2026-06-30T16:12:40Z","snapshot_observed_at":"2026-08-13T16:31:58.188253Z","submitted_at":"2026-06-30T16:12:40Z","title":"From Tensor Buffer to Distributed Memory Hierarchy: A Survey of KV Cache Management for LLM Serving","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-12T09:50:23.266920Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2607.02574"},"observation_digest":"sha256:4d608642bcb52ae508f1fc0d97c31543a2f78a4eacecac27c4f4e430330c3a6b","observation_id":"9fd9a7c0-1059-4670-95b1-72526efb4668","resolution":{"observed_at":"2026-07-12T09:50:23.266920Z","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-01T18:29:31.653276Z","title":"arXiv:2402.02057","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17299","last_updated":"2026-07-19T15:31:13Z","snapshot_observed_at":"2026-08-15T19:13:30.871033Z","submitted_at":"2026-07-19T15:31:13Z","title":"WAR: Workload-Aware Rollouts for Synchronous Agentic Reinforcement Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T18:29:31.653276Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2607.17299"},"observation_digest":"sha256:5c376a1afe9021642166539e90f38df74ecc749d00dd7cc84cd0d0a368641ae5","observation_id":"c117637a-c16a-402b-9c74-8ad8c0857f32","resolution":{"observed_at":"2026-08-01T18:29:31.653276Z","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-07-31T19:52:40.513351Z","title":"Kelvin Guu, Kenton Lee, Zora Tung, Panupong Pasupat, and Ming-Wei Chang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24260","last_updated":"2026-07-27T10:51:38Z","snapshot_observed_at":"2026-08-19T08:04:26.359104Z","submitted_at":"2026-07-27T10:51:38Z","title":"KAP: Bridging the Knowledge Selection-Runtime Consumption Gap in LLM Systems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T19:52:40.513351Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2607.24260"},"observation_digest":"sha256:3feec2a4be4e2dc9dc87cf14bd6cb111143abbc79194f8a1914061e7bd4bfd1e","observation_id":"cfb1070d-3e61-4d60-8d5d-1a763a6b9243","resolution":{"observed_at":"2026-07-31T19:52:40.513351Z","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-01T10:55:32.040437Z","title":"arXiv preprint arXiv:2402.02057 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27269","last_updated":"2026-07-29T10:54:46Z","snapshot_observed_at":"2026-08-17T03:33:24.292903Z","submitted_at":"2026-07-29T10:54:46Z","title":"Beyond KV Reconstruction: Functional Reconstruction for MLA Draft Models in Speculative Decoding","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T10:55:32.040437Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2607.27269"},"observation_digest":"sha256:2400f825ccee146490a08bf91c2c12c998f401043b4c2b49e2184af45c14a7d2","observation_id":"f093adaf-d518-4b78-a85c-5c89bf3c73b0","resolution":{"observed_at":"2026-08-01T10:55:32.040437Z","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-05T04:16:08.547924Z","title":"arXiv preprint arXiv:2402.02057 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.04010","last_updated":"2026-08-04T17:59:58Z","snapshot_observed_at":"2026-08-15T09:45:02.472901Z","submitted_at":"2026-08-04T17:59:58Z","title":"ParVL: Parallel Scaling and Expandable Compute Allocation for Multimodal LLMs","version":1},"reference_index":114,"source":"arxiv_source","source_observed_at":"2026-08-05T04:16:08.547924Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2608.04010"},"observation_digest":"sha256:1d63fd4332aa654b3360a9a961139a3bba6d2dbf8c08a48f785adcf6a494d2f8","observation_id":"d2753568-a074-4b6d-869b-10a38879b878","resolution":{"observed_at":"2026-08-05T04:16:08.547924Z","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-07T14:06:38.812461Z","title":"arXiv preprint arXiv:2402.02057 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06146","last_updated":"2026-08-06T15:16:18Z","snapshot_observed_at":"2026-08-18T00:54:26.110183Z","submitted_at":"2026-08-06T15:16:18Z","title":"PaDoc: Layout-Grounded Parallel Decoding for Document Parsing","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T14:06:38.812461Z"},"links":{"cited_paper":"/paper/2402.02057","citing_paper":"/paper/2608.06146"},"observation_digest":"sha256:98c757e9c98a7f113cf1f21a528005adf574effae70d4e5f1a6ec160fd00dd39","observation_id":"00e86942-c22d-4fd4-af08-19eccf7a23d2","resolution":{"observed_at":"2026-08-07T14:06:38.812461Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.02057/citation-record","integrity":"/paper/2402.02057/integrity","json":"/paper/2402.02057/citation-record.json","paper":"/paper/2402.02057"},"outbound":[],"paper":{"arxiv_id":"2402.02057","last_updated":"2024-02-03T06:37:50Z","latest_version":1,"primary_category":"cs.LG","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"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 61 inbound Pith citation observations for arXiv:2402.02057."}