{"as_of":"2026-08-07T18:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:303844398a10ce81558a836d93631fcf9277eedaf59579472d6f3c3ba8cbe65b","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:17:13.042261Z","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-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T01:05:13.790381Z","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-04T15:59:57.348851Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"cited_work":{"arxiv_id":"2602.02599","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2602.02599","snapshot_observed_at":"2026-08-04T01:49:25.748849Z","title":"RAP: KV-cache compres- sion via RoPE-aligned pruning.arXiv preprint arXiv:2602.02599, 2026","venue":null,"work_id":"fee7da9a-f8d5-40c3-83e8-809d23bae501","year":2026},"citing_paper":{"arxiv_id":"2606.24033","last_updated":"2026-06-23T00:17:48Z","snapshot_observed_at":"2026-08-05T22:30:32.069600Z","submitted_at":"2026-06-23T00:17:48Z","title":"RoPE-Aware Bit Allocation for KV-Cache Quantization","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T01:05:13.790381Z"},"links":{"cited_paper":"/paper/2602.02599","citing_paper":"/paper/2606.24033"},"observation_digest":"sha256:3b351406cf4a9c35fb76be965034a478f1b08a3d506a7e21dbb18892eccc9081","observation_id":"0f2f05ee-48c8-46e0-88d7-269fad521b26","resolution":{"observed_at":"2026-08-04T01:49:25.748849Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.02599/citation-record","integrity":"/paper/2602.02599/integrity","json":"/paper/2602.02599/citation-record.json","paper":"/paper/2602.02599"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-04T06:17:10.992317Z","title":"L., Almeida, D., Altenschmidt, J., Altman, S., Anadkat, S., et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:10.992317Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:1dc98eb5db2f6f17ed03bbeeb959fbf05111e87794ed3ba08f218d17c995a52b","observation_id":"619a5c6d-9ef0-4542-bc72-94aa3d7e43c5","resolution":{"observed_at":"2026-08-04T06:17:10.992317Z","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-04T06:17:12.829264Z","title":"Complete Experimental Results This appendix provides complete tables and supplementary plots for all experiments","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.829264Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:946d7be1d4245ffe2d4cc63d2ef57965d0adae5e5de57bc401b53e80f026fa7e","observation_id":"c59c549f-9ce0-4507-8ffa-ffbf7cfbbd95","resolution":{"observed_at":"2026-08-04T06:17:12.829264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-04T06:17:11.275157Z","title":"E., and Cohan, A","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.275157Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:ba1a61ccd7ecceaf9390a669b8c38b28fed15bdb64db5143d763f100b1c48f6b","observation_id":"d43e52ac-0132-4936-8885-5cf052c05dd2","resolution":{"observed_at":"2026-08-04T06:17:11.275157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.17323","last_updated":"2023-03-22T13:10:47Z","snapshot_observed_at":"2026-08-07T08:38:54.025062Z","submitted_at":"2022-10-31T13:42:40Z","title":"GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.17323","snapshot_observed_at":"2026-08-04T06:17:11.401442Z","title":"Gptq: Accurate post-training quantization for generative pre- trained transformers.arXiv preprint arXiv:2210.17323,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.401442Z"},"links":{"cited_paper":"/paper/2210.17323","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:23d44d1998796ca236bf27f6a6ec097c1437ef44a0faed011006b2d332204113","observation_id":"33776003-4509-4955-953e-d1b60e744463","resolution":{"observed_at":"2026-08-04T06:17:11.401442Z","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-04T06:17:12.665509Z","title":"Proof of Theorem 5.1 Proof","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.665509Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:7757b842a64f2734520379436d8585d30350d964351da88f4b3711dc5229667f","observation_id":"fb174046-ee9e-4bd0-9ec9-62349e5b80c7","resolution":{"observed_at":"2026-08-04T06:17:12.665509Z","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-04T06:17:11.795737Z","title":"Ma, X., Fang, G., and Wang, X","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.795737Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:58c791e13c94384b7eee01f96a520823bdb2b8741797580ac8f4be2e9dbd5308","observation_id":"7512a4fc-0fed-4163-815b-b5eae1ce4957","resolution":{"observed_at":"2026-08-04T06:17:11.795737Z","resolver_source":null,"status":"malformed_identifier"},"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-04T06:17:11.902985Z","title":"Does quantization affect models’ perfor- mance on long-context tasks? In Christodoulopou- los, C., Chakraborty, T., Rose, C., and Peng, V","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.902985Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:28276592c384961f3893f5af027f1b6260d4423ac4c3dc2e02b56c6bcbd407f9","observation_id":"af1ca3cb-fe79-4c0f-886a-c75eb6d193e5","resolution":{"observed_at":"2026-08-04T06:17:11.902985Z","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-04T06:17:12.014905Z","title":"ISBN 979- 8-89176-332-6","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.014905Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:b7995946ba130be51631b3991d093cb466fea852f2bab6db274ed0bc5810da98","observation_id":"2789b135-fab1-4917-b5e0-d49fb2d1b720","resolution":{"observed_at":"2026-08-04T06:17:12.014905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00071","last_updated":"2026-02-06T19:40:50Z","snapshot_observed_at":"2026-08-01T02:15:47.181936Z","submitted_at":"2023-08-31T18:18:07Z","title":"YaRN: Efficient Context Window Extension of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00071","snapshot_observed_at":"2026-08-04T06:17:12.323290Z","title":"Peng, B., Quesnelle, J., Fan, H., and Shippole, E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.323290Z"},"links":{"cited_paper":"/paper/2309.00071","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:9b2d09ebe357a4295e3bdf9ac19e6feea803c6fa49b589521451c0710f5940bf","observation_id":"77dfa594-3baf-4fb0-a21d-29d786790e1c","resolution":{"observed_at":"2026-08-04T06:17:12.323290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-04T06:17:12.484770Z","title":"Llama: Open and efficient foundation lan- guage models.arXiv preprint arXiv:2302.13971,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.484770Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:97eac316b701f7dd49f61ddaf3470c94b4f3c8d831fe6fc16bc264597e0acd11","observation_id":"5bb88734-f62c-493e-aa6b-e1dcf3dfa57a","resolution":{"observed_at":"2026-08-04T06:17:12.484770Z","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-04T06:17:12.963873Z","title":null,"venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.963873Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:44ee47836847fa770f1cf557592490ea2c80c28f99fe3b91534413f973b2e10e","observation_id":"cbe1e3be-213c-4503-9e8f-eed5d032c06a","resolution":{"observed_at":"2026-08-04T06:17:12.963873Z","resolver_source":null,"status":"malformed_identifier"},"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-04T06:17:13.042261Z","title":null,"venue":null,"work_id":null,"year":2048},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:13.042261Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:c41c080636db54959df7961f6e7e5d0d35b045f261a5e705cccdf411346756f1","observation_id":"843a6fe6-352b-45ff-babe-12bb18ef33f1","resolution":{"observed_at":"2026-08-04T06:17:13.042261Z","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-04T06:17:12.150025Z","title":"emnlp-main.479/","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":479,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.150025Z"},"links":{"citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:3fc73b6c35ae2a11b2bb5aa87ca44f23049751830afa71a745d204a8adaf1e3e","observation_id":"61077fed-6461-4d8d-a47e-92cba7005c6e","resolution":{"observed_at":"2026-08-04T06:17:12.150025Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.16416","last_updated":"2026-05-21T10:32:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-22T09:05:01Z","title":"Circle-RoPE: Cone-like Decoupled Rotary Positional Embedding for Large Vision-Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.16416","snapshot_observed_at":"2026-08-04T06:17:12.549851Z","title":"Circle-rope: Cone-like decoupled rotary posi- tional embedding for large vision-language models.arXiv preprint arXiv:2505.16416, 2025a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:12.549851Z"},"links":{"cited_paper":"/paper/2505.16416","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:64c0903d66ef600d759de21fab6eef885c63d099f84f5cdeff73d4a04528c4dc","observation_id":"3fa80d22-adfc-48f5-88a0-06a3fa545159","resolution":{"observed_at":"2026-08-04T06:17:12.549851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.16609","last_updated":"2023-09-28T17:07:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-28T17:07:49Z","title":"Qwen Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.16609","snapshot_observed_at":"2026-08-04T06:17:11.134269Z","title":"Qwen technical report.arXiv preprint arXiv:2309.16609,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.134269Z"},"links":{"cited_paper":"/paper/2309.16609","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:e2c96196c7bb00238ebc26aee107bbe1261661ed9528126a6d77c01a6673de99","observation_id":"e4ff99a5-de0c-49f5-802b-f81cb5d25b8e","resolution":{"observed_at":"2026-08-04T06:17:11.134269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-04T06:17:11.555167Z","title":"Distilling the knowledge in a neural network.arXiv preprint arXiv:1503.02531,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.555167Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:3b95ffb97bb5c894dfc38cb22070b01d837cd885452d6cd5cd08e5ee388c3f74","observation_id":"4f330ee4-6039-4bed-aaef-ba9672b6802f","resolution":{"observed_at":"2026-08-04T06:17:11.555167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-04T06:17:11.657080Z","title":"Deepseek- v3 technical report.arXiv preprint arXiv:2412.19437, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","version":4},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T06:17:11.657080Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2602.02599"},"observation_digest":"sha256:aa7bbdf129547c6085f573e9239d02f8df725f2880d0fd6b18bdb8bddb4b626b","observation_id":"76414a5b-92eb-4d68-9bc3-599466e585fb","resolution":{"observed_at":"2026-08-04T06:17:11.657080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.02599","last_updated":"2026-07-30T16:56:40Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T00:16:47.374752Z","submitted_at":"2026-02-01T17:15:40Z","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2602.02599."}