{"_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_d8c8dc51552e4603cd2dd2fc181038d2776de5a81489a12432347156691d7e7f","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_d8c8dc51552e4603cd2dd2fc181038d2776de5a81489a12432347156691d7e7f","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"d56b8bd539434b5846b5048b959965d4a1127303040917053c393536046d7894","published":"Mon, 20 Jul 2026 00:00:00 -0400","receipt_hash":"d56b8bd539434b5846b5048b959965d4a1127303040917053c393536046d7894","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":"d56b8bd539434b5846b5048b959965d4a1127303040917053c393536046d7894","observed_at":"2026-07-20T04:43:09.641409Z","parent_run_hash":"0fd83663f0f57da59b26313ca1a35283a3e9f06e3165d3e143d26f7174743aca","published":"Mon, 20 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.15459v1 Announce Type: new \nAbstract: A trained deep reinforcement learning policy is a black box, and we ask whether it can be made explainable by rewriting it as an executable logic program that reproduces its behaviour and that a person can read, a logic engine can run, and an optimizer can edit. We present a three-stage post-hoc transformation that extracts a frozen proximal policy optimization teacher, induces an ordered rule list from its decisions in the manner of classical relational learning, and emits the result as a Prolog program whose every decision is executed by an off-the-shelf logic engine; a subsequent expansion stage edits the rule base and accepts an edit only when policy evaluation certifies a return increase. We prove four guarantees. A return-loss bound makes the distilled program a machine-checkable certificate in a finite Markov decision process, and the expansion loop improves monotonically and terminates. For the continuous-observation setting we a","title":"From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems","url":"https://arxiv.org/abs/2607.15459","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.15459v1 Announce Type: new \nAbstract: A trained deep reinforcement learning policy is a black box, and we ask whether it can be made explainable by rewriting it as an executable logic program that reproduces its behaviour and that a person can read, a logic engine can run, and an optimizer can edit. We present a three-stage post-hoc transformation that extracts a frozen proximal policy optimization teacher, induces an ordered rule list from its decisions in the manner of classical relational learning, and emits the result as a Prolog program whose every decision is executed by an off-the-shelf logic engine; a subsequent expansion stage edits the rule base and accepts an edit only when policy evaluation certifies a return increase. We prove four guarantees. A return-loss bound makes the distilled program a machine-checkable certificate in a finite Markov decision process, and the expansion loop improves monotonically and terminates. For the continuous-observation setting we a","title":"From Black Box to Executable Logic: Explainable Reinforcement Learning through Prolog Expert Systems","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-20T04: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/2607.15459"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:e0f1e5ec6eca04a13f2fd2b192ac7e1b9529b3a630532fa91d8ac3833b2df81ab60f356c0fc24d9ecbf0875adab56d11b83fe4b7f4a3ee71e0b2f7be3e256b05","signer":"crovia.substrate","subject":{"observed_at":"2026-07-20T04:43:09Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.15459"},"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":"f6f99dbc9d0a4e409fc572a06d79d1522003f6dd36491bd13b0657f3a6ea8878","leaf_index":333235,"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":"e4c25a480cad00a90118bb40c080ad49f85f8edba765ee1c5c1b7a327bb6fa1e","side":"left"},{"sibling":"cfc96673f302f7cb4db37c58a5987878e2a7b03c15e07dafd0e2d84baae591c9","side":"left"},{"sibling":"9517d92edfe3f9195a0b94118f41042702dbc0fd59988ef745c993de8a58c1f0","side":"right"},{"sibling":"5eff4b48d9e05fe0c22ef70b31f7d570bcd981c93904d6000237080ffe6215d6","side":"right"},{"sibling":"bae2e69e6a658a964d8a226d03f74ee6d51af14bfefe5bdb9a28c13da8a34a2e","side":"left"},{"sibling":"c498ca63dfb4140aca826e9aa02081a1f160508f424a00f8754f668150a422b2","side":"left"},{"sibling":"1c1eae4bcf76cdef09630f53290dbde3bf8b1015085bf72726a6fb8f907bb8c8","side":"right"},{"sibling":"5e895feb6aeddb3dac892d493e1de271cf5bb255124626b8ae869ebb57ff0c74","side":"left"},{"sibling":"089fcaa13823a284a9c3064c9de337dded31410d6f89ef3761586a5e77c18ff1","side":"left"},{"sibling":"b0d667e95f8746ac275ad4169634f2e9442cd7e445099c6355bed5e0b9e27cbf","side":"right"},{"sibling":"dedd2da92d9447ddf1b1db68fe20109a426ed18359861ed746907ac820021a8d","side":"left"},{"sibling":"a1c43cc7cd9c775fac33940ee5124aece01596733f003fc53743f43483f9f597","side":"right"},{"sibling":"b5ad3eafd7eeb74c063261356fdd9bf6059ee6d0bf1e3c70e60731b394a5536e","side":"left"},{"sibling":"93e399d152203db688c6a5a58d25131205603504f5b79123a1f2b5a5ed9c1e54","side":"right"},{"sibling":"b6e0cad7f6eb9107f0edd276f1a9942635d8cd6d60d2a97e7daac08b110dc209","side":"right"},{"sibling":"80ec062e7e625dc3f9bb5865cb5198696bbec2608e48abae5670677b90695899","side":"right"},{"sibling":"77025bcb374a7ad74f520643e20a8ae1205a7ee78507b0beb93117760f1c29d3","side":"left"},{"sibling":"0aced6f0c9dec3e6cc9e89b68b70f5f8ce7e1eb13606d92db1917b76e57393c7","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":333540,"merkle_root":"ee60f62b8a724dd9bde638d638caf32cefec4440f832018b457ff47a0ec56a8c","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260720T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-20T05:38:36Z","sig_algorithm":"ed25519","signature":"82a3787e628bfab19c377d875220e1aaedfc498736c545f4708a1b887e8398afdf306995994493a36c864ff7139a2d436b905ce7081aaa540789aa4f707dc800","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_d8c8dc51552e4603cd2dd2fc181038d2776de5a81489a12432347156691d7e7f"}}