{"_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_7fd8b902f8e5dfe916784b999f598d68a8661f5f0660cb03ac38848e8c2e9957","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_7fd8b902f8e5dfe916784b999f598d68a8661f5f0660cb03ac38848e8c2e9957","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"acef4fb3fbc86ad962f9f6a56bf261b792557cde3e5d541d5b09b1072b1b57ac","published":"Wed, 01 Jul 2026 00:00:00 -0400","receipt_hash":"acef4fb3fbc86ad962f9f6a56bf261b792557cde3e5d541d5b09b1072b1b57ac","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":"acef4fb3fbc86ad962f9f6a56bf261b792557cde3e5d541d5b09b1072b1b57ac","observed_at":"2026-07-01T04:43:38.812993Z","parent_run_hash":"0e10ec7d671a375a4e18d8645653df2b4352c82fe16fae2a400af6f7634d6699","published":"Wed, 01 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:2606.31819v1 Announce Type: new \nAbstract: This work introduces a new computational theory of mind grounded in set theory and hyperdimensional computing. Whereas traditional neural networks rely on continuous weights and matrix multiplication, this framework works with sparse binary data. It represents information as discrete sets, directly modeling biological neural population codes. I demonstrate that associative memory emerges naturally from network topologies featuring a combinatorially expanded hidden layer. Learning is driven by topological plasticity rather than scalar weight adjustments. This architecture unifies auto-associative and hetero-associative learning under a single core algorithm: information retrieval via subset pattern matching and exact nearest-neighbor search. Operating with constant-time complexity, these mechanisms bridge perceptual data (sparse distributed representations) and symbols (sparse holographic representations) without continuous bottlenecks. M","title":"Creating Intelligence: A Computational Foundation for AGI","url":"https://arxiv.org/abs/2606.31819","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.31819v1 Announce Type: new \nAbstract: This work introduces a new computational theory of mind grounded in set theory and hyperdimensional computing. Whereas traditional neural networks rely on continuous weights and matrix multiplication, this framework works with sparse binary data. It represents information as discrete sets, directly modeling biological neural population codes. I demonstrate that associative memory emerges naturally from network topologies featuring a combinatorially expanded hidden layer. Learning is driven by topological plasticity rather than scalar weight adjustments. This architecture unifies auto-associative and hetero-associative learning under a single core algorithm: information retrieval via subset pattern matching and exact nearest-neighbor search. Operating with constant-time complexity, these mechanisms bridge perceptual data (sparse distributed representations) and symbols (sparse holographic representations) without continuous bottlenecks. M","title":"Creating Intelligence: A Computational Foundation for AGI","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-01T04: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/2606.31819"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:a52bef43813c84b50a34cbccd748da6fc02e5f1bee4437f8453df96c3e61344212030ee8917ee29c8dfa84df2c10ff8da0676a46bf506dd54a502d655f17bd05","signer":"crovia.substrate","subject":{"observed_at":"2026-07-01T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.31819"},"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":"a82ef23b84be771e1becfefab3b0a5e3dd7b8f2557ec0c85fa32f8fe50b40043","leaf_index":268461,"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":"4388f3236fe6a344f54d231fd11b87ac5f61c2a0166e403a37b753fe84a97110","side":"left"},{"sibling":"933b1567b5380c69d0d4682128a036368b7e605fd6361c15b32061bef2096b30","side":"right"},{"sibling":"dde81ed4447a7953fa04a1894bfc7e1c0bdbb7582947828cc0fddf945660f66c","side":"left"},{"sibling":"d251ef1d2e4eee5f61212be34e1fb8381c9dfcb13c026ec1e357a371b9d5745f","side":"left"},{"sibling":"8f707130fd584aad823af6e2e3680ffcd04cf2de05c48968957be8f7a9d0057d","side":"right"},{"sibling":"3c00badf09d79f6e2a56da4c892b05feabb66e4811f38b88f91194b15421132b","side":"left"},{"sibling":"5ed1e3f2d66ccf2bbb3d9d5c38b28cacec009dfcd5aa53798aeee2d1bd6d11c3","side":"right"},{"sibling":"373441c77391345a6bdd59f6d24909be6fec81e993e9a7050109db1522722b95","side":"left"},{"sibling":"25b5e7b84bfdaf7764d4179af698e218f4b2858d756d4fd6c30f7dc8f562c1b9","side":"right"},{"sibling":"bbd9a20451913e8c7b910f616d5661d9b281a94af70d201ba50b3112d429521b","side":"right"},{"sibling":"85af80e45748c1e0da1e2f42d9d66da8996016888a034f20eb17ff0a73b69eab","side":"right"},{"sibling":"4575fde969d1d9a2984cc01a37ac8441238f74527d42874272dc5582dadebb4f","side":"left"},{"sibling":"f536de281672cbf0b583a3dc46faef1de2823b72bd9265c7b60e889131cc268d","side":"left"},{"sibling":"95b8b0f67237052a17c41fa8cbdce2b79bcb5aeeba3fdb239d4c4497e598115d","side":"right"},{"sibling":"c2f351f771cee329448890504d9436792ba482e50250ca9a19289311131f96c8","side":"right"},{"sibling":"c39bfb2e911ca37ae997690bfc04128ae32e6806ee1cb3908781a7e6685022a0","side":"right"},{"sibling":"a101b4c60ef6854ac3d750eef02d8e2e06c153284b5ecb7111302f97eb129797","side":"right"},{"sibling":"eae2a3de5cb35455ad60125e196cfadaba8a590c53146e95028469f53f70349c","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":268860,"merkle_root":"d098f25810d0569730b6c0e170d57f329a70359d483b47874b5f2fc51d23de65","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260701T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-01T05:38:05Z","sig_algorithm":"ed25519","signature":"64f37f0e3df0556baa55b924a736cab8005643fa0ab65b503f22407de30eab293e6e0bd62904270fda38d05084bb350c8c0d0aadb2c5a6bae5f1c54598e6d30c","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_7fd8b902f8e5dfe916784b999f598d68a8661f5f0660cb03ac38848e8c2e9957"}}