{"as_of":"2026-08-09T21:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc62e0c9a6f7bd30943b6cec5fa532a3c7982dfd3d2732f9a33bb21d049da96d","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:43:27.969502Z","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-06-29T08:53:15.769753Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-09T20:43:27.969502Z","title":"Specdec++: Boosting speculative decoding via adaptive candidate lengths, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.19309","last_updated":"2025-01-31T17:09:53Z","snapshot_observed_at":"2026-08-09T20:34:15.481645Z","submitted_at":"2025-01-31T17:09:53Z","title":"Judge Decoding: Faster Speculative Sampling Requires Going Beyond Model Alignment","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-09T20:43:27.969502Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2501.19309"},"observation_digest":"sha256:318fce66eb78aee2fa7b168094392a031f068b2fc015bf980418991a5ee7a87e","observation_id":"0af5de14-086b-4b91-b057-27e1ecdf9258","resolution":{"observed_at":"2026-08-09T20:43:27.969502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-07T11:30:55.537631Z","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-09T18:58:56.218883Z","submitted_at":"2025-06-03T03:13:27Z","title":"Consultant Decoding: Yet Another Synergistic Mechanism","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T11:30:55.537631Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2506.02391"},"observation_digest":"sha256:52b0eb9ce4f2297753e18f33719913cb8e0826ac0a4e5168bc1e384af345c5b7","observation_id":"1d7d9053-3c24-4dcc-98cb-0c525f46875e","resolution":{"observed_at":"2026-08-07T11:30:55.537631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-07T11:04:15.625984Z","title":"Specdec++: Boosting speculative decoding via adaptive candidate lengths.arXiv preprint arXiv:2405.19715, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03566","last_updated":"2025-06-04T04:30:30Z","snapshot_observed_at":"2026-08-09T11:34:13.037312Z","submitted_at":"2025-06-04T04:30:30Z","title":"POSS: Position Specialist Generates Better Draft for Speculative Decoding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:15.625984Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2506.03566"},"observation_digest":"sha256:c7255856e11816b54105c236efc15292426070dc563515b4c834cffce879ef69","observation_id":"4dda5b89-b539-4d54-8612-368f1ace52f4","resolution":{"observed_at":"2026-08-07T11:04:15.625984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-07T11:02:39.260580Z","title":"Specdec++: Boosting speculative decoding via adaptive candidate lengths","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03700","last_updated":"2025-06-04T08:32:30Z","snapshot_observed_at":"2026-08-08T01:16:24.422333Z","submitted_at":"2025-06-04T08:32:30Z","title":"AdaDecode: Accelerating LLM Decoding with Adaptive Layer Parallelism","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T11:02:39.260580Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2506.03700"},"observation_digest":"sha256:8b0fb7e492d21be0a1998b5f57fa35acf6b84fe1593c8763c6654f8fbbe0c3ba","observation_id":"c6ba6a95-54c5-4eb3-b122-6a9b5d7193e7","resolution":{"observed_at":"2026-08-07T11:02:39.260580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":"2405.19715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-06-29T08:53:15.769753Z","title":"Yaniv Leviathan, Matan Kalman, and Yossi Matias","venue":null,"work_id":"b8292026-6612-4f7d-9132-d090b281ac57","year":2024},"citing_paper":{"arxiv_id":"2601.05524","last_updated":"2026-04-14T05:38:03Z","snapshot_observed_at":"2026-07-06T22:41:15.345760Z","submitted_at":"2026-01-09T04:35:21Z","title":"Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T16:39:26.611704Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2601.05524"},"observation_digest":"sha256:c4cf7d3442633f281e4065bb1be75b03232486a8239f4dd5aab8bd3064ed8e86","observation_id":"2e7aef30-9a50-4fdf-8d73-ac083dbc25e2","resolution":{"observed_at":"2026-05-16T16:41:06.270646Z","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":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":"2405.19715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-06-29T08:53:15.769753Z","title":"Yaniv Leviathan, Matan Kalman, and Yossi Matias","venue":null,"work_id":"b8292026-6612-4f7d-9132-d090b281ac57","year":2024},"citing_paper":{"arxiv_id":"2604.09731","last_updated":"2026-06-30T01:27:13Z","snapshot_observed_at":"2026-08-06T01:39:37.713323Z","submitted_at":"2026-04-09T13:17:56Z","title":"SMART: When is it Actually Worth Expanding a Speculative Tree?","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T16:47:57.421156Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2604.09731"},"observation_digest":"sha256:ae57be8d65ddff63e38519396edc162c5209193febc1e40a3508b3a02c2a27b4","observation_id":"54716424-150c-418b-a383-01782ef78df7","resolution":{"observed_at":"2026-05-11T08:11:02.621346Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":"2405.19715","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-06-29T08:53:15.769753Z","title":"Yaniv Leviathan, Matan Kalman, and Yossi Matias","venue":null,"work_id":"b8292026-6612-4f7d-9132-d090b281ac57","year":2024},"citing_paper":{"arxiv_id":"2605.29727","last_updated":"2026-05-28T10:21:34Z","snapshot_observed_at":"2026-08-02T01:53:53.633149Z","submitted_at":"2026-05-28T10:21:34Z","title":"Bastion: Budget-Aware Speculative Decoding with Tree-structured Block Diffusion Drafting","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T08:51:11.662084Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2605.29727"},"observation_digest":"sha256:18542c947fcb5614a707aca3722f56f4381b705acaa8822fda436d9badaa11a9","observation_id":"6a6de9ce-57c2-491c-97d8-8fed1a912470","resolution":{"observed_at":"2026-06-29T08:53:15.771303Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-07-11T23:19:24.722999Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.03876","last_updated":"2026-07-04T13:39:40Z","snapshot_observed_at":"2026-08-08T01:22:15.144757Z","submitted_at":"2026-07-04T13:39:40Z","title":"AdaptiveSD A Stability-Aware, Runtime-Adaptive Speculative Decoding Framework with Multi-Policy Orchestration for CPU-Constrained LLM Inference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T23:19:24.722999Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2607.03876"},"observation_digest":"sha256:4a11858ee5f5b665195fd0545ae3c8d3a04725968056b7f01ff2745155845e2f","observation_id":"731dc54b-2b18-4b05-881b-9ff28cdccf9c","resolution":{"observed_at":"2026-07-11T23:19:24.722999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-07-11T08:05:17.460513Z","title":"Huang, X","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05147","last_updated":"2026-07-06T14:28:06Z","snapshot_observed_at":"2026-07-31T15:07:06.604191Z","submitted_at":"2026-07-06T14:28:06Z","title":"DSpark: Confidence-Scheduled Speculative Decoding with Semi-Autoregressive Generation","version":1},"reference_index":148,"source":"arxiv_source","source_observed_at":"2026-07-11T08:05:17.460513Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2607.05147"},"observation_digest":"sha256:aacc323f781bbff31f5761590982afcc053d31338937b2327cb91f0417a54286","observation_id":"8890f748-c8f6-413f-a055-2744a7bf2eac","resolution":{"observed_at":"2026-07-11T08:05:17.460513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-01T01:22:13.555570Z","title":"Mude Hui, Xin Huang, Jaime Campos Salas, Yue Sun, Nathan Pemberton, Xiang Song, Ashish Khetan, and George Karypis","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":14,"source":"pdf_text","source_observed_at":"2026-08-01T01:22:13.555570Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2607.25852"},"observation_digest":"sha256:4a18019484edf70ca3dadf0c6e4b95482ae3b03e5bc9a954391ea2ddbf51e97f","observation_id":"beb5afe7-e891-4b19-9d53-8ce7a9a94f07","resolution":{"observed_at":"2026-08-01T01:22:13.555570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-05T00:46:50.594481Z","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":60,"source":"arxiv_source","source_observed_at":"2026-08-05T00:46:50.594481Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2608.00531"},"observation_digest":"sha256:34f9ddcec6b87057ad57d43c3222a6c019167ce078c30719b90a3747fc3a5eff","observation_id":"ed2acbdb-2449-4422-b872-65951c8bdd8f","resolution":{"observed_at":"2026-08-05T00:46:50.594481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19715","snapshot_observed_at":"2026-08-08T15:48:05.498093Z","title":"Specdec++: Boosting spec- ulative decoding via adaptive candidate lengths,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.05303","last_updated":"2026-08-05T18:03:47Z","snapshot_observed_at":"2026-08-09T20:10:45.061588Z","submitted_at":"2026-08-05T18:03:47Z","title":"EdgeXpert: An Edge Device for Memory-Efficient LLM Inference with Mixture-of-Experts and Speculative Decoding","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T15:48:05.498093Z"},"links":{"cited_paper":"/paper/2405.19715","citing_paper":"/paper/2608.05303"},"observation_digest":"sha256:9cebcf602db6f075be483cd53d32b9a582a2b45d5df3f92cd2bd0d8ec01863a7","observation_id":"1de07ba8-0bac-4dc7-a0db-c8acf3181940","resolution":{"observed_at":"2026-08-08T15:48:05.498093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2405.19715/citation-record","integrity":"/paper/2405.19715/integrity","json":"/paper/2405.19715/citation-record.json","paper":"/paper/2405.19715"},"outbound":[],"paper":{"arxiv_id":"2405.19715","last_updated":"2025-07-11T01:33:18Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T01:15:52.225102Z","submitted_at":"2024-05-30T05:49:38Z","title":"SpecDec++: Boosting Speculative Decoding via Adaptive Candidate Lengths"},"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 12 inbound Pith citation observations for arXiv:2405.19715."}