{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XVMQFACJMHKRIWTPLJ4BW5WNGV","short_pith_number":"pith:XVMQFACJ","schema_version":"1.0","canonical_sha256":"bd5902804961d5145a6f5a781b76cd357b76d557a69b94c613f44df0be9699c8","source":{"kind":"arxiv","id":"2210.06597","version":2},"attestation_state":"computed","paper":{"title":"Find Your Friends: Personalized Federated Learning with the Right Collaborators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Brendan Leigh Ross, Jesse C. Cresswell, Junfeng Wen, Yenson Lau, Yi Sui","submitted_at":"2022-10-12T21:29:22Z","abstract_excerpt":"In the traditional federated learning setting, a central server coordinates a network of clients to train one global model. However, the global model may serve many clients poorly due to data heterogeneity. Moreover, there may not exist a trusted central party that can coordinate the clients to ensure that each of them can benefit from others. To address these concerns, we present a novel decentralized framework, FedeRiCo, where each client can learn as much or as little from other clients as is optimal for its local data distribution. Based on expectation-maximization, FedeRiCo estimates the "},"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":"2210.06597","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-12T21:29:22Z","cross_cats_sorted":[],"title_canon_sha256":"5c8f04248bf06e1834a48f961d15bfa9960cea793c5580b5fc953fa120c0024e","abstract_canon_sha256":"305902cc308f04e9a18c347679176621db3126230e60bd98bb504f469c3f10c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:05.261821Z","signature_b64":"x4Ie6zAs3+gR7BAjzFgve6JlTi+HiP+Hrwh6cL1kZyQoSGULi8Cr+J3f1sB1UjDzvZAOfc4QeRwWuSGgm/h9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5902804961d5145a6f5a781b76cd357b76d557a69b94c613f44df0be9699c8","last_reissued_at":"2026-07-05T05:07:05.261297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:05.261297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Find Your Friends: Personalized Federated Learning with the Right Collaborators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Brendan Leigh Ross, Jesse C. Cresswell, Junfeng Wen, Yenson Lau, Yi Sui","submitted_at":"2022-10-12T21:29:22Z","abstract_excerpt":"In the traditional federated learning setting, a central server coordinates a network of clients to train one global model. However, the global model may serve many clients poorly due to data heterogeneity. Moreover, there may not exist a trusted central party that can coordinate the clients to ensure that each of them can benefit from others. To address these concerns, we present a novel decentralized framework, FedeRiCo, where each client can learn as much or as little from other clients as is optimal for its local data distribution. Based on expectation-maximization, FedeRiCo estimates the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.06597","kind":"arxiv","version":2},"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/2210.06597/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":"2210.06597","created_at":"2026-07-05T05:07:05.261378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.06597v2","created_at":"2026-07-05T05:07:05.261378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.06597","created_at":"2026-07-05T05:07:05.261378+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVMQFACJMHKR","created_at":"2026-07-05T05:07:05.261378+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVMQFACJMHKRIWTP","created_at":"2026-07-05T05:07:05.261378+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVMQFACJ","created_at":"2026-07-05T05:07:05.261378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.19279","citing_title":"S-VOTE: Similarity-based Voting for Client Selection in Decentralized Federated Learning","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV","json":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV.json","graph_json":"https://pith.science/api/pith-number/XVMQFACJMHKRIWTPLJ4BW5WNGV/graph.json","events_json":"https://pith.science/api/pith-number/XVMQFACJMHKRIWTPLJ4BW5WNGV/events.json","paper":"https://pith.science/paper/XVMQFACJ"},"agent_actions":{"view_html":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV","download_json":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV.json","view_paper":"https://pith.science/paper/XVMQFACJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.06597&json=true","fetch_graph":"https://pith.science/api/pith-number/XVMQFACJMHKRIWTPLJ4BW5WNGV/graph.json","fetch_events":"https://pith.science/api/pith-number/XVMQFACJMHKRIWTPLJ4BW5WNGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV/action/storage_attestation","attest_author":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV/action/author_attestation","sign_citation":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV/action/citation_signature","submit_replication":"https://pith.science/pith/XVMQFACJMHKRIWTPLJ4BW5WNGV/action/replication_record"}},"created_at":"2026-07-05T05:07:05.261378+00:00","updated_at":"2026-07-05T05:07:05.261378+00:00"}