{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7NNKRF3WMEPJKLSUGEDOMQR5R7","short_pith_number":"pith:7NNKRF3W","schema_version":"1.0","canonical_sha256":"fb5aa89776611e952e543106e6423d8fe6d41365a9db43056cd71b857f98be46","source":{"kind":"arxiv","id":"2405.07100","version":2},"attestation_state":"computed","paper":{"title":"Analysis of Decentralized Stochastic Successive Convex Approximation for composite non-convex problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Basil M. Idrees, Ketan Rajawat, Shivangi Dubey Sharma","submitted_at":"2024-05-11T21:58:28Z","abstract_excerpt":"This work considers the decentralized successive convex approximation (SCA) method for minimizing stochastic non-convex objectives subject to convex constraints, along with possibly non-smooth convex regularizers. Although SCA has been widely applied in decentralized settings, its stochastic first order (SFO) complexity is unknown, and it is thought to be slower than the centralized momentum-enhanced SCA variants. In this work, we advance the state-of-the-art for SCA methods by proposing an accelerated variant, namely the \\textbf{D}ecentralized \\textbf{M}omentum-based \\textbf{S}tochastic \\text"},"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":"2405.07100","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-05-11T21:58:28Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"b79c2ab8adcb5d60db621110120f6f82edccb110414d15d951b301624bdb7c88","abstract_canon_sha256":"8a7a138cde53a543d1508a92f4d63012360ade5ede06a7d62d8ed2a4cb15780c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:05.321464Z","signature_b64":"AyeR4bQOoSxVhUta/7QamNa7QgDalxDonFPCNT99CyenSRe1IsHaNkqSLLmsw++Ikz3TXiUxsp71VnIVoRVmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5aa89776611e952e543106e6423d8fe6d41365a9db43056cd71b857f98be46","last_reissued_at":"2026-07-05T08:24:05.320970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:05.320970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Decentralized Stochastic Successive Convex Approximation for composite non-convex problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"math.OC","authors_text":"Basil M. Idrees, Ketan Rajawat, Shivangi Dubey Sharma","submitted_at":"2024-05-11T21:58:28Z","abstract_excerpt":"This work considers the decentralized successive convex approximation (SCA) method for minimizing stochastic non-convex objectives subject to convex constraints, along with possibly non-smooth convex regularizers. Although SCA has been widely applied in decentralized settings, its stochastic first order (SFO) complexity is unknown, and it is thought to be slower than the centralized momentum-enhanced SCA variants. In this work, we advance the state-of-the-art for SCA methods by proposing an accelerated variant, namely the \\textbf{D}ecentralized \\textbf{M}omentum-based \\textbf{S}tochastic \\text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07100","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/2405.07100/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":"2405.07100","created_at":"2026-07-05T08:24:05.321034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07100v2","created_at":"2026-07-05T08:24:05.321034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07100","created_at":"2026-07-05T08:24:05.321034+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NNKRF3WMEPJ","created_at":"2026-07-05T08:24:05.321034+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NNKRF3WMEPJKLSU","created_at":"2026-07-05T08:24:05.321034+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NNKRF3W","created_at":"2026-07-05T08:24:05.321034+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.13054","citing_title":"Distributed Normal Map-based Stochastic Proximal Gradient Methods over Networks","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7","json":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7.json","graph_json":"https://pith.science/api/pith-number/7NNKRF3WMEPJKLSUGEDOMQR5R7/graph.json","events_json":"https://pith.science/api/pith-number/7NNKRF3WMEPJKLSUGEDOMQR5R7/events.json","paper":"https://pith.science/paper/7NNKRF3W"},"agent_actions":{"view_html":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7","download_json":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7.json","view_paper":"https://pith.science/paper/7NNKRF3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07100&json=true","fetch_graph":"https://pith.science/api/pith-number/7NNKRF3WMEPJKLSUGEDOMQR5R7/graph.json","fetch_events":"https://pith.science/api/pith-number/7NNKRF3WMEPJKLSUGEDOMQR5R7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7/action/storage_attestation","attest_author":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7/action/author_attestation","sign_citation":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7/action/citation_signature","submit_replication":"https://pith.science/pith/7NNKRF3WMEPJKLSUGEDOMQR5R7/action/replication_record"}},"created_at":"2026-07-05T08:24:05.321034+00:00","updated_at":"2026-07-05T08:24:05.321034+00:00"}