{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4NVBCJJV3JX3UF6XGGCVHK22DZ","short_pith_number":"pith:4NVBCJJV","schema_version":"1.0","canonical_sha256":"e36a112535da6fba17d7318553ab5a1e7b3cecfc4de2d543c10666270c2c7f37","source":{"kind":"arxiv","id":"2605.13283","version":1},"attestation_state":"computed","paper":{"title":"Byzantine-Robust Distributed Sparse Learning Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Local l1-regularized robust estimators plus server-side robust aggregation deliver non-asymptotic guarantees and near-optimal rates for Byzantine-robust distributed sparse learning.","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Kangqiang Li, Lixin Zhang, Yuxuan Wang","submitted_at":"2026-05-13T10:00:23Z","abstract_excerpt":"We revisit Byzantine robust distributed estimation for high-dimensional sparse linear models. By combining local $\\ell_1$-regularized robust estimation with robust aggregation at the server, the framework applies to pseudo-Huber regression, quantile regression, and sparse SVM. We show that the resulting estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient. Simulations confirm strong robustness in estimation, support recovery and classification accuracy under various Byzantine attacks."},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T10:00:23Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"eb725248b003ae8dc6463d1d1adc6f6045a9af5e82703a8fbb0149686cc8bbb4","abstract_canon_sha256":"38f83b0b65db508330450c6154e16ae0088efbc6bbbbaa224404af58d776a32e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:49.175726Z","signature_b64":"odVB/z2U0aoL7IgTjl8OaaK6GJ/KQcJScEfSyh8VycfCzyznTkXhcqh8TFO0ukHs0cfwYuG1P69iuoPWcwXIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e36a112535da6fba17d7318553ab5a1e7b3cecfc4de2d543c10666270c2c7f37","last_reissued_at":"2026-05-18T02:44:49.175230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:49.175230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine-Robust Distributed Sparse Learning Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Local l1-regularized robust estimators plus server-side robust aggregation deliver non-asymptotic guarantees and near-optimal rates for Byzantine-robust distributed sparse learning.","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Kangqiang Li, Lixin Zhang, Yuxuan Wang","submitted_at":"2026-05-13T10:00:23Z","abstract_excerpt":"We revisit Byzantine robust distributed estimation for high-dimensional sparse linear models. By combining local $\\ell_1$-regularized robust estimation with robust aggregation at the server, the framework applies to pseudo-Huber regression, quantile regression, and sparse SVM. We show that the resulting estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient. Simulations confirm strong robustness in estimation, support recovery and classification accuracy under various Byzantine attacks."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"the resulting estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"mild conditions on the data distribution, sparsity level, and fraction of Byzantine machines (standard but unspecified in abstract; typically requires bounded moments and Byzantine fraction below 1/2)","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Local L1-regularized robust estimators plus server-side robust aggregation achieve near-optimal rates for high-dimensional sparse learning under Byzantine attacks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Local l1-regularized robust estimators plus server-side robust aggregation deliver non-asymptotic guarantees and near-optimal rates for Byzantine-robust distributed sparse learning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"931a1cd313433b232c29a5ac9441240578e4027418349fe94a9290a498d839bd"},"source":{"id":"2605.13283","kind":"arxiv","version":1},"verdict":{"id":"ee5a5ed2-8cc1-4210-a80e-8148a0fb3a90","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:37:19.514915Z","strongest_claim":"the resulting estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient","one_line_summary":"Local L1-regularized robust estimators plus server-side robust aggregation achieve near-optimal rates for high-dimensional sparse learning under Byzantine attacks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"mild conditions on the data distribution, sparsity level, and fraction of Byzantine machines (standard but unspecified in abstract; typically requires bounded moments and Byzantine fraction below 1/2)","pith_extraction_headline":"Local l1-regularized robust estimators plus server-side robust aggregation deliver non-asymptotic guarantees and near-optimal rates for Byzantine-robust distributed sparse learning."},"references":{"count":16,"sample":[{"doi":"","year":null,"title":"Sparse Quantile Huber Regression for Efficient and Robust Estimation","work_id":"2ca89efa-7258-429d-a5e8-e169cf94253c","ref_index":1,"cited_arxiv_id":"1402.4624","is_internal_anchor":true},{"doi":"10.1214/17-aos1587","year":2011,"title":"Distributed testing and estimation under sparse high dimensional models. Ann. Statist. 46, 1352–1382. doi:10.1214/17-AOS1587. Belloni,A.,Chernozhukov,V.,2011.𝓁 1-penalizedquantileregressioninhigh-dime","work_id":"d901821a-9e8a-4dc4-a53c-b106bb5d8e53","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"2023 , journal =","work_id":"cedbb8cd-4355-4661-9d7a-1d12a91d0dd9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1111/rssb.12166","year":null,"title":"Estimation of high dimensional mean regression in the absence of symmetry and light tail assumptions. J. R. Stat. Soc. B: Stat. Methodol. 79, 247–265. doi:10.1111/rssb.12166. Fan, J., Liu, H., Sun, Q.","work_id":"76326722-d8c8-4407-a4e1-61becdbeb9d6","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1214/17-aos1568","year":null,"title":"I-lamm for sparse learning: Simultaneous control of algorithmic complexity and statistical error. Ann. Statist. 46, 814–841. doi:10.1214/17-AOS1568. He, X., Pan, X., Tan, K.M., Zhou, W.X.,","work_id":"c546aea9-8b24-49dd-8df0-3ad21ab0c166","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"397490c10791ec916fb5731af52ad99796657a8ad60bd1c7bfd66f49f791cf92","internal_anchors":1},"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":"2605.13283","created_at":"2026-05-18T02:44:49.175325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13283v1","created_at":"2026-05-18T02:44:49.175325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13283","created_at":"2026-05-18T02:44:49.175325+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NVBCJJV3JX3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NVBCJJV3JX3UF6X","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NVBCJJV","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ","json":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ.json","graph_json":"https://pith.science/api/pith-number/4NVBCJJV3JX3UF6XGGCVHK22DZ/graph.json","events_json":"https://pith.science/api/pith-number/4NVBCJJV3JX3UF6XGGCVHK22DZ/events.json","paper":"https://pith.science/paper/4NVBCJJV"},"agent_actions":{"view_html":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ","download_json":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ.json","view_paper":"https://pith.science/paper/4NVBCJJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13283&json=true","fetch_graph":"https://pith.science/api/pith-number/4NVBCJJV3JX3UF6XGGCVHK22DZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4NVBCJJV3JX3UF6XGGCVHK22DZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ/action/storage_attestation","attest_author":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ/action/author_attestation","sign_citation":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ/action/citation_signature","submit_replication":"https://pith.science/pith/4NVBCJJV3JX3UF6XGGCVHK22DZ/action/replication_record"}},"created_at":"2026-05-18T02:44:49.175325+00:00","updated_at":"2026-05-18T02:44:49.175325+00:00"}