{"as_of":"2026-08-22T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:05cfa36c1e093543afefb7a0c6194a577d9d20e19d61792235ea07a6141cd75c","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:16:44.116580Z","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-03T22:29:00.436625Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-08-12T11:16:44.116580Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.18462","last_updated":"2025-08-24T15:48:28Z","snapshot_observed_at":"2026-08-19T03:09:46.193892Z","submitted_at":"2024-11-27T15:53:17Z","title":"Draft Model Knows When to Stop: Self-Verification Speculative Decoding for Long-Form Generation","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T11:16:44.116580Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2411.18462"},"observation_digest":"sha256:7a78b371aa15fa6d55335303d28f411f965c8ae5e71388e07faa1566cfa228b9","observation_id":"14e15ee3-5b4e-4730-a242-ba304f0ef40e","resolution":{"observed_at":"2026-08-12T11:16:44.116580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-08-11T04:25:53.077768Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.18910","last_updated":"2024-12-25T13:57:33Z","snapshot_observed_at":"2026-08-15T20:34:52.552648Z","submitted_at":"2024-12-25T13:57:33Z","title":"AdaEAGLE: Optimizing Speculative Decoding via Explicit Modeling of Adaptive Draft Structures","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T04:25:53.077768Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2412.18910"},"observation_digest":"sha256:881639d3f8055259d3d980b18e7ed7de198e89477a1d68f5c330ddbc0f41bda4","observation_id":"4ac2cbac-95e0-4f9a-ad3b-ae3f831ac12a","resolution":{"observed_at":"2026-08-11T04:25:53.077768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-08-07T11:30:54.597272Z","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":1,"source":"arxiv_source","source_observed_at":"2026-08-07T11:30:54.597272Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2506.02391"},"observation_digest":"sha256:598188113d4b15f250f7df6658d14ee78b4ef367c6845bbbeafbe664759e6f30","observation_id":"1d77c999-79de-4361-bacf-2054ca985910","resolution":{"observed_at":"2026-08-07T11:30:54.597272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-08-07T00:14:52.633170Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.20675","last_updated":"2025-06-17T20:06:08Z","snapshot_observed_at":"2026-08-17T10:07:57.659273Z","submitted_at":"2025-06-17T20:06:08Z","title":"Utility-Driven Speculative Decoding for Mixture-of-Experts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T00:14:52.633170Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2506.20675"},"observation_digest":"sha256:6ed3c3a895f2abb421e655ed18231f0ec9b3f92601b4a0310213678abfb7062a","observation_id":"1d64126f-2f7e-4af2-9ce2-ffface2e9994","resolution":{"observed_at":"2026-08-07T00:14:52.633170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":"2409.00142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-07-03T22:29:00.436625Z","title":"Dynamic depth decoding: Faster speculative decoding for llms.arXiv preprint arXiv:2409.00142","venue":null,"work_id":"d0ed559c-f7ba-4d89-9adf-321909b72d4c","year":2024},"citing_paper":{"arxiv_id":"2510.24211","last_updated":"2026-05-05T17:15:37Z","snapshot_observed_at":"2026-08-21T07:41:28.547112Z","submitted_at":"2025-10-28T09:26:27Z","title":"Speculative Coupled Decoding for Training-Free Lossless Acceleration of Autoregressive Visual Generation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-18T03:20:35.021120Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2510.24211"},"observation_digest":"sha256:8a933df10c95e34a4f0bf366ba5e91abeb985416dbe733f3296c45667923ad3f","observation_id":"0a13ce7b-37bd-4c97-b218-3e61c8f24f20","resolution":{"observed_at":"2026-05-18T03:20:48.663559Z","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":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":"2409.00142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-07-03T22:29:00.436625Z","title":"Dynamic depth decoding: Faster speculative decoding for llms.arXiv preprint arXiv:2409.00142","venue":null,"work_id":"d0ed559c-f7ba-4d89-9adf-321909b72d4c","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":1,"source":"pdf_text","source_observed_at":"2026-05-15T14:09:59.938676Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2604.09603"},"observation_digest":"sha256:79a2dbb3dac3ee88bfcaf802ac03075aba73569860f304153d9e2db8cbfa48e6","observation_id":"c0e30ff3-23a1-4d28-8406-6f609396856d","resolution":{"observed_at":"2026-05-15T14:10:03.159998Z","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":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":"2409.00142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-07-03T22:29:00.436625Z","title":"Dynamic depth decoding: Faster speculative decoding for llms.arXiv preprint arXiv:2409.00142","venue":null,"work_id":"d0ed559c-f7ba-4d89-9adf-321909b72d4c","year":2024},"citing_paper":{"arxiv_id":"2605.00342","last_updated":"2026-05-01T01:52:01Z","snapshot_observed_at":"2026-08-03T04:07:32.005688Z","submitted_at":"2026-05-01T01:52:01Z","title":"Making Every Verified Token Count: Adaptive Verification for MoE Speculative Decoding","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-05-09T19:53:40.791974Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2605.00342"},"observation_digest":"sha256:ad17777abd7a0b0029722256b5bf8b508f178ad224a95a37a2f4d7d355c84819","observation_id":"acbcae23-d9ea-4d37-91c1-c4e73f5960e0","resolution":{"observed_at":"2026-05-11T15:31:05.489522Z","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":"2409.00142","last_updated":"2024-08-30T03:27:48Z","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs","version":1},"cited_work":{"arxiv_id":"2409.00142","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.00142","snapshot_observed_at":"2026-07-03T22:29:00.436625Z","title":"Dynamic depth decoding: Faster speculative decoding for llms.arXiv preprint arXiv:2409.00142","venue":null,"work_id":"d0ed559c-f7ba-4d89-9adf-321909b72d4c","year":2024},"citing_paper":{"arxiv_id":"2606.17518","last_updated":"2026-06-16T04:54:23Z","snapshot_observed_at":"2026-08-16T01:52:01.817331Z","submitted_at":"2026-06-16T04:54:23Z","title":"SpecGen: Accelerating Agentic Kernel Optimization with Speculative Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T23:35:32.175768Z"},"links":{"cited_paper":"/paper/2409.00142","citing_paper":"/paper/2606.17518"},"observation_digest":"sha256:725cea9415ba37810d8739fa2144231a6ccabdeb310e804c91260a6ad525e9dc","observation_id":"85fb37fd-f540-4bac-8e0c-247538a7e88a","resolution":{"observed_at":"2026-07-03T22:29:00.438374Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2409.00142/citation-record","integrity":"/paper/2409.00142/integrity","json":"/paper/2409.00142/citation-record.json","paper":"/paper/2409.00142"},"outbound":[],"paper":{"arxiv_id":"2409.00142","last_updated":"2024-08-30T03:27:48Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T13:22:45.987277Z","submitted_at":"2024-08-30T03:27:48Z","title":"Dynamic Depth Decoding: Faster Speculative Decoding for LLMs"},"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 8 inbound Pith citation observations for arXiv:2409.00142."}