{"as_of":"2026-08-06T02:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:83239e5b91528483aa887d308a73f37950332c205266b702274f661be267bd4c","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:57:59.636975Z","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-05T06:32:48.257954+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T07:03:08.617257Z","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-06-30T07:04:20.894665Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"cited_work":{"arxiv_id":"2604.07815","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.07815","snapshot_observed_at":"2026-06-30T07:04:20.894665Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","venue":"cs.CL","work_id":"2b85fdef-eae6-4c71-a828-79b1c54b8e96","year":2026},"citing_paper":{"arxiv_id":"2606.30389","last_updated":"2026-06-29T14:43:25Z","snapshot_observed_at":"2026-07-07T00:04:15.048683Z","submitted_at":"2026-06-29T14:43:25Z","title":"Predict, Reuse, and Repair: Accelerating Dynamic Sparse Attention for Long-Context LLM Decoding","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-30T07:03:08.617257Z"},"links":{"cited_paper":"/paper/2604.07815","citing_paper":"/paper/2606.30389"},"observation_digest":"sha256:a15930b50966619b939345a0c31dd8c8f8a2290a4fb0bc1880e841194da8d387","observation_id":"9b91a285-c214-4683-987c-f4a163d3c9db","resolution":{"observed_at":"2026-06-30T07:04:20.896292Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2604.07815/citation-record","integrity":"/paper/2604.07815/integrity","json":"/paper/2604.07815/citation-record.json","paper":"/paper/2604.07815"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.04434","last_updated":"2024-06-19T06:04:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-07T15:56:43Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","version":5},"cited_work":{"arxiv_id":"2405.04434","doi":"10.1145/3593013.3594097","metadata_source":"pith","pith_arxiv_id":"2405.04434","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","venue":"cs.CL","work_id":"1e1df141-cac8-47fd-b068-c4c96e51e331","year":2024},"citing_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:57:59.636975Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2604.07815"},"observation_digest":"sha256:a68ebe0973b53f88e1638e23f8451e2493535631a56bd7f35a3dbd0f79fb50a4","observation_id":"873da5d2-89b0-4e91-b6bb-4460768145a0","resolution":{"observed_at":"2026-05-11T05:45:57.795459Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.03091","last_updated":"2023-10-04T01:13:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-05T17:59:41Z","title":"RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems","version":2},"cited_work":{"arxiv_id":"2306.03091","doi":"10.48550/arxiv.2306.03091","metadata_source":"pith","pith_arxiv_id":"2306.03091","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"RepoBench: Benchmarking Repository-Level Code Auto-Completion Systems","venue":"cs.CL","work_id":"24b24ba5-b21c-43c6-866f-4b874305372e","year":2023},"citing_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:57:59.636975Z"},"links":{"cited_paper":"/paper/2306.03091","citing_paper":"/paper/2604.07815"},"observation_digest":"sha256:6e542d2eeb2af12376a58e1b5a16b2288b934471ae120144bffaf2c2013e03c9","observation_id":"19feda74-160d-46fd-931e-f6aa7ca968ee","resolution":{"observed_at":"2026-05-15T22:29:52.776747Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-05-21T21:53:10.253516+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-21T21:53:10.253516+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2509.01322","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T09:37:49.308056Z","title":"Longcat-flash technical report","venue":null,"work_id":"112bbed5-cf36-4773-82b3-0229bfea4626","year":2025},"citing_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:57:59.636975Z"},"links":{"citing_paper":"/paper/2604.07815"},"observation_digest":"sha256:ed9fbeeb345f32399687246a36111e9d0e5689a68a6ce664fb271408f4ea3f86","observation_id":"f1237d17-208a-4273-b25c-402907d5134f","resolution":{"observed_at":"2026-05-11T05:45:57.774641Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.06865","last_updated":"2023-06-12T07:48:53Z","snapshot_observed_at":"2026-07-06T15:02:25.281739Z","submitted_at":"2023-03-13T05:19:28Z","title":"FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPU","version":2},"cited_work":{"arxiv_id":"2303.06865","doi":"10.48550/arxiv.2303.06865","metadata_source":"pith","pith_arxiv_id":"2303.06865","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Y ., Xie, Z., Chen, B., Barrett, C., Gonzalez, J","venue":"cs.LG","work_id":"c99785d7-2d72-4d2f-8363-f4db53cf669f","year":2023},"citing_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:57:59.636975Z"},"links":{"cited_paper":"/paper/2303.06865","citing_paper":"/paper/2604.07815"},"observation_digest":"sha256:65421378a0e8d80647e3e24dc87aea783fe968597a0c1acd5d94c8de922941fb","observation_id":"f7f8442b-e6d9-4ea7-9d6c-ac4d4c74212a","resolution":{"observed_at":"2026-05-11T05:45:57.821474Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:57:59.636975Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2604.07815"},"observation_digest":"sha256:69e2368ae981d40a7a04409756529fe9f73cd40eb2d0af6013843c80370186e1","observation_id":"000bc7c1-7a39-4beb-a902-2864270f8062","resolution":{"observed_at":"2026-05-11T05:45:57.811820Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.07815","last_updated":"2026-04-09T05:15:16Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T22:57:05.146373Z","submitted_at":"2026-04-09T05:15:16Z","title":"AsyncTLS: Efficient Generative LLM Inference with Asynchronous Two-level Sparse Attention"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":5},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 1 inbound Pith citation observation for arXiv:2604.07815."}