{"as_of":"2026-08-07T06:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2568d79316066551facde16d64f765ef4d2c35c7edcac3ec164adbeed6bbb16","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":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T10:16:13.078259Z","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-07-02T21:57:26.175240Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2307.08621","last_updated":"2023-08-09T08:53:08Z","snapshot_observed_at":"2026-08-02T13:21:32.251959Z","submitted_at":"2023-07-17T16:40:01Z","title":"Retentive Network: A Successor to Transformer for Large Language Models","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-11T20:29:59.633357Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2307.08621"},"observation_digest":"sha256:8b987d642b9b9b12a68e5073a3a1481492dfeed33a417050a1b0eadb1d4e6155","observation_id":"10964c7f-fb85-46cd-923d-444d78d92895","resolution":{"observed_at":"2026-05-11T20:29:59.827872Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2407.11550","last_updated":"2025-10-16T13:25:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-16T09:53:32Z","title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","version":5},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-17T11:16:31.904921Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2407.11550"},"observation_digest":"sha256:a619bd91bad155b5db01c466fe3cb9e388a27316e6d4dbaaf1f0bde21175d609","observation_id":"58304fc4-6592-4cf3-916f-6b12d957eeb9","resolution":{"observed_at":"2026-05-17T11:16:32.060641Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-05T10:16:13.078259Z","title":"arXiv preprint arXiv:2104.02112","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.04377","last_updated":"2025-09-04T16:40:01Z","snapshot_observed_at":"2026-08-06T07:33:15.787399Z","submitted_at":"2025-09-04T16:40:01Z","title":"PagedEviction: Structured Block-wise KV Cache Pruning for Efficient Large Language Model Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T10:16:13.078259Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2509.04377"},"observation_digest":"sha256:92eb92b77603412315ccf0fbe11e664261f54c3fb6b5dc46bb60894ef45244c7","observation_id":"a6377163-eeb6-429d-a227-4de38537b4b9","resolution":{"observed_at":"2026-08-05T10:16:13.078259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-05T05:36:53.837356Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.05218","last_updated":"2025-09-08T03:13:38Z","snapshot_observed_at":"2026-08-07T01:27:09.310737Z","submitted_at":"2025-09-05T16:20:48Z","title":"HoPE: Hyperbolic Rotary Positional Encoding for Stable Long-Range Dependency Modeling in Large Language Models","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T05:36:53.837356Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2509.05218"},"observation_digest":"sha256:5cfdbb96952adc88c96ff136b803c60743b5e50d2bc6c1065c9960e68cc86d27","observation_id":"c574ba02-1743-4dc4-85c6-245e7c1ffe8f","resolution":{"observed_at":"2026-08-05T05:36:53.837356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-04T20:53:29.091290Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.08315","last_updated":"2025-09-10T06:32:49Z","snapshot_observed_at":"2026-08-04T20:53:17.807634Z","submitted_at":"2025-09-10T06:32:49Z","title":"EvolKV: Evolutionary KV Cache Compression for LLM Inference","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T20:53:29.091290Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2509.08315"},"observation_digest":"sha256:f51b852874d9bd48a9730b14d445c3f8ef8cde0cf7233ef305ff9c3cf7b651ca","observation_id":"3cf5adb1-59b7-46cb-b6ee-be469b6c2134","resolution":{"observed_at":"2026-08-04T20:53:29.091290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2602.08686","last_updated":"2026-07-21T10:42:28Z","snapshot_observed_at":"2026-08-03T03:16:17.613692Z","submitted_at":"2026-02-09T14:07:55Z","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T13:32:15.598047Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2602.08686"},"observation_digest":"sha256:8dd90d4bfa510db5aa8a00792b7081cdffb586acf97045a284b2b5ad380c1844","observation_id":"73d24d71-cbd5-46ac-b7a9-ee8255c9b99c","resolution":{"observed_at":"2026-05-21T13:34:11.434119Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-03T03:16:19.880944Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08686","last_updated":"2026-07-21T10:42:28Z","snapshot_observed_at":"2026-08-03T03:16:17.613692Z","submitted_at":"2026-02-09T14:07:55Z","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T03:16:19.880944Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2602.08686"},"observation_digest":"sha256:14c30f1ceef53d152f505581f8e6fd420dad731017708ebbcf8c1bba932497dd","observation_id":"28a89545-aa60-4a94-950b-458d7654da3b","resolution":{"observed_at":"2026-08-03T03:16:19.880944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-03T04:56:23.067350Z","title":"InFindings of the As- sociation for Computational Linguistics: ACL 2023, pages 13851–13883","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.00021","last_updated":"2026-05-30T11:05:28Z","snapshot_observed_at":"2026-08-03T04:56:21.569799Z","submitted_at":"2026-02-03T14:48:47Z","title":"From Global to Local: Learning Context-Aware Graph Representations for Document Classification and Summarization","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T04:56:23.067350Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2603.00021"},"observation_digest":"sha256:3c83f30d0fdab043b6ca7e3d1a06eebd4546528a30553c046d7efbe642d23898","observation_id":"f7662b0b-ce84-4628-af95-f4be3d9bf2f4","resolution":{"observed_at":"2026-08-03T04:56:23.067350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2604.21231","last_updated":"2026-05-04T22:59:12Z","snapshot_observed_at":"2026-07-06T23:07:51.979267Z","submitted_at":"2026-04-23T02:55:31Z","title":"SparKV: Overhead-Aware KV Cache Loading for Efficient On-Device LLM Inference","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-08T14:09:30.821354Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2604.21231"},"observation_digest":"sha256:de7cf14f25f71894df44166aef01b47ee0e10589e14f83f97d32eb40d1db11ee","observation_id":"bf15c77a-b126-42c8-9175-e740885c74e6","resolution":{"observed_at":"2026-05-11T18:46:07.739539Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2604.24647","last_updated":"2026-04-27T16:15:37Z","snapshot_observed_at":"2026-07-06T23:10:38.548416Z","submitted_at":"2026-04-27T16:15:37Z","title":"DepthKV: Layer-Dependent KV Cache Pruning for Long-Context LLM Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T03:49:01.267556Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2604.24647"},"observation_digest":"sha256:054f81640e931065cd8c065cb7c2b478de36e1af043469a80393f16b0fa29206","observation_id":"743a815a-e7ec-46bc-bfc5-be887273ba95","resolution":{"observed_at":"2026-05-11T21:56:12.778516Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2604.28157","last_updated":"2026-04-30T17:43:24Z","snapshot_observed_at":"2026-07-06T23:13:29.310140Z","submitted_at":"2026-04-30T17:43:24Z","title":"FlashRT: Towards Computationally and Memory Efficient Red-Teaming for Prompt Injection and Knowledge Corruption","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-07T06:49:56.316472Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2604.28157"},"observation_digest":"sha256:d18331f735d727761a6f50ed028456ff70def69fbf47dd7dba66dc98bac4fa71","observation_id":"467e96e9-9e8b-48ed-b76d-56ada5ccb4a5","resolution":{"observed_at":"2026-05-12T10:16:28.252669Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2605.06850","last_updated":"2026-05-07T18:51:57Z","snapshot_observed_at":"2026-07-06T23:19:15.382283Z","submitted_at":"2026-05-07T18:51:57Z","title":"How to Compress KV Cache in RL Post-Training? Shadow Mask Distillation for Memory-Efficient Alignment","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-11T01:25:30.458137Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2605.06850"},"observation_digest":"sha256:25d24c48522c7ee98fa7b00333ab7ea90cba00fd03d83bb2c868589b549d0e5e","observation_id":"d560fc7d-073d-4c2d-b73c-3c99f851fcb6","resolution":{"observed_at":"2026-05-11T04:25:57.314115Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2605.07234","last_updated":"2026-05-08T04:37:22Z","snapshot_observed_at":"2026-08-06T04:40:19.152385Z","submitted_at":"2026-05-08T04:37:22Z","title":"Reformulating KV Cache Eviction Problem for Long-Context LLM Inference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-11T02:37:52.545943Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2605.07234"},"observation_digest":"sha256:1efcc50a94832603a104add89c508d5f3101c96918a926c0017d980328149c37","observation_id":"f06a8140-4e99-4091-ad4d-147156ba33a2","resolution":{"observed_at":"2026-05-11T03:10:53.455240Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2606.07923","last_updated":"2026-06-06T01:16:58Z","snapshot_observed_at":"2026-07-06T23:47:29.065892Z","submitted_at":"2026-06-06T01:16:58Z","title":"Larch: Learned Query Optimization for Semantic Predicates","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T19:21:22.978335Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2606.07923"},"observation_digest":"sha256:7c56eab7b38b0f48dffb1c8dda08a73ea981f9f309db563574b80fc1110c02c5","observation_id":"4c13e76e-bb39-4d91-8dd1-34a3841f5f1d","resolution":{"observed_at":"2026-07-02T21:57:26.176647Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2606.29563","last_updated":"2026-06-28T19:04:47Z","snapshot_observed_at":"2026-08-02T13:11:07.991129Z","submitted_at":"2026-06-28T19:04:47Z","title":"Coverage-Driven KV Cache Eviction for Efficient and Improved Inference of LLM","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-30T07:19:48.530272Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2606.29563"},"observation_digest":"sha256:00569049217da281d5f3be87c4b39bf4723e04645a3659a873826f6304d05418","observation_id":"b184685a-4cee-4247-b016-892215fc08e1","resolution":{"observed_at":"2026-06-30T07:24:21.377682Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2606.29708","last_updated":"2026-06-30T03:13:37Z","snapshot_observed_at":"2026-07-07T00:03:41.292432Z","submitted_at":"2026-06-29T02:24:13Z","title":"Demystifying the Design Space and Best Practices for Heterogeneous LLM Inference and Serving","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T05:37:13.211613Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2606.29708"},"observation_digest":"sha256:c874803220186010816677d1834d63ccc5d8f3043e74ce7361bc6ed77ddb18c5","observation_id":"d68bd663-9252-47ea-98fe-446a8d2f2f6c","resolution":{"observed_at":"2026-06-30T14:04:45.313977Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":"2104.02112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-07-02T21:57:26.175240Z","title":"Effi- cient attentions for long document summarization.arXiv preprint arXiv:2104.02112","venue":null,"work_id":"aae5a10a-401d-4f18-8d91-43ed236a42aa","year":2021},"citing_paper":{"arxiv_id":"2606.29708","last_updated":"2026-06-30T03:13:37Z","snapshot_observed_at":"2026-07-07T00:03:41.292432Z","submitted_at":"2026-06-29T02:24:13Z","title":"Demystifying the Design Space and Best Practices for Heterogeneous LLM Inference and Serving","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-01T07:06:53.318182Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2606.29708"},"observation_digest":"sha256:d0321daea5ac2737b7d69bc457e91febbc5e87b7d8979867800b39b99fa7e5f9","observation_id":"5c30acc4-9429-4ffb-934b-b7c5183fe016","resolution":{"observed_at":"2026-07-01T08:55:35.166941Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.02112","snapshot_observed_at":"2026-08-01T06:59:51.397427Z","title":"Efficient attentions for long document summarization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21731","last_updated":"2026-07-23T18:28:13Z","snapshot_observed_at":"2026-08-06T13:35:24.001058Z","submitted_at":"2026-07-23T18:28:13Z","title":"RED-PIM: Reducing Data Movement for Transformers using Processing-in-Memory","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T06:59:51.397427Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2607.21731"},"observation_digest":"sha256:0f83c24c6eb19b9a055100430b7657c1ab25246660d4be32d990bca8f1bd307d","observation_id":"746124be-e2f0-4d8c-9150-8c2d77111e8e","resolution":{"observed_at":"2026-08-01T06:59:51.397427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.02112/citation-record","integrity":"/paper/2104.02112/integrity","json":"/paper/2104.02112/citation-record.json","paper":"/paper/2104.02112"},"outbound":[],"paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T10:56:39.571860Z","submitted_at":"2021-04-05T18:45:13Z","title":"Efficient Attentions for Long Document Summarization"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2104.02112."}