{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KUGDU2PML3VCUWVMQCRU5MVJ7U","short_pith_number":"pith:KUGDU2PM","canonical_record":{"source":{"id":"2509.00388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-30T06:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"7eab36e51a70855298173edf7aa651017ce3e027820dfb3ad5b2a00e606daacc","abstract_canon_sha256":"f91bbe2d8ba6aa04bfbc630bb20ea523090785c96d977ccc2da9efcd04ea4184"},"schema_version":"1.0"},"canonical_sha256":"550c3a69ec5eea2a5aac80a34eb2a9fd0871ba6985019b681a9d932cc46cd2ff","source":{"kind":"arxiv","id":"2509.00388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00388","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00388v1","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00388","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"KUGDU2PML3VC","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_16","alias_value":"KUGDU2PML3VCUWVM","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_8","alias_value":"KUGDU2PM","created_at":"2026-07-05T12:02:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KUGDU2PML3VCUWVMQCRU5MVJ7U","target":"record","payload":{"canonical_record":{"source":{"id":"2509.00388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-30T06:56:28Z","cross_cats_sorted":[],"title_canon_sha256":"7eab36e51a70855298173edf7aa651017ce3e027820dfb3ad5b2a00e606daacc","abstract_canon_sha256":"f91bbe2d8ba6aa04bfbc630bb20ea523090785c96d977ccc2da9efcd04ea4184"},"schema_version":"1.0"},"canonical_sha256":"550c3a69ec5eea2a5aac80a34eb2a9fd0871ba6985019b681a9d932cc46cd2ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:15.289344Z","signature_b64":"4QEl2d/bCH9wlkm+xA6V9kS0k91U8mAfC/cb5YVXbUPkPhBivw6iqSxi38EKM7CfukejmwIAT9KYncCMtyroCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"550c3a69ec5eea2a5aac80a34eb2a9fd0871ba6985019b681a9d932cc46cd2ff","last_reissued_at":"2026-07-05T12:02:15.288820Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:15.288820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.00388","source_version":1,"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-07-05T12:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTPciNcSrX+ulsDGeYOsK5KR/EtVhGiLOE/5ipTUPIoVApqxX6QlNnvOckn3pRWF6gsL+DG3Ky54hLDI/ry+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:02:53.027984Z"},"content_sha256":"84dd42cfe8362aa5be3e1bb8a4c9b67d0ed5f1ed8b01d17963acc1e587ff6d0e","schema_version":"1.0","event_id":"sha256:84dd42cfe8362aa5be3e1bb8a4c9b67d0ed5f1ed8b01d17963acc1e587ff6d0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KUGDU2PML3VCUWVMQCRU5MVJ7U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphKV: Breaking the Static Selection Paradigm with Graph-Based KV Cache Eviction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Linfeng Zhang, Xiangqi Jin, Xuelin Li","submitted_at":"2025-08-30T06:56:28Z","abstract_excerpt":"Efficient Key-Value (KV) cache management is essential for processing long text sequences in large language models (LLMs), where memory constraints often limit performance. Conventional KV eviction strategies, such as top-k selection based on attention scores, depend on static heuristics that fail to capture the evolving implicit dependencies among tokens during inference. To overcome this, we propose GraphKV, a graph-based framework that redefines token selection for KV cache compression. In GraphKV, tokens are modeled as nodes with importance scores, and edges represent their similarity rela"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00388","kind":"arxiv","version":1},"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/2509.00388/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-07-05T12:02:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKdb/1M3+AY1XW0HrBzZeh7h8bgrRAf5fXYaB6lR7ASOfceZHpSUtQ3sPdIi0ahVl3fQ7w2EECWssOrE+J6MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:02:53.030153Z"},"content_sha256":"6f95fb84ff3b1ed0e35734689ce2838c155555ea9726a650f190dea2ece4ac91","schema_version":"1.0","event_id":"sha256:6f95fb84ff3b1ed0e35734689ce2838c155555ea9726a650f190dea2ece4ac91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/bundle.json","state_url":"https://pith.science/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/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-07T01:02:53Z","links":{"resolver":"https://pith.science/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U","bundle":"https://pith.science/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/bundle.json","state":"https://pith.science/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUGDU2PML3VCUWVMQCRU5MVJ7U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KUGDU2PML3VCUWVMQCRU5MVJ7U","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":"f91bbe2d8ba6aa04bfbc630bb20ea523090785c96d977ccc2da9efcd04ea4184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-30T06:56:28Z","title_canon_sha256":"7eab36e51a70855298173edf7aa651017ce3e027820dfb3ad5b2a00e606daacc"},"schema_version":"1.0","source":{"id":"2509.00388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.00388","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"arxiv_version","alias_value":"2509.00388v1","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00388","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_12","alias_value":"KUGDU2PML3VC","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_16","alias_value":"KUGDU2PML3VCUWVM","created_at":"2026-07-05T12:02:15Z"},{"alias_kind":"pith_short_8","alias_value":"KUGDU2PM","created_at":"2026-07-05T12:02:15Z"}],"graph_snapshots":[{"event_id":"sha256:6f95fb84ff3b1ed0e35734689ce2838c155555ea9726a650f190dea2ece4ac91","target":"graph","created_at":"2026-07-05T12:02:15Z","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/2509.00388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient Key-Value (KV) cache management is essential for processing long text sequences in large language models (LLMs), where memory constraints often limit performance. Conventional KV eviction strategies, such as top-k selection based on attention scores, depend on static heuristics that fail to capture the evolving implicit dependencies among tokens during inference. To overcome this, we propose GraphKV, a graph-based framework that redefines token selection for KV cache compression. In GraphKV, tokens are modeled as nodes with importance scores, and edges represent their similarity rela","authors_text":"Linfeng Zhang, Xiangqi Jin, Xuelin Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-30T06:56:28Z","title":"GraphKV: Breaking the Static Selection Paradigm with Graph-Based KV Cache Eviction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00388","kind":"arxiv","version":1},"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:84dd42cfe8362aa5be3e1bb8a4c9b67d0ed5f1ed8b01d17963acc1e587ff6d0e","target":"record","created_at":"2026-07-05T12:02:15Z","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":"f91bbe2d8ba6aa04bfbc630bb20ea523090785c96d977ccc2da9efcd04ea4184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-08-30T06:56:28Z","title_canon_sha256":"7eab36e51a70855298173edf7aa651017ce3e027820dfb3ad5b2a00e606daacc"},"schema_version":"1.0","source":{"id":"2509.00388","kind":"arxiv","version":1}},"canonical_sha256":"550c3a69ec5eea2a5aac80a34eb2a9fd0871ba6985019b681a9d932cc46cd2ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550c3a69ec5eea2a5aac80a34eb2a9fd0871ba6985019b681a9d932cc46cd2ff","first_computed_at":"2026-07-05T12:02:15.288820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:15.288820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4QEl2d/bCH9wlkm+xA6V9kS0k91U8mAfC/cb5YVXbUPkPhBivw6iqSxi38EKM7CfukejmwIAT9KYncCMtyroCg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:15.289344Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.00388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84dd42cfe8362aa5be3e1bb8a4c9b67d0ed5f1ed8b01d17963acc1e587ff6d0e","sha256:6f95fb84ff3b1ed0e35734689ce2838c155555ea9726a650f190dea2ece4ac91"],"state_sha256":"3d8e475cc7c800bee068de5b10dab9135d9caa5d0b1c5d5544cf38f0583148a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHLNM+Q4fQnYRII9f1BbTq5YZ9CjgrCNA7/VhQkIT/foQ/PMG1P1/wVDHGZ6CzzoFGWCP0NYJhCjNl+gMfg9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:02:53.039788Z","bundle_sha256":"f3edfd73fa4d9f1d745fbd81b4c893963aa97ffaf7ee52e4c0dc97a42c8fb062"}}