{"_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_6a657dce4768ad3c3089cb4402428700e137c62a0bde8700a897a59b866e6c53","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_6a657dce4768ad3c3089cb4402428700e137c62a0bde8700a897a59b866e6c53","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"9d9617f2e8bdb499b40272b6fbcdc239570f805f94c5ff61386423e58efe20e4","published":"Mon, 11 May 2026 00:00:00 -0400","receipt_hash":"9d9617f2e8bdb499b40272b6fbcdc239570f805f94c5ff61386423e58efe20e4","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":"9d9617f2e8bdb499b40272b6fbcdc239570f805f94c5ff61386423e58efe20e4","observed_at":"2026-05-11T04:43:50.688999Z","parent_run_hash":"8244cc3d66edb4604be5ded19e92c0b47893b228a258432a9c53a5796a870982","published":"Mon, 11 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:2602.14868v2 Announce Type: replace-cross \nAbstract: Reinforcement learning has emerged as a powerful paradigm for unlocking reasoning capabilities in language models. However, relying on sparse rewards makes this process highly sample-inefficient, as models must navigate vast search spaces with minimal feedback. While classic curriculum learning aims to mitigate this by ordering data based on complexity, prior works have primarily targeted small datasets and do not directly transfer to the large-scale settings typical of modern LM training. Furthermore, the right ordering for a specific model is often unclear. To address this, we propose Goldilocks, a novel teacher-driven data sampling strategy that aims to predict each question's difficulty for the student model. The teacher model selects questions of appropriate difficulty for the student model, i.e., questions that are neither too easy nor too hard (Goldilocks principle), while training the student with GRPO. By leveraging th","title":"Goldilocks RL: Tuning Task Difficulty to Escape Sparse Rewards for Reasoning","url":"https://arxiv.org/abs/2602.14868","vendor":"arxiv_cs_ai"},"summary":"arXiv:2602.14868v2 Announce Type: replace-cross \nAbstract: Reinforcement learning has emerged as a powerful paradigm for unlocking reasoning capabilities in language models. However, relying on sparse rewards makes this process highly sample-inefficient, as models must navigate vast search spaces with minimal feedback. While classic curriculum learning aims to mitigate this by ordering data based on complexity, prior works have primarily targeted small datasets and do not directly transfer to the large-scale settings typical of modern LM training. Furthermore, the right ordering for a specific model is often unclear. To address this, we propose Goldilocks, a novel teacher-driven data sampling strategy that aims to predict each question's difficulty for the student model. The teacher model selects questions of appropriate difficulty for the student model, i.e., questions that are neither too easy nor too hard (Goldilocks principle), while training the student with GRPO. By leveraging th","title":"Goldilocks RL: Tuning Task Difficulty to Escape Sparse Rewards for Reasoning","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-11T04:43:50Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2602.14868"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:dc329aafc9ec2a07acfd78c2cc2c62cc62fc4550156e4c3709edaf37249ebb0949287140b12a8162b84bb771e671c2d777daa00c650a127ba2038416c59ed70d","signer":"crovia.substrate","subject":{"observed_at":"2026-05-11T04:43:50Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2602.14868"},"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":"bc848b8eaaa391eb866ca9ab70e8ca0d0787fd265f07767800c182c611d00c5c","leaf_index":126682,"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":"da8884dab0d373c246710eb7864792efbbe5258ae12148837de16b73ece1202e","side":"right"},{"sibling":"453cda9aefc174a92943e37860a167b1c786d2c53598d8dc11d752a6179979c1","side":"left"},{"sibling":"ce30e78381aa9e376087ccc5fdabf6f6e1aede201738c0f9b05ed81caa1bb864","side":"right"},{"sibling":"1f3ba596246842c56fb36165bcd6fd1bf70af874b118cea3a7a0bb5c2f94244a","side":"left"},{"sibling":"87aef4952391e7ba93f6aced2480fc6736fd2387eaa0593d95b507176a058950","side":"left"},{"sibling":"58aef9591856eb641810d1e156d62e1ae8389c7e9daea4da7a099e8ba39f5bcb","side":"right"},{"sibling":"c884a55932d4cceaac120743551423b0f7bfb9297f0d9ef494f83a195d0b3724","side":"left"},{"sibling":"8145236c073312ace1276c28162c95dcc0d2fd49b8c636293fac87efad823f12","side":"left"},{"sibling":"62d48549e4d4466089a57a96bd9bea15741d62a7cb314f0f9c37c4c22ac650fa","side":"right"},{"sibling":"a2c696699a233359c7b4b418ebd356db453d4b886f4bd076ef34b15ee86144a3","side":"left"},{"sibling":"1a581be91236d1f25e8d47fe5efa0e2b51b7f0f6d706ef76a9093067688e5d56","side":"left"},{"sibling":"878cc30108509c9fa1fc52705a216f519d73b647916fcbdfc30a389934d3364b","side":"left"},{"sibling":"ae7dfff36ba07d9f48c36c28a341482ef244ee13cd0efd49aee2bbef2fd65f87","side":"right"},{"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_6a657dce4768ad3c3089cb4402428700e137c62a0bde8700a897a59b866e6c53"}}