{"_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_2f7095473e25aba1dd597dec6cd3516595eceb3983e96964b078a3b4b44ef943","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_2f7095473e25aba1dd597dec6cd3516595eceb3983e96964b078a3b4b44ef943","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"5b6ec1bdc713383a5f261217885fd871ed128b1f8bbd0edf19baca14c453534b","published":"Thu, 07 May 2026 00:00:00 -0400","receipt_hash":"5b6ec1bdc713383a5f261217885fd871ed128b1f8bbd0edf19baca14c453534b","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":"5b6ec1bdc713383a5f261217885fd871ed128b1f8bbd0edf19baca14c453534b","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:2505.16932v5 Announce Type: replace-cross \nAbstract: Computing the polar decomposition and the related matrix sign function has been a well-studied problem in numerical analysis for decades. Recently, it has emerged as an important subroutine within the Muon optimizer for training deep neural networks. However, the requirements of this application differ sharply from classical settings: deep learning demands GPU-friendly algorithms that prioritize high throughput over high precision. We introduce Polar Express, a new method for computing the polar decomposition. Like Newton-Schulz and other classical polynomial methods, our approach uses only matrix-matrix multiplications, making it very efficient on GPUs. Inspired by earlier work of Chen & Chow and Nakatsukasa & Freund, Polar Express adapts the update rule at each iteration by solving a minimax optimization problem. We prove that this strategy minimizes error in a worst-case sense, allowing Polar Express to converge as rapidly a","title":"The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithm","url":"https://arxiv.org/abs/2505.16932","vendor":"arxiv_cs_ai"},"summary":"arXiv:2505.16932v5 Announce Type: replace-cross \nAbstract: Computing the polar decomposition and the related matrix sign function has been a well-studied problem in numerical analysis for decades. Recently, it has emerged as an important subroutine within the Muon optimizer for training deep neural networks. However, the requirements of this application differ sharply from classical settings: deep learning demands GPU-friendly algorithms that prioritize high throughput over high precision. We introduce Polar Express, a new method for computing the polar decomposition. Like Newton-Schulz and other classical polynomial methods, our approach uses only matrix-matrix multiplications, making it very efficient on GPUs. Inspired by earlier work of Chen & Chow and Nakatsukasa & Freund, Polar Express adapts the update rule at each iteration by solving a minimax optimization problem. We prove that this strategy minimizes error in a worst-case sense, allowing Polar Express to converge as rapidly a","title":"The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithm","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/2505.16932"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:caedfa623dd919bb6229aa25f191c7687934441646acf25ad9c4143a29fc313b0fc29922fd5bd0cc96963f002a6b3c312afecceae9f63557c888c44468912900","signer":"crovia.substrate","subject":{"observed_at":"2026-05-07T04:43:30Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2505.16932"},"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":"ff3ca14922aee2376f059bc3283d49d5b291bd088a1bcfe6f0cc3a4f00ec08e2","leaf_index":118379,"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":"9dbf374288bf518614514c71c13dc0b73e7b18b66f7a044856f1a5150648e588","side":"left"},{"sibling":"e63329288e4a9113e69e8561bb04c21572b9d0d53aa568a6858db857008cc679","side":"left"},{"sibling":"0c347c367faeea6f5ed8ce9698fc1d784648db5fba9c26260b229f66e95127b2","side":"right"},{"sibling":"823fea8bc48b6effad54223d103f3325591f9f37e2b3b539647976fdf0c69fed","side":"left"},{"sibling":"7533429224a5e9c3bc3c524e05ffc5f9c622f75ed479bc6dd8a4b5ad5dea90ea","side":"right"},{"sibling":"4f8fefea0bdad83d6e9dc76f781af14cbaa790887a598ce962ba2d18eff5e2c2","side":"left"},{"sibling":"32aaccf2eeff13821f2f71ee191f0ee0b074a7efb07f37d041ab73d669ff43ba","side":"left"},{"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_2f7095473e25aba1dd597dec6cd3516595eceb3983e96964b078a3b4b44ef943"}}