{"_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_085e143f09c16561438e8a4c56cb97c99cf938ef83049cd18b9c1f734bf75c16","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_085e143f09c16561438e8a4c56cb97c99cf938ef83049cd18b9c1f734bf75c16","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"9bd3553a9d0371f5db620163ac1adccaffa5b2b1582ebc037a4e5ba98258ec17","published":"Mon, 13 Jul 2026 00:00:00 -0400","receipt_hash":"9bd3553a9d0371f5db620163ac1adccaffa5b2b1582ebc037a4e5ba98258ec17","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":"9bd3553a9d0371f5db620163ac1adccaffa5b2b1582ebc037a4e5ba98258ec17","observed_at":"2026-07-13T04:43:08.394955Z","parent_run_hash":"900c1c934245e788564e199a9619f2dc36ec91d9804ddd9c6a40fb42c8a1e1c0","published":"Mon, 13 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.09399v1 Announce Type: cross \nAbstract: We introduce a novel method for both partial and full optimization of the connections in deep differentiable logic gate networks (LGNs) and lookup table networks (LUTNs). Our training method utilizes a probability distribution over a set of connections per gate/lookup table (LUT) input pin, selecting the connection with highest merit, all whilst the optimal gate types or LUT-entries are learned in parallel. We show that the connection-optimized LGNs outperform standard fixed-connection LGNs on the Yin-Yang, MNIST Handwritten Digits and Fashion-MNIST benchmarks, while requiring only a fraction of the number of logic gates. We achieve 98.92% on the MNIST dataset with two layers of 8000 gates. With only one layer of 8000 gates, we obtain 98.45%, showing that our method requires almost 50 times fewer gates compared to fixed-connection LGNs. Training stability up to ten layers has been ensured by employing a high learning rate, straight-thr","title":"Fully Trainable Deep Differentiable Logic Gate Networks and Lookup Table Networks","url":"https://arxiv.org/abs/2607.09399","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.09399v1 Announce Type: cross \nAbstract: We introduce a novel method for both partial and full optimization of the connections in deep differentiable logic gate networks (LGNs) and lookup table networks (LUTNs). Our training method utilizes a probability distribution over a set of connections per gate/lookup table (LUT) input pin, selecting the connection with highest merit, all whilst the optimal gate types or LUT-entries are learned in parallel. We show that the connection-optimized LGNs outperform standard fixed-connection LGNs on the Yin-Yang, MNIST Handwritten Digits and Fashion-MNIST benchmarks, while requiring only a fraction of the number of logic gates. We achieve 98.92% on the MNIST dataset with two layers of 8000 gates. With only one layer of 8000 gates, we obtain 98.45%, showing that our method requires almost 50 times fewer gates compared to fixed-connection LGNs. Training stability up to ten layers has been ensured by employing a high learning rate, straight-thr","title":"Fully Trainable Deep Differentiable Logic Gate Networks and Lookup Table Networks","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-13T04:43:08Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.09399"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:7c539b0ba1ead7c2af86457a166c078f47e954a80fc1a90a318cf6783a7883bfa589aba75d3cb5fb9dcbb4f4dd43763c81f4b22209dec331b2a7c281c566bd09","signer":"crovia.substrate","subject":{"observed_at":"2026-07-13T04:43:08Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.09399"},"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":"d26e30353aab7fa9d1d30550d03d7b4c4f6db80dcba879c204945c925dcf166a","leaf_index":309660,"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":"969c64138edadb706f95a340dffcc6bb468ef930449e289b9fcc155db412e63b","side":"right"},{"sibling":"7952f3a96d34e371a79127119352a0cc20c88c9bbd7a03567e8f6c6806cf3bf8","side":"right"},{"sibling":"0f5933eb29e0519d6f81d6f8186104b4fc11404c384194d0e69033bd93a411e0","side":"left"},{"sibling":"b4890c05e5e578d5c3ab2791ac14125ca5207332b7c50ff8ce25d9dbe574b679","side":"left"},{"sibling":"0c72e63c44aed89a0f2188ce241659deac11d44e317606d3cb9dd66d0ac9d1d0","side":"left"},{"sibling":"4d51e1b0f0229ea0b2702f90a284e81ff7e5975b8389142e45bb23a7285bcf53","side":"right"},{"sibling":"a06f2db4ff89b8806c463205a6d957aa0950263fff991c2aa1386688c611457f","side":"right"},{"sibling":"49f7764de5dea797b32547b8437f6d371cde9fb33ac6cf784651dcfa196b149a","side":"left"},{"sibling":"6cbb0c4695e74fa8ec17dfde89fa56c1958a1d4dffbbcbe3556da4a69c699ebc","side":"left"},{"sibling":"c4bde3283be97905033d39c1097ac73b82f180de8830384fe6f9f1933f7fa4b9","side":"right"},{"sibling":"3b5f968ebea87e7be458ef7e63c6637988d27ba6d170e1f3794d385cd76ca23f","side":"right"},{"sibling":"5ed534e945b31085c140b50460415e7960b76a4b6266da67d272b853dc94b352","side":"left"},{"sibling":"91010b271bc8eb5253b3549292ef3146e1d85bc9bac7ca36e0862f1204f84e8d","side":"left"},{"sibling":"772fbc112e94d8e574379343387c65503d3cf8fb16ff89090174eccced871a41","side":"left"},{"sibling":"5d50450cae1a230f682b390c8e28ae822ec6c0c04a9bc79b0d27af97306ccccd","side":"right"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"e9ac4b1e71d3f572751b7984e9ca00893d71628137b4634e82df02cf3db9ab68","side":"right"},{"sibling":"99ff86058e045249bf936a629308be31e4cc71328f0282c4a924f4e6718be5f0","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":309862,"merkle_root":"f18a76abb66e7cb448986b6541091416ed4ebdde8124f5208a7c7c94bb4165d1","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260713T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-13T05:38:23Z","sig_algorithm":"ed25519","signature":"0488e3527b1d559ba55116220f91e2f6c22bb5358a135e8a9b94a65450b50511702044fa993555662ebca09f005b277f5f6ad0d044ec96a5568e9993c09ef007","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_085e143f09c16561438e8a4c56cb97c99cf938ef83049cd18b9c1f734bf75c16"}}