{"as_of":"2026-08-19T11:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:74ce2c910e9900dec0eea6621912dbfc9a6e09e06ad126997a843e93c7d6d52d","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:25:41.263764Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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-25T05:22:47.198185Z","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":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"cited_work":{"arxiv_id":"2501.04987","doi":"10.48550/arxiv.2501.04987","metadata_source":"arxiv_reference","pith_arxiv_id":"2501.04987","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Treekv: Smooth key-value cache compression with tree structures","venue":"arXiv (Cornell University)","work_id":"9a60c9b4-1738-4f2c-9031-c03c852a6bc2","year":2025},"citing_paper":{"arxiv_id":"2605.23200","last_updated":"2026-05-22T03:32:52Z","snapshot_observed_at":"2026-08-17T12:58:20.920773Z","submitted_at":"2026-05-22T03:32:52Z","title":"Adaptive Mass-Segmented KV Compression for Long-Context Reasoning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T05:22:47.198185Z"},"links":{"cited_paper":"/paper/2501.04987","citing_paper":"/paper/2605.23200"},"observation_digest":"sha256:072ab9c37f4847b9cc04f07fdfcc6dbb15ea2dbf016e22e84af8f115df741097","observation_id":"7a0673d6-ba0f-47f9-ba61-5c114be5d4de","resolution":{"observed_at":"2026-05-25T05:25:22.841372Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:28.351502+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:28.351502+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.04987/citation-record","integrity":"/paper/2501.04987/integrity","json":"/paper/2501.04987/citation-record.json","paper":"/paper/2501.04987"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.14508","last_updated":"2024-06-19T04:00:32Z","snapshot_observed_at":"2026-08-08T03:49:18.086396Z","submitted_at":"2023-08-28T11:53:40Z","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14508","snapshot_observed_at":"2026-08-10T21:25:41.184029Z","title":"Longbench: A bilingual, multitask benchmark for long context understanding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.184029Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:ddbee75f0d3e8ae575260f041e4fcfb0403ed2c8648585469ee98e1742afd906","observation_id":"13249a16-4898-49e2-897a-b2384ff1a02c","resolution":{"observed_at":"2026-08-10T21:25:41.184029Z","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-10T21:25:41.493638Z","title":"Fovea transformer: Efficient long- context modeling with structured fine-to-coarse attention","venue":null,"work_id":"db53a29f-bb60-440a-9721-165ecd2cb852","year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.202432Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:f910d5dea1cb9a705efea71de474fca2722c8eadde7a28c280230f31ef198a87","observation_id":"9f816662-2fec-41ad-b882-abfc390e248a","resolution":{"observed_at":"2026-08-10T21:25:41.497499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14469","last_updated":"2024-06-17T03:01:58Z","snapshot_observed_at":"2026-08-14T12:21:04.886717Z","submitted_at":"2024-04-22T17:42:58Z","title":"SnapKV: LLM Knows What You are Looking for Before Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14469","snapshot_observed_at":"2026-08-10T21:25:41.207753Z","title":"Snapkv: Llm knows what you are looking for before generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.207753Z"},"links":{"cited_paper":"/paper/2404.14469","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:cdddd433e0390863674694531c2f831c28469924a7f87a15eee00a97e7ca5163","observation_id":"8c59361b-24f1-4654-866b-3306be04ffc5","resolution":{"observed_at":"2026-08-10T21:25:41.207753Z","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-10T21:25:41.481176Z","title":"Scissorhands: Ex- ploiting the persistence of importance hypothesis for llm kv cache compression at test time","venue":null,"work_id":"e06fcd55-8a0f-4df4-ab47-7d525cd46aa6","year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.213180Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:5c4c6a907b98de128bc2228d4b54ebd028f92ed952483f5bec2b76fa7a6ba3be","observation_id":"190725d9-cfae-4434-b4d1-5cf7de266738","resolution":{"observed_at":"2026-08-10T21:25:41.485876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06104","last_updated":"2024-06-18T09:16:14Z","snapshot_observed_at":"2026-08-16T14:28:08.030037Z","submitted_at":"2024-01-11T18:35:26Z","title":"Transformers are Multi-State RNNs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06104","snapshot_observed_at":"2026-08-10T21:25:41.217872Z","title":"Transformers are multi-state rnns","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.217872Z"},"links":{"cited_paper":"/paper/2401.06104","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:a81b2d4db9cf41b015b678b658231864bc56abfb03cb4587855ee7131c159218","observation_id":"849a4dc2-1d8c-4b61-82e4-264473520e45","resolution":{"observed_at":"2026-08-10T21:25:41.217872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.05102","last_updated":"2022-11-09T18:50:38Z","snapshot_observed_at":"2026-08-16T16:17:24.089886Z","submitted_at":"2022-11-09T18:50:38Z","title":"Efficiently Scaling Transformer Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.05102","snapshot_observed_at":"2026-08-10T21:25:41.222232Z","title":"Efficiently scaling transformer inference","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.222232Z"},"links":{"cited_paper":"/paper/2211.05102","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:1e18f1efbe2fb29742efae5c0f68ec83cae77220a57d7b0c9580d70ee8b8e934","observation_id":"21a53ee0-b0f2-4a00-9062-ea2bb4d60a09","resolution":{"observed_at":"2026-08-10T21:25:41.222232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-10T21:25:41.235020Z","title":"Llama 2: Open foundation and fine-tuned chat models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.235020Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:dff10abd991cf6f2f451ebae5ddcb53dca1c7dd2ab9048a261406e523dac4013","observation_id":"0722134c-c233-483e-a82e-cf3b0b16dde2","resolution":{"observed_at":"2026-08-10T21:25:41.235020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17755","last_updated":"2024-05-28T02:12:35Z","snapshot_observed_at":"2026-08-17T15:10:49.685774Z","submitted_at":"2024-05-28T02:12:35Z","title":"XL3M: A Training-free Framework for LLM Length Extension Based on Segment-wise Inference","version":1},"cited_work":{"arxiv_id":"2405.17755","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17755","snapshot_observed_at":"2026-08-10T21:25:41.361542Z","title":"XL3M: A Training-free Framework for LLM Length Extension Based on Segment-wise Inference","venue":"cs.CL","work_id":"149fca7a-16f0-4c79-b3c6-60fb9fef6106","year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.239231Z"},"links":{"cited_paper":"/paper/2405.17755","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:6471667d5523792da3248f91d5fe9523255ff3f5be01e6b9e456ddc680a681de","observation_id":"1e5ef0d8-8bcc-4ca3-9e7d-5bff92880aae","resolution":{"observed_at":"2026-08-10T21:25:41.365416Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2206.07682","last_updated":"2022-10-26T05:06:24Z","snapshot_observed_at":"2026-08-17T00:14:01.413100Z","submitted_at":"2022-06-15T17:32:01Z","title":"Emergent Abilities of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.07682","snapshot_observed_at":"2026-08-10T21:25:41.243369Z","title":"Emergent abilities of large language models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.243369Z"},"links":{"cited_paper":"/paper/2206.07682","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:eb2577856780aff7917c7392e0f435fca3d504a876a1e4db77180fe33429ea01","observation_id":"4640a3ee-65b7-4fa3-b7ac-ce1d9d7c65b2","resolution":{"observed_at":"2026-08-10T21:25:41.243369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-08-14T06:01:54.549199Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-10T21:25:41.247199Z","title":"Efficient stream- ing language models with attention sinks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.247199Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:517e66af70d4ef224f6a8bf5a7d9db37ff71c9cecc0bc04642592e8123759a99","observation_id":"8a28cf18-7be0-4a91-978a-55fddae9a59b","resolution":{"observed_at":"2026-08-10T21:25:41.247199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12532","last_updated":"2024-06-05T09:01:24Z","snapshot_observed_at":"2026-08-16T13:51:05.375565Z","submitted_at":"2024-05-21T06:46:37Z","title":"PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12532","snapshot_observed_at":"2026-08-10T21:25:41.251024Z","title":"Pyramidinfer: Pyra- mid kv cache compression for high-throughput llm infer- ence","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.251024Z"},"links":{"cited_paper":"/paper/2405.12532","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:556fa3705a888d17dd6660b40723592e71eb9eef1b71647b7baae1ad0451ea4b","observation_id":"f328f19a-bac3-4371-a5a2-5be7ba46d374","resolution":{"observed_at":"2026-08-10T21:25:41.251024Z","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-10T21:25:41.455383Z","title":"Wordcraft: story writing with large language models","venue":null,"work_id":"6b75cced-14ff-40de-83fe-cb26b94355e1","year":2022},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.255283Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:02f9bc09631fc81efe50e58b096ecdf8b35ba229ef748b61666764e0772bcbc8","observation_id":"ccf65406-15a8-4fd6-99d9-8c62d77eabb1","resolution":{"observed_at":"2026-08-10T21:25:41.460099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02069","last_updated":"2025-05-15T17:18:12Z","snapshot_observed_at":"2026-08-13T04:39:30.300015Z","submitted_at":"2024-06-04T07:51:30Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-10T21:25:41.259363Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.259363Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:bb67c2ce2b82d5ac9903b9406592d5062a79a066e6a8bdee1a7081ae20aad0b2","observation_id":"d8f20272-7c65-4af9-bc55-b153cc589812","resolution":{"observed_at":"2026-08-10T21:25:41.259363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.09055","last_updated":"2022-03-17T03:33:47Z","snapshot_observed_at":"2026-08-16T17:13:54.735046Z","submitted_at":"2022-03-17T03:33:47Z","title":"Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERT","version":1},"cited_work":{"arxiv_id":"2203.09055","doi":null,"metadata_source":"pith","pith_arxiv_id":"2203.09055","snapshot_observed_at":"2026-08-10T21:25:41.294241Z","title":"Fine- and Coarse-Granularity Hybrid Self-Attention for Efficient BERT","venue":"cs.CL","work_id":"1dc19391-1db7-4926-9d52-72f81766b261","year":2022},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.263764Z"},"links":{"cited_paper":"/paper/2203.09055","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:90ceb143f3439af15a9aa2a6a10298fd7c61027336be72c6497b259b28384c75","observation_id":"1b9bb5f5-4c87-4d8e-8436-cb214ba38d77","resolution":{"observed_at":"2026-08-10T21:25:41.300916Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T21:25:41.468716Z","title":"Dct-former: Ef- ficient self-attention with discrete cosine transform","venue":null,"work_id":"2a95ba3a-23d5-4055-bb86-7947f91c92d1","year":2023},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.230618Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:88b31e5106449e1c31d7990f6bea0bf956733b1ae182e705c7c851e030e6a587","observation_id":"446196d6-41b3-4c73-aad2-395029588609","resolution":{"observed_at":"2026-08-10T21:25:41.472839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T21:25:41.516395Z","title":"Lm-infinite: Zero-shot extreme length generalization for large language models","venue":null,"work_id":"318801a7-40b2-43ba-922b-5da7a802fb42","year":2024},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.193385Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:0eede2b7a91da12785e552b8731e70b9b7afbbfde7beea15da0d543e2c98cf08","observation_id":"c5134423-3603-4ed4-9398-fbd81f21396a","resolution":{"observed_at":"2026-08-10T21:25:41.520981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05507","last_updated":"2019-11-13T14:36:01Z","snapshot_observed_at":"2026-08-10T02:15:37.272323Z","submitted_at":"2019-11-13T14:36:01Z","title":"Compressive Transformers for Long-Range Sequence Modelling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05507","snapshot_observed_at":"2026-08-10T21:25:41.226478Z","title":"Compressive trans- formers for long-range sequence modelling.arXiv preprint arXiv:1911.05507,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.226478Z"},"links":{"cited_paper":"/paper/1911.05507","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:27ef053b140f1092de7af30ae87bfe918d1ded9f24a67004f55d33d190f4232a","observation_id":"9b06ccb0-9493-47e3-b08e-7f30e7dd07d7","resolution":{"observed_at":"2026-08-10T21:25:41.226478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.00027","last_updated":"2020-12-31T19:00:10Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-12-31T19:00:10Z","title":"The Pile: An 800GB Dataset of Diverse Text for Language Modeling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.00027","snapshot_observed_at":"2026-08-10T21:25:41.189033Z","title":"The pile: An 800gb dataset of diverse text for language modeling","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.189033Z"},"links":{"cited_paper":"/paper/2101.00027","citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:96bfe7cadb0de126345d8736c70a3f7e4222173679534342f8148057a077def0","observation_id":"7c5e47fb-a107-442b-814a-04f0c8996f85","resolution":{"observed_at":"2026-08-10T21:25:41.189033Z","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-10T21:25:41.504400Z","title":"Fourier transformer: Fast long range mod- eling by removing sequence redundancy with fft operator","venue":null,"work_id":"b0ed88fe-9893-4cfb-83a0-97d55f384b57","year":2023},"citing_paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T21:25:41.198082Z"},"links":{"citing_paper":"/paper/2501.04987"},"observation_digest":"sha256:de57ab990d3935ff411cb5c3d1bb4a0021779f9b7046247faaa6626202109bb0","observation_id":"e15347ef-a648-42a0-80fb-ab0498bcfb55","resolution":{"observed_at":"2026-08-10T21:25:41.508151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.04987","last_updated":"2025-05-16T12:32:36Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-15T18:26:51.078891Z","submitted_at":"2025-01-09T06:00:27Z","title":"TreeKV: Smooth Key-Value Cache Compression with Tree Structures"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":6},"total_outbound_references":19},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 1 inbound Pith citation observation for arXiv:2501.04987."}