{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:A6XEVBXMRC4NA7JWF3MNBHPGLP","short_pith_number":"pith:A6XEVBXM","schema_version":"1.0","canonical_sha256":"07ae4a86ec88b8d07d362ed8d09de65be1503e88e232d41390f8368f95a776c1","source":{"kind":"arxiv","id":"2008.03371","version":1},"attestation_state":"computed","paper":{"title":"LotteryFL: Personalized and Communication-Efficient Federated Learning with Lottery Ticket Hypothesis on Non-IID Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Binghui Wang, Hai Li, Jingwei Sun, Lin Duan, Sicheng Li, Yiran Chen","submitted_at":"2020-08-07T20:45:12Z","abstract_excerpt":"Federated learning is a popular distributed machine learning paradigm with enhanced privacy. Its primary goal is learning a global model that offers good performance for the participants as many as possible. The technology is rapidly advancing with many unsolved challenges, among which statistical heterogeneity (i.e., non-IID) and communication efficiency are two critical ones that hinder the development of federated learning. In this work, we propose LotteryFL -- a personalized and communication-efficient federated learning framework via exploiting the Lottery Ticket hypothesis. In LotteryFL,"},"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":"2008.03371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-07T20:45:12Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"3e3bdda86b440ece6a6d2b8cf314b19fbdd5b8fe2aa1b406b35391aa464fb351","abstract_canon_sha256":"80d17a0bbb41fc43c32a4669f99e6f9e5e95b9c7090022f66a60ea99bbe38b2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:41.108378Z","signature_b64":"pvFIjLjTI2ZjL8rkNNza7ysGLxy9mPgIEH86m+rO4ZRXBEJrBphtttqHLQL2/2tr+1YStDLEYfgEovHhzaW+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ae4a86ec88b8d07d362ed8d09de65be1503e88e232d41390f8368f95a776c1","last_reissued_at":"2026-07-05T01:25:41.107963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:41.107963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LotteryFL: Personalized and Communication-Efficient Federated Learning with Lottery Ticket Hypothesis on Non-IID Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ang Li, Binghui Wang, Hai Li, Jingwei Sun, Lin Duan, Sicheng Li, Yiran Chen","submitted_at":"2020-08-07T20:45:12Z","abstract_excerpt":"Federated learning is a popular distributed machine learning paradigm with enhanced privacy. Its primary goal is learning a global model that offers good performance for the participants as many as possible. The technology is rapidly advancing with many unsolved challenges, among which statistical heterogeneity (i.e., non-IID) and communication efficiency are two critical ones that hinder the development of federated learning. In this work, we propose LotteryFL -- a personalized and communication-efficient federated learning framework via exploiting the Lottery Ticket hypothesis. In LotteryFL,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03371","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/2008.03371/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":"2008.03371","created_at":"2026-07-05T01:25:41.108020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.03371v1","created_at":"2026-07-05T01:25:41.108020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03371","created_at":"2026-07-05T01:25:41.108020+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6XEVBXMRC4N","created_at":"2026-07-05T01:25:41.108020+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6XEVBXMRC4NA7JW","created_at":"2026-07-05T01:25:41.108020+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6XEVBXM","created_at":"2026-07-05T01:25:41.108020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15573","citing_title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","ref_index":97,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25414","citing_title":"Rethinking Parameter Sharing for LLM Fine-Tuning with Multiple LoRAs","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11278","citing_title":"Representation-Aligned Multi-Scale Personalization for Federated Learning","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP","json":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP.json","graph_json":"https://pith.science/api/pith-number/A6XEVBXMRC4NA7JWF3MNBHPGLP/graph.json","events_json":"https://pith.science/api/pith-number/A6XEVBXMRC4NA7JWF3MNBHPGLP/events.json","paper":"https://pith.science/paper/A6XEVBXM"},"agent_actions":{"view_html":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP","download_json":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP.json","view_paper":"https://pith.science/paper/A6XEVBXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.03371&json=true","fetch_graph":"https://pith.science/api/pith-number/A6XEVBXMRC4NA7JWF3MNBHPGLP/graph.json","fetch_events":"https://pith.science/api/pith-number/A6XEVBXMRC4NA7JWF3MNBHPGLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP/action/storage_attestation","attest_author":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP/action/author_attestation","sign_citation":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP/action/citation_signature","submit_replication":"https://pith.science/pith/A6XEVBXMRC4NA7JWF3MNBHPGLP/action/replication_record"}},"created_at":"2026-07-05T01:25:41.108020+00:00","updated_at":"2026-07-05T01:25:41.108020+00:00"}