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 "searching for a robust neural architecture in four gpu hours"):
  Abstract: Conventional neural architecture search (NAS) approaches are based on reinforcement learning or evolutionary strategy, which take more than 3000 GPU hours to find a good model on CIFAR-10. We propose an efficient NAS approach learning to search by gradient descent. Our approach represents the search space as a directed acyclic graph (DAG). This DAG contains billions of sub-graphs, each of which indicates a kind of neural architecture. To avoid traversing all the possibilities of the sub-graphs, we develop a differentiable sampler over the DAG. This sampler is learnable and optimized by the validation loss after training the sampled architecture. In this way, our approach can be trained in an end-to-end fashion by gradient descent, named Gradient-based search using Differentiable Architecture Sampler (GDAS). In experiments, we can finish one searching procedure in four GPU hours on CIFAR-10, and the discovered model obtains a test error of 2.82\% with only 2.5M parameters, which is on par with the state-of-the-art. Code is publicly available on GitHub: this https URL.

Includes members:
  Member "partial order pruning for best speed accuracy trade off in neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adwpnas architecture driven weight prediction for neural architecture search")
  Member "mobilenetv2 inverted residuals and linear bottlenecks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "discrimination aware network pruning for deep model compression")
  Member "graph hypernetworks for neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning architectures for binary networks")
  Member "regularized evolution for image classifier architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "searching for winograd aware quantized networks")
  Member "neural architecture optimization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning architectures for binary networks")
  Member "darts differentiable architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gan compression efficient architectures for interactive conditional gans")
  Member "snas stochastic neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning architectures for binary networks")
  Member "searching for efficient multi scale architectures for dense image prediction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nas count counting by density with neural architecture search")

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.CV(Computer Vision and Pattern Recognition)