{"as_of":"2026-08-06T07:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73d894a852b78c289ed80d88afca6e7eb419e245ee70fc60bf460b40cf8fcbf1","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-08-06T05:07:21.631030Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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-05-10T07:15:19.184970Z","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":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"cited_work":{"arxiv_id":"2508.02215","doi":"10.48550/arxiv.2508.02215","metadata_source":"arxiv_reference","pith_arxiv_id":"2508.02215","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Available: https://doi.org/10.48550/arXiv.2508.02215","venue":"ArXiv.org","work_id":"5d192ad5-f8f1-423b-b77a-7f62da42cffa","year":null},"citing_paper":{"arxiv_id":"2604.16864","last_updated":"2026-04-18T06:28:21Z","snapshot_observed_at":"2026-08-02T05:52:50.560554Z","submitted_at":"2026-04-18T06:28:21Z","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-10T07:15:19.184970Z"},"links":{"cited_paper":"/paper/2508.02215","citing_paper":"/paper/2604.16864"},"observation_digest":"sha256:bfef67ce854b69e456c41d2bc54d68b0b7bc5ea55d7d651b595e787c3c6020e9","observation_id":"9860044c-3cd7-4a2c-8b64-17976956e549","resolution":{"observed_at":"2026-05-10T07:16:54.225290Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.02215/citation-record","integrity":"/paper/2508.02215/integrity","json":"/paper/2508.02215/citation-record.json","paper":"/paper/2508.02215"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:25.737538Z","title":"V ., Khangulyan, D","venue":null,"work_id":"712244e0-a197-4eb1-9f74-965e256dc7a4","year":2012},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:18.925159Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:91842897616405c076139add25a10afb2aeb20270bed3614e2dfd98552c4fabd","observation_id":"b37e75c8-d8a8-475c-b7c4-67893db3a212","resolution":{"observed_at":"2026-08-06T05:07:25.788660Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:25.623215Z","title":"& Janis, V","venue":null,"work_id":"133654ed-6364-4de2-987c-f86f4f71fb7b","year":1985},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:18.979564Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:9183a58a06e377059379cbcdbece5ff1adb186837d604c8c024216f942b6ea1b","observation_id":"e4102bf6-d0f3-4beb-bfae-e154bc076a93","resolution":{"observed_at":"2026-08-06T05:07:25.669370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:19.027309Z","title":"2019, ARA&A, 57, 467","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.027309Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:87ec1cdd8f8caeb1f12a8406bdb640b8098810909dbd019c69acb70c259c2bfb","observation_id":"f02b2345-b923-4c7b-972b-e9ef7343204c","resolution":{"observed_at":"2026-08-06T05:07:19.027309Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:19.136402Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.136402Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:008a7f69b58ecfd639e3c43599bb0e5d0e888e689f2aaa2043c2930f1bbed491","observation_id":"cf9d45ce-90b2-4bcc-8c0c-6f0d47e4a7ee","resolution":{"observed_at":"2026-08-06T05:07:19.136402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:19.223407Z","title":"2021, Phys","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.223407Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:97252c2c7fb925e3a714e2bc5bfc2bb41dcfdf83e0a626cfd59ca5a58bc063dd","observation_id":"29ee8ba1-b98c-4033-8d81-8f9ecd008bb7","resolution":{"observed_at":"2026-08-06T05:07:19.223407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:25.459666Z","title":"R., Uzdensky, D","venue":null,"work_id":"4e275920-8979-4d61-b9d1-4f246eb4ccde","year":2013},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.304470Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:8ac6c86be7486969dac340aa95d472bd5aa5950f67b129b99c1ca3f7e486a736","observation_id":"b5a8c9aa-513f-4094-aea7-eceeb827a26e","resolution":{"observed_at":"2026-08-06T05:07:25.519435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:25.286509Z","title":"2021, A&A, 650, A163","venue":null,"work_id":"20e9311b-a351-4d63-a91a-299929616115","year":2021},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.414888Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:985a04480bff82f3f3035efd1b8a215ca71e91ef869872a74f16e8c887e3b3ab","observation_id":"ae91f28a-24bb-40b4-b3da-fc0e90441bf1","resolution":{"observed_at":"2026-08-06T05:07:25.359327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:25.148833Z","title":"2020, Phys","venue":null,"work_id":"d91450f3-a8dd-45e7-befe-992bc3c99acc","year":2020},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.506150Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:8513ed33350ed1116bcabdecf546d106826746b876f341a407c60c7e5ed4e4cf","observation_id":"424baa80-fc44-4e6c-a971-200da36f8c6d","resolution":{"observed_at":"2026-08-06T05:07:25.206210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:24.955375Z","title":"2023, MNRAS, 521, 4323 Event Horizon Telescope Collaboration, Akiyama, K., Alberdi, A., et al","venue":null,"work_id":"04ad5587-ae87-4c1b-b992-0ee7116c154b","year":2023},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.561587Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:c5833df9d4c750337057b1e56193ea7b52bf64cc13ca2ea7f40f7e29190f6efe","observation_id":"c79b043e-f37f-4ff0-91db-73c41c1a4164","resolution":{"observed_at":"2026-08-06T05:07:25.060890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:24.758350Z","title":"2006, in Compact stellar X-ray sources, ed","venue":null,"work_id":"0c940bfa-eb0b-4f40-91f6-1f808babe66c","year":2006},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.607408Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:c54679c4fd3c14400621717f01898587b27196e666f932be301d4b9595dca9b4","observation_id":"38f6f93d-e8b0-42d0-89a9-73efa254685a","resolution":{"observed_at":"2026-08-06T05:07:24.850054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:19.700503Z","title":"& Julian, W","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.700503Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:9415f6e0b2b7b5f3ae335dd2db2ccdbcc56c17c828f7fc6e2f37c3b6924db8a7","observation_id":"a6071324-4cb8-456b-9cb6-a28e38009706","resolution":{"observed_at":"2026-08-06T05:07:19.700503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:24.584516Z","title":"2024, A&A, 687, A185","venue":null,"work_id":"40078650-5671-41e7-86a6-c85f1f3188ec","year":2024},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.736859Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:baf79b61fb808f8bdc872aa57d02c5cee812a0d9f294ec2526137eb49ae44301","observation_id":"f1ba584c-c73d-4118-a884-055bafa1fc68","resolution":{"observed_at":"2026-08-06T05:07:24.671974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:24.410655Z","title":null,"venue":null,"work_id":"5062a7ff-bdeb-4f5e-a87f-4e8588f87017","year":2025},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.805286Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:3617b190d70a0e52d643f6658b20d0ec1ff6d5278924f0023e3a5fa822a1d054","observation_id":"9bf8ccbd-d978-47d5-a7f2-682628443536","resolution":{"observed_at":"2026-08-06T05:07:24.481981Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:24.161831Z","title":null,"venue":null,"work_id":"29f0c96f-18c0-488b-8c7f-e89e6e9e9927","year":2002},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.899395Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:de92b8e7a81ff303791a2fd0e8d406ac448abb3f3b666aced8cb9fd09ce6a994","observation_id":"6164983c-1396-4a76-a61e-18b71e50a090","resolution":{"observed_at":"2026-08-06T05:07:24.263527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.965343Z","title":null,"venue":null,"work_id":"2db5822b-0db1-44ac-9dc2-bb28303638c2","year":2001},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:19.960560Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:9e92b2c80c56b19327bf4a0a958b7aa3e3859addfe72a492ff0946a8b0de689c","observation_id":"f8156929-b49a-46c7-82e5-6fe9fbb94802","resolution":{"observed_at":"2026-08-06T05:07:24.045019Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.743079Z","title":null,"venue":null,"work_id":"bccded66-7f06-4d14-b392-399450b07a8e","year":2004},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.034373Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:57d27ad7cdddcb083dc70ce93f4ada5c7250ad23bd50e82a93459eba848ed24e","observation_id":"75c21714-b1d3-4ac7-b164-f516b3840c25","resolution":{"observed_at":"2026-08-06T05:07:23.844165Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.579315Z","title":null,"venue":null,"work_id":"109238d3-3919-4469-a159-8bf2f24a5940","year":1994},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.146922Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:7db05b88678f540885f6e5f5c529b5c79b9c5b09a9cb1e0946d9b8b57bc6133b","observation_id":"bbe2f03b-fe7f-40da-aae4-c74291b8bfb5","resolution":{"observed_at":"2026-08-06T05:07:23.635282Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.344622Z","title":null,"venue":null,"work_id":"48ac791d-7866-4e8b-b7f9-8adb2aff209e","year":1999},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.264548Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:2f4b732d1fbe7c3d7a36d699f2ac2d097e05eb08df034545bc671d97903ef0d3","observation_id":"5b14ed07-c45f-4820-a790-eaed01a3485d","resolution":{"observed_at":"2026-08-06T05:07:23.450242Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.181364Z","title":null,"venue":null,"work_id":"b5899737-4d51-4ec0-8c5f-078ff227bbd6","year":2010},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.454157Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:6181fdf2262bf5cf19900c6b40175e95d2a751d053546a321bfaf101aaec6053","observation_id":"0d018878-e5b0-4542-b015-412fc55efb11","resolution":{"observed_at":"2026-08-06T05:07:23.257424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:23.000418Z","title":"2019, Phys","venue":null,"work_id":"9b00d8af-778b-4fb4-84c1-a9918f453fcd","year":2019},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.568597Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:a5cda44b8ca17606c6a356a90740f56edb09eb68ab7f9f120eb2c743701a277a","observation_id":"65b0d091-28fc-481c-8182-76c0ef97634c","resolution":{"observed_at":"2026-08-06T05:07:23.092166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:22.837761Z","title":null,"venue":null,"work_id":"6bd2c229-1403-46af-8dfc-f752fcf9f16f","year":2018},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.718378Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:80824443ef16612c869597d2638da38b15c7121739da7813c1a4c6f6f8e8cbcc","observation_id":"f9c38f54-8453-4646-b3ad-92789b83e10f","resolution":{"observed_at":"2026-08-06T05:07:22.909105Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:20.813761Z","title":"M., Quataert, E., White, C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.813761Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:d5fc0210c3cdcdde49738a7ec7591bcf9150f7440232202578db075d2ed9fc23","observation_id":"5c0a8df5-743d-4672-a45c-32a0507c6cb5","resolution":{"observed_at":"2026-08-06T05:07:20.813761Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:20.912254Z","title":"M., White, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:20.912254Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:95230b08dc7f2c91ce9bc802205227d859133de9da6d7555a7e13bf7b6731619","observation_id":"19129308-cfd6-496c-aff3-2011f2485118","resolution":{"observed_at":"2026-08-06T05:07:20.912254Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:22.622213Z","title":"J., Yusef-Zadeh, F., Wardle, M., et al","venue":null,"work_id":"b55723a4-5a25-407d-8236-3982b89ac3f5","year":2019},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.063938Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:bc11ebb4d628909c3abc9d1870a2049ebbb71c52a8e9e2fd0012a12e6a7abb23","observation_id":"bb82b1e7-2f51-4ed8-bffe-dc56f5cc3d3d","resolution":{"observed_at":"2026-08-06T05:07:22.689366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:21.151211Z","title":"& Spitkovsky, A","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.151211Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:09e474dca3ee87d98a41c9ff0da1c68e5757c0185285dfbd53616a705fbae743","observation_id":"58b3967a-b50c-415b-a8eb-8bc8c5ad2cbc","resolution":{"observed_at":"2026-08-06T05:07:21.151211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:21.259057Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.259057Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:333b13d06975e22c9e75b5d9e57ef9ea77fa5e19793a5d37410fc9a73a1218ac","observation_id":"8175e28a-8074-435e-b2bf-63fd79e2eb90","resolution":{"observed_at":"2026-08-06T05:07:21.259057Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T05:07:22.365324Z","title":null,"venue":null,"work_id":"a0c21657-5040-4f0f-b64b-87878728141d","year":1974},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.398399Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:7b5a4f4df32f139923e7b9a67a64349b4dc7b83cf21866fafa5adfdbc63c695f","observation_id":"0add7c93-5b75-4d80-ae79-648fa4968045","resolution":{"observed_at":"2026-08-06T05:07:22.483506Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:22.064588Z","title":"R., Uzdensky, D","venue":null,"work_id":"cc3204b2-190e-46f7-a50e-d3a636cc9631","year":2016},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.516474Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:ff00a5f07343c3d5041f9f933f590bafeadf76149c72de1a78692e91d6554768","observation_id":"abeb63fb-5326-4724-a205-6b0d7fe0a251","resolution":{"observed_at":"2026-08-06T05:07:22.235028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-08-06T05:07:21.849413Z","title":"Y ., & Luepker, M","venue":null,"work_id":"0b31bbfa-9852-4c4b-874c-35979ba0a044","year":2025},"citing_paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T05:07:21.631030Z"},"links":{"citing_paper":"/paper/2508.02215"},"observation_digest":"sha256:796951166c312ce903a43f2e7f3b6d39acff0545d3657ccbca48d8101d7c81b7","observation_id":"3e61ab15-f88b-473b-b934-66bceea4c6ef","resolution":{"observed_at":"2026-08-06T05:07:21.946688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.02215","last_updated":"2025-08-04T09:08:43Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T05:07:18.252560Z","submitted_at":"2025-08-04T09:08:43Z","title":"LeanK: Learnable K Cache Channel Pruning for Efficient Decoding"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":12},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 1 inbound Pith citation observation for arXiv:2508.02215."}