{"as_of":"2026-08-22T03:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71cba3c944abaada5a299ad2be4b7342c87732fa8fce8000d4e110a61e7d21a0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:49:22.111443Z","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-08-06T14:42:56.429631Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.13485","last_updated":"2024-02-21T02:51:07Z","snapshot_observed_at":"2026-08-18T10:41:05.743571Z","submitted_at":"2024-02-21T02:51:07Z","title":"ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.13485","snapshot_observed_at":"2026-08-12T16:49:22.111443Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.13157","last_updated":"2024-11-27T03:25:44Z","snapshot_observed_at":"2026-08-16T10:20:38.532309Z","submitted_at":"2024-11-20T09:46:30Z","title":"Closer Look at Efficient Inference Methods: A Survey of Speculative Decoding","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T16:49:22.111443Z"},"links":{"cited_paper":"/paper/2402.13485","citing_paper":"/paper/2411.13157"},"observation_digest":"sha256:9e773d63ac7356f00ca85bb327096abf515c7e28f28146a29366671eb213ced6","observation_id":"eaa754bb-750c-4a9c-b523-204b3f353780","resolution":{"observed_at":"2026-08-12T16:49:22.111443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13485","last_updated":"2024-02-21T02:51:07Z","snapshot_observed_at":"2026-08-18T10:41:05.743571Z","submitted_at":"2024-02-21T02:51:07Z","title":"ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding","version":1},"cited_work":{"arxiv_id":"2402.13485","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.13485","snapshot_observed_at":"2026-08-06T14:42:56.429631Z","title":"ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding","venue":"cs.LG","work_id":"79221109-7b8d-4654-bd6e-685eefc460ae","year":2024},"citing_paper":{"arxiv_id":"2507.18181","last_updated":"2025-07-28T08:55:09Z","snapshot_observed_at":"2026-08-15T09:21:04.969128Z","submitted_at":"2025-07-24T08:27:53Z","title":"SpecASR: Accelerating LLM-based Automatic Speech Recognition via Speculative Decoding","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T14:42:56.137565Z"},"links":{"cited_paper":"/paper/2402.13485","citing_paper":"/paper/2507.18181"},"observation_digest":"sha256:1fd8391498ea5ffedb80e710f0baf1397ca787579c12583062359727e7f0e893","observation_id":"a3fbdefc-9124-4558-89b6-5747d771b5c1","resolution":{"observed_at":"2026-08-06T14:42:56.437339Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2402.13485/citation-record","integrity":"/paper/2402.13485/integrity","json":"/paper/2402.13485/citation-record.json","paper":"/paper/2402.13485"},"outbound":[],"paper":{"arxiv_id":"2402.13485","last_updated":"2024-02-21T02:51:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T10:41:05.743571Z","submitted_at":"2024-02-21T02:51:07Z","title":"ProPD: Dynamic Token Tree Pruning and Generation for LLM Parallel Decoding"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.13485."}