{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I2XQ3PVKCA5YPH3IVQ2TC7TTCV","short_pith_number":"pith:I2XQ3PVK","schema_version":"1.0","canonical_sha256":"46af0dbeaa103b879f68ac35317e73154e4a6b986afc72c0c18a3912e38329fb","source":{"kind":"arxiv","id":"1805.09682","version":1},"attestation_state":"computed","paper":{"title":"Phocas: dimensional Byzantine-resilient stochastic gradient descent","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-05-23T09:25:48Z","abstract_excerpt":"We propose a novel robust aggregation rule 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 of the proposed 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":"1805.09682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-23T09:25:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d20db7d159fb040743233005eba8ed7060ee47ac7657ba7e987ad828a7332463","abstract_canon_sha256":"8255b90dfaec7056617d01d3ee092faf82f7d66a121cca3d3fd5e28fafedc8f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:03.164889Z","signature_b64":"Zfj9JLR/c3RPtO41d68+wpuyOjxc19z67XE5Ga8O7M/q2Xs98c9nYEoGyfLUu8yO7hLT7tAjovd3PDLU/EwdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46af0dbeaa103b879f68ac35317e73154e4a6b986afc72c0c18a3912e38329fb","last_reissued_at":"2026-05-18T00:15:03.164131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:03.164131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phocas: dimensional Byzantine-resilient stochastic gradient descent","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-05-23T09:25:48Z","abstract_excerpt":"We propose a novel robust aggregation rule 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 of the proposed 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":"1805.09682","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":""},"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":"1805.09682","created_at":"2026-05-18T00:15:03.164270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09682v1","created_at":"2026-05-18T00:15:03.164270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09682","created_at":"2026-05-18T00:15:03.164270+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2XQ3PVKCA5Y","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2XQ3PVKCA5YPH3I","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2XQ3PVK","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07977","citing_title":"RESIST: Resilient Decentralized Learning Using Consensus Gradient Descent","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV","json":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV.json","graph_json":"https://pith.science/api/pith-number/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/graph.json","events_json":"https://pith.science/api/pith-number/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/events.json","paper":"https://pith.science/paper/I2XQ3PVK"},"agent_actions":{"view_html":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV","download_json":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV.json","view_paper":"https://pith.science/paper/I2XQ3PVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09682&json=true","fetch_graph":"https://pith.science/api/pith-number/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/graph.json","fetch_events":"https://pith.science/api/pith-number/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/action/storage_attestation","attest_author":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/action/author_attestation","sign_citation":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/action/citation_signature","submit_replication":"https://pith.science/pith/I2XQ3PVKCA5YPH3IVQ2TC7TTCV/action/replication_record"}},"created_at":"2026-05-18T00:15:03.164270+00:00","updated_at":"2026-05-18T00:15:03.164270+00:00"}