{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TPS2ZUUS5Y5MFX46VV4EUD743C","short_pith_number":"pith:TPS2ZUUS","canonical_record":{"source":{"id":"2502.03958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T10:49:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6f111db5e9d28dd6818c10afb9c33d34918aa8fd3767100dc764bd52c66d0cb7","abstract_canon_sha256":"944da433032f9bc409887a2eb4f21bd45ac2ec0d39d34097e8e1cd27e2edd982"},"schema_version":"1.0"},"canonical_sha256":"9be5acd292ee3ac2df9ead784a0ffcd88d93295ac72facb806e113ed53ee94e3","source":{"kind":"arxiv","id":"2502.03958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03958","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03958v1","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03958","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"TPS2ZUUS5Y5M","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"TPS2ZUUS5Y5MFX46","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"TPS2ZUUS","created_at":"2026-07-05T10:10:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TPS2ZUUS5Y5MFX46VV4EUD743C","target":"record","payload":{"canonical_record":{"source":{"id":"2502.03958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T10:49:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6f111db5e9d28dd6818c10afb9c33d34918aa8fd3767100dc764bd52c66d0cb7","abstract_canon_sha256":"944da433032f9bc409887a2eb4f21bd45ac2ec0d39d34097e8e1cd27e2edd982"},"schema_version":"1.0"},"canonical_sha256":"9be5acd292ee3ac2df9ead784a0ffcd88d93295ac72facb806e113ed53ee94e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:31.797852Z","signature_b64":"f8Xoi7bI2XVJe94VXTwih+JjRq3llxyR0fbeXvzhhQ1rSu0LACSX+YWZBGFTnu1c6AVkEKy2nB86pUjp2IrDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9be5acd292ee3ac2df9ead784a0ffcd88d93295ac72facb806e113ed53ee94e3","last_reissued_at":"2026-07-05T10:10:31.797449Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:31.797449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.03958","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:10:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqynfgyjsRd/RDlIT9RP34IW1C3QpYewSec/MpuGZpdRvdt/lnKoV/GoX+PEE9mKrhw3PXHBSYsdGL9pVh7aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:04:58.025091Z"},"content_sha256":"e9742defd546bce202dafa47e144bf32bf2979098e6648ee9c0c573276b29bf6","schema_version":"1.0","event_id":"sha256:e9742defd546bce202dafa47e144bf32bf2979098e6648ee9c0c573276b29bf6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TPS2ZUUS5Y5MFX46VV4EUD743C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-convex composite federated learning with heterogeneous data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jiang Hu, Jiaojiao Zhang, Mikael Johansson","submitted_at":"2025-02-06T10:49:03Z","abstract_excerpt":"We propose an innovative algorithm for non-convex composite federated learning that decouples the proximal operator evaluation and the communication between server and clients. Moreover, each client uses local updates to communicate less frequently with the server, sends only a single d-dimensional vector per communication round, and overcomes issues with client drift. In the analysis, challenges arise from the use of decoupling strategies and local updates in the algorithm, as well as from the non-convex and non-smooth nature of the problem. We establish sublinear and linear convergence to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03958","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/2502.03958/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:10:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9I014V3UsRr+iI5wK098L0ugf0zAEH1dsLOQuWIVEEDSWM22/c40DB2TloRH6WSzMDNUPzbmbi+vjEw8h8uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:04:58.025580Z"},"content_sha256":"80e6e3c9a5a89e652a1ead2a63a5b3139f0489d8686e3035eac8d3527d0e956b","schema_version":"1.0","event_id":"sha256:80e6e3c9a5a89e652a1ead2a63a5b3139f0489d8686e3035eac8d3527d0e956b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/bundle.json","state_url":"https://pith.science/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/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-08-09T22:04:58Z","links":{"resolver":"https://pith.science/pith/TPS2ZUUS5Y5MFX46VV4EUD743C","bundle":"https://pith.science/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/bundle.json","state":"https://pith.science/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPS2ZUUS5Y5MFX46VV4EUD743C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TPS2ZUUS5Y5MFX46VV4EUD743C","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":"944da433032f9bc409887a2eb4f21bd45ac2ec0d39d34097e8e1cd27e2edd982","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T10:49:03Z","title_canon_sha256":"6f111db5e9d28dd6818c10afb9c33d34918aa8fd3767100dc764bd52c66d0cb7"},"schema_version":"1.0","source":{"id":"2502.03958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.03958","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"arxiv_version","alias_value":"2502.03958v1","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03958","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_12","alias_value":"TPS2ZUUS5Y5M","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_16","alias_value":"TPS2ZUUS5Y5MFX46","created_at":"2026-07-05T10:10:31Z"},{"alias_kind":"pith_short_8","alias_value":"TPS2ZUUS","created_at":"2026-07-05T10:10:31Z"}],"graph_snapshots":[{"event_id":"sha256:80e6e3c9a5a89e652a1ead2a63a5b3139f0489d8686e3035eac8d3527d0e956b","target":"graph","created_at":"2026-07-05T10:10:31Z","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/2502.03958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an innovative algorithm for non-convex composite federated learning that decouples the proximal operator evaluation and the communication between server and clients. Moreover, each client uses local updates to communicate less frequently with the server, sends only a single d-dimensional vector per communication round, and overcomes issues with client drift. In the analysis, challenges arise from the use of decoupling strategies and local updates in the algorithm, as well as from the non-convex and non-smooth nature of the problem. We establish sublinear and linear convergence to a ","authors_text":"Jiang Hu, Jiaojiao Zhang, Mikael Johansson","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T10:49:03Z","title":"Non-convex composite federated learning with heterogeneous data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03958","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:e9742defd546bce202dafa47e144bf32bf2979098e6648ee9c0c573276b29bf6","target":"record","created_at":"2026-07-05T10:10:31Z","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":"944da433032f9bc409887a2eb4f21bd45ac2ec0d39d34097e8e1cd27e2edd982","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T10:49:03Z","title_canon_sha256":"6f111db5e9d28dd6818c10afb9c33d34918aa8fd3767100dc764bd52c66d0cb7"},"schema_version":"1.0","source":{"id":"2502.03958","kind":"arxiv","version":1}},"canonical_sha256":"9be5acd292ee3ac2df9ead784a0ffcd88d93295ac72facb806e113ed53ee94e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9be5acd292ee3ac2df9ead784a0ffcd88d93295ac72facb806e113ed53ee94e3","first_computed_at":"2026-07-05T10:10:31.797449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:31.797449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f8Xoi7bI2XVJe94VXTwih+JjRq3llxyR0fbeXvzhhQ1rSu0LACSX+YWZBGFTnu1c6AVkEKy2nB86pUjp2IrDDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:31.797852Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.03958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9742defd546bce202dafa47e144bf32bf2979098e6648ee9c0c573276b29bf6","sha256:80e6e3c9a5a89e652a1ead2a63a5b3139f0489d8686e3035eac8d3527d0e956b"],"state_sha256":"0799d06c2e3470ad7f75f1b2662830440711b5fbba9f4e7fc661204101c258f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uG+yOvTFUzzgMDxLR0oU/dYR+Taww+hU5cChVvZDQIsdEk/3jR8Mwtzar8+Mdci3KsntrGPhEojw+j7t+9t5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:04:58.030731Z","bundle_sha256":"b8edbaea017638d4c08548830264f887db1506d54b0959f1b6adbb62973e8e22"}}