{"as_of":"2026-08-19T17:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a45206cafd23e43d6ea8364253b6147e0c8263f8ac7bb5073235406b19bc526d","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":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":29,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:43:52.626266Z","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-08-16T18:33:45.535571Z","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-18T21:18:20.077927Z","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:3fffe0098042599b5b11dd9ad002b4b9759e9129421ac1a2dfd79ae1e9ef9fa8","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-12T20:32:53.188699Z","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:3fdfe712716eb285851c70c47708da72dd680dd8cd4f197841a14a5cf494fc82","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-11T19:11:06.092188Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.07171","last_updated":"2024-12-10T04:09:29Z","snapshot_observed_at":"2026-08-14T07:22:41.809657Z","submitted_at":"2024-12-10T04:09:29Z","title":"Breaking the Stage Barrier: A Novel Single-Stage Approach to Long Context Extension for Large Language Models","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T19:11:06.092188Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2412.07171"},"observation_digest":"sha256:5a25a5cea553c38bee68275ca9a00c212ec7b639395e15b6b1e76363e15cde6f","observation_id":"4f359a4d-f3ed-447d-92e0-caefd4b71304","resolution":{"observed_at":"2026-08-11T19:11:06.092188Z","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-08-16T18:33:45.535571Z","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-11T13:52:48.695396Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12706","last_updated":"2025-02-20T12:14:49Z","snapshot_observed_at":"2026-08-13T11:09:26.001382Z","submitted_at":"2024-12-17T09:20:31Z","title":"More Tokens, Lower Precision: Towards the Optimal Token-Precision Trade-off in KV Cache Compression","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T13:52:48.695396Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2412.12706"},"observation_digest":"sha256:a8a71d409c8ad44382f73dbc7f892ecc12e228d0b95bbbc2c4448c224f70fa08","observation_id":"326f13d4-abc0-4fe5-a144-9b06272784dc","resolution":{"observed_at":"2026-08-11T13:52:48.695396Z","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-08-16T18:33:45.535571Z","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-11T05:18:54.484670Z","title":"Effi- cient attentions for long document summarization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.17739","last_updated":"2025-07-14T04:23:36Z","snapshot_observed_at":"2026-08-16T01:52:40.015617Z","submitted_at":"2024-12-23T17:44:01Z","title":"Fourier Position Embedding: Enhancing Attention's Periodic Extension for Length Generalization","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T05:18:54.484670Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2412.17739"},"observation_digest":"sha256:3fc8367acef0473a50686ea24efb9614febd25e4c100dc461d09104e75f92eb9","observation_id":"a0c11acb-7f8d-4164-b65d-acf589380943","resolution":{"observed_at":"2026-08-11T05:18:54.484670Z","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-08-16T18:33:45.535571Z","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-10T23:05:07.292596Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.00097","last_updated":"2024-12-30T19:00:01Z","snapshot_observed_at":"2026-08-17T22:12:06.609751Z","submitted_at":"2024-12-30T19:00:01Z","title":"CaseSumm: A Large-Scale Dataset for Long-Context Summarization from U.S. Supreme Court Opinions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T23:05:07.292596Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2501.00097"},"observation_digest":"sha256:0ab5e6ab1929ee05794793e89ca3f7272c2379ce74b5764686203d652c3173de","observation_id":"4bb28842-85ce-43bb-9aad-aecc76921dad","resolution":{"observed_at":"2026-08-10T23:05:07.292596Z","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-08-16T18:33:45.535571Z","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-10T22:18:51.258739Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.02336","last_updated":"2025-01-04T17:01:30Z","snapshot_observed_at":"2026-08-14T12:52:08.037319Z","submitted_at":"2025-01-04T17:01:30Z","title":"AdaSkip: Adaptive Sublayer Skipping for Accelerating Long-Context LLM Inference","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T22:18:51.258739Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2501.02336"},"observation_digest":"sha256:ca0e19ff245c3a6f039d2eaca907d7abadda2c474e601ac4c62e906c28ce64f1","observation_id":"1e410ddf-31ce-4697-a539-4964f08141cf","resolution":{"observed_at":"2026-08-10T22:18:51.258739Z","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-08-16T18:33:45.535571Z","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-10T14:41:05.122694Z","title":"Efficient attentions for long document summarization,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.15113","last_updated":"2025-01-25T07:28:13Z","snapshot_observed_at":"2026-08-19T12:48:12.083052Z","submitted_at":"2025-01-25T07:28:13Z","title":"Task-KV: Task-aware KV Cache Optimization via Semantic Differentiation of Attention Heads","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T14:41:05.122694Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2501.15113"},"observation_digest":"sha256:c221af46f758bfe7933cc638d9b7edbc8cdc3be0032355fdb3caa0aa78d57f8f","observation_id":"895f4727-556e-4266-8a88-567002d11549","resolution":{"observed_at":"2026-08-10T14:41:05.122694Z","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-08-16T18:33:45.535571Z","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-09T00:45:56.863397Z","title":"Efficient attentions for long document summarization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.03805","last_updated":"2026-05-28T09:11:35Z","snapshot_observed_at":"2026-08-17T23:09:00.351462Z","submitted_at":"2025-02-06T06:31:47Z","title":"CriticalKV: Optimizing KV Cache Eviction from an Output Perturbation Perspective","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-09T00:45:56.863397Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2502.03805"},"observation_digest":"sha256:c3e5364febc0ce9780f5acb4214fb6ad1bafd8515f836e92363a5051519adc92","observation_id":"f5345240-a8a7-4fda-be5b-148b51d37ebe","resolution":{"observed_at":"2026-08-09T00:45:56.863397Z","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-08-16T18:33:45.535571Z","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-16T04:43:52.626266Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.00506","last_updated":"2025-05-01T13:22:45Z","snapshot_observed_at":"2026-08-17T19:10:02.944786Z","submitted_at":"2025-05-01T13:22:45Z","title":"HalluMix: A Task-Agnostic, Multi-Domain Benchmark for Real-World Hallucination Detection","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T04:43:52.626266Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2505.00506"},"observation_digest":"sha256:a90146a0617811ab42315102662a108a79ccf4ffe8061bf65da00f327f5b0126","observation_id":"6c19549a-e3fa-422d-8858-65e281fd969a","resolution":{"observed_at":"2026-08-16T04:43:52.626266Z","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-08-16T18:33:45.535571Z","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-15T22:35:06.000675Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.06862","last_updated":"2025-05-11T06:14:39Z","snapshot_observed_at":"2026-08-19T15:22:09.134169Z","submitted_at":"2025-05-11T06:14:39Z","title":"A Split-then-Join Approach to Abstractive Summarization for Very Long Documents in a Low Resource Setting","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T22:35:06.000675Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2505.06862"},"observation_digest":"sha256:d40eafa460d1291c1a632f0655af6e0a4d5d654d0fb1f67a1fd2d8ed7306a5ba","observation_id":"b142c41e-b56c-49c1-9beb-a3eb0de83948","resolution":{"observed_at":"2026-08-15T22:35:06.000675Z","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-08-16T18:33:45.535571Z","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-15T20:22:04.424586Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.13204","last_updated":"2025-09-12T09:08:05Z","snapshot_observed_at":"2026-08-17T19:29:04.101537Z","submitted_at":"2025-05-19T14:55:41Z","title":"Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T20:22:04.424586Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2505.13204"},"observation_digest":"sha256:4f0e34d498242e9a9143c245626f659f5ad05d4685fd9b5280e9e170725b0043","observation_id":"402ad735-96af-4d01-bd92-776a4aac9fba","resolution":{"observed_at":"2026-08-15T20:22:04.424586Z","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-08-16T18:33:45.535571Z","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-15T06:44:06.974630Z","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:68f54e1e00a690bb0604f081dfc474cddaa19a8a218c064a9b7ec7b2e77c7d0c","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-08-16T18:33:45.535571Z","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-14T23:22:55.529770Z","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:62193d25148d5f9bbb9a6e7ab64fa4061a44fe80091cfd194dffcbb903a818b8","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-08-16T18:33:45.535571Z","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-15T18:17:20.123085Z","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:ab79228455343ca3240141414e0008bdfd3e0f8167a3b26a3b6910c0a9419777","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-08-16T18:33:45.535571Z","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-14T22:35:11.759380Z","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:841656c89903d39ecb3a4e08ed89c3d8313cdd441e5ad26088c354f9a1b257ff","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-14T22:35:11.759380Z","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:6d3fbf6cef9e02cc3fdebbba05e38bc8e11c6b972b3d7c087eb2a29a67772814","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-08-16T18:33:45.535571Z","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-09T08:16:07.657842Z","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:f3d0d354d22d1c17a2bd97929e17b443d5130d2b18c70ad0120af66f1f3c80e9","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-08-16T18:33:45.535571Z","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-08-11T10:10:15.248500Z","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:3ee437b4bc3dc0a70bae652c989d9d517b5754c0cf60b3f57d5e12daa33c7924","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-10T21:34:05.286434Z","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:daba32a314ef1569209c933e1d97a01989e19bc80275df3a9ffd5e3876c52178","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-13T05:57:14.675241Z","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:ecd02b18fe8f90d2a74df636aaf03cc2503238278b512706289ac5527c58d7e6","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-12T23:12:29.874236Z","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:e9d6cb32f8da52823359f511c65673f6a9cc4188f1f64bf9f9ebd955554f237d","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-19T11:50:34.082381Z","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:04d8a3c91f280330d26c3c0e2485e9eead32606a955fa5c088b171be60431a9b","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-12T15:58:38.217749Z","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:343f3b840e897dccc966c9de1874a2a570f469261fb5eec10e67bb1f6ddddf35","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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:95133bdab76c3c9f1074d3e9ad1d56803469c7a0d6e783e118c85327c9d1d951","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-16T06:58:23.021208Z","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:382a1caa6d356fcfda8b7c1e97df5d081e41d8aabdab59da47ef0496c0951c6e","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-08-16T06:58:23.021208Z","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:bc19b67d58191a6153fe08b67ff68babe8ae4cf070ee1325c54640f7c9675535","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-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":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-14T11:59:02.790386Z","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:88dd934cc1a973c0a510ada062505ac06433769802e11f656053fa87acd9506d","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.02112","last_updated":"2021-04-11T21:04:26Z","snapshot_observed_at":"2026-08-16T18:33:45.535571Z","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-14T12:54:26.515463Z","title":"Efficient attentions for long document summarization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.13365","last_updated":"2026-08-13T15:31:01Z","snapshot_observed_at":"2026-08-17T17:08:33.314163Z","submitted_at":"2026-08-13T15:31:01Z","title":"When Local Variance Optimality Is Not Enough: RoPE-Aligned Q/K Rotations for Dynamic 4-Bit Quantisation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T12:54:26.515463Z"},"links":{"cited_paper":"/paper/2104.02112","citing_paper":"/paper/2608.13365"},"observation_digest":"sha256:4aa749cdec14562bb51c3de3c4fae56c00c814f830a302ce49cebe86ad400ab0","observation_id":"f16433bc-b32b-4c31-a56a-a5c617c6fc45","resolution":{"observed_at":"2026-08-14T12:54:26.515463Z","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-08-16T18:33:45.535571Z","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-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 0 of 0 outbound references and 29 inbound Pith citation observations for arXiv:2104.02112."}