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: "a social spider algorithm for global optimization"
  Abstract: The growing complexity of real-world problems has motivated computer scientists to search for efficient problem-solving methods. Metaheuristics based on evolutionary computation and swarm intelligence are outstanding examples of nature-inspired solution techniques. Inspired by the social spiders, we propose a novel Social Spider Algorithm to solve global optimization problems. This algorithm is mainly based on the foraging strategy of social spiders, utilizing the vibrations on the spider web to determine the positions of preys. Different from the previously proposed swarm intelligence algorithms, we introduce a new social animal foraging strategy model to solve optimization problems. In addition, we perform preliminary parameter sensitivity analysis for our proposed algorithm, developing guidelines for choosing the parameter values. The Social Spider Algorithm is evaluated by a series of widely-used benchmark functions, and our proposed algorithm has superior performance compared with other state-of-the-art metaheuristics.

Connected through hyperedge HE-1 (induced by source paper "comprehensive taxonomies of nature and bio inspired optimization inspiration versus algorithmic behavior critical analysis and recommendations"):
  with members:
    - "jmetalpy a python framework for multi objective optimization with metaheuristics"
    - "multi species cuckoo search algorithm for global optimization"
    - "platemo a matlab platform for evolutionary multi objective optimization"
    - "across neighborhood search for numerical optimization"
    - "an optimization algorithm inspired by the states of matter that improves the balance between exploration and exploitation"
    - "a brief review of nature inspired algorithms for optimization"
    - "new hoopoe heuristic optimization"
    - "group leaders optimization algorithm"

Connected through hyperedge HE-2 (induced by source paper "heuristic optimization of electrical energy systems refined metrics to compare the solutions"):
  with members:
    - "benchmarking optimization software with performance profiles"

Connected through hyperedge HE-3 (induced by source paper "selecting best software reliability growth models a social spider algorithm based approach"):
  with members:
    - "a social spider algorithm for solving the non convex economic load dispatch problem"
    - "parameter sensitivity analysis of social spider algorithm"

Connected through hyperedge HE-4 (induced by source paper "delay aware intelligent transient stability assessment system"):
  with members:
    - "intelligent time adaptive transient stability assessment system"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-5 (induced by source paper "a social spider algorithm for solving the non convex economic load dispatch problem"):
  with members:
    - "parameter sensitivity analysis of social spider algorithm"
    - "base station switching problem for green cellular networks with social spider algorithm"
    - "optimal v2g scheduling of electric vehicles and unit commitment using chemical reaction optimization"

Connected through hyperedge HE-6 (induced by source paper "adaptive chemical reaction optimization for global numerical optimization"):
  with members:
    - "sensor deployment for air pollution monitoring using public transportation system"
    - "real coded chemical reaction optimization with different perturbation functions"
    - "evolutionary artificial neural network based on chemical reaction optimization"

Connected through hyperedge HE-7 (induced by source paper "parameter sensitivity analysis of social spider algorithm"):
  with members:
    - "base station switching problem for green cellular networks with social spider algorithm"

Connected through hyperedge HE-8 (induced by source paper "base station switching problem for green cellular networks with social spider algorithm"):
  with members:
    - "on the transmission computation energy tradeoff in wireless and fixed networks"

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)