{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M33UUUI4XJ37FKTGSJ2BILSIOL","short_pith_number":"pith:M33UUUI4","canonical_record":{"source":{"id":"2503.21627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2dbfac29aa90785c1a0fd11e6e3158bcde81a3299a3e16293d53fee4e6556df3","abstract_canon_sha256":"1fb4777d4ddd76f154a51cdfc9d201673c284a541d0481385d2f6ef0bb56ec7f"},"schema_version":"1.0"},"canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","source":{"kind":"arxiv","id":"2503.21627","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M33UUUI4XJ37FKTGSJ2BILSIOL","target":"record","payload":{"canonical_record":{"source":{"id":"2503.21627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-03-27T15:48:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2dbfac29aa90785c1a0fd11e6e3158bcde81a3299a3e16293d53fee4e6556df3","abstract_canon_sha256":"1fb4777d4ddd76f154a51cdfc9d201673c284a541d0481385d2f6ef0bb56ec7f"},"schema_version":"1.0"},"canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:28.252769Z","signature_b64":"7/N6cOGsLRL1Ee5r0GkOo5/rusiAboD+w5TK4ciL9bgbx4xXe7tiKHSshsIrI2v1n7WU2E6Joip7z/oPWeQgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66f74a511cba77f2aa669274142e4872c350aa106e99fbb0bfd8ed984f087105","last_reissued_at":"2026-07-05T10:40:28.252352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:28.252352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.21627","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLojyxBqwjEbLpQyHk/eiw/Jd6ropobGE+Tvv+Bd2Bz1wtTup6516a8VP2TsaVjblVj1fcWuac5GTtj21hfDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:21:56.299597Z"},"content_sha256":"03847b6375abe36327a74ea4a25f121dc63a499efccc55494533bf64ac48cdee","schema_version":"1.0","event_id":"sha256:03847b6375abe36327a74ea4a25f121dc63a499efccc55494533bf64ac48cdee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M33UUUI4XJ37FKTGSJ2BILSIOL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Ali Dadras, Alp Yurtsever, Karlo Palenzuela, Tommy L\\\"ofstedt","submitted_at":"2025-03-27T15:48:34Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21627","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/2503.21627/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vm+IxWFNo9wcWxKGB/XjkokvfQXfFTm4Buu3bHgQLccGp2fGzpbBt2Y8ITzbk7ylwbyOcg6d/MBjUBHnYy1nDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:21:56.299973Z"},"content_sha256":"ce61327e9c7a1032f8de03feda2e775131855835c45c487ae0702d330bdf9b4c","schema_version":"1.0","event_id":"sha256:ce61327e9c7a1032f8de03feda2e775131855835c45c487ae0702d330bdf9b4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/bundle.json","state_url":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T15:21:56Z","links":{"resolver":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL","bundle":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/bundle.json","state":"https://pith.science/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M33UUUI4XJ37FKTGSJ2BILSIOL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jS75BqIQBNjzqRoe0llGhpQUcNHUlMZdEpq6w4CWWrbtKphu/5OHX2S0xbvV8E/l0X6EZ7VYELuWDU+wc3aeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:21:56.302026Z","bundle_sha256":"d8b09f4961a9ae274fa4536cc24127662dd31b317bd6d5117142df60b58e9777"}}