{"as_of":"2026-08-12T04:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9b88b2062dc06c2776365452ae759ff06efb813ea4fa2a87f26999cd397093f","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T22:20:53.856657Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T02:55:50.187273Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","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":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2604.12798","last_updated":"2026-04-14T14:28:50Z","snapshot_observed_at":"2026-08-11T18:45:07.841438Z","submitted_at":"2026-04-14T14:28:50Z","title":"VFA: Relieving Vector Operations in Flash Attention with Global Maximum Pre-computation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T16:10:40.858525Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2604.12798"},"observation_digest":"sha256:4445941634decd911960ef01dcb1ddb88a7eff9cc83f2477f11e049a7a08d2d2","observation_id":"2acb1520-1ea6-48b6-a3a9-c8aacbfd9736","resolution":{"observed_at":"2026-05-11T09:16:00.073232Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2605.06763","last_updated":"2026-05-11T02:30:41Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-07T17:37:56Z","title":"Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:35.871863Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2605.06763"},"observation_digest":"sha256:a96519e99146e23c29fb288af62a878f2fd03eedde54ccb315b12f1927bdde6b","observation_id":"3528bdb4-791c-4c44-9905-60e7e1f02da8","resolution":{"observed_at":"2026-05-11T01:15:50.502233Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2605.16928","last_updated":"2026-06-08T02:38:05Z","snapshot_observed_at":"2026-08-02T02:41:46.596895Z","submitted_at":"2026-05-16T10:51:58Z","title":"Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T20:51:29.740033Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2605.16928"},"observation_digest":"sha256:139f45524adfffbf201ed052b9f7293f8f4391cacb3724d64302395610958d2b","observation_id":"0ce1eba7-fe3a-45f4-9f7c-320dd2a917fa","resolution":{"observed_at":"2026-05-19T20:52:46.083413Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2605.16928","last_updated":"2026-06-08T02:38:05Z","snapshot_observed_at":"2026-08-02T02:41:46.596895Z","submitted_at":"2026-05-16T10:51:58Z","title":"Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-30T19:17:28.300961Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2605.16928"},"observation_digest":"sha256:93055f9a4480db9beaed65eff8416cbd7dab654504479cc820295e6edcb2bb18","observation_id":"8d4d0499-3bda-41b4-a13b-94a61c46861b","resolution":{"observed_at":"2026-07-01T14:55:47.426879Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2605.20868","last_updated":"2026-05-20T08:04:40Z","snapshot_observed_at":"2026-07-06T23:31:23.407780Z","submitted_at":"2026-05-20T08:04:40Z","title":"Runtime-Certified Bounded-Error Quantized Attention","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T05:45:42.295527Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2605.20868"},"observation_digest":"sha256:996624724b1582f9bc0d0dd3aee93017f6c05f0b3612edad5db50593384821d8","observation_id":"4b6fd9fe-2384-4bb0-ba48-43896dbf98c7","resolution":{"observed_at":"2026-05-21T05:49:41.106969Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2606.09080","last_updated":"2026-06-08T06:26:18Z","snapshot_observed_at":"2026-07-06T23:48:30.569726Z","submitted_at":"2026-06-08T06:26:18Z","title":"Beyond FLOPs: Benchmarking Real Inference Acceleration of LLM Pruning under a GEMM-Centric Taxonomy","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-06-27T17:02:30.894934Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2606.09080"},"observation_digest":"sha256:4fa8b13a70f0147e4855b6634f469a17671208a4e6541e2a3ca7c85aa542518b","observation_id":"41288731-b927-4803-ab16-29cdfb9b73bf","resolution":{"observed_at":"2026-06-27T17:11:05.692659Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":"2512.12087","doi":"10.48550/arxiv.2512.12087","metadata_source":"pith","pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","venue":"cs.CL","work_id":"f8235a9e-3a00-45d0-a9a9-4f26273f82f4","year":2025},"citing_paper":{"arxiv_id":"2606.23961","last_updated":"2026-06-22T21:42:51Z","snapshot_observed_at":"2026-08-06T01:05:08.235011Z","submitted_at":"2026-06-22T21:42:51Z","title":"Forget Without Compromise: Nexus Sampling for Streaming KV-Cache Eviction Under Fixed Budgets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T08:46:54.468405Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2606.23961"},"observation_digest":"sha256:2ac1b7e23531fa93011b1f7b9ce6673505924ed5d359abb3aed17ec8c58f177d","observation_id":"0543cf73-f419-4f52-82ca-3bdfbcbc5047","resolution":{"observed_at":"2026-07-04T10:29:45.333942Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-07-31T11:49:11.788006Z","title":"BLASST: Dynamic BLocked attention sparsity via softmax thresholding","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24555","last_updated":"2026-07-27T15:28:52Z","snapshot_observed_at":"2026-08-02T06:50:39.173138Z","submitted_at":"2026-07-27T15:28:52Z","title":"LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decoding","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-31T11:49:11.788006Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2607.24555"},"observation_digest":"sha256:59620938700b2055271ad76bc2f011fd5e1e97672615a00ecb7ee309bdf494b7","observation_id":"d35f19ad-4206-4fb0-bf15-52471124beb1","resolution":{"observed_at":"2026-07-31T11:49:11.788006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.12087","snapshot_observed_at":"2026-08-01T02:55:50.187273Z","title":"arXiv preprint arXiv:2512.12087 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25291","last_updated":"2026-08-07T08:55:53Z","snapshot_observed_at":"2026-08-12T04:09:27.778931Z","submitted_at":"2026-07-28T04:57:19Z","title":"CoSA: Accelerating Long-Context Inference via Proxy-Kernel Co-Designed Sparse Attention","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T02:55:50.187273Z"},"links":{"cited_paper":"/paper/2512.12087","citing_paper":"/paper/2607.25291"},"observation_digest":"sha256:e96674c775b9dc7ecc209752e565bd18f55ecf5743bba1985e448f200cf4935f","observation_id":"78bbb400-e10c-45ef-8c68-c810580fa1f9","resolution":{"observed_at":"2026-08-01T02:55:50.187273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2512.12087/citation-record","integrity":"/paper/2512.12087/integrity","json":"/paper/2512.12087/citation-record.json","paper":"/paper/2512.12087"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":"2303.08774","doi":"10.1002/tea.20265","metadata_source":"pith","pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GPT-4 Technical Report","venue":"cs.CL","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","year":2023},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:4df56b20dd56151724de91e6c0e43d636d915e586bf28601f49bf7000d7843f4","observation_id":"3afe4107-8838-49a0-9774-90b737167db3","resolution":{"observed_at":"2026-05-16T22:21:18.615576Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15204","last_updated":"2025-01-03T11:44:51Z","snapshot_observed_at":"2026-08-04T21:07:04.238345Z","submitted_at":"2024-12-19T18:59:17Z","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","version":2},"cited_work":{"arxiv_id":"2412.15204","doi":"10.48550/arxiv.2412.15204","metadata_source":"pith","pith_arxiv_id":"2412.15204","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks","venue":"cs.CL","work_id":"9fac250b-241e-41ce-9177-469deaf03040","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2412.15204","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:db04e8f4b9f002ead3ac18f1e29da0c5514b242cf1e768cb2842567e973af33f","observation_id":"45fe34df-18b6-4ff6-9f5c-a3ab67ead4cf","resolution":{"observed_at":"2026-05-16T22:21:18.662116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14051","last_updated":"2025-08-13T17:55:58Z","snapshot_observed_at":"2026-08-11T00:54:58.705708Z","submitted_at":"2025-02-19T19:12:46Z","title":"RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression","version":3},"cited_work":{"arxiv_id":"2502.14051","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.14051","snapshot_observed_at":"2026-06-30T11:04:37.899992Z","title":"Rocketkv: Accelerating long-context llm inference via two-stage kv cache compression.arXiv preprint arXiv:2502.14051","venue":null,"work_id":"27282a28-5d11-444f-9204-ee153fd66d42","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2502.14051","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:5ec54a63d001ee90e07092bb3e876e4bd3fa07b63b722e868d7dc6a3cd94bfad","observation_id":"345a6de2-d371-4861-8a36-92dd7c1530b1","resolution":{"observed_at":"2026-05-16T22:21:18.598551Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":"2004.05150","doi":"10.48550/arxiv.2004.05150","metadata_source":"pith","pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Longformer: The Long-Document Transformer","venue":"cs.CL","work_id":"abea7a44-6668-4de7-aab6-f53a6e5aa088","year":2020},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:19273c5005ea3da69186bef5fe464feae6942458a33152ca8f953a7adfad7419","observation_id":"034f5f74-bc42-44b7-882b-91632870853f","resolution":{"observed_at":"2026-05-16T22:21:18.586041Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-12T21:49:59.161233+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T21:49:59.161233+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10509","last_updated":"2019-04-23T19:29:47Z","snapshot_observed_at":"2026-08-09T19:46:04.857927Z","submitted_at":"2019-04-23T19:29:47Z","title":"Generating Long Sequences with Sparse Transformers","version":1},"cited_work":{"arxiv_id":"1904.10509","doi":"10.48550/arxiv.1904.10509","metadata_source":"pith","pith_arxiv_id":"1904.10509","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Generating Long Sequences with Sparse Transformers","venue":"cs.LG","work_id":"c5b81688-45ee-4a9a-b095-e6290f45cb6c","year":2019},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/1904.10509","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:b92348ae5400869c46200f5e287ff729fa0da5ee45904f47fe99b9c2d769d2e8","observation_id":"d0e978ac-af60-4722-872a-445188eac61a","resolution":{"observed_at":"2026-05-16T22:21:18.666808Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-12T21:49:59.71041+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T21:49:59.71041+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06261","last_updated":"2025-12-19T14:25:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-07T17:36:04Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","version":6},"cited_work":{"arxiv_id":"2507.06261","doi":"10.48550/arxiv.2503.19","metadata_source":"pith","pith_arxiv_id":"2507.06261","snapshot_observed_at":"2026-07-11T03:17:51.364436Z","title":"Gemini 2.5: Pushing the Frontier with Advanced Reasoning, Multimodality, Long Context, and Next Generation Agentic Capabilities","venue":"cs.CL","work_id":"008df105-2fdd-45d8-857a-8e35868aecb6","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2507.06261","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:350dc1c471e1fb75b8ebb16c275920aceac8052d0523c18a5eb5ea5e1127d0ea","observation_id":"26341737-4e75-43ab-bb7d-381387bfba96","resolution":{"observed_at":"2026-05-16T22:21:18.648102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.02660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T18:40:03.208056Z","title":"How to train long- context language models (effectively)","venue":null,"work_id":"1a93fc7f-b292-4ad8-b303-698846cc45a6","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:21970efda5a243aa2cc145961f2e80c88aaa4f259c8b6800f727ee88c16cd221","observation_id":"3510d862-cdc8-4bdc-b0aa-54426f92c9c4","resolution":{"observed_at":"2026-05-16T22:21:18.653286Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.08889","last_updated":"2025-06-10T15:17:26Z","snapshot_observed_at":"2026-08-07T11:00:03.513055Z","submitted_at":"2025-06-10T15:17:26Z","title":"SeerAttention-R: Sparse Attention Adaptation for Long Reasoning","version":1},"cited_work":{"arxiv_id":"2506.08889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.08889","snapshot_observed_at":"2026-07-02T13:36:59.523914Z","title":"Seerattention-r: Sparse attention adaptation for long reasoning","venue":null,"work_id":"5cd68498-f613-4fa1-a51f-eae46c0c6d2d","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2506.08889","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:d2aeb28d7af3bc66a6aac4c5a8221e677737b845bc3c0dfe5f1989a13dc5d587","observation_id":"b4a83254-06b0-4481-9dd6-7cc3af0c7330","resolution":{"observed_at":"2026-05-16T22:21:18.608942Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.00752","last_updated":"2024-05-31T17:55:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-01T18:01:34Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","version":2},"cited_work":{"arxiv_id":"2312.00752","doi":"10.48550/arxiv.2312.00752","metadata_source":"pith","pith_arxiv_id":"2312.00752","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mamba: Linear-Time Sequence Modeling with Selective State Spaces","venue":"cs.LG","work_id":"4ee75248-1199-492c-a52f-6661e0f4adff","year":2023},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2312.00752","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:d7b2af552ee623587d4ae6c9d368e0f668d976a266527fda7637fbc3333a5361","observation_id":"21e54efd-11fd-4a8a-b33f-5a1265213d8f","resolution":{"observed_at":"2026-05-16T22:21:18.575063Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-05-30T19:25:31.081761+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-30T19:25:31.081761+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2501.12948","doi":"10.1016/j.artmed.2024.103001","metadata_source":"pith","pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","venue":"cs.CL","work_id":"e6b75ad5-2877-4168-97c8-710407094d20","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:43333f02fd8cf8a8c819a7d636e9bd1ecdc4e563b2a093b449dfa707801b7c18","observation_id":"8c39c8dd-6336-4ab2-b862-e36e20d84a63","resolution":{"observed_at":"2026-05-16T22:21:18.605096Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.06654","last_updated":"2024-08-06T21:48:58Z","snapshot_observed_at":"2026-08-10T09:20:57.804343Z","submitted_at":"2024-04-09T23:41:27Z","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","version":3},"cited_work":{"arxiv_id":"2404.06654","doi":"10.48550/arxiv.2404.06654","metadata_source":"pith","pith_arxiv_id":"2404.06654","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"RULER: What's the Real Context Size of Your Long-Context Language Models?","venue":"cs.CL","work_id":"c0bc4689-3ce8-4e3d-9442-bd74869445bb","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2404.06654","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:6e6368c9a1b96f49b4c069db8c0c3a44759172d84dee78af645494f4d8e2f48c","observation_id":"9e592699-ad48-44c9-92e1-46968a28be95","resolution":{"observed_at":"2026-05-16T22:21:18.657950Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20766","last_updated":"2025-02-28T06:34:53Z","snapshot_observed_at":"2026-08-07T17:40:46.337382Z","submitted_at":"2025-02-28T06:34:53Z","title":"FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inference","version":1},"cited_work":{"arxiv_id":"2502.20766","doi":"10.48550/arxiv.2502.20766","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.20766","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Flex- prefill: A context-aware sparse attention mechanism for efficient long-sequence inference.arXiv preprint arXiv:2502.20766","venue":"ArXiv.org","work_id":"0cb1c44c-efb7-45c0-aee5-f6032ae66a8b","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2502.20766","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:58a70e0b106a4b6a2b161e0e4ea46ff9d83f3274df7113d8135a4eb856639f86","observation_id":"1efe3e05-b733-407c-9421-0bd925bc76f0","resolution":{"observed_at":"2026-05-16T22:21:18.631790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2506.05345","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"aef2c0ac-76cc-4aaf-bb42-87dea36249f1","year":null},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:f47d729b5bb03d5a316177e0fe14c5a48cb626e726c5d82948f7560eb297338e","observation_id":"178772d7-8ad1-47e4-8668-84c85c5b40d4","resolution":{"observed_at":"2026-05-16T22:21:18.602898Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2405.04434","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:8e85aa5dcee52a40b4914465ad2b12ae7306f0c6cd4058299ad4fca3c5291e7a","observation_id":"974a0be4-3c76-4d2c-a4ad-c0636661f5c8","resolution":{"observed_at":"2026-05-16T22:21:18.612119Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.06708","last_updated":"2025-05-10T17:15:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-10T17:15:49Z","title":"Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Free","version":1},"cited_work":{"arxiv_id":"2505.06708","doi":"10.48550/arxiv.2505.06708","metadata_source":"pith","pith_arxiv_id":"2505.06708","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Free","venue":"cs.CL","work_id":"35cc586b-44f1-4948-a84b-866e8335e649","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2505.06708","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:b48aa4b8173da48d3210ab10a6d4977e3d28a35dbb3d3ac958af5bcf8f3048f3","observation_id":"4ddb7f6e-22a5-431d-84a9-3a008af0c8fb","resolution":{"observed_at":"2026-05-16T22:21:18.639195Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":"2308.12950","doi":"10.48550/arxiv.2308.12950","metadata_source":"pith","pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Code Llama: Open Foundation Models for Code","venue":"cs.CL","work_id":"e73bffa4-7620-47ac-9327-259a60db52ca","year":2023},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:2e4b890c7cc485b91c734f724b85237891369019d16e77c7b45429fb3dfc09f5","observation_id":"93207c4d-0c3c-4fd8-b5d1-59702a8878b8","resolution":{"observed_at":"2026-05-16T22:21:18.635213Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:36.742994+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:36.742994+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16419","last_updated":"2025-08-21T19:14:40Z","snapshot_observed_at":"2026-08-11T13:10:23.709172Z","submitted_at":"2025-03-20T17:59:38Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","version":4},"cited_work":{"arxiv_id":"2503.16419","doi":"10.48550/arxiv.2503.16419","metadata_source":"pith","pith_arxiv_id":"2503.16419","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models","venue":"cs.CL","work_id":"21afd80d-63a7-472b-800d-3b81161c39d3","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2503.16419","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:8ac12113013153d66c0794623fd5e4914c3ed8866344f936bce7f8f2d8a68f6e","observation_id":"36dff947-c8ce-4209-acdb-d8dda6f9432e","resolution":{"observed_at":"2026-05-16T22:21:18.611334Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.04108","last_updated":"2025-06-05T05:39:48Z","snapshot_observed_at":"2026-08-10T12:09:42.684962Z","submitted_at":"2025-06-04T16:01:48Z","title":"Rectified Sparse Attention","version":2},"cited_work":{"arxiv_id":"2506.04108","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.04108","snapshot_observed_at":"2026-07-02T13:46:58.816966Z","title":"Rectified sparse attention","venue":null,"work_id":"aa22dbb5-75b6-4873-be14-90ee8a85e41a","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2506.04108","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:230b482f127187326e6b8f561e2388d6fa49fa723f073164409ebd33a3d97e6e","observation_id":"cf2a2230-520c-4f33-b5b1-5d835d2570f9","resolution":{"observed_at":"2026-05-16T22:21:18.626267Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10774","last_updated":"2024-08-26T21:01:02Z","snapshot_observed_at":"2026-07-06T18:31:36.504766Z","submitted_at":"2024-06-16T01:33:02Z","title":"Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference","version":2},"cited_work":{"arxiv_id":"2406.10774","doi":"10.48550/arxiv.2406.10774","metadata_source":"pith","pith_arxiv_id":"2406.10774","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference","venue":"cs.CL","work_id":"2cad64c9-e2d5-42b6-8db9-03fafde4bcb0","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2406.10774","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:86df46640b31f805e7d572ec733836287fe5b64ec9cc9e4cb7a11678574c3b6a","observation_id":"e259b309-1fdb-46ab-a3c5-7a5d262dcc4f","resolution":{"observed_at":"2026-05-16T22:21:18.579060Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15574","last_updated":"2024-04-24T00:24:03Z","snapshot_observed_at":"2026-08-06T03:07:12.026697Z","submitted_at":"2024-04-24T00:24:03Z","title":"Retrieval Head Mechanistically Explains Long-Context Factuality","version":1},"cited_work":{"arxiv_id":"2404.15574","doi":"10.48550/arxiv.2404.15574","metadata_source":"pith","pith_arxiv_id":"2404.15574","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Re- trieval head mechanistically explains long-context factu- ality.arXiv preprint arXiv:2404.15574","venue":"cs.CL","work_id":"43c186a9-18a4-4468-8e5e-e8e32f44538f","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2404.15574","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:47a6d9c9788cc88c8ec4cf5e6b516e3ed67a1c59822726799e03e2b01a9303ed","observation_id":"40b49129-f577-47ca-9319-2c48cba3e381","resolution":{"observed_at":"2026-05-16T22:21:18.643653Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":"2309.17453","doi":"10.48550/arxiv.2309.17453","metadata_source":"pith","pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Streaming Language Models with Attention Sinks","venue":"cs.CL","work_id":"a8d25452-c237-48c9-88a4-682717c3979a","year":2023},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:19c3c6b028b39c3df597af5f98f6593ba30678e2abcf54254e93cf8969b5690b","observation_id":"bd2750a1-55e1-4be0-a9ce-29e6db44d50e","resolution":{"observed_at":"2026-05-16T22:21:18.562124Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10819","last_updated":"2024-10-14T17:59:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-14T17:59:58Z","title":"DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads","version":1},"cited_work":{"arxiv_id":"2410.10819","doi":"10.48550/arxiv.2410.10819","metadata_source":"pith","pith_arxiv_id":"2410.10819","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads","venue":"cs.CL","work_id":"dcb5f5ed-ec94-4386-bfa7-02fcaeb844f1","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2410.10819","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:7225654a5965da3638a66242dfc3a87b976cff8d7abe53e24b917f232baea06f","observation_id":"0bc7445a-1e70-444d-a69c-f96d6cd9a978","resolution":{"observed_at":"2026-05-18T11:49:16.947404Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:4b30c1ea92328e8b74d0208645be793e3902ac16898034a8bbe96875d5718d4d","observation_id":"3a6e3782-e2b8-4be9-a4d4-6822f675e34e","resolution":{"observed_at":"2026-05-16T22:21:18.594359Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05076","last_updated":"2024-10-07T14:30:27Z","snapshot_observed_at":"2026-08-10T08:03:08.117947Z","submitted_at":"2024-10-07T14:30:27Z","title":"TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attention","version":1},"cited_work":{"arxiv_id":"2410.05076","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.05076","snapshot_observed_at":"2026-07-02T13:36:59.560564Z","title":"arXiv preprint arXiv:2410.05076","venue":null,"work_id":"c6960431-2c6c-436b-a292-f2fb471e3a6b","year":2024},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2410.05076","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:89d1030e854055827eb8def40b7e54402d6e043d2d2a4fd36602cc8de3cdb2f9","observation_id":"c533775b-e768-4152-80f9-bcc9f83059d6","resolution":{"observed_at":"2026-05-16T22:21:18.616466Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01005","last_updated":"2025-04-21T20:10:11Z","snapshot_observed_at":"2026-07-06T20:15:36.280948Z","submitted_at":"2025-01-02T02:02:20Z","title":"FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Serving","version":2},"cited_work":{"arxiv_id":"2501.01005","doi":"10.48550/arxiv.2501.01005","metadata_source":"pith","pith_arxiv_id":"2501.01005","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Serving","venue":"cs.DC","work_id":"a153885b-2460-4177-9053-8d0011adfcb9","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2501.01005","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:435dcb8992d2634b5b85d39ea662a25156a4f9ef42fb43d28dcf7dd1367793bc","observation_id":"28f5ac65-337c-41c8-b8df-daf0c2f07528","resolution":{"observed_at":"2026-05-16T22:21:18.590854Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11089","last_updated":"2025-02-27T09:01:21Z","snapshot_observed_at":"2026-08-07T14:17:15.942844Z","submitted_at":"2025-02-16T11:53:44Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","version":2},"cited_work":{"arxiv_id":"2502.11089","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.11089","snapshot_observed_at":"2026-07-10T01:36:44.142264Z","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","venue":"cs.CL","work_id":"c74d35ec-94d3-48f5-a291-20cfad7c04a3","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2502.11089","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:88093ccaca452f43a8c2bd8ae3f21b3ad0f53e18c23a626d046f3386a1261187","observation_id":"862d1db2-8482-41ac-8ec6-7e85327c9c72","resolution":{"observed_at":"2026-05-16T23:46:30.294205Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06471","last_updated":"2025-08-08T17:21:06Z","snapshot_observed_at":"2026-08-11T03:34:09.767397Z","submitted_at":"2025-08-08T17:21:06Z","title":"GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Models","version":1},"cited_work":{"arxiv_id":"2508.06471","doi":"10.48550/arxiv.2508.06471","metadata_source":"pith","pith_arxiv_id":"2508.06471","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GLM-4.5: Agentic, Reasoning, and Coding (ARC) Foundation Models","venue":"cs.CL","work_id":"5bb4e5d7-985e-431b-bb0d-75576cdc2950","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"cited_paper":"/paper/2508.06471","citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:e14a7b6f19fedc335ec2645f8011d497e7032bb0c776513e2d4f4d6a333cea04","observation_id":"7867ada3-2c1b-4aa3-991b-344c21dde056","resolution":{"observed_at":"2026-05-16T22:21:18.627000Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-05-23T05:23:01.474969+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-23T05:23:01.474969+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2502.18137","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T20:48:56.478959Z","title":"Spargeattn: Accurate sparse attention accelerating any model inference","venue":null,"work_id":"6199672f-7a6e-41ee-9a53-dcc98d435cb6","year":2025},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:b8109cb5d4466c56f50fd05f8eb4f5a3330f86c44b19f58f075f4c9ab6ccd539","observation_id":"b5182c2a-f954-4bcf-bf79-3c61435b5d65","resolution":{"observed_at":"2026-05-16T22:21:18.599241Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"H2o: Heavy-hitter oracle for efficient generative inference of large language models.Advances in Neural Information Processing Systems, 36:34661–34710","venue":null,"work_id":"df270c3a-61fe-4c52-aef8-cd5f0aaed905","year":2023},"citing_paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T22:20:53.856657Z"},"links":{"citing_paper":"/paper/2512.12087"},"observation_digest":"sha256:286e4655538c52e2ff339c7827e107cf35b3848656410eaca9b023a2bef7839c","observation_id":"dcee2c82-51fc-4771-bcf0-73df190798a7","resolution":{"observed_at":"2026-05-16T22:21:19.065428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2512.12087","last_updated":"2026-04-28T06:58:25Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-11T12:47:24.973524Z","submitted_at":"2025-12-12T23:30:43Z","title":"BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":25,"verified_fuzzy":1},"total_outbound_references":29},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 9 inbound Pith citation observations for arXiv:2512.12087."}