{"_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_8a1a6bef50e163f6d36ac0de92fb451ee91e43761c8b9126b2bb9e4b2be77ca5","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_8a1a6bef50e163f6d36ac0de92fb451ee91e43761c8b9126b2bb9e4b2be77ca5","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"52495b84eb34c372d827ff250a03fabf5a4c13d2df11f90793bd94456e965e19","published":"Thu, 07 May 2026 00:00:00 -0400","receipt_hash":"52495b84eb34c372d827ff250a03fabf5a4c13d2df11f90793bd94456e965e19","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":"52495b84eb34c372d827ff250a03fabf5a4c13d2df11f90793bd94456e965e19","observed_at":"2026-05-07T04:43:30.601849Z","parent_run_hash":"b20b3beeadde500bb99eda3b869d50b00c5259b2c78c650d83e786ac81b85801","published":"Thu, 07 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:2605.03598v2 Announce Type: cross \nAbstract: Understanding how biological and artificial neural networks implement computation from connectivity is a central problem in neuroscience and machine learning. In neural systems, structural and functional connectivity are known to diverge, motivating approaches that move beyond direct connections alone. Here, we show that the spatial and temporal function of recurrent neural networks (RNNs) trained on hierarchically modular tasks can be recovered by modelling the network as a graph and analysing the multi-hop pathways between input and output units. In particular, decomposing these pathways by hop length reveals how the network temporally routes information. This perspective reframes regularisation: if function is implemented through multi-hop communication, then standard penalties such as L1 regularisation, which act only on individual weights, constrain single-hop structure rather than the multi-hop pathways that support computation. ","title":"Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks","url":"https://arxiv.org/abs/2605.03598","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.03598v2 Announce Type: cross \nAbstract: Understanding how biological and artificial neural networks implement computation from connectivity is a central problem in neuroscience and machine learning. In neural systems, structural and functional connectivity are known to diverge, motivating approaches that move beyond direct connections alone. Here, we show that the spatial and temporal function of recurrent neural networks (RNNs) trained on hierarchically modular tasks can be recovered by modelling the network as a graph and analysing the multi-hop pathways between input and output units. In particular, decomposing these pathways by hop length reveals how the network temporally routes information. This perspective reframes regularisation: if function is implemented through multi-hop communication, then standard penalties such as L1 regularisation, which act only on individual weights, constrain single-hop structure rather than the multi-hop pathways that support computation. ","title":"Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-07T04:43:30Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.03598"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:aed9181f9359ea859c169e7f47cbff6340f372d1b3b44fe150881d2901c6c6a1b99bf0576fa736448f60c230a5dc2e258a4df4210a07e48cd5f044be69cb5802","signer":"crovia.substrate","subject":{"observed_at":"2026-05-07T04:43:30Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.03598"},"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":"318b94121a9fdea339af93610ce4231ef51805d96f8a2095c564506a005fddf0","leaf_index":118310,"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":"0d59e3662a3ed1f63df0f90296b8399d897bd6ff58dd01789c37b208d6313d18","side":"right"},{"sibling":"4d3e403d202467f13cc1bd3e6e8dcbc8cf269f408e741f6677b507aae0bfe6ea","side":"left"},{"sibling":"f6202f1d67a6c6e3ef4798ebe727a5c3ff37b2b28d57589c7e299ef3a77cb8f8","side":"left"},{"sibling":"4f92ad532d7daa8d78f42d9c2f16c82dfb400beb5f2240c8559415e6555b10f1","side":"right"},{"sibling":"1fbf0dc03e29d32aeb6abbd001709518ce3a723e344e4689c465c9e52823e3f9","side":"right"},{"sibling":"d3f0f8f917cc535fdafd7262d7572083bec4ab99319b9cd45b1273fde8aa7e68","side":"left"},{"sibling":"d55c45c2d72a75c2e26965d5038dcc3795a5215a1352db031d11fa67366cc442","side":"right"},{"sibling":"432e5b2cf8e49f6f70fd5be7683dbbc02f1ebeff16b82fade70feaeeff078cab","side":"right"},{"sibling":"943780ddf0bc6538ed8b19cdb0e84ad78f5880f72d472b378c67229ade3fd90d","side":"right"},{"sibling":"9e688ad7df5f10379f7d9b9d109c3ea84968c044c36d5562f359706d012cf15b","side":"left"},{"sibling":"8e758a4477dfc0838d2e8ea2bdbd583bc3192683e75fd9cde217ee6a3b2f3ac8","side":"left"},{"sibling":"4219f746e463e594ccd6447debdf736a57e77319b12bcb74d8ece2b5860064c6","side":"left"},{"sibling":"05f89b32c00462e60adf95c1fe4579cdc2791b36e8b17573d8f3b5fd5da95a0b","side":"right"},{"sibling":"8ccd9937a2c0d5c04044d07d1557791b7d07bb31eac41a39a675608d44b38f23","side":"right"},{"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_8a1a6bef50e163f6d36ac0de92fb451ee91e43761c8b9126b2bb9e4b2be77ca5"}}