{"as_of":"2026-08-22T19:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8cc64a3b90acb2237b506eec00f21d98a759be507ba3c6dfb4390466e4f3606","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-02T13:41:14.943191Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.16213/citation-record","integrity":"/paper/2607.16213/integrity","json":"/paper/2607.16213/citation-record.json","paper":"/paper/2607.16213"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.209747Z","title":"Longbench: A bilingual, multitask benchmark for long context understanding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.209747Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:95336a6622839082970244c89f3715ca74e13ebb805997774f5a9316318df845","observation_id":"4ddb8403-48ff-4dda-b0d1-affb8e4e8467","resolution":{"observed_at":"2026-08-02T13:41:13.209747Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.302600Z","title":"Fu, et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.302600Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:348508120bf15cd2cbdd4b80a126dee64fba1ac306219da060532fc8d09bb3da","observation_id":"13086b78-df85-4b18-b8c0-cdfc426cae45","resolution":{"observed_at":"2026-08-02T13:41:13.302600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.470701Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.470701Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:c79225b25b6f38d0462eafa7290da0cce605dbc0a47cc17584c9de78c9c9c993","observation_id":"94ecb4e7-2f3a-4445-872f-9e74d2363ccb","resolution":{"observed_at":"2026-08-02T13:41:13.470701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.608935Z","title":"Diffrate: Differentiable compression rate for efficient vision transformers","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.608935Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:431abc7b222b69f9200482431a8aef7c7c478d796c340ffc1414d5ed976b47e4","observation_id":"c76fa2f0-3653-4940-bcd3-03591c473169","resolution":{"observed_at":"2026-08-02T13:41:13.608935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.771791Z","title":"Attention score is not all you need for token importance indicator in kv cache reduction: Value also matters","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.771791Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:f064b5aede747c7b3629178c289bf3905b653893ad3defbbb36f5af420368082","observation_id":"3712b03b-74e6-4869-b3d6-d7d003ba1d16","resolution":{"observed_at":"2026-08-02T13:41:13.771791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.884121Z","title":"Zipcache: Accurate and efficient kv cache quantization with salient token identification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.884121Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:cc39feb51e2b230c9829c17ce076b48316b6b00b6ab0c480003310968adace16","observation_id":"94f232a7-fa34-4b92-b924-0e05aac6e87c","resolution":{"observed_at":"2026-08-02T13:41:13.884121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:13.982069Z","title":"Snapkv: Llm knows what you are looking for before generation.Advances in Neural Information Processing Systems, 37:22947–22970, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:13.982069Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:629683b22700472a676a3da62778bda0ad6b122abb70cd9b473c8ce15012ebf9","observation_id":"96179e24-68ba-4cd2-addd-0b260f49312c","resolution":{"observed_at":"2026-08-02T13:41:13.982069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.105777Z","title":"Chunkkv: Semantic-preserving kv cache compression for efficient long-context llm inference.arXiv preprint arXiv:2502.00299, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.105777Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:cb373369a070720b8c1491998334bec765f695c0656043d9e61829b7be5aaffa","observation_id":"dbdda27f-c85c-4294-a543-b616f3e26e70","resolution":{"observed_at":"2026-08-02T13:41:14.105777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.217911Z","title":"Kivi: A tuning-free asymmetric 2bit quantization for kv cache","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.217911Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:45969f36047651969be0b9d49ee4d7973c95601a0daf93352fbf92d4edf5b58f","observation_id":"07a117ec-92ba-48bf-8993-4bb8b4a2be53","resolution":{"observed_at":"2026-08-02T13:41:14.217911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.369320Z","title":"Lava: Layer-wise kv cache eviction with dynamic budget allocation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.369320Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:48e9e98da82631664243fc43c30ff25396cabcfc429c61d09bbcdaa0333afa9f","observation_id":"821376e1-de73-44f6-ab69-3209c680b971","resolution":{"observed_at":"2026-08-02T13:41:14.369320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.533602Z","title":"Keepkv: Eliminating output perturbation in kv cache compression for efficient llms inference.arXiv, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.533602Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:ed9ffbfe77ec93dc48e53cd61ad57c8196fc66f6504e0eac2dd74c8a8d0e2f04","observation_id":"5767be33-4450-447c-a244-ddfd3e54a60a","resolution":{"observed_at":"2026-08-02T13:41:14.533602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.559159Z","title":"Look-m: Look-once optimization in kv cache for efficient multimodal long-context inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.559159Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:ff9aaea86ea3417fbe50456f873374f9266fefca0b609ca9cc9487b30c6b91a4","observation_id":"0aa3385f-b70b-4f5b-badb-a5172cf1cd28","resolution":{"observed_at":"2026-08-02T13:41:14.559159Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.563792Z","title":"D2o: Dynamic discriminative operations for efficient long-context inference of large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.563792Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:9d518bdabb119b466eaedae875b48f0d26c915222d70ddc9b20e6a52522b9189","observation_id":"1fa5edbe-e771-4ea0-a968-15a03391fdd9","resolution":{"observed_at":"2026-08-02T13:41:14.563792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.08454","last_updated":"2024-07-21T02:37:11Z","snapshot_observed_at":"2026-08-19T22:31:41.606680Z","submitted_at":"2024-07-11T12:50:42Z","title":"Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.08454","snapshot_observed_at":"2026-08-02T13:41:14.592412Z","title":"Model tells you where to merge: Adaptive kv cache merging for llms on long-context tasks.arXiv:2407.08454, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.592412Z"},"links":{"cited_paper":"/paper/2407.08454","citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:2697481c5a475f559d86fb7a4565f0f3f3a8baf6922d8f58fe1d94b447bb14c3","observation_id":"20f4bf9f-c2c4-407c-b717-ddafc6fdf7b1","resolution":{"observed_at":"2026-08-02T13:41:14.592412Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.642097Z","title":"Efficient streaming language models with attention sinks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.642097Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:62e4dd5ed881c078fca59f9e0484330ae5b71d593c7781e67b33f0b8db920af8","observation_id":"1248b30e-01d2-4d69-a5db-8cca5f56bc93","resolution":{"observed_at":"2026-08-02T13:41:14.642097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.721932Z","title":"Evolkv: Evolutionary kv cache compression for llm inference","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.721932Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:2ce8274ea288aa34ff109f01fe6c736d1939f6b790ce8ee0ace98bb840856c73","observation_id":"f8894808-f39f-4332-837d-5881805375b9","resolution":{"observed_at":"2026-08-02T13:41:14.721932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.801772Z","title":"Weightedkv: Attention scores weighted key-value cache merging for large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.801772Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:b89744c7831eae0abd8d97c6afb9e102779656d3ae692f39aac748cd2792542c","observation_id":"a3e3234b-415f-42da-a7a9-a8ec76d88ee5","resolution":{"observed_at":"2026-08-02T13:41:14.801772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.886026Z","title":"Ems: Adaptive evict-then-merge strategy for head-wise kv cache compression.arXiv, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.886026Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:0e34c6aa9e2defc7153b1c1f2b5c7f12088d2813243c4e0b2c63ecc8fed2d34e","observation_id":"43bcf879-3278-4f13-8c9d-b4c3f36ac0f4","resolution":{"observed_at":"2026-08-02T13:41:14.886026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T13:41:14.943191Z","title":"How is the ground truth for fake news established?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T13:41:14.943191Z"},"links":{"citing_paper":"/paper/2607.16213"},"observation_digest":"sha256:3c0feb84b2ff88328f96c611ea929757a35b7bfa1ac37ce4097642c2756b7f24","observation_id":"485124aa-59af-458f-9d4e-be4efd3c0ad7","resolution":{"observed_at":"2026-08-02T13:41:14.943191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.16213","last_updated":"2026-05-19T17:44:56Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-22T06:10:04.294638Z","submitted_at":"2026-05-19T17:44:56Z","title":"SelKV: Selective KV Cache Merging with Per-Token Merge-or-Drop and Attention Compensation"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":0},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2607.16213."}