{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_a9cff73a300536e4ed739e9393c2adf86d2c7ccd49e801103372ddbc97b56d0d","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_a9cff73a300536e4ed739e9393c2adf86d2c7ccd49e801103372ddbc97b56d0d","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"728e4f50f02d98584643c2629c4880c0f5077bd47049f5ad70f82f996c60c9ab","published":"Mon, 29 Jun 2026 00:00:00 -0400","receipt_hash":"728e4f50f02d98584643c2629c4880c0f5077bd47049f5ad70f82f996c60c9ab","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"728e4f50f02d98584643c2629c4880c0f5077bd47049f5ad70f82f996c60c9ab","observed_at":"2026-06-29T04:44:03.414425Z","parent_run_hash":"36b5ab5c57ae76dc9e1a863501c4d38f172868cfae31b4ba5baf3caffaafb2c4","published":"Mon, 29 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2502.16886v4 Announce Type: replace-cross \nAbstract: To reduce memory consumption during LLM inference, a handful of methods have been proposed for KV cache pruning. While these techniques can accomplish lossless memory reduction on many datasets, they often hinge on an under-emphasized condition: an input/domain-specific threshold for KV cache budget needs to be pre-determined to achieve the optimal performance. However, such input-sensitive design may be considerably limited in real-world scenarios, as open-domain inputs span diverse domains, lengths and difficulty levels, without clear boundaries for threshold selection. As a result, the dependence of such input-sensitive threshold can be a fundamental limitation that causes large degradation on arbitrary inputs. In this work, we propose a new objective that lifts the threshold constraints for robust KV compression, advocating for \"threshold-free\" methods that adaptively adjust budget allocation while preserving full-cache per","title":"ReFreeKV: Towards Threshold-Free KV Cache Compression","url":"https://arxiv.org/abs/2502.16886","vendor":"arxiv_cs_ai"},"summary":"arXiv:2502.16886v4 Announce Type: replace-cross \nAbstract: To reduce memory consumption during LLM inference, a handful of methods have been proposed for KV cache pruning. While these techniques can accomplish lossless memory reduction on many datasets, they often hinge on an under-emphasized condition: an input/domain-specific threshold for KV cache budget needs to be pre-determined to achieve the optimal performance. However, such input-sensitive design may be considerably limited in real-world scenarios, as open-domain inputs span diverse domains, lengths and difficulty levels, without clear boundaries for threshold selection. As a result, the dependence of such input-sensitive threshold can be a fundamental limitation that causes large degradation on arbitrary inputs. In this work, we propose a new objective that lifts the threshold constraints for robust KV compression, advocating for \"threshold-free\" methods that adaptively adjust budget allocation while preserving full-cache per","title":"ReFreeKV: Towards Threshold-Free KV Cache Compression","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-29T04:44:03Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2502.16886"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:0fc7e17d3a3a39944b28227cf4a8c23e2c5f65b01b71dd2501de0c68459bf4b1f77cb9207f31670ee80a6355bbb51439c63c49e0f8b68ea515e6801e852a4605","signer":"crovia.substrate","subject":{"observed_at":"2026-06-29T04:44:03Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2502.16886"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"93f230e939c7a0b2a84daa7512702b82adf21d38c3ef341d1f40690e09a84245","leaf_index":261481,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"a93737f872e0349534454573fa6c2a137c0a3ebeb80d8e11adce8f312f8fa3d1","side":"left"},{"sibling":"8edc38d96b66ad82ec43a7e9b947ba3f37244e23a195159b7edcc7efdace22d3","side":"right"},{"sibling":"95ec0384548b45856915ce0fbe44349a3225ef079a26cbd47bb2055af7068fbb","side":"right"},{"sibling":"6edc5ddf8a69acd1e474f45b0b987fe40fec02e25943352f14b0e86a870b482f","side":"left"},{"sibling":"a9ef5951395912d4e4ab98ada1ce829b4d047259ccc45c6a8d9271b4b25f91ea","side":"right"},{"sibling":"d6cf72c7d9c886efcdcf4e7b5f7c8e925e8e0ea6de18ceb8d47544007b92130a","side":"left"},{"sibling":"a600c67ab28d0232fe4727e4641fc665bde749779b50edf849b1a9c8287bc809","side":"left"},{"sibling":"4b4bda5fa1fb23989b8f6f192c36dadc8266c378c69d42945af35c9d6ab81a10","side":"right"},{"sibling":"6d1df65d14253ed3a13c03e25aa9adcd9a091d8062a82e8586bcaee74013b90e","side":"left"},{"sibling":"9f9daa9d12e65b219f34c92aec45450536b79a42b8892050d66961432ae28ed1","side":"right"},{"sibling":"b5725d7b0807dc6da32d9788f20057fa8726be38d30a9ebdabc605ae92739122","side":"left"},{"sibling":"e321b2cac14cbe28f76ccb7938249a40ff60cd5d2128b5634be046ea10e984b8","side":"left"},{"sibling":"5900dc6c7d13855af9d0385baf1691ec386df33e450c422af1cabe0a36e40ad8","side":"left"},{"sibling":"ae636ddee98c71ab7a7dc55ddfab70c7f710a2b6abfdf7a8b5d16a4017d1c0d1","side":"left"},{"sibling":"f29798d8bb6aa9900eab878992d9ff0c53266debd87472f31ab26a6a3fb55880","side":"left"},{"sibling":"a04392fb9f2a3a620840e3b3fecd93d12e6d224e481c162389d8ae64e7194599","side":"left"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":261662,"merkle_root":"aa8865c239aa2eb6c8aa7c6250f56b3cd5709854a8a07f6a29eb4ddd8802cb6f","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260629T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-29T05:38:02Z","sig_algorithm":"ed25519","signature":"476329233e82fb35fba2552ddc5d1d75b2bdd8513bbd281e9c40a0b8e475df374a62dcd8b456b0c5e8815984f5b4bf0983ae95d2cf4d7412ebb13a433b933c0a","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_a9cff73a300536e4ed739e9393c2adf86d2c7ccd49e801103372ddbc97b56d0d"}}