{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:55TL3NEKEYRIDGI3SSJMPONLLE","short_pith_number":"pith:55TL3NEK","schema_version":"1.0","canonical_sha256":"ef66bdb48a262281991b9492c7b9ab593b358f526b4ad951a29b446d1a03d792","source":{"kind":"arxiv","id":"2011.10464","version":2},"attestation_state":"computed","paper":{"title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lingjuan Lyu, Xinyi Xu","submitted_at":"2020-11-20T15:52:45Z","abstract_excerpt":"Federated learning (FL) is an emerging practical framework for effective and scalable machine learning among multiple participants, such as end users, organizations and companies. However, most existing FL or distributed learning frameworks have not well addressed two important issues together: collaborative fairness and adversarial robustness (e.g. free-riders and malicious participants). In conventional FL, all participants receive the global model (equal rewards), which might be unfair to the high-contributing participants. Furthermore, due to the lack of a safeguard mechanism, free-riders "},"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":"2011.10464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-20T15:52:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"38d461229291056f1ffd3b9a82dade0b4745c9c4de6810b2f09f2c7d07a0c803","abstract_canon_sha256":"3e61b464595446f1a5e8cd9078257112bc0cccb162c4f77055bfc73b63d773f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:47.028990Z","signature_b64":"Zh098/jYJH5BIelNCo+tkIH1tgBVEQrUgm/uWpiuL9QJV8/mNP8OmIpkacyz6nl5oARY2guMvPV++EorK+xpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef66bdb48a262281991b9492c7b9ab593b358f526b4ad951a29b446d1a03d792","last_reissued_at":"2026-07-05T03:00:47.028569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:47.028569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reputation Mechanism Is All You Need: Collaborative Fairness and Adversarial Robustness in Federated Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lingjuan Lyu, Xinyi Xu","submitted_at":"2020-11-20T15:52:45Z","abstract_excerpt":"Federated learning (FL) is an emerging practical framework for effective and scalable machine learning among multiple participants, such as end users, organizations and companies. However, most existing FL or distributed learning frameworks have not well addressed two important issues together: collaborative fairness and adversarial robustness (e.g. free-riders and malicious participants). In conventional FL, all participants receive the global model (equal rewards), which might be unfair to the high-contributing participants. Furthermore, due to the lack of a safeguard mechanism, free-riders "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.10464","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/2011.10464/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":"2011.10464","created_at":"2026-07-05T03:00:47.028628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.10464v2","created_at":"2026-07-05T03:00:47.028628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.10464","created_at":"2026-07-05T03:00:47.028628+00:00"},{"alias_kind":"pith_short_12","alias_value":"55TL3NEKEYRI","created_at":"2026-07-05T03:00:47.028628+00:00"},{"alias_kind":"pith_short_16","alias_value":"55TL3NEKEYRIDGI3","created_at":"2026-07-05T03:00:47.028628+00:00"},{"alias_kind":"pith_short_8","alias_value":"55TL3NEK","created_at":"2026-07-05T03:00:47.028628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15573","citing_title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04611","citing_title":"Dynamic Free-Rider Detection in Federated Learning via Simulated Attack Patterns","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE","json":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE.json","graph_json":"https://pith.science/api/pith-number/55TL3NEKEYRIDGI3SSJMPONLLE/graph.json","events_json":"https://pith.science/api/pith-number/55TL3NEKEYRIDGI3SSJMPONLLE/events.json","paper":"https://pith.science/paper/55TL3NEK"},"agent_actions":{"view_html":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE","download_json":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE.json","view_paper":"https://pith.science/paper/55TL3NEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.10464&json=true","fetch_graph":"https://pith.science/api/pith-number/55TL3NEKEYRIDGI3SSJMPONLLE/graph.json","fetch_events":"https://pith.science/api/pith-number/55TL3NEKEYRIDGI3SSJMPONLLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE/action/storage_attestation","attest_author":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE/action/author_attestation","sign_citation":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE/action/citation_signature","submit_replication":"https://pith.science/pith/55TL3NEKEYRIDGI3SSJMPONLLE/action/replication_record"}},"created_at":"2026-07-05T03:00:47.028628+00:00","updated_at":"2026-07-05T03:00:47.028628+00:00"}