{"_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_6c79ec32d6703189dbb058e1b7535ad033fbcdf8dcc43fce69867a730fadb35d","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_6c79ec32d6703189dbb058e1b7535ad033fbcdf8dcc43fce69867a730fadb35d","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"1a70f94dd1cff523a485c07353186d29603614d657ff5b801a75b2513a792fbe","published":"Wed, 17 Jun 2026 00:00:00 -0400","receipt_hash":"1a70f94dd1cff523a485c07353186d29603614d657ff5b801a75b2513a792fbe","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":"1a70f94dd1cff523a485c07353186d29603614d657ff5b801a75b2513a792fbe","observed_at":"2026-06-17T04:43:17.968423Z","parent_run_hash":"8f56c4deb22b28178ba7974d6ffc5ff17336d44c95dd94de80095705245fa113","published":"Wed, 17 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:2604.10827v2 Announce Type: replace \nAbstract: Compute scaling for LLM reasoning trades off exploring solution approaches (\\emph{breadth}) against refining promising ones (\\emph{depth}), yet why a given trade-off works, and why it often fails to transfer across models, remains unclear. We argue that \\textbf{the optimal strategy depends on the model's \\emph{diversity profile}, the spread of probability mass across solution approaches, and that this must be characterized before any exploration strategy is adopted.} We formalize this with a framework decomposing reasoning uncertainty, deriving when depth-based refinement outperforms parallel sampling, and validate it across three model families at both inference and training. Our central finding is that the diversity regime dictates the strategy: low-diversity aligned models benefit from depth-based refinement with lightweight intrinsic signals, whereas high-diversity base models are often harmed by it, and instead need breadth or s","title":"Know Thy Reasoner: Not All Language Models Explore Alike","url":"https://arxiv.org/abs/2604.10827","vendor":"arxiv_cs_ai"},"summary":"arXiv:2604.10827v2 Announce Type: replace \nAbstract: Compute scaling for LLM reasoning trades off exploring solution approaches (\\emph{breadth}) against refining promising ones (\\emph{depth}), yet why a given trade-off works, and why it often fails to transfer across models, remains unclear. We argue that \\textbf{the optimal strategy depends on the model's \\emph{diversity profile}, the spread of probability mass across solution approaches, and that this must be characterized before any exploration strategy is adopted.} We formalize this with a framework decomposing reasoning uncertainty, deriving when depth-based refinement outperforms parallel sampling, and validate it across three model families at both inference and training. Our central finding is that the diversity regime dictates the strategy: low-diversity aligned models benefit from depth-based refinement with lightweight intrinsic signals, whereas high-diversity base models are often harmed by it, and instead need breadth or s","title":"Know Thy Reasoner: Not All Language Models Explore Alike","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-17T04:43:17Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2604.10827"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:5ab1ab64c920f55c8c1f80b27fe3022c3cb5498b81a05e567d149e42cf1f33e1f2274a523f7ad94d13f4bd89ab12fb9d5b6d426ceb978a8488ccc5d41280cf05","signer":"crovia.substrate","subject":{"observed_at":"2026-06-17T04:43:17Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2604.10827"},"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":"47c1a22c33af91e5a0f63156d5d806933cf6a08f1fc33b84a1e325a59c316e7d","leaf_index":231069,"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":"b75c0836ac1237ebfe4ef65143e663d010f122333106bc21cb6ed30e9d6c2450","side":"left"},{"sibling":"14f3cce13ac80c91487d24eeea2aef3dc6d011050a5b19c75dfd5aa5e3a87a58","side":"right"},{"sibling":"e6b7ef1a0e52636702b057fd137c238ab4660c5a69fa84633f945bcf4ddfc4a0","side":"left"},{"sibling":"1133da7ef451d22fd87f0312957788a04fad16f4a1c1f328ab19bc47247a4d60","side":"left"},{"sibling":"2234be07dc5fa21ed57cc666f10ec27dc035bfdf70fb5e2ae4a7eb9f95d0d63c","side":"left"},{"sibling":"401a1630c5aad4a6d955e9bc3b7821e10456186bbec788f650aad24d13f92dba","side":"right"},{"sibling":"7a29e65cf9321ea3076f41dd24fefc9d208bf9f0637cc281244597fdc0ef6c90","side":"right"},{"sibling":"f9fc1f172b9aaac5635bc943e16d4e16badadc9ca81e3f68212276c41230e861","side":"left"},{"sibling":"ebbec9ce4bf43a3f5f71e2c07df4c91301abefa2da727a4d748099a74e980bc3","side":"right"},{"sibling":"1d74941c32baeab8cad08f8700cb49427d8256f231534f2a225b2bb3e84e4ff8","side":"left"},{"sibling":"d5b9f8b1a2c9f6a46e17982dfbe6ce1f3b5fa4e730220397f2253d114dcc8486","side":"left"},{"sibling":"d10d772a4984cae00e65ab24af21d1d260e475bbaae3f17871859eb705bd3999","side":"right"},{"sibling":"e79159853f2f35ddae8e3247d515e433c534277b287d65bbd77ae989aa4992fa","side":"right"},{"sibling":"3054319f1840cce0eaaf0bc4b1ae38e5bf8b6210927d924a750775cc7d77cca6","side":"right"},{"sibling":"0fd8b5059f279c4a4a6688de2472fdbc25543fee183df19b21dacca880354cff","side":"right"},{"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":232015,"merkle_root":"62bfb7809bb55667ad7eeebdb48267b9b2c1ee89bb808ea1e6d3a814a15aa402","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260617T133701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-17T13:39:59Z","sig_algorithm":"ed25519","signature":"930a3563c643cc7518d048b12a1f5392a96a5edce49533ba0a56f11b6cc69319bb1c800aacc46b52a6941c4d05dae255a45cac757d6093c971b96852c24f140e","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_6c79ec32d6703189dbb058e1b7535ad033fbcdf8dcc43fce69867a730fadb35d"}}