{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:X773IKO42CGPXVICHESU73LBRS","short_pith_number":"pith:X773IKO4","canonical_record":{"source":{"id":"1803.01498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-05T05:04:17Z","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"title_canon_sha256":"757242c8e4e4c5abf73f8cea2df44c585711020ce1fc235c5bd9ed7a4bcd6c16","abstract_canon_sha256":"3eb3f1e75ce59b849ac8868e29cf1cae93594b3470b67d2d36aeb033ed91eb83"},"schema_version":"1.0"},"canonical_sha256":"bfffb429dcd08cfbd50239254fed618c8d77948331455f22b5c76603a1d7af0b","source":{"kind":"arxiv","id":"1803.01498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01498","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01498v2","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01498","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"X773IKO42CGP","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"X773IKO42CGPXVIC","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"X773IKO4","created_at":"2026-07-05T02:18:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:X773IKO42CGPXVICHESU73LBRS","target":"record","payload":{"canonical_record":{"source":{"id":"1803.01498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-05T05:04:17Z","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"title_canon_sha256":"757242c8e4e4c5abf73f8cea2df44c585711020ce1fc235c5bd9ed7a4bcd6c16","abstract_canon_sha256":"3eb3f1e75ce59b849ac8868e29cf1cae93594b3470b67d2d36aeb033ed91eb83"},"schema_version":"1.0"},"canonical_sha256":"bfffb429dcd08cfbd50239254fed618c8d77948331455f22b5c76603a1d7af0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:13.350412Z","signature_b64":"twuakRoQowdatIds85QCxVLV0wB76noXl9LgkypF4Gic+PH7KJGgmysSyswyUr+pjO2mQW4ttLi6WGPJ+tefDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfffb429dcd08cfbd50239254fed618c8d77948331455f22b5c76603a1d7af0b","last_reissued_at":"2026-07-05T02:18:13.349929Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:13.349929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.01498","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BC3rr7EY1cQvqAxvHciZUsoOPq8skIIKpwlBLRo7XlTSA7GvYG0d6Iep5pc3OOq67asOv6QkuGqX/NAvtMscAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:56:42.336218Z"},"content_sha256":"e90ac6a80a8a91e3a4c62550739990f87422f0543baa2bd8121475e2d50c4567","schema_version":"1.0","event_id":"sha256:e90ac6a80a8a91e3a4c62550739990f87422f0543baa2bd8121475e2d50c4567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:X773IKO42CGPXVICHESU73LBRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dong Yin, Kannan Ramchandran, Peter Bartlett, Yudong Chen","submitted_at":"2018-03-05T05:04:17Z","abstract_excerpt":"In large-scale distributed learning, security issues have become increasingly important. Particularly in a decentralized environment, some computing units may behave abnormally, or even exhibit Byzantine failures -- arbitrary and potentially adversarial behavior. In this paper, we develop distributed learning algorithms that are provably robust against such failures, with a focus on achieving optimal statistical performance. A main result of this work is a sharp analysis of two robust distributed gradient descent algorithms based on median and trimmed mean operations, respectively. We prove st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01498","kind":"arxiv","version":2},"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/1803.01498/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7llG2HTP6zUnBzEZInvuWVnitw7VqvvTeWpm788UcwI+zhDKMzpV9AByib+6UTtympdzxuHPICfmvmwWKQLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T05:56:42.336780Z"},"content_sha256":"cd9d3a35373c39768d394e0150f594d6c4be01ba1eda0cc55e23a5e6bdd04c4a","schema_version":"1.0","event_id":"sha256:cd9d3a35373c39768d394e0150f594d6c4be01ba1eda0cc55e23a5e6bdd04c4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X773IKO42CGPXVICHESU73LBRS/bundle.json","state_url":"https://pith.science/pith/X773IKO42CGPXVICHESU73LBRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X773IKO42CGPXVICHESU73LBRS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T05:56:42Z","links":{"resolver":"https://pith.science/pith/X773IKO42CGPXVICHESU73LBRS","bundle":"https://pith.science/pith/X773IKO42CGPXVICHESU73LBRS/bundle.json","state":"https://pith.science/pith/X773IKO42CGPXVICHESU73LBRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X773IKO42CGPXVICHESU73LBRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:X773IKO42CGPXVICHESU73LBRS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3eb3f1e75ce59b849ac8868e29cf1cae93594b3470b67d2d36aeb033ed91eb83","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-05T05:04:17Z","title_canon_sha256":"757242c8e4e4c5abf73f8cea2df44c585711020ce1fc235c5bd9ed7a4bcd6c16"},"schema_version":"1.0","source":{"id":"1803.01498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.01498","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.01498v2","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01498","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"X773IKO42CGP","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_16","alias_value":"X773IKO42CGPXVIC","created_at":"2026-07-05T02:18:13Z"},{"alias_kind":"pith_short_8","alias_value":"X773IKO4","created_at":"2026-07-05T02:18:13Z"}],"graph_snapshots":[{"event_id":"sha256:cd9d3a35373c39768d394e0150f594d6c4be01ba1eda0cc55e23a5e6bdd04c4a","target":"graph","created_at":"2026-07-05T02:18:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1803.01498/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In large-scale distributed learning, security issues have become increasingly important. Particularly in a decentralized environment, some computing units may behave abnormally, or even exhibit Byzantine failures -- arbitrary and potentially adversarial behavior. In this paper, we develop distributed learning algorithms that are provably robust against such failures, with a focus on achieving optimal statistical performance. A main result of this work is a sharp analysis of two robust distributed gradient descent algorithms based on median and trimmed mean operations, respectively. We prove st","authors_text":"Dong Yin, Kannan Ramchandran, Peter Bartlett, Yudong Chen","cross_cats":["cs.CR","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-05T05:04:17Z","title":"Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01498","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e90ac6a80a8a91e3a4c62550739990f87422f0543baa2bd8121475e2d50c4567","target":"record","created_at":"2026-07-05T02:18:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3eb3f1e75ce59b849ac8868e29cf1cae93594b3470b67d2d36aeb033ed91eb83","cross_cats_sorted":["cs.CR","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-05T05:04:17Z","title_canon_sha256":"757242c8e4e4c5abf73f8cea2df44c585711020ce1fc235c5bd9ed7a4bcd6c16"},"schema_version":"1.0","source":{"id":"1803.01498","kind":"arxiv","version":2}},"canonical_sha256":"bfffb429dcd08cfbd50239254fed618c8d77948331455f22b5c76603a1d7af0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfffb429dcd08cfbd50239254fed618c8d77948331455f22b5c76603a1d7af0b","first_computed_at":"2026-07-05T02:18:13.349929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:13.349929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"twuakRoQowdatIds85QCxVLV0wB76noXl9LgkypF4Gic+PH7KJGgmysSyswyUr+pjO2mQW4ttLi6WGPJ+tefDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:13.350412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.01498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e90ac6a80a8a91e3a4c62550739990f87422f0543baa2bd8121475e2d50c4567","sha256:cd9d3a35373c39768d394e0150f594d6c4be01ba1eda0cc55e23a5e6bdd04c4a"],"state_sha256":"682d3c659f6eafc59286645599dfa6155a536e85cf2e0c015ff7ad7ed6f0c1ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmVLaE28W4z3xhsLX4BK3wXwBONlZJOdj2GWZ0NbgUfgRF2nkDGZlWgoNOJ36+Y9k6ED3G37Y6Xa+lCzjD8kAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T05:56:42.341823Z","bundle_sha256":"912aaac88b5a5b3c1bd309db696c80492ba314d96609276dfdc20cf3e5092c4a"}}