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 "on the effectiveness of mitigating data poisoning attacks with gradient shaping"):
  Abstract: Machine learning algorithms are vulnerable to data poisoning attacks. Prior taxonomies that focus on specific scenarios, e.g., indiscriminate or targeted, have enabled defenses for the corresponding subset of known attacks. Yet, this introduces an inevitable arms race between adversaries and defenders. In this work, we study the feasibility of an attack-agnostic defense relying on artifacts that are common to all poisoning attacks. Specifically, we focus on a common element between all attacks: they modify gradients computed to train the model. We identify two main artifacts of gradients computed in the presence of poison: (1) their $\ell_2$ norms have significantly higher magnitudes than those of clean gradients, and (2) their orientation differs from clean gradients. Based on these observations, we propose the prerequisite for a generic poisoning defense: it must bound gradient magnitudes and minimize differences in orientation. We call this gradient shaping. As an exemplar tool to evaluate the feasibility of gradient shaping, we use differentially private stochastic gradient descent (DP-SGD), which clips and perturbs individual gradients during training to obtain privacy guarantees. We find that DP-SGD, even in configurations that do not result in meaningful privacy guarantees, increases the model's robustness to indiscriminate attacks. It also mitigates worst-case targeted attacks and increases the adversary's cost in multi-poison scenarios. The only attack we find DP-SGD to be ineffective against is a strong, yet unrealistic, indiscriminate attack. Our results suggest that, while we currently lack a generic poisoning defense, gradient shaping is a promising direction for future research.

Includes members:
  Member "data poisoning against differentially private learners attacks and defenses":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "can you really backdoor federated learning")
  Member "evaluating differentially private machine learning in practice":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "encode shuffle analyze privacy revisited formalizations and empirical evaluation")
  Member "analyzing federated learning through an adversarial lens":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning home crowdsourced training of large neural networks using decentralized mixture of experts")
  Member "byzantine robust distributed learning towards optimal statistical rates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "learning structured distributions from untrusted batches faster and simpler")
  Member "manipulating machine learning poisoning attacks and countermeasures for regression learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secure and robust machine learning for healthcare a survey")
  Member "is feature selection secure against training data poisoning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "certified robustness to label flipping attacks via randomized smoothing")
  Member "how to backdoor federated learning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "trends and advancements in deep neural network communication")

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.CR(Cryptography and Security)