{"_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_61700b7827412d455d3bf2bf83a74dc28473eccf4c52fe8290737bef05bd4710","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_61700b7827412d455d3bf2bf83a74dc28473eccf4c52fe8290737bef05bd4710","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"ec0ca617ce4174724674d2bda7b2b686e185cf31b0555d0548c4bb3daa3e9fbb","published":"Thu, 28 May 2026 00:00:00 -0400","receipt_hash":"ec0ca617ce4174724674d2bda7b2b686e185cf31b0555d0548c4bb3daa3e9fbb","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":"ec0ca617ce4174724674d2bda7b2b686e185cf31b0555d0548c4bb3daa3e9fbb","observed_at":"2026-05-28T04:43:38.862500Z","parent_run_hash":"58f8b4a134069e0a15ea3949252489597eb86dd27c9ca3fb15c6fb838ce49ef3","published":"Thu, 28 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:2605.28008v1 Announce Type: new \nAbstract: Large language models (LLMs) can now solve complex problems through long chain-of-thought (CoT) reasoning, but the trade-off between performance and token cost remains a central challenge. To address this issue, supervised fine-tuning (SFT) often uses compressed reasoning data, where CoT traces are shortened into compact forms. However, the effect of such compressed reasoning data on post-training remains poorly understood. In this paper, we propose a taxonomy of CoT consisting of Explicit CoT, which outputs all operations without aggregation, Composed CoT, which combines multiple operations into a single step, and Implicit CoT, which omits intermediate operations. We construct a synthetic compositional reasoning task that allows controlled variation of difficulty, compression granularity, and data size, and conducted a comprehensive set of experiments across different model families and sizes. Notably, we find that (i) coarser CoT requi","title":"Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training","url":"https://arxiv.org/abs/2605.28008","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.28008v1 Announce Type: new \nAbstract: Large language models (LLMs) can now solve complex problems through long chain-of-thought (CoT) reasoning, but the trade-off between performance and token cost remains a central challenge. To address this issue, supervised fine-tuning (SFT) often uses compressed reasoning data, where CoT traces are shortened into compact forms. However, the effect of such compressed reasoning data on post-training remains poorly understood. In this paper, we propose a taxonomy of CoT consisting of Explicit CoT, which outputs all operations without aggregation, Composed CoT, which combines multiple operations into a single step, and Implicit CoT, which omits intermediate operations. We construct a synthetic compositional reasoning task that allows controlled variation of difficulty, compression granularity, and data size, and conducted a comprehensive set of experiments across different model families and sizes. Notably, we find that (i) coarser CoT requi","title":"Zipping the Thought: When and How Compressed Reasoning Data Works in LLM Post-Training","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-28T04:43:38Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.28008"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:105d46a8509138194cc9e86c22355c1bf5baaec0e97be6dff2a9fd3a0ee6e376d2c74e0dab1576474cd932d99eccf9bdcdde320650c765149734904db0158907","signer":"crovia.substrate","subject":{"observed_at":"2026-05-28T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.28008"},"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":"4174eeb8f625b2867cc836a4034bc8ef88081c795563273220db3fca160f29f1","leaf_index":155627,"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":"bb798701c6c5729af85e427390ba677affa4593fcf092e73b794629f66eb8305","side":"left"},{"sibling":"369828bce1b675444c1cf79e0c7a03c81e4a441a5567d2d62ac65051d6fda550","side":"left"},{"sibling":"640a11f509c055e276ea8ea5e385e269163b9ad1736a32523e1aa24b92496c7e","side":"right"},{"sibling":"710937d7e0384b653d078ea4b08213a1f4b6136fde6516a4b219ed9241ab0a62","side":"left"},{"sibling":"d6435b91033fcf32b63286991723fdb5ad8961375d1fab4770414389b7e55a4e","side":"right"},{"sibling":"4f5c0bc0fe04bf8a303961caf66d14882049b75ce6cf00c515653227b2c64bfb","side":"left"},{"sibling":"7252c2f7874601f6b2d750e8a0aa6cc72c6924d6614fe237cd5c97d2026c5c17","side":"left"},{"sibling":"70e73f197ecea5d12ff2f9cf2ca33087110a782ea956c539b3058422ada4b2bd","side":"left"},{"sibling":"8c9c7b64ca041ef0029c35e402972d0bebed706fe997b9c587da6f5c811dcce1","side":"left"},{"sibling":"aa7a574eaea239ab8851da225206477d62a6ea5a15b65834f22d1c10288348e7","side":"left"},{"sibling":"7fcba2ee8232873e5d864902f28968d2be38867751c238f238f629eddb98b226","side":"left"},{"sibling":"816f233274bb10f5a122aac086a0c8c697b78fec67a4af55190bb596b7506fab","side":"left"},{"sibling":"d415e6939aee710631f5062799379b547d2c3e3d9a68f263bbb5a693285ab2ca","side":"left"},{"sibling":"d422d38e0ffe6e849b6ce3259d90c9d36497b4d7391a003e15591668c79028a7","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"7b6f0bea4291a5e63574dfca9aa0f9756f450c9478c3d07474d39a7ababb51f9","side":"right"},{"sibling":"1d39fe14b21e2ebbfb87e882423b24ee9469eae1e4c77af5b799ac4db9537467","side":"right"},{"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":156177,"merkle_root":"c5705a0243d16afd8b1ebfd731b7aa304079c442c2a7906493c5bbed374c69ec","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260528T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-28T05:37:36Z","sig_algorithm":"ed25519","signature":"f087e13febc8bb6a2e0812610de64cebc65be92915518d9c4b230799c3b161839b04c4eb1b02741f938f35545a76ab76555b04c782bdc2f9a44852d171d65909","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_61700b7827412d455d3bf2bf83a74dc28473eccf4c52fe8290737bef05bd4710"}}