{"_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_5545ada673d6a17a5cf2a3e04782ed9cb93836c1818f459fd1fa57f8478e2a8d","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_5545ada673d6a17a5cf2a3e04782ed9cb93836c1818f459fd1fa57f8478e2a8d","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"fb3eeab313a06b1671b7b7b5f321c8f853490f6f7f0348a0b704d5094d86ea36","published":"Mon, 01 Jun 2026 00:00:00 -0400","receipt_hash":"fb3eeab313a06b1671b7b7b5f321c8f853490f6f7f0348a0b704d5094d86ea36","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":"fb3eeab313a06b1671b7b7b5f321c8f853490f6f7f0348a0b704d5094d86ea36","observed_at":"2026-06-01T04:43:13.859018Z","parent_run_hash":"8993bbc535dae8c9669e099af3624cb39166b8d9bbfd66f26ae5c338cbb21be2","published":"Mon, 01 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:2605.30372v1 Announce Type: cross \nAbstract: Reservoir computing, a type of recurrent neural network, is a promising approach for temporal learning as it separates dynamic processing from the trained readout layer. However, classical Echo State Networks (ESNs) often require task-specific tuning of their architecture and hyperparameters to achieve good performance. This paper introduces EARLY (Evolutionary Algorithm for Reservoir Learning and Yielding), a framework designed to evolve both the topology and hyperparameters of multi-reservoir ESNs. Inspired by the modular organisation of the brain, EARLY encodes architectures as graph-based genomes and applies crossover, mutation, and selection to discover effective configurations. Our goal is to create both generic architectures and tasks inducing generalization. The method is evaluated on temporal learning tasks from the CogScale dataset. Results show that evolved architectures outperform those obtained with random search on severa","title":"Evolutionary Algorithm for Reservoir Learning and Yielding","url":"https://arxiv.org/abs/2605.30372","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.30372v1 Announce Type: cross \nAbstract: Reservoir computing, a type of recurrent neural network, is a promising approach for temporal learning as it separates dynamic processing from the trained readout layer. However, classical Echo State Networks (ESNs) often require task-specific tuning of their architecture and hyperparameters to achieve good performance. This paper introduces EARLY (Evolutionary Algorithm for Reservoir Learning and Yielding), a framework designed to evolve both the topology and hyperparameters of multi-reservoir ESNs. Inspired by the modular organisation of the brain, EARLY encodes architectures as graph-based genomes and applies crossover, mutation, and selection to discover effective configurations. Our goal is to create both generic architectures and tasks inducing generalization. The method is evaluated on temporal learning tasks from the CogScale dataset. Results show that evolved architectures outperform those obtained with random search on severa","title":"Evolutionary Algorithm for Reservoir Learning and Yielding","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-01T04:43:13Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.30372"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:75e31d0e579953f78f0f4e28103de62960183d2f605c9bca28e4f777c7305f71fd5437caf27c82dc0a26c0341d72c29cf2d53deb0e696914b98534dd344baf00","signer":"crovia.substrate","subject":{"observed_at":"2026-06-01T04:43:13Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.30372"},"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":"0dfe6b73286e36b258e6024c6ce1c4dc92300ad3b20370ae295a113d72b8b372","leaf_index":163810,"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":"6cbd52fb08a2a8c73c17b6175a84347128c203c089d1f24c19f79c086d320ae6","side":"right"},{"sibling":"7e1b01bfec9238bb013129947268b028ec4da02f58c1fb751c5ae1f5b17948e3","side":"left"},{"sibling":"c469f3ffb16c1ec81b99b6f71ec3b8c6f84622c9d13b368535b317dcd905b117","side":"right"},{"sibling":"96730c35bf6345ca2761f414df87ff15305c5168bbbf85cc4d8548f7b7099fff","side":"right"},{"sibling":"903174d245dc01cd2537dc636a47d819fa98f914cbb6e16a2a09b68208cf3a1e","side":"right"},{"sibling":"a8f314233e57d9b2e1f73a238db7bf336c4b3b1673499ca02aeae9337c8cb49b","side":"left"},{"sibling":"6f506d4e4c7fb170ea5ab20efffbcbb69464bf6db4cde5e90925fede53e31584","side":"left"},{"sibling":"764e4312cdb701ef8613acdc2311e1724d6a379f21c70c30ed832e7ede3d2d33","side":"left"},{"sibling":"5a0517e6c348bc5a70f1aef04c1415d23980c712e375838fff54dfa281f98760","side":"left"},{"sibling":"d6986f4b6a5bd07cba1de43f660d527af780ad1465d0f4af5f137bd514e95f7e","side":"left"},{"sibling":"aff54f89d4445cf32bb05b2ece532d190200cb92524489ddfa648b5cc36e21a4","side":"left"},{"sibling":"f028fad1771bff7dceff3a83baf90249f4eb410ebedfe92dda1bb2b89d7093c8","side":"left"},{"sibling":"59c6490072e8a1d357ece10bb08d7f449a3acbae58e130e3e7469cbea0314c65","side":"left"},{"sibling":"66331bac84ca0f8983eb09fac7eaf95af234f1b82680b793eabff4ee25caac40","side":"left"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"c9ac00eed8c475f1e525869bb329af03d052181b19ff8234edefe12f6ecec154","side":"right"},{"sibling":"ce41d9b82f34b16efd653dfb3552acc4e2512939e47903e5fc979fbed00c5764","side":"right"},{"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":164217,"merkle_root":"a1098816aea1b60b8fe37b62410469bc5024a2c335bbec4f6ef2add7875dbdf2","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260601T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-01T05:37:41Z","sig_algorithm":"ed25519","signature":"d7f91db1d54b9495c499440c2828f4bd53360555391ce6e25adea5183bc1fa0f697d80708a099d0b0429e6f8cb6c71e7fccf82acb3c84481149974fb26074708","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_5545ada673d6a17a5cf2a3e04782ed9cb93836c1818f459fd1fa57f8478e2a8d"}}