human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "As mentioned in the introduction, an encod-ing/crossover pair makes a spectrum of geographical linkages. A"
  Abstract: It is open as to which chromosomal dimension performs best. Although higher-dimensional encodings (whether real or imaginary) can preserve more geographical gene linkages, we suspect that too high a dimension would not perform desirably. We are studying the question of which dimension of encoding is best for a given instance. It is likely that the optimal dimension is somehow dependent on the chromosome size and the input graph topology; interactions with the flexibility of crossover are yet unknown. The interaction of these considerations with the number of cuts used in the crossover is also an open issue. * In relocating genes onto a multi-dimensional chromosome, the simplest way is via a sequential assignment such as row-major order. Section 4 showed that performance improves when a DFS-row-major reembedding is used for two- and three-dimensional encodings. We suspect that this phenomenon will be consistent for higher-dimensional cases, and hope to perform more detailed investigations in the future. Although DFS reordering proved to be helpful for both linear encodings [19] and multi-dimensional encodings, we do not believe DFS-row-major reembedding is a good approach for the multi-dimensional cases since the row-major embedding is so simplistic. We are considering alternative 2-dimensional and 3-dimensional reembeddings which will hopefully provide further improvement. [4] T. N. Bui and B. R. Moon. Hyperplane synthesis for genetic algorithms. In Fifth International Conference on Genetic Algorithms, pages 102-109, July 1993. [5] T. N. Bui and B. R. Moon. Analyzing hyperplane synthesis in genetic algorithms using clustered schemata. In International Conference on Evolutionary Computation, Oct. 1994. Lecture Notes in Computer Science, 866:108-118, Springer-Verlag.

Connected through hyperedge HE-1 (induced by source paper "Distribution Category:  A Parallel Genetic Algorithm for the Set Partitioning Problem"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Surgery"
    - "A Comparative Study of Genetic Search"
    - "A Survey of Parallel Genetic Algorithms"
    - "Scheduling Maintenance of Electrical Power Transmission Networks Using Genetic Programming"
    - "Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem"
    - "An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms"
    - "On the Virtues of Parameterized Uniform Crossover"

Connected through hyperedge HE-2 (induced by source paper "Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "HGA: A Hardware-Based Genetic Algorithm"
    - "Vector Quantizer Design Using Genetic Algorithms"
    - "A Comparative Study of Genetic Search"
    - "Using Problem Generators to Explore the Effects of Epistasis"
    - "How good are genetic algorithms at finding large cliques: an experimental study"
    - "An Evolutionary Approach to Vector Quantizer Design"
    - "Using Genetic Algorithms for Supervised Concept Learning"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Genetic_Algorithms