{"as_of":"2026-08-09T10:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c6b8568171975901b7728f4f804a2d5f301400a87f1ccd24022ae5b741ad45a2","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-08T19:28:43.596934Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-08T19:28:43.596934Z","title":"Block-attention for efficient rag","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.05431","last_updated":"2025-02-12T13:54:01Z","snapshot_observed_at":"2026-08-08T19:19:35.161573Z","submitted_at":"2025-02-08T03:41:16Z","title":"APE: Faster and Longer Context-Augmented Generation via Adaptive Parallel Encoding","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T19:28:43.596934Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2502.05431"},"observation_digest":"sha256:bc90b25de2a2e72ec7db3c52c21c6e161fd645590ba2ea73dd84f074319f2784","observation_id":"6fdb970b-33dd-4543-bf71-6990a9779315","resolution":{"observed_at":"2026-08-08T19:28:43.596934Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-07T15:41:09.659563Z","title":"Block-attention for efficient rag.arXiv preprint arXiv:2409.15355, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14398","last_updated":"2025-05-20T14:14:38Z","snapshot_observed_at":"2026-08-08T06:32:37.396568Z","submitted_at":"2025-05-20T14:14:38Z","title":"Log-Augmented Generation: Scaling Test-Time Reasoning with Reusable Computation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:41:09.659563Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2505.14398"},"observation_digest":"sha256:11634091c240dc310484d0de1af8875dc01e9255205cc919781e7395cbff9ae1","observation_id":"cfc08c28-0def-4fa9-9842-366c6a0abc59","resolution":{"observed_at":"2026-08-07T15:41:09.659563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":"2409.15355","doi":"10.48550/arxiv.2409.15355","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Block-attention for efficient rag","venue":"arXiv (Cornell University)","work_id":"9f6bd5a0-3ba6-4087-ab1a-1e24e1ea54d4","year":2024},"citing_paper":{"arxiv_id":"2510.10129","last_updated":"2026-05-21T08:20:19Z","snapshot_observed_at":"2026-07-06T22:32:22.953630Z","submitted_at":"2025-10-11T09:28:26Z","title":"CacheClip: Accelerating RAG with Effective KV Cache Reuse","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T12:36:41.630618Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2510.10129"},"observation_digest":"sha256:d38bd158f3ad590373d6f3df24b3d2331ac163ade5ab77034201abe59632ac43","observation_id":"f1a5b7bf-a489-4b8f-9e69-36093f75bf10","resolution":{"observed_at":"2026-05-22T12:41:33.696197Z","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":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":"2409.15355","doi":"10.48550/arxiv.2409.15355","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Block-attention for efficient rag","venue":"arXiv (Cornell University)","work_id":"9f6bd5a0-3ba6-4087-ab1a-1e24e1ea54d4","year":2024},"citing_paper":{"arxiv_id":"2512.13368","last_updated":"2026-05-22T09:00:57Z","snapshot_observed_at":"2026-08-02T00:54:15.217111Z","submitted_at":"2025-12-15T14:23:57Z","title":"BlossomRec: Block-level Fused Sparse Attention Mechanism for Sequential Recommendations","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-25T07:20:46.517218Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2512.13368"},"observation_digest":"sha256:278d2bb25a629310b4ba2bd4cf9a1f17fe6448f3d6b7659e6386295a3d05f4d7","observation_id":"d750ccb4-70a8-43e2-b9db-e54129054bc6","resolution":{"observed_at":"2026-05-25T07:26:42.145821Z","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":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":"2409.15355","doi":"10.48550/arxiv.2409.15355","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Block-attention for efficient rag","venue":"arXiv (Cornell University)","work_id":"9f6bd5a0-3ba6-4087-ab1a-1e24e1ea54d4","year":2024},"citing_paper":{"arxiv_id":"2606.13126","last_updated":"2026-06-11T09:51:36Z","snapshot_observed_at":"2026-08-07T11:38:31.536933Z","submitted_at":"2026-06-11T09:51:36Z","title":"MiniPIC: Flexible Position-Independent Caching in <100LOC","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T07:12:45.449658Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2606.13126"},"observation_digest":"sha256:065353f51ddc548126a3221477bcd89b49007b91b38f626b405a9695113a8700","observation_id":"67e57f10-15c5-4b51-b458-57883579cd87","resolution":{"observed_at":"2026-06-27T07:20:42.188936Z","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":"2409.15355","last_updated":"2025-04-13T14:02:47Z","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling","version":5},"cited_work":{"arxiv_id":"2409.15355","doi":"10.48550/arxiv.2409.15355","metadata_source":"arxiv_reference","pith_arxiv_id":"2409.15355","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Block-attention for efficient rag","venue":"arXiv (Cornell University)","work_id":"9f6bd5a0-3ba6-4087-ab1a-1e24e1ea54d4","year":2024},"citing_paper":{"arxiv_id":"2607.01538","last_updated":"2026-07-01T23:38:25Z","snapshot_observed_at":"2026-08-02T05:27:20.501902Z","submitted_at":"2026-07-01T23:38:25Z","title":"Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-03T20:43:40.938898Z"},"links":{"cited_paper":"/paper/2409.15355","citing_paper":"/paper/2607.01538"},"observation_digest":"sha256:e94cd9bbaf6ff03c04f76c7afb192b3235f880bbf579a5eed09a1db5327c3bc3","observation_id":"55d6ea9c-2a44-4dd1-b29e-181564055fdc","resolution":{"observed_at":"2026-07-03T20:48:55.271639Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2409.15355/citation-record","integrity":"/paper/2409.15355/integrity","json":"/paper/2409.15355/citation-record.json","paper":"/paper/2409.15355"},"outbound":[],"paper":{"arxiv_id":"2409.15355","last_updated":"2025-04-13T14:02:47Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T02:55:00.804211Z","submitted_at":"2024-09-14T02:34:26Z","title":"Block-Attention for Efficient Prefilling"},"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:2409.15355."}