{"as_of":"2026-08-14T08:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7afff1974faa2450cc9c9a1a6cebeb0c1f3bd1dcf05598f128209dc2f9fc240a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:38:47.654460Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T21:43:00.702439Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.09486","last_updated":"2024-02-04T03:14:08Z","snapshot_observed_at":"2026-08-13T04:42:11.411127Z","submitted_at":"2024-01-16T09:18:46Z","title":"LoMA: Lossless Compressed Memory Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09486","snapshot_observed_at":"2026-08-11T00:38:47.654460Z","title":"LoMA: Lossless Compressed Memory Attention,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19442","last_updated":"2025-07-30T05:24:46Z","snapshot_observed_at":"2026-08-11T00:33:34.388194Z","submitted_at":"2024-12-27T04:17:57Z","title":"A Survey on Large Language Model Acceleration based on KV Cache Management","version":3},"reference_index":105,"source":"pdf_text","source_observed_at":"2026-08-11T00:38:47.654460Z"},"links":{"cited_paper":"/paper/2401.09486","citing_paper":"/paper/2412.19442"},"observation_digest":"sha256:c741587883fb6fd78ba2659de031b605c5dee395a67a3e08e8c26816e8ff0c24","observation_id":"9473ec23-5a58-4e4a-9104-b4773ba8dbf4","resolution":{"observed_at":"2026-08-11T00:38:47.654460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09486","last_updated":"2024-02-04T03:14:08Z","snapshot_observed_at":"2026-08-13T04:42:11.411127Z","submitted_at":"2024-01-16T09:18:46Z","title":"LoMA: Lossless Compressed Memory Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.09486","snapshot_observed_at":"2026-08-06T14:00:43.320151Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-13T21:02:31.385896Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.320151Z"},"links":{"cited_paper":"/paper/2401.09486","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:c1ba9368be33ca571221a9a87c42e2ae200e4368caf9f19f26e3ba7f6a203ea2","observation_id":"b72fc353-3e11-4225-8845-5ddbe2a5b604","resolution":{"observed_at":"2026-08-06T14:00:43.320151Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.09486","last_updated":"2024-02-04T03:14:08Z","snapshot_observed_at":"2026-08-13T04:42:11.411127Z","submitted_at":"2024-01-16T09:18:46Z","title":"LoMA: Lossless Compressed Memory Attention","version":2},"cited_work":{"arxiv_id":"2401.09486","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.09486","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2401.09486 (2024)","venue":null,"work_id":"920009b9-1b49-416e-9d11-f377e7e298a8","year":2024},"citing_paper":{"arxiv_id":"2603.27960","last_updated":"2026-04-11T06:07:02Z","snapshot_observed_at":"2026-08-11T16:23:12.824554Z","submitted_at":"2026-03-30T02:23:37Z","title":"Towards Efficient Large Vision-Language Models: A Comprehensive Survey on Inference Strategies","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-14T21:40:55.343169Z"},"links":{"cited_paper":"/paper/2401.09486","citing_paper":"/paper/2603.27960"},"observation_digest":"sha256:9d044bcc1b6858939491b09de068f2291e5cd0452caf4f3d061c05bc8ac964a2","observation_id":"8cbf2512-6e06-4976-951b-e7fe06b90b95","resolution":{"observed_at":"2026-05-14T21:43:00.704065Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2401.09486/citation-record","integrity":"/paper/2401.09486/integrity","json":"/paper/2401.09486/citation-record.json","paper":"/paper/2401.09486"},"outbound":[],"paper":{"arxiv_id":"2401.09486","last_updated":"2024-02-04T03:14:08Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-13T04:42:11.411127Z","submitted_at":"2024-01-16T09:18:46Z","title":"LoMA: Lossless Compressed Memory Attention"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2401.09486."}