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 "average drift analysis and its application"):
  Abstract: Drift analysis is a useful tool for estimating the runtime of evolutionary algorithms. A new representation of drift analysis, called average drift analysis, is introduced in this paper. It takes a weaker requirement than point-wise drift analysis does. Point-wise drift theorems are corollaries of average drift theorems. Therefore average drift analysis is more powerful than point-wise drift analysis. To demonstrate the advantage of average drift analysis, we choose a population-based evolutionary algorithms for linear-like functions as a case study. The lower and upper bounds on the runtime have been drawn using average drift analysis. The cut-off points for the OneMax and BinVal are also derived.

Includes members:
  Member "adaptive drift analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic tools for the analysis of randomized optimization heuristics")
  Member "multiplicative drift analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic tools for the analysis of randomized optimization 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)