human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "sgd decentralized byzantine resilience"):
  Abstract: The size of the datasets available today leads to distribute Machine Learning (ML) tasks. An SGD--based optimization is for instance typically carried out by two categories of participants: parameter servers and workers. Some of these nodes can sometimes behave arbitrarily (called \emph{Byzantine} and caused by corrupt/bogus data/machines), impacting the accuracy of the entire learning activity. Several approaches recently studied how to tolerate Byzantine workers, while assuming honest and trusted parameter servers. In order to achieve total ML robustness, we introduce GuanYu, the first algorithm (to the best of our knowledge) to handle Byzantine parameter servers as well as Byzantine workers. We prove that GuanYu ensures convergence against $\frac{1}{3}$ Byzantine parameter servers and $\frac{1}{3}$ Byzantine workers, which is optimal in asynchronous networks (GuanYu does also tolerate unbounded communication delays, i.e.\ asynchrony). To prove the Byzantine resilience of GuanYu, we use a contraction argument, leveraging geometric properties of the median in high dimensional spaces to prevent (with probability 1) any drift on the models within each of the non-Byzantine servers. % To convey its practicality, we implemented GuanYu using the low-level TensorFlow APIs and deployed it in a distributed setup using the CIFAR-10 dataset. The overhead of tolerating Byzantine participants, compared to a vanilla TensorFlow deployment that is vulnerable to a single Byzantine participant, is around 30\% in terms of throughput (model updates per second) - while maintaining the same convergence rate (model updates required to reach some accuracy).

Includes members:
  Member "distributed learning with adversarial agents under relaxed network condition":
    also connected through other hyperedges:
      (none)
  Member "byzantine stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "federated over the air subspace learning from incomplete data")
  Member "wild patterns ten years after the rise of adversarial machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "vulnerabilities of connectionist ai applications evaluation and defence")
  Member "signsgd with majority vote is communication efficient and fault tolerant":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "threats to federated learning a survey")
  Member "zeno byzantine suspicious stochastic gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "detox a redundancy based framework for faster and more robust gradient aggregation")
  Member "federated learning strategies for improving communication efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "trends and advancements in deep neural network communication")
  Member "adversarial spheres":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "utilizing network properties to detect erroneous inputs")
  Member "finite time guarantees for byzantine resilient distributed state estimation with noisy measurements":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "byzantine fault tolerant distributed linear regression")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DC(Distributed, Parallel, and Cluster Computing)