{"_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_069ed83181893b67a535773cc4292c7aed0a2438567c312c42d6f836c1af0536","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_069ed83181893b67a535773cc4292c7aed0a2438567c312c42d6f836c1af0536","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"8aa7c93db0aa33e56317b25f8ecbf5b0ef6fba52a54f5d1224381a48305ba0a8","published":"Fri, 03 Jul 2026 00:00:00 -0400","receipt_hash":"8aa7c93db0aa33e56317b25f8ecbf5b0ef6fba52a54f5d1224381a48305ba0a8","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":"8aa7c93db0aa33e56317b25f8ecbf5b0ef6fba52a54f5d1224381a48305ba0a8","observed_at":"2026-07-03T04:43:38.241623Z","parent_run_hash":"f0e30469786257a5e74170498cacb4c028623bf32d6d06d4dbadc488960545be","published":"Fri, 03 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.01741v1 Announce Type: cross \nAbstract: Reinforcement Learning (RL) is a sequential decision-making framework in which an agent learns optimal policies through interaction with an environment by maximizing cumulative rewards. Among RL methods, Bayesian Reinforcement Learning (BRL) addresses common practical challenges related to data scarcity by leveraging prior knowledge about the environment and sequential belief updates. However, most BRL approaches require an explicit likelihood function, which is frequently inaccessible or intractable in real-world settings.\n  We propose Likelihood-Free Iterated Batch Importance Sampling (LF-IBIS), a novel algorithm for BRL that updates the agent's beliefs online as new interactions become available. By combining Approximate Bayesian Computation with Iterated Batch Importance Sampling, LF-IBIS enables full Bayesian inference in settings where the environment dynamics are not described by an explicit or tractable likelihood. The method y","title":"Full Bayesian Reinforcement Learning via LF-IBIS","url":"https://arxiv.org/abs/2607.01741","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.01741v1 Announce Type: cross \nAbstract: Reinforcement Learning (RL) is a sequential decision-making framework in which an agent learns optimal policies through interaction with an environment by maximizing cumulative rewards. Among RL methods, Bayesian Reinforcement Learning (BRL) addresses common practical challenges related to data scarcity by leveraging prior knowledge about the environment and sequential belief updates. However, most BRL approaches require an explicit likelihood function, which is frequently inaccessible or intractable in real-world settings.\n  We propose Likelihood-Free Iterated Batch Importance Sampling (LF-IBIS), a novel algorithm for BRL that updates the agent's beliefs online as new interactions become available. By combining Approximate Bayesian Computation with Iterated Batch Importance Sampling, LF-IBIS enables full Bayesian inference in settings where the environment dynamics are not described by an explicit or tractable likelihood. The method y","title":"Full Bayesian Reinforcement Learning via LF-IBIS","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-03T04:43:38Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.01741"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:4a54c8f0c4757cffacf8df1311db160781397e17f5ed42f9d8cf811a393a88ab4230ba374ea96bb6dfcf8237e8fe3cb681ee5432a9a6fc2c57455cea5b430207","signer":"crovia.substrate","subject":{"observed_at":"2026-07-03T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.01741"},"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":"1a6798c298ebd06da3d3f6bc13356e558d45f125b3d381430436b0b8010192f0","leaf_index":275478,"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":"8d288088bf88d8e4e88e4565aa34ee5f5ebd9fad5af27c066cd4fef22f189e56","side":"right"},{"sibling":"850d2c5220b59d044f851171a3dd790d4e56518a6e207c03b9b2c09d62059e84","side":"left"},{"sibling":"a48c93cd4b9ca708d88c33a837b9dff318cfb93bea55d26f2bfbc70c358b1511","side":"left"},{"sibling":"a8672d7eabfc89d72c72645ae560903c29caf5b5064ac1bac30949370d5fe961","side":"right"},{"sibling":"1c27d34d1e2923fdd90fcee8bb54cce96a39a35fea5135fa7ad04e18c62a1de3","side":"left"},{"sibling":"b3b863c9974ca5cbe5ac1a7f2fad35e6058ddd19556b26290b86de0ec5078396","side":"right"},{"sibling":"2284ba9d3dd74b37a7d6fc2e010bfb5c1b41ccf53af38b7b3ace1fe0776fd6a5","side":"right"},{"sibling":"5e5c8e8db37d5481fef0ead807ae94ad0195c7ae0cf92622f52c3dec100a7e16","side":"right"},{"sibling":"da9343635b180d3ddf07636b2a7814fcbf809adc1979958fa092ef6d16ef0db5","side":"right"},{"sibling":"1685b068d9bba0447845c97429c2a9ba728526abe2dc9d9522fed7b13d6620e4","side":"right"},{"sibling":"cf1e47b22a12b71fda307cbe1b98bc247fa4226ac8691ca8d99e6cc72a905b34","side":"left"},{"sibling":"4dbd8247ba08a5432c7d6540711da9acb2f59e6189865aa8552dee37f69286a9","side":"right"},{"sibling":"41cd1885dc3fcb51e49eeb887d6d22ec2cfa58df0e4f8d7c7dddf3a1b0ce8249","side":"left"},{"sibling":"8a09562f6b247c1c3cd1fea36cb3b8f1cf5c575479dd514573856a380a964bf5","side":"left"},{"sibling":"723981908169653ca6d835aa9b8381a8c7ad3e3e3830d0792bc32032cda615ee","side":"right"},{"sibling":"c0594fa1ee81d5f019cccc7b5e51af603c6d7e43995498c451012060c7d06165","side":"right"},{"sibling":"4de6a2fb22efbb50c84dc62abeb0f2cbc8c663a9540aeba9e758ebfdfe3e86dd","side":"right"},{"sibling":"fdbb3519f8dc411a4043dfb5abdbfea5441e130326183ac2247c42584033f152","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":275799,"merkle_root":"2581d0d6e5fa345cdf2e8ab3b191ace76d6b14189901ab0e4c2291ca1d1ae1e6","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260703T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-03T05:38:09Z","sig_algorithm":"ed25519","signature":"e44a386a5ae00c0e7fc67b1179bb9060bf0fefc006e454fec70e27668182ff497d1e2faf0c3b22de0917beefb7c80e880dae925a3f67e1b16aa0eb44bf947407","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_069ed83181893b67a535773cc4292c7aed0a2438567c312c42d6f836c1af0536"}}