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 "estimating approximation errors of elitist evolutionary algorithms"):
  Abstract: When EAs are unlikely to locate precise global optimal solutions with satisfactory performances, it is important to substitute the hitting time/running time analysis with another available theoretical routine. In order to bring theories and applications closer, this paper is dedicated to perform an analysis on approximation error of EAs. First, we proposed a general result on upper bound and lower bound of approximation errors. Then, several case studies are performed to present the routine of error analysis, and consequently, validate its applicability on cases generating transition matrices of various shapes. Meanwhile, the theoretical results also show the close connections between approximation errors and eigenvalues of transition matrices. The analysis validates applicability of error analysis, demonstrates significance of estimation results, and then, exhibits its potential to be applied for theoretical analysis.

Includes members:
  Member "drift theory in continuous search spaces expected hitting time of the 1 1 es with 1 5 success rule":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "runtime analysis for self adaptive mutation rates")
  Member "a theoretical framework of approximation error analysis of evolutionary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "error analysis of elitist random search heuristics")
  Member "average convergence rate of evolutionary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "error analysis of elitist random search heuristics")
  Member "an analytic expression of relative approximation error for a class of evolutionary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "error analysis of elitist random search heuristics")
  Member "performance analysis of evolutionary algorithms for the minimum label spanning tree problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "error analysis of elitist random search heuristics")
  Member "multiplicative drift analysis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probabilistic tools for the analysis of randomized optimization heuristics")
  Member "on the approximation ability of evolutionary optimization with application to minimum set cover":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "error analysis of elitist random search heuristics")

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)