{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VFYPTQIKQLDJ4QJGSMLEM2BSC4","short_pith_number":"pith:VFYPTQIK","schema_version":"1.0","canonical_sha256":"a970f9c10a82c69e412693164668321708d6e605562ba5ff7bf378248b7e8d7b","source":{"kind":"arxiv","id":"2606.04757","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Amit Attia, Nitai Kluger, Tomer Koren","submitted_at":"2026-06-03T11:42:01Z","abstract_excerpt":"We study decentralized stochastic smooth convex optimization, where $M$ workers minimize an average objective using local stochastic gradients and neighbor-only communication over a fixed gossip network. A central question in this setting is to determine the largest number of workers that can be used under a total budget of $N$ gradient samples while still preserving the centralized $O(1/\\sqrt N)$ statistical rate. We introduce an accelerated decentralized method that preserves this rate for up to $\\smash{M\\lesssim \\sqrt{\\rho}\\,N^{3/4}}$ workers, where $\\rho$ is the spectral gap of the gossip "},"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.04757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-03T11:42:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad8d96e46e9019ed5917b51b9740d07a5959a1e83b53109a441d1a501e599249","abstract_canon_sha256":"68d4b93c83239ac815e26636ae727b93a65560740cf46a5015f90d4db19c3546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:28.814395Z","signature_b64":"CQbBbDyVEYesiDylZYwgBqyoHSQFsnQ7FYmH8eCmgP1xMHR7z/79Hj4/eeVtbND36p0DnwbV6+4ogPb5s/HzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a970f9c10a82c69e412693164668321708d6e605562ba5ff7bf378248b7e8d7b","last_reissued_at":"2026-06-04T01:09:28.813618Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:28.813618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Amit Attia, Nitai Kluger, Tomer Koren","submitted_at":"2026-06-03T11:42:01Z","abstract_excerpt":"We study decentralized stochastic smooth convex optimization, where $M$ workers minimize an average objective using local stochastic gradients and neighbor-only communication over a fixed gossip network. A central question in this setting is to determine the largest number of workers that can be used under a total budget of $N$ gradient samples while still preserving the centralized $O(1/\\sqrt N)$ statistical rate. We introduce an accelerated decentralized method that preserves this rate for up to $\\smash{M\\lesssim \\sqrt{\\rho}\\,N^{3/4}}$ workers, where $\\rho$ is the spectral gap of the gossip "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04757","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.04757/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.04757","created_at":"2026-06-04T01:09:28.813747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04757v1","created_at":"2026-06-04T01:09:28.813747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04757","created_at":"2026-06-04T01:09:28.813747+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFYPTQIKQLDJ","created_at":"2026-06-04T01:09:28.813747+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFYPTQIKQLDJ4QJG","created_at":"2026-06-04T01:09:28.813747+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFYPTQIK","created_at":"2026-06-04T01:09:28.813747+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/VFYPTQIKQLDJ4QJGSMLEM2BSC4","json":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4.json","graph_json":"https://pith.science/api/pith-number/VFYPTQIKQLDJ4QJGSMLEM2BSC4/graph.json","events_json":"https://pith.science/api/pith-number/VFYPTQIKQLDJ4QJGSMLEM2BSC4/events.json","paper":"https://pith.science/paper/VFYPTQIK"},"agent_actions":{"view_html":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4","download_json":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4.json","view_paper":"https://pith.science/paper/VFYPTQIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04757&json=true","fetch_graph":"https://pith.science/api/pith-number/VFYPTQIKQLDJ4QJGSMLEM2BSC4/graph.json","fetch_events":"https://pith.science/api/pith-number/VFYPTQIKQLDJ4QJGSMLEM2BSC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4/action/storage_attestation","attest_author":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4/action/author_attestation","sign_citation":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4/action/citation_signature","submit_replication":"https://pith.science/pith/VFYPTQIKQLDJ4QJGSMLEM2BSC4/action/replication_record"}},"created_at":"2026-06-04T01:09:28.813747+00:00","updated_at":"2026-06-04T01:09:28.813747+00:00"}