{"as_of":"2026-08-09T17:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ba568ff93618798d623513fe8b36e9d80f3e18e4a8354aa3c45683348637a57a","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:42:56.088831Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T21:57:39.274234Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-08-06T14:42:56.088831Z","title":"Dyspec: Faster speculative decoding with dynamic token tree structure,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.18181","last_updated":"2025-07-28T08:55:09Z","snapshot_observed_at":"2026-08-07T03:43:34.568661Z","submitted_at":"2025-07-24T08:27:53Z","title":"SpecASR: Accelerating LLM-based Automatic Speech Recognition via Speculative Decoding","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:42:56.088831Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2507.18181"},"observation_digest":"sha256:02a55cd81b424dc6baae64d892be887d2e2a96a4ef4108d6ef9f6b9d36d9f17f","observation_id":"b1f4f612-a7f2-423b-97f4-69f78366719e","resolution":{"observed_at":"2026-08-06T14:42:56.088831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":"2410.11744","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-07-10T21:57:39.274234Z","title":"DySpec: Faster speculative decoding with dynamic token tree structure","venue":"cs.LG","work_id":"2cdd6743-604a-4c17-a772-3809d93681fb","year":2024},"citing_paper":{"arxiv_id":"2605.11186","last_updated":"2026-05-11T19:50:08Z","snapshot_observed_at":"2026-07-06T23:23:02.025664Z","submitted_at":"2026-05-11T19:50:08Z","title":"CATS: Cascaded Adaptive Tree Speculation for Memory-Limited LLM Inference Acceleration","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-13T04:06:24.409303Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2605.11186"},"observation_digest":"sha256:529f95ef6b767669e200297c1e1af170c02290ab887a6ad753c1500b85005007","observation_id":"8fea9f7a-6697-4e6b-825e-2879a04eb493","resolution":{"observed_at":"2026-05-13T04:07:13.063095Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":"2410.11744","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-07-10T21:57:39.274234Z","title":"DySpec: Faster speculative decoding with dynamic token tree structure","venue":"cs.LG","work_id":"2cdd6743-604a-4c17-a772-3809d93681fb","year":2024},"citing_paper":{"arxiv_id":"2607.06763","last_updated":"2026-07-12T19:52:09Z","snapshot_observed_at":"2026-08-04T00:51:59.830713Z","submitted_at":"2026-07-07T19:48:36Z","title":"Trees from Marginals: Autoregressive drafting with factorized priors","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T21:49:34.512370Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2607.06763"},"observation_digest":"sha256:cb6b343f9532a7e4a1b1651cea476188e25aa5dca64206ddc2d0837bfb838cab","observation_id":"be2ac203-4846-4da1-9679-58e6eca95e21","resolution":{"observed_at":"2026-07-10T21:57:39.327815Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-07-14T15:58:05.356765Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.06763","last_updated":"2026-07-12T19:52:09Z","snapshot_observed_at":"2026-08-04T00:51:59.830713Z","submitted_at":"2026-07-07T19:48:36Z","title":"Trees from Marginals: Autoregressive drafting with factorized priors","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T15:58:05.356765Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2607.06763"},"observation_digest":"sha256:e8d5b7d0f05246f9052d211bcd58764222a1546b9a520a67789f2661f84645f6","observation_id":"cadf4cac-e838-4d06-954f-2e5cc562f1d2","resolution":{"observed_at":"2026-07-14T15:58:05.356765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-08-01T01:22:13.846361Z","title":"Tengyu Xu, Eryk Helenowski, Karthik Abinav Sankararaman, Di Jin, Kaiyan Peng, Eric Han, Shaoliang Nie, Chen Zhu, Hejia Zhang, Wenxuan Zhou, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25852","last_updated":"2026-07-29T07:31:33Z","snapshot_observed_at":"2026-08-07T17:12:03.331999Z","submitted_at":"2026-07-28T15:25:05Z","title":"AngelSpec: Towards Real-World High Performance Inference with Speculative Decoding","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T01:22:13.846361Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2607.25852"},"observation_digest":"sha256:38c744b767498c3660eac3f87c2c43fda38f728784b2d840baa4edaf97fb6fb5","observation_id":"13dccef7-4acc-4a4c-b818-9bf5b16f10b3","resolution":{"observed_at":"2026-08-01T01:22:13.846361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11744","snapshot_observed_at":"2026-08-05T00:46:51.629742Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00531","last_updated":"2026-08-01T08:43:34Z","snapshot_observed_at":"2026-08-08T21:14:30.213581Z","submitted_at":"2026-08-01T08:43:34Z","title":"CURE: Local Uncertainty Repair for Block-Parallel Speculative Decoding","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-05T00:46:51.629742Z"},"links":{"cited_paper":"/paper/2410.11744","citing_paper":"/paper/2608.00531"},"observation_digest":"sha256:f81a12043aa5a393d3b37b8cf95d839241c30888ef33a1fdc93984e256776e73","observation_id":"d60e9140-553b-4961-88ea-8774487cfcb1","resolution":{"observed_at":"2026-08-05T00:46:51.629742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.11744/citation-record","integrity":"/paper/2410.11744/integrity","json":"/paper/2410.11744/citation-record.json","paper":"/paper/2410.11744"},"outbound":[],"paper":{"arxiv_id":"2410.11744","last_updated":"2024-10-15T16:21:15Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:33:57.090585Z","submitted_at":"2024-10-15T16:21:15Z","title":"DySpec: Faster Speculative Decoding with Dynamic Token Tree Structure"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2410.11744."}