{"_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_d73449a30cdf3f91a1f08a663f665ae0b92bdafdb4b075dfdb53da6caafc980d","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_d73449a30cdf3f91a1f08a663f665ae0b92bdafdb4b075dfdb53da6caafc980d","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"aade860eb04a325d1fd2d4681f3b8f87b0f04d5071f8fbef371d9d34670b398e","published":"Tue, 28 Jul 2026 00:00:00 -0400","receipt_hash":"aade860eb04a325d1fd2d4681f3b8f87b0f04d5071f8fbef371d9d34670b398e","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":"aade860eb04a325d1fd2d4681f3b8f87b0f04d5071f8fbef371d9d34670b398e","observed_at":"2026-07-28T04:43:08.282317Z","parent_run_hash":"23a1ef85134515049ced29518443d084afc46fd7c967741e6c6acdbdbbf29939","published":"Tue, 28 Jul 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:2607.22644v1 Announce Type: new \nAbstract: Real-world document classification pipelines typically apply the same sequence of models to every incoming document, regardless of its complexity or type. This leads to inefficient use of compute and human resources: simple documents are over-processed while difficult ones may not receive enough scrutiny. We introduce DocHRL, a hierarchical reinforcement learning framework that learns to adaptively and dynamically select the most cost-effective classification policy on a per-document basis. DocHRL formulates document classification as a sequential decision problem with a two-level policy hierarchy: a top-level policy selects among broad options (vision classifiers, LLMs, OCR, and human-in-the-loop review), while option-specific sub-policies choose the concrete model or tool to invoke. The reward signal is the negative total expected cost, which captures inference cost, cost of misclassification, and cost of human labelling. Trained with ","title":"DocHRL: A Hierarchical Reinforcement Learning Framework for Cost-Optimised Document Classification","url":"https://arxiv.org/abs/2607.22644","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.22644v1 Announce Type: new \nAbstract: Real-world document classification pipelines typically apply the same sequence of models to every incoming document, regardless of its complexity or type. This leads to inefficient use of compute and human resources: simple documents are over-processed while difficult ones may not receive enough scrutiny. We introduce DocHRL, a hierarchical reinforcement learning framework that learns to adaptively and dynamically select the most cost-effective classification policy on a per-document basis. DocHRL formulates document classification as a sequential decision problem with a two-level policy hierarchy: a top-level policy selects among broad options (vision classifiers, LLMs, OCR, and human-in-the-loop review), while option-specific sub-policies choose the concrete model or tool to invoke. The reward signal is the negative total expected cost, which captures inference cost, cost of misclassification, and cost of human labelling. Trained with ","title":"DocHRL: A Hierarchical Reinforcement Learning Framework for Cost-Optimised Document Classification","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-28T04:43:08Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.22644"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:8f053630691cc355cbb780b870b0ac3f381dd11077f93e40ca25c1fcd030c9db8b8daf8fbca5f45188747654e68fb3b873dfc98bd4a45c85097b044fb98a950f","signer":"crovia.substrate","subject":{"observed_at":"2026-07-28T04:43:08Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.22644"},"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":"0fa2af9ea686979d83248444951fa0d8c0fef13d519c5e8d1f64eeb3beda7407","leaf_index":360361,"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":"0afbc37b17268d6c6f5f9ec2ab35589573e1251fa280897de165c342c21857c9","side":"left"},{"sibling":"fa5d03bdd3d4852139b92a65bf706e462c6b4cbf6a6ecc39d516ea36dbf1cfae","side":"right"},{"sibling":"c380c851ef7fb7a6b1e24834f6fc0ab1b41e1a8dcfd52d9d1c92019a96dc994e","side":"right"},{"sibling":"1498e9c396911fac4bbc49e29b20ad4ff5dee5104e2281946b3130f016c14ace","side":"left"},{"sibling":"8e61571c2e7965fe958bf3041495b21b1c16f123f46afbf1db022c614f67130c","side":"right"},{"sibling":"2c87e5a910c5dcf9ab7bb899eaf82222f3503a24a3dea73c210014c194f6dd0a","side":"left"},{"sibling":"48dace931609a55569e4aa242be3eefac99c722b35aa9345c111116089b4e976","side":"right"},{"sibling":"ce393210d8cb9e0705a24ff80bd76d7becf22bfce1258f4a57fd2dbdca17218b","side":"left"},{"sibling":"8fe957ea378915d410087f8b2c41171bdfdac25ba34c42d93c5aaa835f32246c","side":"left"},{"sibling":"f57ebea8749a327b4323e9ad9c906a9400f5a5d8c83084dfc7d80be83bd44007","side":"left"},{"sibling":"4424ff61f20c9cef2251672611ec86369d87b1608ab089738930fd3d52e0dd54","side":"left"},{"sibling":"8db22b6d8b4004df8ccd40f648d9fd8a62f564821c80fbfd9c743849f4102e1b","side":"left"},{"sibling":"cff500acb83b14a8a7195a72d90dd4b7a6b8a28fc1069f8300b1191728718f90","side":"left"},{"sibling":"51ee2566d84aba54b9d07233fb460f9fab044b4edfa3fbe376fa1df0727acfa5","side":"left"},{"sibling":"f3e45bceed774d2402fa45d41ff5190f295823bd2f216eb90157884150034693","side":"left"},{"sibling":"2096cd69b54e283ddc45b26b63564a5e4c02f303ffd855b3b3533bcf26bc284d","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"3b50864499c874394ea0928567747666eaf59b01380e46cd52164ec5acec0f71","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","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":361008,"merkle_root":"3065e8369ea437c06beba806dc4e4bb159979adeb21fe632242c1906a7204647","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260728T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-28T05:38:48Z","sig_algorithm":"ed25519","signature":"9141644407577a82611c1579110f667de2d46dc6b93c6322edf26f4c3056ea99f0e56502853908e30d87c38bcf95eb6e0ab5130525aa51505bd6f61938120609","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_d73449a30cdf3f91a1f08a663f665ae0b92bdafdb4b075dfdb53da6caafc980d"}}