{"as_of":"2026-08-15T14:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:db3c53052ecbc6ed82e333018e22cf3fcd664f20efdd43e0bdca373eacd3e68a","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T10:09:31.872801Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.10661/citation-record","integrity":"/paper/2607.10661/integrity","json":"/paper/2607.10661/citation-record.json","paper":"/paper/2607.10661"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.05109","last_updated":"2024-10-07T16:21:29Z","snapshot_observed_at":"2026-08-14T23:09:03.763342Z","submitted_at":"2024-02-07T18:58:50Z","title":"Hydra: Sequentially-Dependent Draft Heads for Medusa Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05109","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Jacob Austin, Augustus Odena, Maxwell Nye, Maarten Bosma, Henryk Michalewski, David Dohan, Ellen Jiang, Carrie Cai, Michael Terry, Quoc Le, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2402.05109","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:734361bc58b4c61bc57211f53afe0784e4a45dcb8a0f98b2cd14760364a31a1f","observation_id":"379e6e24-e167-41a6-9bd4-50fdc7951801","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19309","last_updated":"2025-01-31T17:09:53Z","snapshot_observed_at":"2026-08-13T20:59:09.799963Z","submitted_at":"2025-01-31T17:09:53Z","title":"Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19309","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Tianle Cai, Yuhong Li, Zhengyang Geng, Hongwu Peng, Jason D","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2501.19309","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:2e274748407d11ace387b699a718e0d51c1871486619b179c8098873b11efde7","observation_id":"108b1706-daa3-4a9c-8c42-c3313cd2b39a","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Training verifiers to solve math word problems.arXiv preprint arXiv:2110.14168,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:5cfca60a95d685842783708a8adee7345518dedf918dc610d2b30521d25f3e1f","observation_id":"5e830182-a92a-416c-9aa8-55c3899e4fa5","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15077","last_updated":"2025-03-04T13:58:39Z","snapshot_observed_at":"2026-08-03T09:40:31.365295Z","submitted_at":"2024-01-26T18:59:01Z","title":"EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15077","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"10 Accepted at COLM 2026 Tianyu Liu, Yun Li, Qitan Lv, Kai Liu, Jianchen Zhu, Winston Hu, and Xiao Sun","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2401.15077","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:6fa3efc0ff112dff60f7286123eee25e574dfe88032ef530c54db35912357357","observation_id":"1242df3b-0e5a-4d9f-9b23-82d741873d1f","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.11850","last_updated":"2025-02-17T03:33:50Z","snapshot_observed_at":"2026-08-12T23:04:27.100022Z","submitted_at":"2024-08-13T08:32:06Z","title":"PEARL: Parallel Speculative Decoding with Adaptive Draft Length","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.11850","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2408.11850","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:b5bddeaab8230c2151afcb86b65268e1f8b7d252e965d61ea687a7a3098161d6","observation_id":"e5b833aa-8d8f-48fd-93ce-dad896ab9cc8","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"URLhttp://dx.doi.org/10.1145/3620666.3651335","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:4628414163f8f58cf81a11abc824f54c7896fd819d8e6a562d04ff24eb41d575","observation_id":"8c297c7d-d20a-43ea-9e6b-fd5aaffd761a","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Speculative decoding: Exploiting speculative execution for accelerating seq2seq generation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:5157228d5b8618714bd4acce1639f2d5a52b95dcc18687a01aebf0c4a9e325f6","observation_id":"e8191ffd-ad01-4bee-b44e-ff943225de86","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"doi: 10.18653/v1/2023.findings-emnlp.257","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:c2a0fb3d540e8cbbbbcde77576021c37e36294785f4c059c487a3880a70c1ed1","observation_id":"518f386f-ed90-4be6-891d-f1101586e8c7","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06706","last_updated":"2024-01-12T17:15:23Z","snapshot_observed_at":"2026-08-13T04:43:48.759883Z","submitted_at":"2024-01-12T17:15:23Z","title":"Multi-Candidate Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06706","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"doi: 10.18653/v1/2024.findings-acl.456","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2401.06706","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:89ec599d82efcb18123f5e6c701935691f4ffe9204176bc1235cd488ca2110fc","observation_id":"e84c7af2-40ca-46c5-8fc3-f62103bf2fe0","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11309","last_updated":"2025-06-12T21:15:58Z","snapshot_observed_at":"2026-08-08T01:16:03.022130Z","submitted_at":"2025-06-12T21:15:58Z","title":"SwiftSpec: Ultra-Low Latency LLM Decoding by Scaling Asynchronous Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.11309","snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Lianmin Zheng, Wei-Lin Chiang, Ying Sheng, Siyuan Zhuang, Zhanghao Wu, Yonghao Zhuang, Zi Lin, Zhuohan Li, Dacheng Li, Eric P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"cited_paper":"/paper/2506.11309","citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:98764de95931419233b1dc9fb658f4c57bab4778ff5422b6cbbdcd07846a4f6c","observation_id":"44023fab-b54f-4e68-933e-80447626be8f","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"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","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:3a9ed38cd187abb686960082dbc721cb2b93ca3a922251e5dd3e6fbe52a8960a","observation_id":"f836cc65-5161-44d1-b163-365834ef4563","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"Sampling Procedure.Given a set of candidate nodes {n1, n2,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:2e3ad77a7aa7d7642f14ca4b9daeb12b357f10aa0fe75b56d0eedac229f5a8e0","observation_id":"a9bbeeb5-1c39-4b43-929b-c0a11610e27f","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:09:31.872801Z","title":"After rejectingn 1,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T10:09:31.872801Z"},"links":{"citing_paper":"/paper/2607.10661"},"observation_digest":"sha256:1599d6cd069b0ef086fc3578c76e459810df2bf4bc9fd1b9dc64c6e9b688c1df","observation_id":"52c8931b-2409-43a6-9ade-93a13f89ae83","resolution":{"observed_at":"2026-07-14T10:09:31.872801Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10661","last_updated":"2026-07-12T09:10:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-14T15:46:18.109969Z","submitted_at":"2026-07-12T09:10:34Z","title":"Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"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."}