{"as_of":"2026-08-20T11:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d91f0582c4fb866c11d5354f775e0ead93f86eac693937d5e9c82a11053f03b8","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-20T06:33:59.587034+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-11T00:38:49.493305Z","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-07T14:48:01.055376Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.00242","last_updated":"2025-03-07T17:47:42Z","snapshot_observed_at":"2026-08-16T14:05:03.590274Z","submitted_at":"2024-03-30T04:34:54Z","title":"DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.00242","snapshot_observed_at":"2026-08-11T00:38:49.493305Z","title":"Deft: Decoding with flash tree-attention for efficient tree-structured llm inference,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19442","last_updated":"2025-07-30T05:24:46Z","snapshot_observed_at":"2026-08-15T13:24:51.697670Z","submitted_at":"2024-12-27T04:17:57Z","title":"A Survey on Large Language Model Acceleration based on KV Cache Management","version":3},"reference_index":252,"source":"pdf_text","source_observed_at":"2026-08-11T00:38:49.493305Z"},"links":{"cited_paper":"/paper/2404.00242","citing_paper":"/paper/2412.19442"},"observation_digest":"sha256:93c6ccfe59d8285e4bff341186f024379755c3d15e3212d39b884360b7e4e430","observation_id":"1844ee98-bf1a-4982-92a3-090c460267d9","resolution":{"observed_at":"2026-08-11T00:38:49.493305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.00242","last_updated":"2025-03-07T17:47:42Z","snapshot_observed_at":"2026-08-16T14:05:03.590274Z","submitted_at":"2024-03-30T04:34:54Z","title":"DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference","version":4},"cited_work":{"arxiv_id":"2404.00242","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.00242","snapshot_observed_at":"2026-08-07T14:48:01.055376Z","title":"DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference","venue":"cs.CL","work_id":"6ad3c5e8-1212-4c4c-9b60-8c2c66423ba6","year":2024},"citing_paper":{"arxiv_id":"2505.17694","last_updated":"2026-03-28T10:14:51Z","snapshot_observed_at":"2026-08-15T04:43:19.645752Z","submitted_at":"2025-05-23T10:03:28Z","title":"CoDec: Prefix-Shared Decoding Kernel for LLMs","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:47:59.580666Z"},"links":{"cited_paper":"/paper/2404.00242","citing_paper":"/paper/2505.17694"},"observation_digest":"sha256:9caf147611e893453372dc819f14e93b4285294b2256c91a8eb91715e6d48daa","observation_id":"17500bd2-ada7-4d5a-aa54-91307ed98c0e","resolution":{"observed_at":"2026-08-07T14:48:01.088376Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2404.00242/citation-record","integrity":"/paper/2404.00242/integrity","json":"/paper/2404.00242/citation-record.json","paper":"/paper/2404.00242"},"outbound":[],"paper":{"arxiv_id":"2404.00242","last_updated":"2025-03-07T17:47:42Z","latest_version":4,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T14:05:03.590274Z","submitted_at":"2024-03-30T04:34:54Z","title":"DeFT: Decoding with Flash Tree-attention for Efficient Tree-structured LLM Inference"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2404.00242."}