{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KQG4TSP25ZECUGCL5J4GGDK77P","short_pith_number":"pith:KQG4TSP2","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"},"canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","source":{"kind":"arxiv","id":"2406.14362","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14362","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14362v1","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14362","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"KQG4TSP25ZEC","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"KQG4TSP25ZECUGCL","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"KQG4TSP2","created_at":"2026-07-05T08:34:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KQG4TSP25ZECUGCL5J4GGDK77P","target":"record","payload":{"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"},"canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","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"},"source_kind":"arxiv","source_id":"2406.14362","source_version":1,"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-05T08:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOIDzfyQS5F05V1P2rpL0sqYxAp09G2OZp3gv8M8QcP6qpw6kIcgeB40CfdBoHRlAWIHwC7EwrvZdX8E92dVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:37:02.534472Z"},"content_sha256":"7ae2844728c1aa50c9eee1c78c356428092c48c7e5e6eb19c54e96f6b8a6649f","schema_version":"1.0","event_id":"sha256:7ae2844728c1aa50c9eee1c78c356428092c48c7e5e6eb19c54e96f6b8a6649f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KQG4TSP25ZECUGCL5J4GGDK77P","target":"graph","payload":{"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"},"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-05T08:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSXcOphoB77W4zXgrnfaoqxItl+TUPWK81WQ/O2c9AFe7zA/ZPsBL6eRBVFPvTFU7rRmvF1UdECJE9P0FABKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T05:37:02.534987Z"},"content_sha256":"52ccaec95e0984d8e917b6e1f88d5893d2bfcf09eb477e93a5239f15ab424cac","schema_version":"1.0","event_id":"sha256:52ccaec95e0984d8e917b6e1f88d5893d2bfcf09eb477e93a5239f15ab424cac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/bundle.json","state_url":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQG4TSP25ZECUGCL5J4GGDK77P/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-08T05:37:02Z","links":{"resolver":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P","bundle":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/bundle.json","state":"https://pith.science/pith/KQG4TSP25ZECUGCL5J4GGDK77P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQG4TSP25ZECUGCL5J4GGDK77P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KQG4TSP25ZECUGCL5J4GGDK77P","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":"7feaac81e5d6f6c24208a1734a7ea3e730f33e6c5a9e397a9eabc01946649e65","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-20T14:36:12Z","title_canon_sha256":"4651a7bf9a3c4b7c9f358b58e587ee5bd580f0494d50a41375481b5d44a8aa2f"},"schema_version":"1.0","source":{"id":"2406.14362","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14362","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14362v1","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14362","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"KQG4TSP25ZEC","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"KQG4TSP25ZECUGCL","created_at":"2026-07-05T08:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"KQG4TSP2","created_at":"2026-07-05T08:34:49Z"}],"graph_snapshots":[{"event_id":"sha256:52ccaec95e0984d8e917b6e1f88d5893d2bfcf09eb477e93a5239f15ab424cac","target":"graph","created_at":"2026-07-05T08:34:49Z","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/2406.14362/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Afonso de S\\'a Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-20T14:36:12Z","title":"Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14362","kind":"arxiv","version":1},"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:7ae2844728c1aa50c9eee1c78c356428092c48c7e5e6eb19c54e96f6b8a6649f","target":"record","created_at":"2026-07-05T08:34:49Z","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":"7feaac81e5d6f6c24208a1734a7ea3e730f33e6c5a9e397a9eabc01946649e65","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-20T14:36:12Z","title_canon_sha256":"4651a7bf9a3c4b7c9f358b58e587ee5bd580f0494d50a41375481b5d44a8aa2f"},"schema_version":"1.0","source":{"id":"2406.14362","kind":"arxiv","version":1}},"canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"540dc9c9faee482a184bea78630d5ffbce01af92dc39e35bd6097eda32dd309f","first_computed_at":"2026-07-05T08:34:49.651854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:34:49.651854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PGtIAyL7kvxFBwvl+e3/nh0WaD8rBIlWChUP6pSh9JfAfqtc7ds2VpAQZA5wwLycTH6xr0/g/b7dF/nKklxCBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:34:49.652276Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.14362","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ae2844728c1aa50c9eee1c78c356428092c48c7e5e6eb19c54e96f6b8a6649f","sha256:52ccaec95e0984d8e917b6e1f88d5893d2bfcf09eb477e93a5239f15ab424cac"],"state_sha256":"da603263c2193b776583bfb8e1477b88c63918b6f9513d0eb7e1fc2c45e953cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSoT/x2GS5YrQnZfN1SKbqD+EDDA5zzvKujoXtJBh1hZFyCdh4YQKsMhn4CtS/C+iFh9rWdXtacZ5VeOWjJVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T05:37:02.538818Z","bundle_sha256":"26a4595c755e318cd71e980517f3ed0a142fbbfa59619d7cb58b4cb1bd50b4f9"}}