{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5PMEUGTMZP44HSDELNKF45PI7G","short_pith_number":"pith:5PMEUGTM","schema_version":"1.0","canonical_sha256":"ebd84a1a6ccbf9c3c8645b545e75e8f9b93705a568a7cff3f3485081132b891a","source":{"kind":"arxiv","id":"2510.01377","version":2},"attestation_state":"computed","paper":{"title":"DeMuon: A Decentralized Muon for Matrix Optimization over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chuan He, Erik G. Larsson, Jingwei Mao, Shuyi Ren","submitted_at":"2025-10-01T19:06:11Z","abstract_excerpt":"In this paper, we propose DeMuon, a method for decentralized matrix optimization over a given communication topology. DeMuon incorporates matrix orthogonalization via Newton-Schulz iterations-a technique inherited from its centralized predecessor, Muon-and employs gradient tracking to mitigate heterogeneity among local functions. Under heavy-tailed noise conditions and additional mild assumptions, we establish the iteration complexity of DeMuon for reaching an approximate stochastic stationary point. This complexity result matches the best-known complexity bounds of centralized algorithms in t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2510.01377","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-01T19:06:11Z","cross_cats_sorted":["cs.AI","cs.LG","cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"ffaece6eda947e95b619db55ea4ea2e5108fc8b6829e4bbe11a89fd268316634","abstract_canon_sha256":"61d843245db7a61faaeebe1588c3544e86f87423d39b100e494f9b367131a02d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:45.468387Z","signature_b64":"iE/LeZ3reuCT5evZPh8xRMOaQ7qhYQrhCwtEXS3Xo0XxMwjlirw4hRumHxEduYxJgiiYAokNhoC+LMf0mSpnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebd84a1a6ccbf9c3c8645b545e75e8f9b93705a568a7cff3f3485081132b891a","last_reissued_at":"2026-06-03T01:05:45.467980Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:45.467980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeMuon: A Decentralized Muon for Matrix Optimization over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.MA","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Chuan He, Erik G. Larsson, Jingwei Mao, Shuyi Ren","submitted_at":"2025-10-01T19:06:11Z","abstract_excerpt":"In this paper, we propose DeMuon, a method for decentralized matrix optimization over a given communication topology. DeMuon incorporates matrix orthogonalization via Newton-Schulz iterations-a technique inherited from its centralized predecessor, Muon-and employs gradient tracking to mitigate heterogeneity among local functions. Under heavy-tailed noise conditions and additional mild assumptions, we establish the iteration complexity of DeMuon for reaching an approximate stochastic stationary point. This complexity result matches the best-known complexity bounds of centralized algorithms in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.01377","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.01377/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.01377","created_at":"2026-06-03T01:05:45.468041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.01377v2","created_at":"2026-06-03T01:05:45.468041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.01377","created_at":"2026-06-03T01:05:45.468041+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PMEUGTMZP44","created_at":"2026-06-03T01:05:45.468041+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PMEUGTMZP44HSDE","created_at":"2026-06-03T01:05:45.468041+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PMEUGTM","created_at":"2026-06-03T01:05:45.468041+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.23980","citing_title":"SUDA-Muon: Structural Design Principles and Boundaries for Fully Decentralized Muon","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G","json":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G.json","graph_json":"https://pith.science/api/pith-number/5PMEUGTMZP44HSDELNKF45PI7G/graph.json","events_json":"https://pith.science/api/pith-number/5PMEUGTMZP44HSDELNKF45PI7G/events.json","paper":"https://pith.science/paper/5PMEUGTM"},"agent_actions":{"view_html":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G","download_json":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G.json","view_paper":"https://pith.science/paper/5PMEUGTM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.01377&json=true","fetch_graph":"https://pith.science/api/pith-number/5PMEUGTMZP44HSDELNKF45PI7G/graph.json","fetch_events":"https://pith.science/api/pith-number/5PMEUGTMZP44HSDELNKF45PI7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G/action/storage_attestation","attest_author":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G/action/author_attestation","sign_citation":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G/action/citation_signature","submit_replication":"https://pith.science/pith/5PMEUGTMZP44HSDELNKF45PI7G/action/replication_record"}},"created_at":"2026-06-03T01:05:45.468041+00:00","updated_at":"2026-06-03T01:05:45.468041+00:00"}