{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YAWNNEIULI5BREEWEYP5XQORBA","short_pith_number":"pith:YAWNNEIU","schema_version":"1.0","canonical_sha256":"c02cd691145a3a189096261fdbc1d10837b3b9f25d30588a421150cc85900713","source":{"kind":"arxiv","id":"1804.10140","version":3},"attestation_state":"computed","paper":{"title":"Securing Distributed Gradient Descent in High Dimensional Statistical Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Jiaming Xu, Lili Su","submitted_at":"2018-04-26T16:09:51Z","abstract_excerpt":"We consider unreliable distributed learning systems wherein the training data is kept confidential by external workers, and the learner has to interact closely with those workers to train a model. In particular, we assume that there exists a system adversary that can adaptively compromise some workers; the compromised workers deviate from their local designed specifications by sending out arbitrarily malicious messages.\n  We assume in each communication round, up to $q$ out of the $m$ workers suffer Byzantine faults. Each worker keeps a local sample of size $n$ and the total sample size is $N="},"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":"1804.10140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T16:09:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6d5e352c0ae7124fc05ff86043a8d3dacc6e940658e3f8700f6fd68d5783ca64","abstract_canon_sha256":"61c5013b729c8a301a783fa13e8d5ecef5d5e18b4da831642a6af61b63dee146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:41.908243Z","signature_b64":"EdANpplLe3eYC1OS1QqHztum4W3QTQme+id5cgFe+g/G/GeHuxyUg6dhRN581xS9/8nq4odRcVjw0zRupENHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02cd691145a3a189096261fdbc1d10837b3b9f25d30588a421150cc85900713","last_reissued_at":"2026-05-17T23:46:41.907551Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:41.907551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Securing Distributed Gradient Descent in High Dimensional Statistical Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Jiaming Xu, Lili Su","submitted_at":"2018-04-26T16:09:51Z","abstract_excerpt":"We consider unreliable distributed learning systems wherein the training data is kept confidential by external workers, and the learner has to interact closely with those workers to train a model. In particular, we assume that there exists a system adversary that can adaptively compromise some workers; the compromised workers deviate from their local designed specifications by sending out arbitrarily malicious messages.\n  We assume in each communication round, up to $q$ out of the $m$ workers suffer Byzantine faults. Each worker keeps a local sample of size $n$ and the total sample size is $N="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10140","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":"1804.10140","created_at":"2026-05-17T23:46:41.907646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10140v3","created_at":"2026-05-17T23:46:41.907646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10140","created_at":"2026-05-17T23:46:41.907646+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAWNNEIULI5B","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAWNNEIULI5BREEW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAWNNEIU","created_at":"2026-05-18T12:33:04.347982+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":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA","json":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA.json","graph_json":"https://pith.science/api/pith-number/YAWNNEIULI5BREEWEYP5XQORBA/graph.json","events_json":"https://pith.science/api/pith-number/YAWNNEIULI5BREEWEYP5XQORBA/events.json","paper":"https://pith.science/paper/YAWNNEIU"},"agent_actions":{"view_html":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA","download_json":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA.json","view_paper":"https://pith.science/paper/YAWNNEIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10140&json=true","fetch_graph":"https://pith.science/api/pith-number/YAWNNEIULI5BREEWEYP5XQORBA/graph.json","fetch_events":"https://pith.science/api/pith-number/YAWNNEIULI5BREEWEYP5XQORBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA/action/storage_attestation","attest_author":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA/action/author_attestation","sign_citation":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA/action/citation_signature","submit_replication":"https://pith.science/pith/YAWNNEIULI5BREEWEYP5XQORBA/action/replication_record"}},"created_at":"2026-05-17T23:46:41.907646+00:00","updated_at":"2026-05-17T23:46:41.907646+00:00"}