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: "simple max min ant systems and the optimization of linear pseudo boolean functions"
  Abstract: With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on the class of linear pseudo-Boolean functions defined on binary strings of length 'n'. Our investigations point out how the progress according to function values is stored in pheromone. We provide a general upper bound of O((n^3 \log n)/ \rho) for two ACO variants on all linear functions, where (\rho) determines the pheromone update strength. Furthermore, we show improved bounds for two well-known linear pseudo-Boolean functions called OneMax and BinVal and give additional insights using an experimental study.

Connected through hyperedge HE-1 (induced by source paper "working principles of binary differential evolution"):
  with members:
    - "probabilistic tools for the analysis of randomized optimization heuristics"
    - "fast re optimization via structural diversity"
    - "upper bounds on the running time of the univariate marginal distribution algorithm on onemax"
    - "better runtime guarantees via stochastic domination"
    - "significance based estimation of distribution algorithms"
    - "level based analysis of the population based incremental learning algorithm"
    - "the query complexity of a permutation based variant of mastermind"
    - "update strength in edas and aco how to avoid genetic drift"

Connected through hyperedge HE-2 (induced by source paper "complexity theory for discrete black box optimization heuristics"):
  with members:
    - "optimal parameter choices via precise black box analysis"
    - "runtime analysis of the 1 λ λ genetic algorithm on random satisfiable 3 cnf formulas"
    - "the 1 1 elitist black box complexity of leadingones"
    - "onemax in black box models with several restrictions"
    - "optimal parameter choices through self adjustment applying the 1 5 th rule in discrete settings"
    - "ranking based black box complexity"
    - "reducing the arity in unbiased black box complexity"
    - "a new method for lower bounds on the running time of evolutionary algorithms"

Connected through hyperedge HE-3 (induced by source paper "computational complexity analysis of multi objective genetic programming"):
  with members:
    - "multiplicative drift analysis"
    - "computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics"

Connected through hyperedge HE-4 (induced by source paper "black box complexities of combinatorial problems"):
  with members:
    - "more effective crossover operators for the all pairs shortest path problem"
    - "faster black box algorithms through higher arity operators"

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)