Paper Citation Record · LEDGER

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting

As of 15 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.10661.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.10661 v1

Coverage vector

measured 13 of 13 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-14T10:09:31.872801Z

measured 13 of 13 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-15T06:32:42.880941+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

13 of 13 outbound references displayed

verified exact0
verified fuzzy0
unresolved12
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 379e6e24-e167-41a6-9bd4-50fdc7951801 · outbound

This paper cites Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 108b1706-daa3-4a9c-8c42-c3313cd2b39a · outbound

This paper cites Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e830182-a92a-416c-9aa8-55c3899e4fa5 · outbound

This paper cites Training Verifiers to Solve Math Word Problems.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Training Verifiers to Solve Math Word Problems

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1242df3b-0e5a-4d9f-9b23-82d741873d1f · outbound

This paper cites EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5b833aa-8d8f-48fd-93ce-dad896ab9cc8 · outbound

This paper cites PEARL: Parallel Speculative Decoding with Adaptive Draft Length.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting PEARL: Parallel Speculative Decoding with Adaptive Draft Length

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c297c7d-d20a-43ea-9e6b-fd5aaffd761a · outbound

This paper cites URLhttp://dx.doi.org/10.1145/3620666.3651335.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting URLhttp://dx.doi.org/10.1145/3620666.3651335

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e8191ffd-ad01-4bee-b44e-ff943225de86 · outbound

This paper cites Speculative decoding: Exploiting speculative execution for accelerating seq2seq generation.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Speculative decoding: Exploiting speculative execution for accelerating seq2seq generation

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 518f386f-ed90-4be6-891d-f1101586e8c7 · outbound

This paper cites doi: 10.18653/v1/2023.findings-emnlp.257.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting doi: 10.18653/v1/2023.findings-emnlp.257

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e84c7af2-40ca-46c5-8fc3-f62103bf2fe0 · outbound

This paper cites Multi-Candidate Speculative Decoding.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Multi-Candidate Speculative Decoding

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44023fab-b54f-4e68-933e-80447626be8f · outbound

This paper cites SwiftSpec: Ultra-Low Latency LLM Decoding by Scaling Asynchronous Speculative Decoding.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting SwiftSpec: Ultra-Low Latency LLM Decoding by Scaling Asynchronous Speculative Decoding

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f836cc65-5161-44d1-b163-365834ef4563 · outbound

This paper cites Unless otherwise noted, we use LLaMA-2-13B on MT-Bench and compare greedy expansion with top-k and top-p sampling for draft-tree growth.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Unless otherwise noted, we use LLaMA-2-13B on MT-Bench and compare greedy expansion with top-k and top-p sampling for draft-tree growth

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a9bbeeb5-1c39-4b43-929b-c0a11610e27f · outbound

This paper cites Sampling Procedure.Given a set of candidate nodes {n1, n2,.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting Sampling Procedure.Given a set of candidate nodes {n1, n2,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 52c8931b-2409-43a6-9ade-93a13f89ae83 · outbound

This paper cites After rejectingn 1,.

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting After rejectingn 1,

Reference 13

Resolution: malformed identifier; no resolver link, observed 2026-07-14T10:09:31.872801Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.