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 "learning sparse networks using targeted dropout"):
  Abstract: Neural networks are easier to optimise when they have many more weights than are required for modelling the mapping from inputs to outputs. This suggests a two-stage learning procedure that first learns a large net and then prunes away connections or hidden units. But standard training does not necessarily encourage nets to be amenable to pruning. We introduce targeted dropout, a method for training a neural network so that it is robust to subsequent pruning. Before computing the gradients for each weight update, targeted dropout stochastically selects a set of units or weights to be dropped using a simple self-reinforcing sparsity criterion and then computes the gradients for the remaining weights. The resulting network is robust to post hoc pruning of weights or units that frequently occur in the dropped sets. The method improves upon more complicated sparsifying regularisers while being simple to implement and easy to tune.

Includes members:
  Member "the state of sparsity in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "soft threshold weight reparameterization for learnable sparsity")
  Member "faster gaze prediction with dense networks and fisher pruning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards efficient model compression via learned global ranking")
  Member "excitation dropout encouraging plasticity in deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explainable deep classification models for domain generalization")
  Member "flipout efficient pseudo independent weight perturbations on mini batches":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an empirical study of large batch stochastic gradient descent with structured covariance noise")
  Member "learning to prune filters in convolutional neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sasl saliency adaptive sparsity learning for neural network acceleration")
  Member "the lottery ticket hypothesis finding sparse trainable neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lossless compression of deep neural networks")
  Member "rethinking the value of network pruning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")

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.LG(Machine Learning)