{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M33UUUI4XJ37FKTGSJ2BILSIOL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1fb4777d4ddd76f154a51cdfc9d201673c284a541d0481385d2f6ef0bb56ec7f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","title_canon_sha256":"2dbfac29aa90785c1a0fd11e6e3158bcde81a3299a3e16293d53fee4e6556df3"},"schema_version":"1.0","source":{"id":"2503.21627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.21627","created_at":"2026-07-05T10:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"2503.21627v1","created_at":"2026-07-05T10:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21627","created_at":"2026-07-05T10:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"M33UUUI4XJ37","created_at":"2026-07-05T10:40:28Z"},{"alias_kind":"pith_short_16","alias_value":"M33UUUI4XJ37FKTG","created_at":"2026-07-05T10:40:28Z"},{"alias_kind":"pith_short_8","alias_value":"M33UUUI4","created_at":"2026-07-05T10:40:28Z"}],"graph_snapshots":[{"event_id":"sha256:ce61327e9c7a1032f8de03feda2e775131855835c45c487ae0702d330bdf9b4c","target":"graph","created_at":"2026-07-05T10:40:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.21627/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiple local steps are key to communication-efficient federated learning. However, theoretical guarantees for such algorithms, without data heterogeneity-bounding assumptions, have been lacking in general non-smooth convex problems. Leveraging projection-efficient optimization methods, we propose FedMLS, a federated learning algorithm with provable improvements from multiple local steps. FedMLS attains an $\\epsilon$-suboptimal solution in $\\mathcal{O}(1/\\epsilon)$ communication rounds, requiring a total of $\\mathcal{O}(1/\\epsilon^2)$ stochastic subgradient oracle calls.","authors_text":"Ali Dadras, Alp Yurtsever, Karlo Palenzuela, Tommy L\\\"ofstedt","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21627","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:03847b6375abe36327a74ea4a25f121dc63a499efccc55494533bf64ac48cdee","target":"record","created_at":"2026-07-05T10:40:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1fb4777d4ddd76f154a51cdfc9d201673c284a541d0481385d2f6ef0bb56ec7f","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","title_canon_sha256":"2dbfac29aa90785c1a0fd11e6e3158bcde81a3299a3e16293d53fee4e6556df3"},"schema_version":"1.0","source":{"id":"2503.21627","kind":"arxiv","version":1}},"canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","first_computed_at":"2026-07-05T10:40:28.252352Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:40:28.252352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7/N6cOGsLRL1Ee5r0GkOo5/rusiAboD+w5TK4ciL9bgbx4xXe7tiKHSshsIrI2v1n7WU2E6Joip7z/oPWeQgCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:40:28.252769Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.21627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03847b6375abe36327a74ea4a25f121dc63a499efccc55494533bf64ac48cdee","sha256:ce61327e9c7a1032f8de03feda2e775131855835c45c487ae0702d330bdf9b4c"],"state_sha256":"98e1b14d204b2f347a8733f87388de29a1b16a0a41a7a91178be17d31c741505"}