{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WPCMEDHFQ6F4XIBQRI764XO5IV","short_pith_number":"pith:WPCMEDHF","schema_version":"1.0","canonical_sha256":"b3c4c20ce5878bcba0308a3fee5ddd45646299e72aff2f527a38c85cd11154ea","source":{"kind":"arxiv","id":"2505.15537","version":1},"attestation_state":"computed","paper":{"title":"Riemannian EXTRA: Communication-efficient decentralized optimization over compact submanifolds with data heterogeneity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiang Hu, Jiayuan Wu, Weijie Su, Zaiwen Wen, Zhanwang Deng","submitted_at":"2025-05-21T13:58:13Z","abstract_excerpt":"We consider decentralized optimization over a compact Riemannian submanifold in a network of $n$ agents, where each agent holds a smooth, nonconvex local objective defined by its private data. The goal is to collaboratively minimize the sum of these local objective functions. In the presence of data heterogeneity across nodes, existing algorithms typically require communicating both local gradients and iterates to ensure exact convergence with constant step sizes. In this work, we propose REXTRA, a Riemannian extension of the EXTRA algorithm [Shi et al., SIOPT, 2015], to address this limitatio"},"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":"2505.15537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-21T13:58:13Z","cross_cats_sorted":[],"title_canon_sha256":"6e7c65efd4ae1ebebdb3e64d5977a239a9cc53d248be1ae1706ab9066648874a","abstract_canon_sha256":"3dcf9565f3e7b445b2e9cbf323f7484f5803a01614f63e792a602141a5ff706f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:47.441924Z","signature_b64":"MrlT7poiWCCMCq1D/PbcuBP/owbCK5Kq/j22KvKtbZ+TSB0KPqSlbGGRi/SVuXGpuurjIBBambGAQ+JnLQb+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c4c20ce5878bcba0308a3fee5ddd45646299e72aff2f527a38c85cd11154ea","last_reissued_at":"2026-07-05T11:06:47.441419Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:47.441419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Riemannian EXTRA: Communication-efficient decentralized optimization over compact submanifolds with data heterogeneity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiang Hu, Jiayuan Wu, Weijie Su, Zaiwen Wen, Zhanwang Deng","submitted_at":"2025-05-21T13:58:13Z","abstract_excerpt":"We consider decentralized optimization over a compact Riemannian submanifold in a network of $n$ agents, where each agent holds a smooth, nonconvex local objective defined by its private data. The goal is to collaboratively minimize the sum of these local objective functions. In the presence of data heterogeneity across nodes, existing algorithms typically require communicating both local gradients and iterates to ensure exact convergence with constant step sizes. In this work, we propose REXTRA, a Riemannian extension of the EXTRA algorithm [Shi et al., SIOPT, 2015], to address this limitatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15537","kind":"arxiv","version":1},"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/2505.15537/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":"2505.15537","created_at":"2026-07-05T11:06:47.441482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15537v1","created_at":"2026-07-05T11:06:47.441482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15537","created_at":"2026-07-05T11:06:47.441482+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPCMEDHFQ6F4","created_at":"2026-07-05T11:06:47.441482+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPCMEDHFQ6F4XIBQ","created_at":"2026-07-05T11:06:47.441482+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPCMEDHF","created_at":"2026-07-05T11:06:47.441482+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23754","citing_title":"A Retraction-Free EXTRA Method for Decentralized Optimization on the Stiefel Manifold","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV","json":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV.json","graph_json":"https://pith.science/api/pith-number/WPCMEDHFQ6F4XIBQRI764XO5IV/graph.json","events_json":"https://pith.science/api/pith-number/WPCMEDHFQ6F4XIBQRI764XO5IV/events.json","paper":"https://pith.science/paper/WPCMEDHF"},"agent_actions":{"view_html":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV","download_json":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV.json","view_paper":"https://pith.science/paper/WPCMEDHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15537&json=true","fetch_graph":"https://pith.science/api/pith-number/WPCMEDHFQ6F4XIBQRI764XO5IV/graph.json","fetch_events":"https://pith.science/api/pith-number/WPCMEDHFQ6F4XIBQRI764XO5IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV/action/storage_attestation","attest_author":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV/action/author_attestation","sign_citation":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV/action/citation_signature","submit_replication":"https://pith.science/pith/WPCMEDHFQ6F4XIBQRI764XO5IV/action/replication_record"}},"created_at":"2026-07-05T11:06:47.441482+00:00","updated_at":"2026-07-05T11:06:47.441482+00:00"}