{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SHZXZZSH3DNN3KZSNJJ6S4RWAT","short_pith_number":"pith:SHZXZZSH","schema_version":"1.0","canonical_sha256":"91f37ce647d8daddab326a53e9723604d1d9aced565eb233bdaad11de427988e","source":{"kind":"arxiv","id":"2409.06805","version":1},"attestation_state":"computed","paper":{"title":"Personalized Federated Learning Techniques: Empirical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Ahmad Faraz Khan, Ali Anwar, Azal Ahmad Khan, Haider Ali","submitted_at":"2024-09-10T18:16:28Z","abstract_excerpt":"Personalized Federated Learning (pFL) holds immense promise for tailoring machine learning models to individual users while preserving data privacy. However, achieving optimal performance in pFL often requires a careful balancing act between memory overhead costs and model accuracy. This paper delves into the trade-offs inherent in pFL, offering valuable insights for selecting the right algorithms for diverse real-world scenarios. We empirically evaluate ten prominent pFL techniques across various datasets and data splits, uncovering significant differences in their performance. Our study reve"},"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":"2409.06805","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-10T18:16:28Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"09e27cf38c98440e51408752f4a11d4eca898439ac0be76bd359b3040263b8ec","abstract_canon_sha256":"e293d8817e624c530cc85748c84bac96cece4f7a76950142731fa9c283397d36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:05:41.402820Z","signature_b64":"XUz7D5w/kFmgp9Z+AMMBV66VTMBfLR/Q2y0zfq/1YjXGVOpW2YgXLgMVgWci8xD9+Q3wyWKuDv3AIBb5b7m0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91f37ce647d8daddab326a53e9723604d1d9aced565eb233bdaad11de427988e","last_reissued_at":"2026-07-05T09:05:41.402408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:05:41.402408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Personalized Federated Learning Techniques: Empirical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.LG","authors_text":"Ahmad Faraz Khan, Ali Anwar, Azal Ahmad Khan, Haider Ali","submitted_at":"2024-09-10T18:16:28Z","abstract_excerpt":"Personalized Federated Learning (pFL) holds immense promise for tailoring machine learning models to individual users while preserving data privacy. However, achieving optimal performance in pFL often requires a careful balancing act between memory overhead costs and model accuracy. This paper delves into the trade-offs inherent in pFL, offering valuable insights for selecting the right algorithms for diverse real-world scenarios. We empirically evaluate ten prominent pFL techniques across various datasets and data splits, uncovering significant differences in their performance. Our study reve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.06805","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/2409.06805/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":"2409.06805","created_at":"2026-07-05T09:05:41.402464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.06805v1","created_at":"2026-07-05T09:05:41.402464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.06805","created_at":"2026-07-05T09:05:41.402464+00:00"},{"alias_kind":"pith_short_12","alias_value":"SHZXZZSH3DNN","created_at":"2026-07-05T09:05:41.402464+00:00"},{"alias_kind":"pith_short_16","alias_value":"SHZXZZSH3DNN3KZS","created_at":"2026-07-05T09:05:41.402464+00:00"},{"alias_kind":"pith_short_8","alias_value":"SHZXZZSH","created_at":"2026-07-05T09:05:41.402464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22815","citing_title":"Memory as a Service (MaaS): Purpose-Bound Memory Mediation for Cooperative Agents","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT","json":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT.json","graph_json":"https://pith.science/api/pith-number/SHZXZZSH3DNN3KZSNJJ6S4RWAT/graph.json","events_json":"https://pith.science/api/pith-number/SHZXZZSH3DNN3KZSNJJ6S4RWAT/events.json","paper":"https://pith.science/paper/SHZXZZSH"},"agent_actions":{"view_html":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT","download_json":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT.json","view_paper":"https://pith.science/paper/SHZXZZSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.06805&json=true","fetch_graph":"https://pith.science/api/pith-number/SHZXZZSH3DNN3KZSNJJ6S4RWAT/graph.json","fetch_events":"https://pith.science/api/pith-number/SHZXZZSH3DNN3KZSNJJ6S4RWAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT/action/storage_attestation","attest_author":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT/action/author_attestation","sign_citation":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT/action/citation_signature","submit_replication":"https://pith.science/pith/SHZXZZSH3DNN3KZSNJJ6S4RWAT/action/replication_record"}},"created_at":"2026-07-05T09:05:41.402464+00:00","updated_at":"2026-07-05T09:05:41.402464+00:00"}