{"_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_af8a7bed59e70d258c39bd3662bd0f21f68842db09563c387304a7c166df4d57","bitcoin_anchor":{"bitcoin_attestations":["bitcoin_block_949451"],"calendar_attestations":["https://finney.calendar.eternitywall.com","https://btc.calendar.catallaxy.com","https://alice.btc.calendar.opentimestamps.org","https://bob.btc.calendar.opentimestamps.org"],"ots_url":"/registry/data/substrate/anchors/77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3.ots","stamped_at":"2026-05-15T03:00:03Z","status":"bitcoin"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_af8a7bed59e70d258c39bd3662bd0f21f68842db09563c387304a7c166df4d57","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"c9c80840cf9f0bb6e1e1b6d595ea5eaefb85fe546693f61ff20a3f1b81743836","published":"Tue, 12 May 2026 00:00:00 -0400","receipt_hash":"c9c80840cf9f0bb6e1e1b6d595ea5eaefb85fe546693f61ff20a3f1b81743836","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":"c9c80840cf9f0bb6e1e1b6d595ea5eaefb85fe546693f61ff20a3f1b81743836","observed_at":"2026-05-12T04:43:42.564879Z","parent_run_hash":"4cc5aca0c1b8116c9ab92405e0260204f01cf7ce2e49dea9d7e123236f5dc13b","published":"Tue, 12 May 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:2604.24938v2 Announce Type: replace-cross \nAbstract: Depth pruning improves the inference efficiency of large language models by removing Transformer blocks. Prior work has largely treated layer redundancy as an inherent structural property of pretrained networks, emphasizing importance criteria and search algorithms for identifying removable layers. In contrast, we adopt a \\emph{functional perspective}, where redundancy depends jointly on the model and the calibration objective, suggesting that a universal layer ranking may not exist. Through an empirical study across three LLM families, two calibration objectives, and seven search algorithms, we find that different objectives produce qualitatively different pruning patterns, while perplexity and downstream reasoning accuracy rankings often fail to align. In contrast, under a fixed objective, different search algorithms tend to converge to similar pruning solutions. Overall, our results suggest that the calibration objective may","title":"Rethinking Layer Redundancy in Large Language Models: Calibration Objectives and Search for Depth Pruning","url":"https://arxiv.org/abs/2604.24938","vendor":"arxiv_cs_ai"},"summary":"arXiv:2604.24938v2 Announce Type: replace-cross \nAbstract: Depth pruning improves the inference efficiency of large language models by removing Transformer blocks. Prior work has largely treated layer redundancy as an inherent structural property of pretrained networks, emphasizing importance criteria and search algorithms for identifying removable layers. In contrast, we adopt a \\emph{functional perspective}, where redundancy depends jointly on the model and the calibration objective, suggesting that a universal layer ranking may not exist. Through an empirical study across three LLM families, two calibration objectives, and seven search algorithms, we find that different objectives produce qualitatively different pruning patterns, while perplexity and downstream reasoning accuracy rankings often fail to align. In contrast, under a fixed objective, different search algorithms tend to converge to similar pruning solutions. Overall, our results suggest that the calibration objective may","title":"Rethinking Layer Redundancy in Large Language Models: Calibration Objectives and Search for Depth Pruning","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-12T04:43:42Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2604.24938"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:2fb504d99b7b7a237c060f275fae291c2aa2dc28e496c0616ea8793f5c5922bc5f31b9b651bfc75d1c821ec09633ab646eb985a1fe2d889162ce47f555e8ea07","signer":"crovia.substrate","subject":{"observed_at":"2026-05-12T04:43:42Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2604.24938"},"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":"90026746e8328eee66f5810797239445bf1a72dfeb9ca33511d51093d4a32628","leaf_index":129206,"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":"df6de7012573778661325552a7fdc5c03905afbad52fd8f004318e7e6a54547b","side":"right"},{"sibling":"a2f55503ed2dd7d0e37912465a8cb555c3eb94de3b9e5adf98973ee6451c5223","side":"left"},{"sibling":"d51d61612833074d9ff78986226182afd876fe718402bdea42d513d4dbd45ebb","side":"left"},{"sibling":"6eafb87c25ada26d90a0a74b34958fef512b49919b212fb31996c1d01c612e8b","side":"right"},{"sibling":"a88b94dea2af0ee0cec954f09068d6d95df5f3a5b2806f68ba8d1d34e533e0c5","side":"left"},{"sibling":"d64fe1d903643e8fc8de9d0cbc3750ad53407563e74a27a90e4aab522dcf724c","side":"left"},{"sibling":"f8bbf290dd1dc52ae72c42d03c2cdc00f8515b742ac137b342a67e7406e8c59b","side":"right"},{"sibling":"6cffd83b66fa63950542ea9b737e53228a66f295a7ebb44ea9155b70f279094c","side":"left"},{"sibling":"bb93634b6ea81ccfb7b9c5b023ffaff85acd8b3f1ec609973d847fd93873d3ec","side":"right"},{"sibling":"9922155d12ac3db561299f0abaec57fc59dd8e711d91cd590823abd8f3e4647f","side":"right"},{"sibling":"9c71dae5b380aff58527385ccecc23b4cd8ff36395d4fc35ad5236b00fcb6db8","side":"right"},{"sibling":"d32d0a951c1d7e98a8e1951a587d83c97962daeeaa455643bc1d5d53744dc21e","side":"left"},{"sibling":"ffc4d51379293bc3e1910c7d612f409dc610fd9acf8241793fb89f82e1bad4ef","side":"left"},{"sibling":"62ac6554017807bd83187f5a3e5f4f72d6c482616429c2780e9fff1f4845fa04","side":"left"},{"sibling":"3a5e69cf0803f4c91f3895ed7c9a95748fef240bec4422e167c05300f79f06c0","side":"left"},{"sibling":"f2817ab288b5324fe49770372c7a10f33f7cd11005f8d4c0a730316f5229dc98","side":"left"},{"sibling":"725fac972e772ca0dc598810ea1abc70df472f72d2d6ab8a0baee2b80e5d2f4c","side":"left"},{"sibling":"98fc57dfef8873b512edc8340f7181df57302bb96777625e072235c62d7c5895","side":"right"}]},"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":134292,"merkle_root":"77fc9c28fae777b81da5b495b3115474df6592dfac590333213d3bdf8b94a9b3","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260515T023701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-15T02:37:25Z","sig_algorithm":"ed25519","signature":"68107a834b00b24f5d4501e5ec727445311f132a486567ecc4c72a4e6dff24c8c21f2de3105293353ba5fdbe370d032819af6aa70f694e2e39b6af6737507009","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_af8a7bed59e70d258c39bd3662bd0f21f68842db09563c387304a7c166df4d57"}}