{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VJAH75QSESYAYAT5N7M3YXPYYD","short_pith_number":"pith:VJAH75QS","canonical_record":{"source":{"id":"2602.10238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T19:34:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1b89f3b3ed46f747d0c9267565474b280dd2e42026cd9c650c98781702f83880","abstract_canon_sha256":"abe7916928050c861c07d9702d445db923bbaece126744021d0da2820c830c48"},"schema_version":"1.0"},"canonical_sha256":"aa407ff61224b00c027d6fd9bc5df8c0d85c5e2b0ccd81c7872d5d01837ef41b","source":{"kind":"arxiv","id":"2602.10238","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10238","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10238v2","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10238","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"VJAH75QSESYA","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"VJAH75QSESYAYAT5","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"VJAH75QS","created_at":"2026-06-29T01:14:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VJAH75QSESYAYAT5N7M3YXPYYD","target":"record","payload":{"canonical_record":{"source":{"id":"2602.10238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T19:34:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1b89f3b3ed46f747d0c9267565474b280dd2e42026cd9c650c98781702f83880","abstract_canon_sha256":"abe7916928050c861c07d9702d445db923bbaece126744021d0da2820c830c48"},"schema_version":"1.0"},"canonical_sha256":"aa407ff61224b00c027d6fd9bc5df8c0d85c5e2b0ccd81c7872d5d01837ef41b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:28.827449Z","signature_b64":"X5guVQoziU5Ja4bzN3j327JqK5//D0LTjMNB9jLKEAto6IYcCNfBAsb2cSuE5SMWaLTclS+8HuhiIzbi8nmfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa407ff61224b00c027d6fd9bc5df8c0d85c5e2b0ccd81c7872d5d01837ef41b","last_reissued_at":"2026-06-29T01:14:28.826900Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:28.826900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.10238","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3d/SqXLPcY2YZ1bjYor3IlIHVJFC839frZ9nMtMjbRmWKKEl4uOYySZNu+PR9AfhYO0e0yaDExVSHB/kQ/J6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:52:57.523650Z"},"content_sha256":"0d45b17b1873bf4a30577b0c7a6c7453596301dfff742ac77e4b396d4295f762","schema_version":"1.0","event_id":"sha256:0d45b17b1873bf4a30577b0c7a6c7453596301dfff742ac77e4b396d4295f762"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VJAH75QSESYAYAT5N7M3YXPYYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Evict from Key-Value Cache","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Laura Manduchi, Luca Moschella, Ozan Sener","submitted_at":"2026-02-10T19:34:15Z","abstract_excerpt":"The growing size of Large Language Models (LLMs) makes efficient inference challenging, primarily due to the memory demands of the autoregressive Key-Value (KV) cache. Existing eviction or compression methods reduce cost but rely on heuristics, such as recency or past attention scores, which serve only as indirect proxies for a token's future utility and introduce computational overhead. We reframe KV cache eviction as a reinforcement learning (RL) problem: learning to rank tokens by their predicted usefulness for future decoding. To this end, we introduce KV Policy (KVP), a framework of light"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.10238","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.10238/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-29T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8NJxhC/aQshBzoCtkqyJ3thq/8e74ktPoDbj3aNUjvjICwrsOWs4dbBjbcl8WCOiCwNutKqkg8c1es+1MEGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T19:52:57.524175Z"},"content_sha256":"4ca837d898fd2d9578b40677a9096613ad31728ab777fd347679a15284b12434","schema_version":"1.0","event_id":"sha256:4ca837d898fd2d9578b40677a9096613ad31728ab777fd347679a15284b12434"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJAH75QSESYAYAT5N7M3YXPYYD/bundle.json","state_url":"https://pith.science/pith/VJAH75QSESYAYAT5N7M3YXPYYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJAH75QSESYAYAT5N7M3YXPYYD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T19:52:57Z","links":{"resolver":"https://pith.science/pith/VJAH75QSESYAYAT5N7M3YXPYYD","bundle":"https://pith.science/pith/VJAH75QSESYAYAT5N7M3YXPYYD/bundle.json","state":"https://pith.science/pith/VJAH75QSESYAYAT5N7M3YXPYYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJAH75QSESYAYAT5N7M3YXPYYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VJAH75QSESYAYAT5N7M3YXPYYD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"abe7916928050c861c07d9702d445db923bbaece126744021d0da2820c830c48","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T19:34:15Z","title_canon_sha256":"1b89f3b3ed46f747d0c9267565474b280dd2e42026cd9c650c98781702f83880"},"schema_version":"1.0","source":{"id":"2602.10238","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.10238","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"2602.10238v2","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.10238","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"VJAH75QSESYA","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_16","alias_value":"VJAH75QSESYAYAT5","created_at":"2026-06-29T01:14:28Z"},{"alias_kind":"pith_short_8","alias_value":"VJAH75QS","created_at":"2026-06-29T01:14:28Z"}],"graph_snapshots":[{"event_id":"sha256:4ca837d898fd2d9578b40677a9096613ad31728ab777fd347679a15284b12434","target":"graph","created_at":"2026-06-29T01:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.10238/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The growing size of Large Language Models (LLMs) makes efficient inference challenging, primarily due to the memory demands of the autoregressive Key-Value (KV) cache. Existing eviction or compression methods reduce cost but rely on heuristics, such as recency or past attention scores, which serve only as indirect proxies for a token's future utility and introduce computational overhead. We reframe KV cache eviction as a reinforcement learning (RL) problem: learning to rank tokens by their predicted usefulness for future decoding. To this end, we introduce KV Policy (KVP), a framework of light","authors_text":"Laura Manduchi, Luca Moschella, Ozan Sener","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T19:34:15Z","title":"Learning to Evict from Key-Value Cache"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.10238","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d45b17b1873bf4a30577b0c7a6c7453596301dfff742ac77e4b396d4295f762","target":"record","created_at":"2026-06-29T01:14:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"abe7916928050c861c07d9702d445db923bbaece126744021d0da2820c830c48","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-02-10T19:34:15Z","title_canon_sha256":"1b89f3b3ed46f747d0c9267565474b280dd2e42026cd9c650c98781702f83880"},"schema_version":"1.0","source":{"id":"2602.10238","kind":"arxiv","version":2}},"canonical_sha256":"aa407ff61224b00c027d6fd9bc5df8c0d85c5e2b0ccd81c7872d5d01837ef41b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa407ff61224b00c027d6fd9bc5df8c0d85c5e2b0ccd81c7872d5d01837ef41b","first_computed_at":"2026-06-29T01:14:28.826900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-29T01:14:28.826900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5guVQoziU5Ja4bzN3j327JqK5//D0LTjMNB9jLKEAto6IYcCNfBAsb2cSuE5SMWaLTclS+8HuhiIzbi8nmfAA==","signature_status":"signed_v1","signed_at":"2026-06-29T01:14:28.827449Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.10238","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d45b17b1873bf4a30577b0c7a6c7453596301dfff742ac77e4b396d4295f762","sha256:4ca837d898fd2d9578b40677a9096613ad31728ab777fd347679a15284b12434"],"state_sha256":"bf5ed6a1fc2486963b61f2c9c549a6913f6584752c762de941a160cb4afb67df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"06dBwqu5nFQbdsvv0BvB+KbkLJqlbRimaYlizukWO5cnijHewRgDXS33AfZVo3MLuFDJZ8Z8W2Uq2U045dc8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T19:52:57.529243Z","bundle_sha256":"367c1f37e206bddfc45b7261a5b592ca38007cd2f01f1780fa02c0b3973a80fe"}}