{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4T6GPG2CVTSQ6B4YLVYQWM2ER7","short_pith_number":"pith:4T6GPG2C","schema_version":"1.0","canonical_sha256":"e4fc679b42ace50f07985d710b33448ff32b7567cfcb7fe1fa798d943cc70586","source":{"kind":"arxiv","id":"2007.03767","version":4},"attestation_state":"computed","paper":{"title":"Defending against Backdoors in Federated Learning with Robust Learning Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Murat Kantarcioglu, Mustafa Safa Ozdayi, Yulia R. Gel","submitted_at":"2020-07-07T23:38:35Z","abstract_excerpt":"Federated learning (FL) allows a set of agents to collaboratively train a model without sharing their potentially sensitive data. This makes FL suitable for privacy-preserving applications. At the same time, FL is susceptible to adversarial attacks due to decentralized and unvetted data. One important line of attacks against FL is the backdoor attacks. In a backdoor attack, an adversary tries to embed a backdoor functionality to the model during training that can later be activated to cause a desired misclassification. To prevent backdoor attacks, we propose a lightweight defense that requires"},"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":"2007.03767","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-07T23:38:35Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"b7ac7b8e7a50076168098d25c58c2201f0b8c0fe7f2b58d8c6495f138f9c886c","abstract_canon_sha256":"2bc4a19d7ab3b189e184aa44254cfe909dbd459ea7029c351831b16c7c4f1fcb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:52.359176Z","signature_b64":"qW0wH/iI4BGAG2BJMII4GP8ItstygW0IkoAy8VI26DdR6QP0hDYxMOovisYN3Fq07PkvKQ6bWwvRJZMy/YLiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4fc679b42ace50f07985d710b33448ff32b7567cfcb7fe1fa798d943cc70586","last_reissued_at":"2026-07-05T03:01:52.358702Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:52.358702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Defending against Backdoors in Federated Learning with Robust Learning Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Murat Kantarcioglu, Mustafa Safa Ozdayi, Yulia R. Gel","submitted_at":"2020-07-07T23:38:35Z","abstract_excerpt":"Federated learning (FL) allows a set of agents to collaboratively train a model without sharing their potentially sensitive data. This makes FL suitable for privacy-preserving applications. At the same time, FL is susceptible to adversarial attacks due to decentralized and unvetted data. One important line of attacks against FL is the backdoor attacks. In a backdoor attack, an adversary tries to embed a backdoor functionality to the model during training that can later be activated to cause a desired misclassification. To prevent backdoor attacks, we propose a lightweight defense that requires"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.03767","kind":"arxiv","version":4},"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/2007.03767/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":"2007.03767","created_at":"2026-07-05T03:01:52.358758+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.03767v4","created_at":"2026-07-05T03:01:52.358758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.03767","created_at":"2026-07-05T03:01:52.358758+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T6GPG2CVTSQ","created_at":"2026-07-05T03:01:52.358758+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T6GPG2CVTSQ6B4Y","created_at":"2026-07-05T03:01:52.358758+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T6GPG2C","created_at":"2026-07-05T03:01:52.358758+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08746","citing_title":"Stealth by Conformity: Evading Robust Aggregation through Adaptive Poisoning","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7","json":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7.json","graph_json":"https://pith.science/api/pith-number/4T6GPG2CVTSQ6B4YLVYQWM2ER7/graph.json","events_json":"https://pith.science/api/pith-number/4T6GPG2CVTSQ6B4YLVYQWM2ER7/events.json","paper":"https://pith.science/paper/4T6GPG2C"},"agent_actions":{"view_html":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7","download_json":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7.json","view_paper":"https://pith.science/paper/4T6GPG2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.03767&json=true","fetch_graph":"https://pith.science/api/pith-number/4T6GPG2CVTSQ6B4YLVYQWM2ER7/graph.json","fetch_events":"https://pith.science/api/pith-number/4T6GPG2CVTSQ6B4YLVYQWM2ER7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7/action/storage_attestation","attest_author":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7/action/author_attestation","sign_citation":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7/action/citation_signature","submit_replication":"https://pith.science/pith/4T6GPG2CVTSQ6B4YLVYQWM2ER7/action/replication_record"}},"created_at":"2026-07-05T03:01:52.358758+00:00","updated_at":"2026-07-05T03:01:52.358758+00:00"}