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 "an evolutionary framework for automatic and guided discovery of algorithms"):
  Abstract: This paper presents Automatic Algorithm Discoverer (AAD), an evolutionary framework for synthesizing programs of high complexity. To guide evolution, prior evolutionary algorithms have depended on fitness (objective) functions, which are challenging to design. To make evolutionary progress, instead, AAD employs Problem Guided Evolution (PGE), which requires introduction of a group of problems together. With PGE, solutions discovered for simpler problems are used to solve more complex problems in the same group. PGE also enables several new evolutionary strategies, and naturally yields to High-Performance Computing (HPC) techniques. #R##N#We find that PGE and related evolutionary strategies enable AAD to discover algorithms of similar or higher complexity relative to the state-of-the-art. Specifically, AAD produces Python code for 29 array/vector problems ranging from min, max, reverse, to more challenging problems like sorting and matrix-vector multiplication. Additionally, we find that AAD shows adaptability to constrained environments/inputs and demonstrates outside-of-the-box problem solving abilities.

Includes members:
  Member "neural guided deductive search for real time program synthesis from examples":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "comparison of syntactic and semantic representations of programs in neural embeddings")
  Member "program synthesis using conflict driven learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "comparison of syntactic and semantic representations of programs in neural embeddings")
  Member "deepcoder learning to write programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  Member "programmatic and direct manipulation together at last":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "program sketching with live bidirectional evaluation")
  Member "semi automated svg programming via direct manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sketch n sketch output directed programming for svg")
  Member "program synthesis from polymorphic refinement types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to represent programs with property signatures")
  Member "automated feedback generation for introductory programming assignments":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")

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.NE(Neural and Evolutionary Computing)