human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "non elitist genetic algorithm as a local search method"
  Abstract: Sufficient conditions are found under which the iterated non-elitist genetic algorithm with tournament selection first visits a local optimum in polynomially bounded time on average. It is shown that these conditions are satisfied on a class of problems with guaranteed local optima (GLO) if appropriate parameters of the algorithm are chosen.

Connected through hyperedge HE-1 (induced by source paper "hitting times of local and global optima in genetic algorithms with very high selection pressure"):
  with members:
    - "level based analysis of genetic algorithms and other search processes"
    - "a new method for lower bounds on the running time of evolutionary algorithms"
    - "a discipline of evolutionary programming"

Connected through hyperedge HE-2 (induced by source paper "on proportions of fit individuals in population of evolutionary algorithm with tournament selection"):
  with members:
    - "level based analysis of genetic algorithms and other search processes"
    - "a new method for lower bounds on the running time of evolutionary algorithms"
    - "a discipline of evolutionary programming"

Connected through hyperedge HE-3 (induced by source paper "level based analysis of genetic algorithms for combinatorial optimization"):
  with members:
    - "level based analysis of genetic algorithms and other search processes"
    - "a discipline of evolutionary programming"

Question: Please tell me which class the center node 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)