{"_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_7caefa57b7ea4cd20a463cf8c9e504cb6de4489443dab2b45ab281155031d02e","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_7caefa57b7ea4cd20a463cf8c9e504cb6de4489443dab2b45ab281155031d02e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"dbf1fb8a0e0f872bd2346e13aafaa2c3e0e35ccd8da5a0e127a345e026de68a6","published":"Tue, 09 Jun 2026 00:00:00 -0400","receipt_hash":"dbf1fb8a0e0f872bd2346e13aafaa2c3e0e35ccd8da5a0e127a345e026de68a6","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":"dbf1fb8a0e0f872bd2346e13aafaa2c3e0e35ccd8da5a0e127a345e026de68a6","observed_at":"2026-06-09T04:43:45.619596Z","parent_run_hash":"f2344865fd128464efd1bacba326b5a7ccea707694b8c5650dd51ae8c46ac8a1","published":"Tue, 09 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:2606.09377v1 Announce Type: cross \nAbstract: Formal neural network verification -- proving that a network satisfies safety properties for \\emph{all} inputs in a specified domain -- is bounded in practice by GPU memory: standard implementations of bound-propagation algorithms (IBP, CROWN, $\\alpha$-CROWN) require weight and relaxation-coefficient matrices to reside entirely on one accelerator. We adapt two parallelism techniques originally developed for large-scale model training to the \\texttt{auto\\_LiRPA}\\,/\\,$\\alpha,\\beta$-CROWN verification framework. \\textbf{Tensor Parallelism (TP)} shards both weight and $A$-matrices across GPUs, achieving ${\\approx}2\\times$ peak-memory reduction at $P{=}2$; soundness is confirmed on VNN-COMP 2022 MNIST-FC benchmarks, though bound tightness degrades with the number of sharded zones due to forced IBP substitution for intermediate bounds inside sharded zones. \\textbf{Fully Sharded Data Parallelism (FSDP)} shards only weight matrices with a per-","title":"Scaling Neural Network Verification with Tensor Parallelism and Fully Sharded Data Parallelism","url":"https://arxiv.org/abs/2606.09377","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.09377v1 Announce Type: cross \nAbstract: Formal neural network verification -- proving that a network satisfies safety properties for \\emph{all} inputs in a specified domain -- is bounded in practice by GPU memory: standard implementations of bound-propagation algorithms (IBP, CROWN, $\\alpha$-CROWN) require weight and relaxation-coefficient matrices to reside entirely on one accelerator. We adapt two parallelism techniques originally developed for large-scale model training to the \\texttt{auto\\_LiRPA}\\,/\\,$\\alpha,\\beta$-CROWN verification framework. \\textbf{Tensor Parallelism (TP)} shards both weight and $A$-matrices across GPUs, achieving ${\\approx}2\\times$ peak-memory reduction at $P{=}2$; soundness is confirmed on VNN-COMP 2022 MNIST-FC benchmarks, though bound tightness degrades with the number of sharded zones due to forced IBP substitution for intermediate bounds inside sharded zones. \\textbf{Fully Sharded Data Parallelism (FSDP)} shards only weight matrices with a per-","title":"Scaling Neural Network Verification with Tensor Parallelism and Fully Sharded Data Parallelism","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-09T04:43:45Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.09377"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:aa06f0e6be958c6aea41e89f69dcf4e426f8960e65e8832ab94b7d0fd498b7fe943bd52e515a87637b08ebbad39a1e35e72e952ee5bac754b9dd4573c4b35f01","signer":"crovia.substrate","subject":{"observed_at":"2026-06-09T04:43:45Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.09377"},"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":"7e27272baf1588d90d9b2e7ab894b11314c687dab9fc88e12c285acaa23aa3cd","leaf_index":224392,"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":"66ac322cfebe66862973147416b4dfb0ab126af40bcf0fdad2d731658d85004c","side":"right"},{"sibling":"44c8da5df64376105659070454707136e49ed81e969954ece49fb2b1931b0e3f","side":"right"},{"sibling":"466589f2d4de3ff9c4ecaf710f34402a721ad3825b471b4c73bf23f76ad21d2f","side":"right"},{"sibling":"1812b233e3c3f5126faae7e433276eb375b35b7aeda615253a96a0a535568362","side":"left"},{"sibling":"802258790c0db648ac1ada091afd5e6960efb2da6b2ef887286535149a9ec21b","side":"right"},{"sibling":"a9aa5cffe4385f8c60a6f86a47c98b79615188a6c53dc52766e6f0213889a0b2","side":"right"},{"sibling":"e608affc2056362c3a340b4c445f33ace512b2cfe2d91dd48dbc62ed1cd1d32e","side":"right"},{"sibling":"0dba1b4aa8c69a39c01dbd9d9884405788a8121b073c56815159112e9ccba4bd","side":"left"},{"sibling":"f6fb234a4e2f067b22329eec05b093a8b38f0411de9434d5a8eb55c2f70f1a2f","side":"right"},{"sibling":"b2df6a4bb3e928f0b447931cc688ae01d2415773a2b07cfed0b1cba689078aed","side":"right"},{"sibling":"b1c9ec856caa0fd46bb47b46f18c59ebcd295d774ca17adb3b46f05d394a6a5d","side":"left"},{"sibling":"24fdc29d461691aedb6fa920758206b5bb43851f477ef7a04c34aaed84b8971b","side":"left"},{"sibling":"036922da4e1e2c46d948f070454bfad299b7406fb00735ea9d8bd1e687f5f445","side":"right"},{"sibling":"533d82482604463aa4a281b9d8b85917b383b7c5f924b2b494039524c55e8797","side":"left"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"87c6b850dfec08ac35a693d9db3a3315250a68adb1cfab9b1015f212b63b15bd","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"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":224761,"merkle_root":"e9f7b49b652e869ab97ffba9c5a31356b2d0e3dc5d00bb28944adf737c46b1e7","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260609T103805Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-09T14:15:34Z","sig_algorithm":"ed25519","signature":"8ad8076fb12c8e486ae1d1559a9a7ba8e2ee996a9ad3d8ba7bcdbdbd88ab3a15bcb429707aca6d3e9d8b97e2ba755b3dcc77b1abb6601ccb829842719a6fb30d","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_7caefa57b7ea4cd20a463cf8c9e504cb6de4489443dab2b45ab281155031d02e"}}