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 "securing distributed machine learning in high dimensions"):
  Abstract: We consider securing a distributed machine learning system wherein the data is kept confidential by its providers who are recruited as workers to help the learner to train a $d$--dimensional model. In each communication round, up to $q$ out of the $m$ workers suffer Byzantine faults; faulty workers are assumed to have complete knowledge of the system and can collude to behave arbitrarily adversarially against the learner. We assume that each worker keeps a local sample of size $n$. (Thus, the total number of data points is $N=nm$.) Of particular interest is the high-dimensional regime $d \gg n$. #R##N#We propose a secured variant of the classical gradient descent method which can tolerate up to a constant fraction of Byzantine workers. We show that the estimation error of the iterates converges to an estimation error $O(\sqrt{q/N} + \sqrt{d/N})$ in $O(\log N)$ rounds. The core of our method is a robust gradient aggregator based on the iterative filtering algorithm proposed by Steinhardt et al. \cite{Steinhardt18} for robust mean estimation. We establish a uniform concentration of the sample covariance matrix of gradients, and show that the aggregated gradient, as a function of model parameter, converges uniformly to the true gradient function. As a by-product, we develop a new concentration inequality for sample covariance matrices of sub-exponential distributions, which might be of independent interest.

Includes members:
  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 "efficient algorithms for outlier robust regression":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")
  Member "byzantine robust distributed learning towards optimal statistical rates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "turbo aggregate breaking the quadratic aggregation barrier in secure federated learning")
  Member "sever a robust meta algorithm for stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the effectiveness of mitigating data poisoning attacks with gradient shaping")
  Member "defending against saddle point attack in byzantine robust distributed learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the sample complexity of adversarial multi source pac learning")
  Member "being robust in high dimensions can be practical":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private mean estimation of heavy tailed distributions")
  Member "distributed statistical machine learning in adversarial settings byzantine gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "trends and advancements in deep neural network communication")
  Member "byzantine tolerant machine learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "communication efficient and byzantine robust distributed learning")

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)