{"_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_8f40802b69ff59b60fca30255a5d320d81337df146cf8537d825ee3f085d4d17","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_8f40802b69ff59b60fca30255a5d320d81337df146cf8537d825ee3f085d4d17","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"9515f8656633630645621d52b4f6ec21a1f5d247bca8cc385966d6b92fe34fd7","published":"Mon, 01 Jun 2026 00:00:00 -0400","receipt_hash":"9515f8656633630645621d52b4f6ec21a1f5d247bca8cc385966d6b92fe34fd7","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":"9515f8656633630645621d52b4f6ec21a1f5d247bca8cc385966d6b92fe34fd7","observed_at":"2026-06-01T04:43:13.859018Z","parent_run_hash":"8993bbc535dae8c9669e099af3624cb39166b8d9bbfd66f26ae5c338cbb21be2","published":"Mon, 01 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:2605.31492v1 Announce Type: new \nAbstract: Large language models (LLMs) often solve reasoning problems by generating intermediate traces that explore and revise partial solutions. From a search perspective, these traces can be viewed as linearized search trees, where the model extends a partial solution, abandons it when it fails, and backtracks to try alternatives. Compared with traditional heuristic-guided search, such a policy has a potential advantage: it conditions on the whole search trace rather than only on the current local state. We first test whether LLMs utilize this advantage by comparing trace-conditioned reasoning policies against best-first search equipped with an LLM heuristic that only observes the current local state. Across three controlled reasoning environments, Blocks World, grid Navigation, and Sokoban, we find that raw access to search history alone is not enough to reliably outperform heuristic search. We then study one possible reason: in LLM reasoning ","title":"LinTree: Improving LLM Reasoning with Explicitly Structured Search Histories","url":"https://arxiv.org/abs/2605.31492","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.31492v1 Announce Type: new \nAbstract: Large language models (LLMs) often solve reasoning problems by generating intermediate traces that explore and revise partial solutions. From a search perspective, these traces can be viewed as linearized search trees, where the model extends a partial solution, abandons it when it fails, and backtracks to try alternatives. Compared with traditional heuristic-guided search, such a policy has a potential advantage: it conditions on the whole search trace rather than only on the current local state. We first test whether LLMs utilize this advantage by comparing trace-conditioned reasoning policies against best-first search equipped with an LLM heuristic that only observes the current local state. Across three controlled reasoning environments, Blocks World, grid Navigation, and Sokoban, we find that raw access to search history alone is not enough to reliably outperform heuristic search. We then study one possible reason: in LLM reasoning ","title":"LinTree: Improving LLM Reasoning with Explicitly Structured Search Histories","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-01T04:43:13Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.31492"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:e34629e9055281a54d5dd8c90b82828cd8e82e65faa923797b0425aafef50296c704e2fb42895adf57933db66d702415c2cafa008fa6395b6975686d2ade0e0e","signer":"crovia.substrate","subject":{"observed_at":"2026-06-01T04:43:13Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.31492"},"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":"10c2feaeb5310cfd54adc49bcee6450bce73c495e7076eb256a415813704c33c","leaf_index":163799,"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":"289444cfa42f48b634cc48248f0479214023da7907caadd100900ef69eec1f2b","side":"left"},{"sibling":"09bcb0c115ae865a82f5a94d2c13342db235daeb47c4bd40787025c9d0167560","side":"left"},{"sibling":"465cb42da191c9a8382ebe7d2607b8e9458be880af551951c69ee98623126de7","side":"left"},{"sibling":"73f9bee63561cad64c2ae8279b83212e566abf7b0deb34e6fc0708221c472c01","side":"right"},{"sibling":"0f045d7eb008cc10ba76bc5614093e37f652462a372fb95c81220ee5ffedad4d","side":"left"},{"sibling":"14a28c2982687dd26393e7e927addebf2d5a5101d99d05872284131df7a2f44a","side":"right"},{"sibling":"6f506d4e4c7fb170ea5ab20efffbcbb69464bf6db4cde5e90925fede53e31584","side":"left"},{"sibling":"764e4312cdb701ef8613acdc2311e1724d6a379f21c70c30ed832e7ede3d2d33","side":"left"},{"sibling":"5a0517e6c348bc5a70f1aef04c1415d23980c712e375838fff54dfa281f98760","side":"left"},{"sibling":"d6986f4b6a5bd07cba1de43f660d527af780ad1465d0f4af5f137bd514e95f7e","side":"left"},{"sibling":"aff54f89d4445cf32bb05b2ece532d190200cb92524489ddfa648b5cc36e21a4","side":"left"},{"sibling":"f028fad1771bff7dceff3a83baf90249f4eb410ebedfe92dda1bb2b89d7093c8","side":"left"},{"sibling":"59c6490072e8a1d357ece10bb08d7f449a3acbae58e130e3e7469cbea0314c65","side":"left"},{"sibling":"66331bac84ca0f8983eb09fac7eaf95af234f1b82680b793eabff4ee25caac40","side":"left"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"c9ac00eed8c475f1e525869bb329af03d052181b19ff8234edefe12f6ecec154","side":"right"},{"sibling":"ce41d9b82f34b16efd653dfb3552acc4e2512939e47903e5fc979fbed00c5764","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":164217,"merkle_root":"a1098816aea1b60b8fe37b62410469bc5024a2c335bbec4f6ef2add7875dbdf2","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260601T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-01T05:37:41Z","sig_algorithm":"ed25519","signature":"d7f91db1d54b9495c499440c2828f4bd53360555391ce6e25adea5183bc1fa0f697d80708a099d0b0429e6f8cb6c71e7fccf82acb3c84481149974fb26074708","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_8f40802b69ff59b60fca30255a5d320d81337df146cf8537d825ee3f085d4d17"}}