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 "prune and replace nas"):
  Abstract: While recent NAS algorithms are thousands of times faster than the pioneering works, it is often overlooked that they use fewer candidate operations, resulting in a significantly smaller search space. We present PR-DARTS, a NAS algorithm that discovers strong network configurations in a much larger search space and a single day. A small candidate operation pool is used, from which candidates are progressively pruned and replaced with better performing ones. Experiments on CIFAR-10 and CIFAR-100 achieve 2.51% and 15.53% test error, respectively, despite searching in a space where each cell has 150 times as many possible configurations than in the DARTS baseline. Code is available at this https URL

Includes members:
  Member "sharpdarts faster and more accurate differentiable architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "single path mobile automl efficient convnet design and nas hyperparameter optimization")
  Member "on network design spaces for visual recognition":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "how to train your super net an analysis of training heuristics in weight sharing nas")
  Member "nas bench 101 towards reproducible neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "progressive differentiable architecture search bridging the depth gap between search and evaluation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bats binary architecture search")
  Member "multinomial distribution learning for effective neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mixpath a unified approach for one shot neural architecture search")
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "regularized evolution for image classifier architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "searching for winograd aware quantized networks")
  Member "path level network transformation for efficient architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "autoemb automated embedding dimensionality search in streaming recommendations")

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)