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: "distributed evolutionary graph partitioning"
  Abstract: We present a novel distributed evolutionary algorithm, KaFFPaE, to solve the Graph Partitioning Problem, which makes use of KaFFPa (Karlsruhe Fast Flow Partitioner). The use of our multilevel graph partitioner KaFFPa provides new effective crossover and mutation operators. By combining these with a scalable communication protocol we obtain a system that is able to improve the best known partitioning results for many inputs in a very short amount of time. For example, in Walshaw's well known benchmark tables we are able to improve or recompute 76% of entries for the tables with 1%, 3% and 5% imbalance.

Connected through hyperedge HE-1 (induced by source paper "multilevel acyclic hypergraph partitioning"):
  with members:
    - "memetic graph clustering"
    - "network flow based refinement for multilevel hypergraph partitioning"
    - "scalable edge partitioning"
    - "graph partitioning with acyclicity constraints"
    - "memetic multilevel hypergraph partitioning"
    - "high quality shared memory graph partitioning"
    - "partitioning trillion edge graphs in minutes"
    - "k way hypergraph partitioning via n level recursive bisection"

Connected through hyperedge HE-2 (induced by source paper "evolutionary n level hypergraph partitioning with adaptive coarsening"):
  with members:
    - "memetic multilevel hypergraph partitioning"
    - "k way hypergraph partitioning via n level recursive bisection"
    - "parallel graph partitioning for complex networks"
    - "algorithm selection for combinatorial search problems a survey"
    - "n level graph partitioning"
    - "satzilla portfolio based algorithm selection for sat"

Connected through hyperedge HE-3 (induced by source paper "faster and better nested dissection orders for customizable contraction hierarchies"):
  with members:
    - "advanced multilevel node separator algorithms"
    - "graph bisection with pareto optimization"
    - "customizable contraction hierarchies"
    - "recent advances in graph partitioning"

Connected through hyperedge HE-4 (induced by source paper "reconfiguration of connected graph partitions"):
  with members:
    - "fair redistricting is hard"
    - "token sliding on chordal graphs"
    - "approximation and hardness for token swapping"
    - "linear time algorithm for sliding tokens on trees"

Connected through hyperedge HE-5 (induced by source paper "recent progress on graph partitioning problems using evolutionary computation"):
  with members:
    - "memetic graph clustering"
    - "memetic multilevel hypergraph partitioning"
    - "recent advances in graph partitioning"

Connected through hyperedge HE-6 (induced by source paper "memetic graph clustering"):
  with members:
    - "clustering evolving networks"

Connected through hyperedge HE-7 (induced by source paper "evolutionary acyclic graph partitioning"):
  with members:
    - "graph partitioning with acyclicity constraints"
    - "recent advances in graph partitioning"
    - "asymptotically optimal randomized rumor spreading"
    - "engineering multilevel graph partitioning algorithms"
    - "engineering a scalable high quality graph partitioner"

Connected through hyperedge HE-8 (induced by source paper "distributed evolutionary k way node separators"):
  with members:
    - "advanced multilevel node separator algorithms"
    - "graph bisection with pareto optimization"
    - "a multilevel bilinear programming algorithm for the vertex separator problem"
    - "customizable contraction hierarchies"
    - "recent advances in graph partitioning"

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)