{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WQKOO5D4GFE5KTBILXNI37XI3C","short_pith_number":"pith:WQKOO5D4","schema_version":"1.0","canonical_sha256":"b414e7747c3149d54c285dda8dfee8d8aa75cca483cbf6d16fb16f6eb778527a","source":{"kind":"arxiv","id":"2405.00491","version":1},"attestation_state":"computed","paper":{"title":"On the Relevance of Byzantine Robust Optimization Against Data Poisoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nirupam Gupta, Rachid Guerraoui, Rafael Pinot, Sadegh Farhadkhani","submitted_at":"2024-05-01T12:57:14Z","abstract_excerpt":"The success of machine learning (ML) has been intimately linked with the availability of large amounts of data, typically collected from heterogeneous sources and processed on vast networks of computing devices (also called {\\em workers}). Beyond accuracy, the use of ML in critical domains such as healthcare and autonomous driving calls for robustness against {\\em data poisoning}and some {\\em faulty workers}. The problem of {\\em Byzantine ML} formalizes these robustness issues by considering a distributed ML environment in which workers (storing a portion of the global dataset) can deviate arb"},"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":"2405.00491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-01T12:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"ff9cf63be75714d451da45d43e5d4c54a6a2960fe1b83ea22a35d7e6a1829bd4","abstract_canon_sha256":"2ef326b51bc7b9459b37e21783ba04021a9bdba29710c86bbdf46ed908bf8a8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:13.734506Z","signature_b64":"DOxJMdo5aFOEmEv9TxDWdfXToE6STNqec3OI4rz9dmMczAPcAxj9vc29ppt5XPxz8jN8fefJXMy7NeOVSA5IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b414e7747c3149d54c285dda8dfee8d8aa75cca483cbf6d16fb16f6eb778527a","last_reissued_at":"2026-07-05T08:14:13.734062Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:13.734062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Relevance of Byzantine Robust Optimization Against Data Poisoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Nirupam Gupta, Rachid Guerraoui, Rafael Pinot, Sadegh Farhadkhani","submitted_at":"2024-05-01T12:57:14Z","abstract_excerpt":"The success of machine learning (ML) has been intimately linked with the availability of large amounts of data, typically collected from heterogeneous sources and processed on vast networks of computing devices (also called {\\em workers}). Beyond accuracy, the use of ML in critical domains such as healthcare and autonomous driving calls for robustness against {\\em data poisoning}and some {\\em faulty workers}. The problem of {\\em Byzantine ML} formalizes these robustness issues by considering a distributed ML environment in which workers (storing a portion of the global dataset) can deviate arb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.00491","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.00491/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":"2405.00491","created_at":"2026-07-05T08:14:13.734113+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.00491v1","created_at":"2026-07-05T08:14:13.734113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00491","created_at":"2026-07-05T08:14:13.734113+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQKOO5D4GFE5","created_at":"2026-07-05T08:14:13.734113+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQKOO5D4GFE5KTBI","created_at":"2026-07-05T08:14:13.734113+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQKOO5D4","created_at":"2026-07-05T08:14:13.734113+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28123","citing_title":"Dangerous Liaisons of Convex Learning and Non-Affine Aggregation","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C","json":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C.json","graph_json":"https://pith.science/api/pith-number/WQKOO5D4GFE5KTBILXNI37XI3C/graph.json","events_json":"https://pith.science/api/pith-number/WQKOO5D4GFE5KTBILXNI37XI3C/events.json","paper":"https://pith.science/paper/WQKOO5D4"},"agent_actions":{"view_html":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C","download_json":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C.json","view_paper":"https://pith.science/paper/WQKOO5D4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.00491&json=true","fetch_graph":"https://pith.science/api/pith-number/WQKOO5D4GFE5KTBILXNI37XI3C/graph.json","fetch_events":"https://pith.science/api/pith-number/WQKOO5D4GFE5KTBILXNI37XI3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C/action/storage_attestation","attest_author":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C/action/author_attestation","sign_citation":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C/action/citation_signature","submit_replication":"https://pith.science/pith/WQKOO5D4GFE5KTBILXNI37XI3C/action/replication_record"}},"created_at":"2026-07-05T08:14:13.734113+00:00","updated_at":"2026-07-05T08:14:13.734113+00:00"}