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 "automl zero evolving machine learning algorithms from scratch"):
  Abstract: Machine learning research has advanced in multiple aspects, including model structures and learning methods. The effort to automate such research, known as AutoML, has also made significant progress. However, this progress has largely focused on the architecture of neural networks, where it has relied on sophisticated expert-designed layers as building blocks---or similarly restrictive search spaces. Our goal is to show that AutoML can go further: it is possible today to automatically discover complete machine learning algorithms just using basic mathematical operations as building blocks. We demonstrate this by introducing a novel framework that significantly reduces human bias through a generic search space. Despite the vastness of this space, evolutionary search can still discover two-layer neural networks trained by backpropagation. These simple neural networks can then be surpassed by evolving directly on tasks of interest, e.g. CIFAR-10 variants, where modern techniques emerge in the top algorithms, such as bilinear interactions, normalized gradients, and weight averaging. Moreover, evolution adapts algorithms to different task types: e.g., dropout-like techniques appear when little data is available. We believe these preliminary successes in discovering machine learning algorithms from scratch indicate a promising new direction for the field.

Includes members:
  Member "random search and reproducibility for neural architecture search":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning architectures for binary networks")
  Member "nas evaluation is frustratingly hard":
    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 "towards modular and programmable architecture search":
    also connected through other hyperedges:
      (none)
  Member "weight agnostic neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "meta learning curiosity algorithms")
  Member "exploring randomly wired neural networks for image recognition":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning architectures for binary networks")
  Member "the evolved transformer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nas count counting by density with neural architecture search")
  Member "randaugment practical automated data augmentation with a reduced search space":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on feature normalization and data augmentation")
  Member "auto deeplab hierarchical neural architecture search for semantic image segmentation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning architectures for binary networks")

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)