{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JPRXDRTNVHRAZASDVCNVYGPSYA","short_pith_number":"pith:JPRXDRTN","schema_version":"1.0","canonical_sha256":"4be371c66da9e20c8243a89b5c19f2c005e8ab58988a5f19d789a3e973a1813c","source":{"kind":"arxiv","id":"2506.13612","version":1},"attestation_state":"computed","paper":{"title":"EBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC"],"primary_cat":"cs.CR","authors_text":"Cheng Huang, Haiyong Bao, Hao Pan, Hong-Ning Dai, Menghong Guan, Zhiqiang Li","submitted_at":"2025-06-16T15:39:10Z","abstract_excerpt":"Despite federated learning (FL)'s potential in collaborative learning, its performance has deteriorated due to the data heterogeneity of distributed users. Recently, clustered federated learning (CFL) has emerged to address this challenge by partitioning users into clusters according to their similarity. However, CFL faces difficulties in training when users are unwilling to share their cluster identities due to privacy concerns. To address these issues, we present an innovative Efficient and Robust Secure Aggregation scheme for CFL, dubbed EBS-CFL. The proposed EBS-CFL supports effectively tr"},"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":"2506.13612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-06-16T15:39:10Z","cross_cats_sorted":["cs.AI","cs.DC"],"title_canon_sha256":"6ed51689284444c93bf64c7b5101728eca47cf62c3b0371b6a10cb7f372b6fab","abstract_canon_sha256":"1852019e8dcb1ec0a5d51bb790c88a1659658810b09cd4472bba6c460319aa87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:23.419777Z","signature_b64":"pjvQTjA+BWl+zoe8EghLXnHLJVdFLzeuGKNK6i2Q8t7awLaz6wZo0m4oYlErch4DVhxUQ2xWvXqEYRFoyeeJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4be371c66da9e20c8243a89b5c19f2c005e8ab58988a5f19d789a3e973a1813c","last_reissued_at":"2026-07-05T11:22:23.419326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:23.419326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EBS-CFL: Efficient and Byzantine-robust Secure Clustered Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC"],"primary_cat":"cs.CR","authors_text":"Cheng Huang, Haiyong Bao, Hao Pan, Hong-Ning Dai, Menghong Guan, Zhiqiang Li","submitted_at":"2025-06-16T15:39:10Z","abstract_excerpt":"Despite federated learning (FL)'s potential in collaborative learning, its performance has deteriorated due to the data heterogeneity of distributed users. Recently, clustered federated learning (CFL) has emerged to address this challenge by partitioning users into clusters according to their similarity. However, CFL faces difficulties in training when users are unwilling to share their cluster identities due to privacy concerns. To address these issues, we present an innovative Efficient and Robust Secure Aggregation scheme for CFL, dubbed EBS-CFL. The proposed EBS-CFL supports effectively tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.13612","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/2506.13612/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":"2506.13612","created_at":"2026-07-05T11:22:23.419386+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.13612v1","created_at":"2026-07-05T11:22:23.419386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.13612","created_at":"2026-07-05T11:22:23.419386+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPRXDRTNVHRA","created_at":"2026-07-05T11:22:23.419386+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPRXDRTNVHRAZASD","created_at":"2026-07-05T11:22:23.419386+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPRXDRTN","created_at":"2026-07-05T11:22:23.419386+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA","json":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA.json","graph_json":"https://pith.science/api/pith-number/JPRXDRTNVHRAZASDVCNVYGPSYA/graph.json","events_json":"https://pith.science/api/pith-number/JPRXDRTNVHRAZASDVCNVYGPSYA/events.json","paper":"https://pith.science/paper/JPRXDRTN"},"agent_actions":{"view_html":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA","download_json":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA.json","view_paper":"https://pith.science/paper/JPRXDRTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.13612&json=true","fetch_graph":"https://pith.science/api/pith-number/JPRXDRTNVHRAZASDVCNVYGPSYA/graph.json","fetch_events":"https://pith.science/api/pith-number/JPRXDRTNVHRAZASDVCNVYGPSYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA/action/storage_attestation","attest_author":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA/action/author_attestation","sign_citation":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA/action/citation_signature","submit_replication":"https://pith.science/pith/JPRXDRTNVHRAZASDVCNVYGPSYA/action/replication_record"}},"created_at":"2026-07-05T11:22:23.419386+00:00","updated_at":"2026-07-05T11:22:23.419386+00:00"}