{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WDA364XJOQYKQ4HEGDVFSEYL5E","short_pith_number":"pith:WDA364XJ","canonical_record":{"source":{"id":"2010.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T22:29:51Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"c1323e8330d5e5232b7a7a478558a93e45c700feedba656ab63fc77af4ede5fc","abstract_canon_sha256":"dd7fc9e397f897204fd5d5bf92fa31eb95751b12667ed9149bbe5a7577f3a132"},"schema_version":"1.0"},"canonical_sha256":"b0c1bf72e97430a870e430ea59130be92ba63207cbbedb76209d2a594ad6f485","source":{"kind":"arxiv","id":"2010.02372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.02372","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"2010.02372v1","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02372","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"WDA364XJOQYK","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_16","alias_value":"WDA364XJOQYKQ4HE","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_8","alias_value":"WDA364XJ","created_at":"2026-07-05T01:40:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WDA364XJOQYKQ4HEGDVFSEYL5E","target":"record","payload":{"canonical_record":{"source":{"id":"2010.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T22:29:51Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"c1323e8330d5e5232b7a7a478558a93e45c700feedba656ab63fc77af4ede5fc","abstract_canon_sha256":"dd7fc9e397f897204fd5d5bf92fa31eb95751b12667ed9149bbe5a7577f3a132"},"schema_version":"1.0"},"canonical_sha256":"b0c1bf72e97430a870e430ea59130be92ba63207cbbedb76209d2a594ad6f485","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:40:49.128871Z","signature_b64":"H1b3t6AeLr3uBVWlsPwS1bajBnFBUmAnFPoMsOvyH3q4CrJtwswLyRmgaMabf/FneLcwwEv7u4jvUAzhN0R+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0c1bf72e97430a870e430ea59130be92ba63207cbbedb76209d2a594ad6f485","last_reissued_at":"2026-07-05T01:40:49.128505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:40:49.128505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.02372","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-05T01:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+Ej0vnNMLRIl7dSg1wwb4ytH6XHf4FbfWWxAuVVT193gk9monsACKW0OOKhEDd6HeEku8Jd9DxeBNwk6JYrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:45:56.857849Z"},"content_sha256":"686ce66f81e2db253856169c1f452dac941a36749fc2de4755a725f740cb8a01","schema_version":"1.0","event_id":"sha256:686ce66f81e2db253856169c1f452dac941a36749fc2de4755a725f740cb8a01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WDA364XJOQYKQ4HEGDVFSEYL5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds and Optimal Algorithms for Personalized Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.LG","authors_text":"Filip Hanzely, Peter Richt\\'arik, Samuel Horv\\'ath, Slavom\\'ir Hanzely","submitted_at":"2020-10-05T22:29:51Z","abstract_excerpt":"In this work, we consider the optimization formulation of personalized federated learning recently introduced by Hanzely and Richt\\'arik (2020) which was shown to give an alternative explanation to the workings of local {\\tt SGD} methods. Our first contribution is establishing the first lower bounds for this formulation, for both the communication complexity and the local oracle complexity. Our second contribution is the design of several optimal methods matching these lower bounds in almost all regimes. These are the first provably optimal methods for personalized federated learning. Our opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02372","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/2010.02372/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-05T01:40:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F35OF5PRS4nALsyf1hKlHrpeeX1JqmQfx/4bkRNrNJu/3F6O5MSB4nkvLE/5XdaD7IW9CoyrEPYV5OaESTrqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:45:56.858359Z"},"content_sha256":"c8953b4069a794afc490d6410b66ee7c186d4b0b7ee642f0ae5063fdcc8308c9","schema_version":"1.0","event_id":"sha256:c8953b4069a794afc490d6410b66ee7c186d4b0b7ee642f0ae5063fdcc8308c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/bundle.json","state_url":"https://pith.science/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/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-04T15:45:56Z","links":{"resolver":"https://pith.science/pith/WDA364XJOQYKQ4HEGDVFSEYL5E","bundle":"https://pith.science/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/bundle.json","state":"https://pith.science/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WDA364XJOQYKQ4HEGDVFSEYL5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WDA364XJOQYKQ4HEGDVFSEYL5E","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":"dd7fc9e397f897204fd5d5bf92fa31eb95751b12667ed9149bbe5a7577f3a132","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T22:29:51Z","title_canon_sha256":"c1323e8330d5e5232b7a7a478558a93e45c700feedba656ab63fc77af4ede5fc"},"schema_version":"1.0","source":{"id":"2010.02372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.02372","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"arxiv_version","alias_value":"2010.02372v1","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.02372","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_12","alias_value":"WDA364XJOQYK","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_16","alias_value":"WDA364XJOQYKQ4HE","created_at":"2026-07-05T01:40:49Z"},{"alias_kind":"pith_short_8","alias_value":"WDA364XJ","created_at":"2026-07-05T01:40:49Z"}],"graph_snapshots":[{"event_id":"sha256:c8953b4069a794afc490d6410b66ee7c186d4b0b7ee642f0ae5063fdcc8308c9","target":"graph","created_at":"2026-07-05T01:40:49Z","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/2010.02372/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider the optimization formulation of personalized federated learning recently introduced by Hanzely and Richt\\'arik (2020) which was shown to give an alternative explanation to the workings of local {\\tt SGD} methods. Our first contribution is establishing the first lower bounds for this formulation, for both the communication complexity and the local oracle complexity. Our second contribution is the design of several optimal methods matching these lower bounds in almost all regimes. These are the first provably optimal methods for personalized federated learning. Our opti","authors_text":"Filip Hanzely, Peter Richt\\'arik, Samuel Horv\\'ath, Slavom\\'ir Hanzely","cross_cats":["cs.DC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T22:29:51Z","title":"Lower Bounds and Optimal Algorithms for Personalized Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.02372","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:686ce66f81e2db253856169c1f452dac941a36749fc2de4755a725f740cb8a01","target":"record","created_at":"2026-07-05T01:40:49Z","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":"dd7fc9e397f897204fd5d5bf92fa31eb95751b12667ed9149bbe5a7577f3a132","cross_cats_sorted":["cs.DC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-05T22:29:51Z","title_canon_sha256":"c1323e8330d5e5232b7a7a478558a93e45c700feedba656ab63fc77af4ede5fc"},"schema_version":"1.0","source":{"id":"2010.02372","kind":"arxiv","version":1}},"canonical_sha256":"b0c1bf72e97430a870e430ea59130be92ba63207cbbedb76209d2a594ad6f485","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0c1bf72e97430a870e430ea59130be92ba63207cbbedb76209d2a594ad6f485","first_computed_at":"2026-07-05T01:40:49.128505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:40:49.128505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H1b3t6AeLr3uBVWlsPwS1bajBnFBUmAnFPoMsOvyH3q4CrJtwswLyRmgaMabf/FneLcwwEv7u4jvUAzhN0R+Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:40:49.128871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.02372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:686ce66f81e2db253856169c1f452dac941a36749fc2de4755a725f740cb8a01","sha256:c8953b4069a794afc490d6410b66ee7c186d4b0b7ee642f0ae5063fdcc8308c9"],"state_sha256":"186bbd32213fa103320fe223896c50e065a0459d7837002094d0a4d7c939489e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNfdL8j/zyn/rYoh4zyNyj6XrKy2CECtvBSzFQWOruNJ+5js2GZ9Oo/jlGCHzF+tQeW3HKaoK5oV6vRgqCckBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:45:56.869486Z","bundle_sha256":"7a49ed0a33f4139838bb1f50818a51fd716b2bb462bf045617242b221dfc9799"}}