{"_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_99c297134f1a07c62c42caadcb09e23d48f600299ab89661046e01900c3f4197","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_99c297134f1a07c62c42caadcb09e23d48f600299ab89661046e01900c3f4197","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"e8b3eb7a7cddf50e3d132ad3b13434a71064e1587b2326cac9a639f1538b9535","published":"Fri, 03 Jul 2026 00:00:00 -0400","receipt_hash":"e8b3eb7a7cddf50e3d132ad3b13434a71064e1587b2326cac9a639f1538b9535","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":"e8b3eb7a7cddf50e3d132ad3b13434a71064e1587b2326cac9a639f1538b9535","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.02166v1 Announce Type: cross \nAbstract: The rapid advancements in using neural networks as implicit data representations have attracted significant interest in developing machine learning methods that analyze and process the weight spaces of other neural networks. However, efficiently handling these highdimensional weight spaces remains challenging. Existing methods often overlook the sequential nature of layer-by-layer processing in neural network inference. In this work, we propose a novel approach using dynamic graphs to represent neural network parameters, capturing the temporal dynamics of inference. Our Dynamic Neural Graph Encoder (DNG-Encoder) processes these graphs, preserving the sequential nature of neural processing. Additionally, we also leverage DNG-Encoder to develop INR2JLS (Implicit Neural Representation to Joint Latent Space) for facilitate downstream applications, such as classifying Implicit Neural Representations (INRs). Our approach demonstrates signifi","title":"Dynamic Neural Graph Encoding of Inference Processes in Deep Weight Space","url":"https://arxiv.org/abs/2607.02166","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.02166v1 Announce Type: cross \nAbstract: The rapid advancements in using neural networks as implicit data representations have attracted significant interest in developing machine learning methods that analyze and process the weight spaces of other neural networks. However, efficiently handling these highdimensional weight spaces remains challenging. Existing methods often overlook the sequential nature of layer-by-layer processing in neural network inference. In this work, we propose a novel approach using dynamic graphs to represent neural network parameters, capturing the temporal dynamics of inference. Our Dynamic Neural Graph Encoder (DNG-Encoder) processes these graphs, preserving the sequential nature of neural processing. Additionally, we also leverage DNG-Encoder to develop INR2JLS (Implicit Neural Representation to Joint Latent Space) for facilitate downstream applications, such as classifying Implicit Neural Representations (INRs). Our approach demonstrates signifi","title":"Dynamic Neural Graph Encoding of Inference Processes in Deep Weight Space","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.02166"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:1181525ac34aee5e9262f95d9d09b6a6b19630ca7c37ba81d6b748cf8b70fb82786d5fef9cbb184df14802b430f389fa51e31c1a0b76ae5ef5c9c08aaeb0360a","signer":"crovia.substrate","subject":{"observed_at":"2026-07-03T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.02166"},"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":"ad6a80aa050bc3b6c63439e8589e027816a739f67b47fd4a47d7025c8d5fb07e","leaf_index":275527,"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":"938d9102412f12fa2abeca93906a0729a99f8b70c511c62c239d3de919f96028","side":"left"},{"sibling":"e6b95609e963f2c59acbcbdee7168b7fb47f6ddd5c471224dc8cd11369cd5747","side":"left"},{"sibling":"87685686a914e48daafaf5ed0d6d6704ddc33099dd61badee5dffbc96781ced9","side":"left"},{"sibling":"14b56fe43bb10dd45f1ba62f34c31adefcda8000cbcd7fc5724df61a6c8d8d2c","side":"right"},{"sibling":"9b35418e6616998363c01886952ee34ff59c1c632ae2af75b516c1345b762e71","side":"right"},{"sibling":"840e1fb25c11b476db177239b6345299e097ebf1ebebbb042cd3af61d8c9d5a7","side":"right"},{"sibling":"951a1a1b501b86a4c8935e5f14dcd40ccd2d9f000d8c1cc584a81c95ee1b3755","side":"left"},{"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_99c297134f1a07c62c42caadcb09e23d48f600299ab89661046e01900c3f4197"}}