{"_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_9888964f84dc908e86768ec61c63bccf76c417a0a00358d9cc6d7764bf15efe7","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_9888964f84dc908e86768ec61c63bccf76c417a0a00358d9cc6d7764bf15efe7","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"1d7a98c821578997455a819a9a39a335009fc205b92b6582c8764a68531272f8","published":"Mon, 15 Jun 2026 00:00:00 -0400","receipt_hash":"1d7a98c821578997455a819a9a39a335009fc205b92b6582c8764a68531272f8","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":"1d7a98c821578997455a819a9a39a335009fc205b92b6582c8764a68531272f8","observed_at":"2026-06-15T04:43:09.998079Z","parent_run_hash":"ded7a5fa7968821af82d6d8d24b2c1f7e7d776433180609016edbdee95e78c1a","published":"Mon, 15 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:2602.14169v2 Announce Type: replace-cross \nAbstract: Effective exploration is a key challenge in reinforcement learning for large language models: discovering high-quality trajectories within a limited sampling budget from the vast natural language sequence space. Existing methods face notable limitations: GRPO samples exclusively from the root, saturating high-probability trajectories while leaving deep, error-prone states under-explored. Tree-based methods blindly disperse budgets across trivial or unrecoverable states, causing sampling dilution that fails to uncover rare correct suffixes and destabilizes local baselines. To address this, we propose Deep Dense Exploration (DDE), a strategy that focuses exploration on $\\textit{pivots}$-deep, recoverable states within unsuccessful trajectories. We instantiate DDE with DEEP-GRPO, which introduces three key innovations: (1) a lightweight data-driven utility function that automatically balances recoverability and depth bias to ident","title":"Deep Dense Exploration for LLM Reinforcement Learning via Pivot-Driven Resampling","url":"https://arxiv.org/abs/2602.14169","vendor":"arxiv_cs_ai"},"summary":"arXiv:2602.14169v2 Announce Type: replace-cross \nAbstract: Effective exploration is a key challenge in reinforcement learning for large language models: discovering high-quality trajectories within a limited sampling budget from the vast natural language sequence space. Existing methods face notable limitations: GRPO samples exclusively from the root, saturating high-probability trajectories while leaving deep, error-prone states under-explored. Tree-based methods blindly disperse budgets across trivial or unrecoverable states, causing sampling dilution that fails to uncover rare correct suffixes and destabilizes local baselines. To address this, we propose Deep Dense Exploration (DDE), a strategy that focuses exploration on $\\textit{pivots}$-deep, recoverable states within unsuccessful trajectories. We instantiate DDE with DEEP-GRPO, which introduces three key innovations: (1) a lightweight data-driven utility function that automatically balances recoverability and depth bias to ident","title":"Deep Dense Exploration for LLM Reinforcement Learning via Pivot-Driven Resampling","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-15T04:43:09Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2602.14169"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:707b84f9b05fb0807fb6404b360e823f7b015b65d41bcda7e8adb76630e1cc64e5db156ed838bd5e6501cba5bd140ee7d0a1686d1906e3105727f11053937e0e","signer":"crovia.substrate","subject":{"observed_at":"2026-06-15T04:43:09Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2602.14169"},"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":"e9fafa207ceb8d4245f6810f63876f87bf9bfb20b80d7da969731abc13c25caf","leaf_index":230141,"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":"6582e0ac71c8eb795582f579790ada783b6de1757385115a43d07de8bd4950e5","side":"left"},{"sibling":"3ddab49bd98dafb274f3e56d89a63379cc62736ebaa141fb2f212e478e245d07","side":"right"},{"sibling":"cf74bf3eb926d074f9953a566ccdf995da61c6a0eb8b8f8980a31d4f77e55dea","side":"left"},{"sibling":"31a5a53d9f16054806e8337a930671e1e969f1cce55a1caac01db2095c7b5e39","side":"left"},{"sibling":"f26a1561ec58919aeac8b893d24ac57ae03b868946158aaea19258595de7ae5d","side":"left"},{"sibling":"eef6ef787004702e69474576ff5127f1879ce40059a7232f768f384445723ff1","side":"left"},{"sibling":"777fc65e1d77be32b2c8951245c948dfc18781d8f5bfe13e83f1975313bc571c","side":"left"},{"sibling":"4facde6857295772880043256429f729859e11968ea6221d9fa688e71b3a2184","side":"left"},{"sibling":"14c50c43949e1ad41f149ffea691627d3f715c5861766c693b9fbac9d03b0d90","side":"right"},{"sibling":"74897e850164dddc689c3c65b33f9bae0268ab0bf429867a4e193d9b9b685040","side":"left"},{"sibling":"bde25d7e94e64717e426a97f6fcb4907e92b5c61fc89d92d7e0947a2249c3f6b","side":"right"},{"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_9888964f84dc908e86768ec61c63bccf76c417a0a00358d9cc6d7764bf15efe7"}}