{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KQG4TSP25ZECUGCL5J4GGDK77P","short_pith_number":"pith:KQG4TSP2","schema_version":"1.0","canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","source":{"kind":"arxiv","id":"2406.14362","version":1},"attestation_state":"computed","paper":{"title":"Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Afonso de S\\'a Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar","submitted_at":"2024-06-20T14:36:12Z","abstract_excerpt":"We introduce CYBER-0, the first zero-order optimization algorithm for memory-and-communication efficient Federated Learning, resilient to Byzantine faults. We show through extensive numerical experiments on the MNIST dataset and finetuning RoBERTa-Large that CYBER-0 outperforms state-of-the-art algorithms in terms of communication and memory efficiency while reaching similar accuracy. We provide theoretical guarantees on its convergence for convex loss functions."},"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":"2406.14362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-20T14:36:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4651a7bf9a3c4b7c9f358b58e587ee5bd580f0494d50a41375481b5d44a8aa2f","abstract_canon_sha256":"7feaac81e5d6f6c24208a1734a7ea3e730f33e6c5a9e397a9eabc01946649e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:49.652276Z","signature_b64":"PGtIAyL7kvxFBwvl+e3/nh0WaD8rBIlWChUP6pSh9JfAfqtc7ds2VpAQZA5wwLycTH6xr0/g/b7dF/nKklxCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","last_reissued_at":"2026-07-05T08:34:49.651854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:49.651854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Afonso de S\\'a Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar","submitted_at":"2024-06-20T14:36:12Z","abstract_excerpt":"We introduce CYBER-0, the first zero-order optimization algorithm for memory-and-communication efficient Federated Learning, resilient to Byzantine faults. We show through extensive numerical experiments on the MNIST dataset and finetuning RoBERTa-Large that CYBER-0 outperforms state-of-the-art algorithms in terms of communication and memory efficiency while reaching similar accuracy. We provide theoretical guarantees on its convergence for convex loss functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14362","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/2406.14362/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":"2406.14362","created_at":"2026-07-05T08:34:49.651911+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14362v1","created_at":"2026-07-05T08:34:49.651911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14362","created_at":"2026-07-05T08:34:49.651911+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQG4TSP25ZEC","created_at":"2026-07-05T08:34:49.651911+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQG4TSP25ZECUGCL","created_at":"2026-07-05T08:34:49.651911+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQG4TSP2","created_at":"2026-07-05T08:34:49.651911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09870","citing_title":"Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P","json":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P.json","graph_json":"https://pith.science/api/pith-number/KQG4TSP25ZECUGCL5J4GGDK77P/graph.json","events_json":"https://pith.science/api/pith-number/KQG4TSP25ZECUGCL5J4GGDK77P/events.json","paper":"https://pith.science/paper/KQG4TSP2"},"agent_actions":{"view_html":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P","download_json":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P.json","view_paper":"https://pith.science/paper/KQG4TSP2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14362&json=true","fetch_graph":"https://pith.science/api/pith-number/KQG4TSP25ZECUGCL5J4GGDK77P/graph.json","fetch_events":"https://pith.science/api/pith-number/KQG4TSP25ZECUGCL5J4GGDK77P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/action/storage_attestation","attest_author":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/action/author_attestation","sign_citation":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/action/citation_signature","submit_replication":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/action/replication_record"}},"created_at":"2026-07-05T08:34:49.651911+00:00","updated_at":"2026-07-05T08:34:49.651911+00:00"}