{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CO4DJ7ETUA3FYL4EHTKOLS6ARP","short_pith_number":"pith:CO4DJ7ET","schema_version":"1.0","canonical_sha256":"13b834fc93a0365c2f843cd4e5cbc08bf457caca5e22aa4dad71b5d3033387f5","source":{"kind":"arxiv","id":"1907.12205","version":2},"attestation_state":"computed","paper":{"title":"DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Papailiopoulos, Hongyi Wang, Shashank Rajput, Zachary Charles","submitted_at":"2019-07-29T04:02:35Z","abstract_excerpt":"To improve the resilience of distributed training to worst-case, or Byzantine node failures, several recent approaches have replaced gradient averaging with robust aggregation methods. Such techniques can have high computational costs, often quadratic in the number of compute nodes, and only have limited robustness guarantees. Other methods have instead used redundancy to guarantee robustness, but can only tolerate limited number of Byzantine failures. In this work, we present DETOX, a Byzantine-resilient distributed training framework that combines algorithmic redundancy with robust aggregati"},"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":"1907.12205","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-29T04:02:35Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"c951b3b0da1ff15b9d9c72c369f769fa41598ca54d6244d0b3643b511f9cffd5","abstract_canon_sha256":"517f6177516fef039978ed64589c2c781d2e4fca6a21eedaaad36839f811288b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:31.928473Z","signature_b64":"NaxXv+T6xEoc/DRmmXgsDtf3iE39K54rJwmrWZYZLyaftlWedCJc0lsTBpwzOlcXe7HS94koyuuMcz7Aw4l6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b834fc93a0365c2f843cd4e5cbc08bf457caca5e22aa4dad71b5d3033387f5","last_reissued_at":"2026-07-05T00:46:31.927998Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:31.927998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dimitris Papailiopoulos, Hongyi Wang, Shashank Rajput, Zachary Charles","submitted_at":"2019-07-29T04:02:35Z","abstract_excerpt":"To improve the resilience of distributed training to worst-case, or Byzantine node failures, several recent approaches have replaced gradient averaging with robust aggregation methods. Such techniques can have high computational costs, often quadratic in the number of compute nodes, and only have limited robustness guarantees. Other methods have instead used redundancy to guarantee robustness, but can only tolerate limited number of Byzantine failures. In this work, we present DETOX, a Byzantine-resilient distributed training framework that combines algorithmic redundancy with robust aggregati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.12205","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/1907.12205/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.12205","created_at":"2026-07-05T00:46:31.928056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.12205v2","created_at":"2026-07-05T00:46:31.928056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.12205","created_at":"2026-07-05T00:46:31.928056+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO4DJ7ETUA3F","created_at":"2026-07-05T00:46:31.928056+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO4DJ7ETUA3FYL4E","created_at":"2026-07-05T00:46:31.928056+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO4DJ7ET","created_at":"2026-07-05T00:46:31.928056+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/CO4DJ7ETUA3FYL4EHTKOLS6ARP","json":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP.json","graph_json":"https://pith.science/api/pith-number/CO4DJ7ETUA3FYL4EHTKOLS6ARP/graph.json","events_json":"https://pith.science/api/pith-number/CO4DJ7ETUA3FYL4EHTKOLS6ARP/events.json","paper":"https://pith.science/paper/CO4DJ7ET"},"agent_actions":{"view_html":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP","download_json":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP.json","view_paper":"https://pith.science/paper/CO4DJ7ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.12205&json=true","fetch_graph":"https://pith.science/api/pith-number/CO4DJ7ETUA3FYL4EHTKOLS6ARP/graph.json","fetch_events":"https://pith.science/api/pith-number/CO4DJ7ETUA3FYL4EHTKOLS6ARP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP/action/storage_attestation","attest_author":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP/action/author_attestation","sign_citation":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP/action/citation_signature","submit_replication":"https://pith.science/pith/CO4DJ7ETUA3FYL4EHTKOLS6ARP/action/replication_record"}},"created_at":"2026-07-05T00:46:31.928056+00:00","updated_at":"2026-07-05T00:46:31.928056+00:00"}