{"as_of":"2026-08-15T21:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62690d19fdc4e043360003e40b1804e378aadc0f62d4b715b0642bf0bd4528d7","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T05:10:44.821607Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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/2608.13524/citation-record","integrity":"/paper/2608.13524/integrity","json":"/paper/2608.13524/citation-record.json","paper":"/paper/2608.13524"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-08-13T23:55:57.074762Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-08-14T05:10:44.754178Z","title":"Chen, J.; Liang, Y.; and Liu, Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.754178Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:5f733f6b9defdad831d467baa54da1a265302cc8d3b64d08c5eae45af9fb4761","observation_id":"7c542f74-60c2-4d54-ba00-c34a79d1e3fb","resolution":{"observed_at":"2026-08-14T05:10:44.754178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:10:45.076171Z","title":"InProceedings of the 2025 Conference of the NationsoftheAmericasChapteroftheAssociationforCom- putationalLinguistics:HumanLanguageTechnologies(Vol- ume 1: Long Papers), 12042–12059","venue":null,"work_id":"633d9792-ed95-495c-8377-e6169f84671a","year":2025},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.762567Z"},"links":{"citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:24928ee64d44e99b45dae7acaecaf8c963c63abea6e1b9d1d5d06d6dac6b9d2f","observation_id":"2e84342f-85f5-4da8-b6d6-9cf3e5e1cbad","resolution":{"observed_at":"2026-08-14T05:10:45.081279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-08-15T12:33:55.451951Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-14T05:10:44.774149Z","title":"Huang,J.;Zhang,Y.;Zhang,Q.;Lin,H.;Xu,H.;andZhang, L","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.774149Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:6afd6626c130a1dc7d5eb5bacdeb97b1fda6d37118e8b2674e2983d681910065","observation_id":"177838af-7011-4859-ad3d-b4646d859b59","resolution":{"observed_at":"2026-08-14T05:10:44.774149Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.29707","last_updated":"2026-05-28T10:07:44Z","snapshot_observed_at":"2026-08-02T05:37:29.736109Z","submitted_at":"2026-05-28T10:07:44Z","title":"Domino: Decoupling Causal Modeling from Autoregressive Drafting in Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.29707","snapshot_observed_at":"2026-08-14T05:10:44.778268Z","title":"Leviathan, Y.; Kalman, M.; and Matias, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.778268Z"},"links":{"cited_paper":"/paper/2605.29707","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:11546a6f1fd90fe7150bb8f31f74afe81d37241eeb092d48474a03f508756a42","observation_id":"09af4913-80e8-41f3-b760-f17a53ba4872","resolution":{"observed_at":"2026-08-14T05:10:44.778268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.10875","last_updated":"2026-06-04T15:16:30Z","snapshot_observed_at":"2026-08-14T22:08:05.272757Z","submitted_at":"2025-08-14T17:47:22Z","title":"A Survey on Diffusion Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.10875","snapshot_observed_at":"2026-08-14T05:10:44.782766Z","title":"InInter- national Conference on Machine Learning, 19274–19286","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.782766Z"},"links":{"cited_paper":"/paper/2508.10875","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:aa2942b428167cb7ef9b041944b2bbb2c3c3e9373ba085fd9943d42ce3567057","observation_id":"162c353b-860d-4f00-b73b-2332a8a43b24","resolution":{"observed_at":"2026-08-14T05:10:44.782766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.20050","last_updated":"2023-05-31T17:24:00Z","snapshot_observed_at":"2026-08-11T17:22:43.545531Z","submitted_at":"2023-05-31T17:24:00Z","title":"Let's Verify Step by Step","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.20050","snapshot_observed_at":"2026-08-14T05:10:44.787407Z","title":"Myrzakhan,A.;Li,T.;Guo,B.;Tang,S.;andShen,Z.2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.787407Z"},"links":{"cited_paper":"/paper/2305.20050","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:e3ea583aaa2006113b831ce3c46c7fcb43f0e57abbf9d96c5bda847afcbc2265","observation_id":"0f43a750-6488-4a47-9373-d7484391f01c","resolution":{"observed_at":"2026-08-14T05:10:44.787407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.09992","last_updated":"2025-10-18T15:35:05Z","snapshot_observed_at":"2026-08-04T04:34:22.998376Z","submitted_at":"2025-02-14T08:23:51Z","title":"Large Language Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09992","snapshot_observed_at":"2026-08-14T05:10:44.791539Z","title":"Rheinboldt, P.; Berdoz, F.; and Wattenhofer, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.791539Z"},"links":{"cited_paper":"/paper/2502.09992","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:cb10a013b8ba2b97d994394171a1178f399cd3e5bb5d8ec5ab31b02073e75e06","observation_id":"d6bb50c0-9a26-4fec-81cb-4d64b1fcf483","resolution":{"observed_at":"2026-08-14T05:10:44.791539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.03819","last_updated":"2026-06-02T16:00:18Z","snapshot_observed_at":"2026-08-01T07:33:28.891421Z","submitted_at":"2026-06-02T16:00:18Z","title":"TreeFlash: Parallel AR-Approximation for Faster Speculative Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.03819","snapshot_observed_at":"2026-08-14T05:10:44.795550Z","title":"Ringel, L.; and Romano, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.795550Z"},"links":{"cited_paper":"/paper/2606.03819","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:96281c725da7ae60f0ffcee4efb2ec687b490bfda0b6c4a3ca6b51035b27953e","observation_id":"df0b00dd-16d5-41c2-97fd-3e1990904d57","resolution":{"observed_at":"2026-08-14T05:10:44.795550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.12989","last_updated":"2026-04-14T17:23:14Z","snapshot_observed_at":"2026-08-14T18:32:53.095662Z","submitted_at":"2026-04-14T17:23:14Z","title":"Accelerating Speculative Decoding with Block Diffusion Draft Trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.12989","snapshot_observed_at":"2026-08-14T05:10:44.800257Z","title":"Taori, R.; Gulrajani, I.; Zhang, T.; Dubois, Y.; Li, X.; Guestrin, C.; Liang, P.; and Hashimoto, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.800257Z"},"links":{"cited_paper":"/paper/2604.12989","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:a5e21960e3faf9820bd26b5651cdb682d577a8e855d7521372a6f7a0bc6924b4","observation_id":"719f7465-ac4b-4e82-b334-70ab11f811c2","resolution":{"observed_at":"2026-08-14T05:10:44.800257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:10:45.062917Z","title":"stanford","venue":null,"work_id":"63ed0656-b696-4d0b-ad2a-021b3ad80188","year":2023},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.804878Z"},"links":{"citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:051eb5edababf2352a7321ff2b840aa1a2065df723437e02a34d21152288785f","observation_id":"286fb00d-e6a2-4d2b-920c-9ec621a5fab1","resolution":{"observed_at":"2026-08-14T05:10:45.067809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22618","last_updated":"2025-07-03T04:51:05Z","snapshot_observed_at":"2026-07-06T21:32:23.537939Z","submitted_at":"2025-05-28T17:39:15Z","title":"Fast-dLLM: Training-free Acceleration of Diffusion LLM by Enabling KV Cache and Parallel Decoding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22618","snapshot_observed_at":"2026-08-14T05:10:44.809338Z","title":"Xia, H.; Ge, T.; Wang, P.; Chen, S.-Q.; Wei, F.; and Sui, Z","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.809338Z"},"links":{"cited_paper":"/paper/2505.22618","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:25213c5679be12a049f07fa426aeed61655467fa0296c9902aad1b3711578232","observation_id":"f048eb84-9393-4d67-afb1-73fa0ba9262b","resolution":{"observed_at":"2026-08-14T05:10:44.809338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-08-14T05:10:44.813162Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2023, 3909–3925","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.813162Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:fc6622242a971a97835142fe32dc12466e827ea156be7d8b15b1ade0d3f1da4f","observation_id":"8407d65a-ea79-4f68-8d0a-1df3ebbb0578","resolution":{"observed_at":"2026-08-14T05:10:44.813162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.15487","last_updated":"2025-08-21T12:09:58Z","snapshot_observed_at":"2026-08-14T18:38:02.862463Z","submitted_at":"2025-08-21T12:09:58Z","title":"Dream 7B: Diffusion Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.15487","snapshot_observed_at":"2026-08-14T05:10:44.817005Z","title":"Zhang, Y.; and Math-AI, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.817005Z"},"links":{"cited_paper":"/paper/2508.15487","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:8e898b6e3f5a33e4cdbdabee801a4d91a8a4e0efc0ca721508dc9a976a5eeeaa","observation_id":"0c37adbc-29b0-4299-9c21-c55c0f8c76ad","resolution":{"observed_at":"2026-08-14T05:10:44.817005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T05:10:45.048061Z","title":null,"venue":null,"work_id":"aecf3900-b16d-4856-a275-2b51b93ed16b","year":1977},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.821607Z"},"links":{"citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:8160f5c9d3298e8bb57a18572f1efa79298e5c043bc61fb4bd401f9cc8d890ff","observation_id":"48cfdcdc-c1f9-48df-ad9c-409f69cf03a5","resolution":{"observed_at":"2026-08-14T05:10:45.053271Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-14T05:10:44.766158Z","title":"arXiv preprint arXiv:2110.14168","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.766158Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:59b0e3973d22ef2b4dc5d8b9ed9f5b8534c18ea3951bbb5f13071b98cebc5b6e","observation_id":"458b04f9-2ca1-44bb-b5d1-91d04a73bd78","resolution":{"observed_at":"2026-08-14T05:10:44.766158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.08933","last_updated":"2023-02-14T06:45:49Z","snapshot_observed_at":"2026-07-06T14:06:34.310083Z","submitted_at":"2022-10-17T10:49:08Z","title":"DiffuSeq: Sequence to Sequence Text Generation with Diffusion Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.08933","snapshot_observed_at":"2026-08-14T05:10:44.770281Z","title":"Guo, D.; Yang, D.; Zhang, H.; Song, J.; Wang, P.; Zhu, Q.; Xu, R.; Zhang, R.; Ma, S.; Bi, X.; et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.770281Z"},"links":{"cited_paper":"/paper/2210.08933","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:1d949c2d6bb8220b523330f63e79d85486e8ffb9d25dcf3a4169c35d81e0ea8c","observation_id":"f409105a-fb78-45fe-8988-6ed1871c99da","resolution":{"observed_at":"2026-08-14T05:10:44.770281Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-14T05:10:44.740950Z","title":"Arriola, M.; Gokaslan, A.; Chiu, J.; Yang, Z.; Qi, Z.; Han, J.; Sahoo, S.; and Kuleshov, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.740950Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:fc7cb384ad91304dab9f40a64ea010d1445b233bb1d9318bf75bc60ec14d21be","observation_id":"08d6252a-11bb-40da-a5bc-fca21292e910","resolution":{"observed_at":"2026-08-14T05:10:44.740950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.10774","last_updated":"2024-06-14T23:32:32Z","snapshot_observed_at":"2026-07-06T17:17:56.276857Z","submitted_at":"2024-01-19T15:48:40Z","title":"Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.10774","snapshot_observed_at":"2026-08-14T05:10:44.749781Z","title":"Chen, C.; Borgeaud, S.; Irving, G.; Lespiau, J.-B.; Sifre, L.; and Jumper, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.749781Z"},"links":{"cited_paper":"/paper/2401.10774","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:1e69af73e2eabff818fb48f101886c3688acad94c1c4c00ceb6acf2996b85638","observation_id":"6748f25e-6a27-48f1-a393-5ebe566c8ac7","resolution":{"observed_at":"2026-08-14T05:10:44.749781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-15T17:40:38.050939Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-14T05:10:44.745577Z","title":"InInternationalConferenceonLearningRepresen- tations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.745577Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:17524685b507c6665d045bfa7c4e8b711886b9e69279b05b41064528a6a3f1ce","observation_id":"b528491a-f3a1-4201-ac3b-a805c13e6991","resolution":{"observed_at":"2026-08-14T05:10:44.745577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.06036","last_updated":"2026-05-28T09:13:25Z","snapshot_observed_at":"2026-08-14T23:40:22.559473Z","submitted_at":"2026-02-05T18:59:30Z","title":"DFlash: Block Diffusion for Flash Speculative Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.06036","snapshot_observed_at":"2026-08-14T05:10:44.758496Z","title":"Chen, M.; Tworek, J.; Jun, H.; Yuan, Q.; Pinto, H","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-14T05:10:44.758496Z"},"links":{"cited_paper":"/paper/2602.06036","citing_paper":"/paper/2608.13524"},"observation_digest":"sha256:14a008c700def4cf185febaee867ddfd3d1fb8cac7a190054bab041951068050","observation_id":"a7e242c7-d71e-4547-9d3e-01e62f8a8adf","resolution":{"observed_at":"2026-08-14T05:10:44.758496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.13524","last_updated":"2026-08-13T17:43:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T21:17:54.219670Z","submitted_at":"2026-08-13T17:43:44Z","title":"DARTree: Speculative Diffusion Decoding with Autoregressive Draft Trees"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":20},"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 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2608.13524."}