{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZAYTCIKC26QSWYWT56HRIBYCOA","short_pith_number":"pith:ZAYTCIKC","schema_version":"1.0","canonical_sha256":"c831312142d7a12b62d3ef8f1407027005bacf50099bbe074641ac622a482501","source":{"kind":"arxiv","id":"1802.10116","version":3},"attestation_state":"computed","paper":{"title":"Generalized Byzantine-tolerant SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Cong Xie, Indranil Gupta, Oluwasanmi Koyejo","submitted_at":"2018-02-27T19:06:15Z","abstract_excerpt":"We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilience properties of these aggregation rules. Empirical analysis shows that the proposed techniques outperform current approaches for realistic use cases and Byzantine attack scenarios."},"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":"1802.10116","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-27T19:06:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a3d8688322f88710972591c0d3139a025ad3e87bbfec15fc454f61e412db6f5a","abstract_canon_sha256":"e9ff9f0b7b1a99ba791d74735f18b9f1fe80d90601ce74ef7b86223a6c124761"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:13.547496Z","signature_b64":"t1wLTGOT7zfW479L8UcoSXbJURiePBf6qUPIm/ZN2FhJKYDWJhr5QHecJxvTXQDosTrQysCjsojaFJnURdEBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c831312142d7a12b62d3ef8f1407027005bacf50099bbe074641ac622a482501","last_reissued_at":"2026-05-18T00:20:13.546991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:13.546991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Byzantine-tolerant SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Cong Xie, Indranil Gupta, Oluwasanmi Koyejo","submitted_at":"2018-02-27T19:06:15Z","abstract_excerpt":"We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilience properties of these aggregation rules. Empirical analysis shows that the proposed techniques outperform current approaches for realistic use cases and Byzantine attack scenarios."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10116","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1802.10116","created_at":"2026-05-18T00:20:13.547067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10116v3","created_at":"2026-05-18T00:20:13.547067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10116","created_at":"2026-05-18T00:20:13.547067+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAYTCIKC26QS","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAYTCIKC26QSWYWT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAYTCIKC","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.23318","citing_title":"Generalized Rank Regression","ref_index":102,"is_internal_anchor":true},{"citing_arxiv_id":"2502.07977","citing_title":"RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15887","citing_title":"Practical Validity Conditions for Byzantine-Tolerant Federated Learning","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2604.10179","citing_title":"Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA","json":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA.json","graph_json":"https://pith.science/api/pith-number/ZAYTCIKC26QSWYWT56HRIBYCOA/graph.json","events_json":"https://pith.science/api/pith-number/ZAYTCIKC26QSWYWT56HRIBYCOA/events.json","paper":"https://pith.science/paper/ZAYTCIKC"},"agent_actions":{"view_html":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA","download_json":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA.json","view_paper":"https://pith.science/paper/ZAYTCIKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10116&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAYTCIKC26QSWYWT56HRIBYCOA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAYTCIKC26QSWYWT56HRIBYCOA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA/action/storage_attestation","attest_author":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA/action/author_attestation","sign_citation":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA/action/citation_signature","submit_replication":"https://pith.science/pith/ZAYTCIKC26QSWYWT56HRIBYCOA/action/replication_record"}},"created_at":"2026-05-18T00:20:13.547067+00:00","updated_at":"2026-05-18T00:20:13.547067+00:00"}