{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CKPFUA2TUWQVB3VWFFIHKXDWY6","short_pith_number":"pith:CKPFUA2T","schema_version":"1.0","canonical_sha256":"129e5a0353a5a150eeb62950755c76c7a5b303603d8d32cc5a83eb2b2797c796","source":{"kind":"arxiv","id":"2606.07496","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Decentralized Stochastic Gradient Descent for Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kun Yuan, Ming Sun","submitted_at":"2026-06-05T17:51:11Z","abstract_excerpt":"Decentralized stochastic optimization is a fundamental paradigm for large-scale learning over networks, where agents communicate only with their neighbors and no central coordinator is required. For strongly convex problems, communication efficiency is mainly determined by the condition number \\(\\kappa=L/\\mu\\) and the network spectral gap \\(1-\\beta\\). Although deterministic decentralized methods can simultaneously achieve accelerated \\(\\sqrt{\\kappa}\\) and \\(1/\\sqrt{1-\\beta}\\) dependences, no existing stochastic method attains both improvements at once. In this paper, we propose \\emph{Multi-Gos"},"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":"2606.07496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-05T17:51:11Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"c2c0cdb29d7ecca045f536e24c78769566115887515e9017b8ec7799394e5621","abstract_canon_sha256":"8ea825b503d2b1ba16b6400e90162aa4bdcc3c7a798cccb12aa94531435a13d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:30.377650Z","signature_b64":"3qQmmNncnlos7LIeProYczc7goSA/yAalgS1JpkKIEOyB1fTdl/C0/Z6nMZYenmwRc4kUJlo4obZs38yEh5LCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"129e5a0353a5a150eeb62950755c76c7a5b303603d8d32cc5a83eb2b2797c796","last_reissued_at":"2026-06-08T01:05:30.376809Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:30.376809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Decentralized Stochastic Gradient Descent for Strongly Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Kun Yuan, Ming Sun","submitted_at":"2026-06-05T17:51:11Z","abstract_excerpt":"Decentralized stochastic optimization is a fundamental paradigm for large-scale learning over networks, where agents communicate only with their neighbors and no central coordinator is required. For strongly convex problems, communication efficiency is mainly determined by the condition number \\(\\kappa=L/\\mu\\) and the network spectral gap \\(1-\\beta\\). Although deterministic decentralized methods can simultaneously achieve accelerated \\(\\sqrt{\\kappa}\\) and \\(1/\\sqrt{1-\\beta}\\) dependences, no existing stochastic method attains both improvements at once. In this paper, we propose \\emph{Multi-Gos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07496","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/2606.07496/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":"2606.07496","created_at":"2026-06-08T01:05:30.376949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07496v1","created_at":"2026-06-08T01:05:30.376949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07496","created_at":"2026-06-08T01:05:30.376949+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKPFUA2TUWQV","created_at":"2026-06-08T01:05:30.376949+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKPFUA2TUWQVB3VW","created_at":"2026-06-08T01:05:30.376949+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKPFUA2T","created_at":"2026-06-08T01:05:30.376949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6","json":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6.json","graph_json":"https://pith.science/api/pith-number/CKPFUA2TUWQVB3VWFFIHKXDWY6/graph.json","events_json":"https://pith.science/api/pith-number/CKPFUA2TUWQVB3VWFFIHKXDWY6/events.json","paper":"https://pith.science/paper/CKPFUA2T"},"agent_actions":{"view_html":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6","download_json":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6.json","view_paper":"https://pith.science/paper/CKPFUA2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07496&json=true","fetch_graph":"https://pith.science/api/pith-number/CKPFUA2TUWQVB3VWFFIHKXDWY6/graph.json","fetch_events":"https://pith.science/api/pith-number/CKPFUA2TUWQVB3VWFFIHKXDWY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6/action/storage_attestation","attest_author":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6/action/author_attestation","sign_citation":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6/action/citation_signature","submit_replication":"https://pith.science/pith/CKPFUA2TUWQVB3VWFFIHKXDWY6/action/replication_record"}},"created_at":"2026-06-08T01:05:30.376949+00:00","updated_at":"2026-06-08T01:05:30.376949+00:00"}