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: "Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms"
  Abstract: We investigate the effectiveness of stochastic hillclimbing as a baseline for evaluating the performance of genetic algorithms (GAs) as combinatorial function optimizers. In particular, we address four problems to which GAs have been applied in the literature: the maximum cut problem, Koza's 11-multiplexer problem, MDAP (the Multiprocessor Document Allocation Problem), and the jobshop problem. We demonstrate that simple stochastic hillclimbing methods are able to achieve results comparable or superior to those obtained by the GAs designed to address these four problems. We further illustrate, in the case of the jobshop problem, how insights obtained in the formulation of a stochastic hillclimbing algorithm can lead to improvements in the encoding used by a GA. fl Department of Computer Science, University of California at Berkeley. Supported by a NASA Graduate Fellowship. This paper was written while the author was a visiting researcher at the Ecole Normale Superieure-rue d'Ulm, Groupe de BioInformatique, France. E-mail: juels@cs.berkeley.edu y Department of Mathematics, University of California at Berkeley. Supported by an NDSEG Graduate Fellowship. E-mail: wattenbe@math.berkeley.edu

Connected through hyperedge HE-1 (induced by source paper "An Evolutionary Approach to Combinatorial Optimization Problems"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "An Overview of Evolutionary Computation"

Connected through hyperedge HE-2 (induced by source paper "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."):
  with members:
    - "Measuring the Difficulty of Specific Learning Problems"
    - "Trading Spaces: Computation, Representation and the Limits of Uninformed Learning"
    - "Discovering Complex Othello Strategies Through Evolutionary Neural Networks"
    - "USING MARKER-BASED GENETIC ENCODING OF NEURAL NETWORKS TO EVOLVE FINITE-STATE BEHAVIOUR"
    - "Evolving Obstacle Avoidance Behavior in a Robot Arm"
    - "A Comparison of Selection Schemes used in Genetic Algorithms"
    - "Determining Successful Negotiation Strategies: An Evolutionary Approach"
    - "Genetic Programming and Redundancy"

Connected through hyperedge HE-3 (induced by source paper "Surgery"):
  with members:
    - "Book Review  Introduction to the Theory of Neural Computation Reviewed by: 2"
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Distribution Category:  A Parallel Genetic Algorithm for the Set Partitioning Problem"

Connected through hyperedge HE-4 (induced by source paper "Chapter 4 Empirical comparison of stochastic algorithms Empirical comparison of stochastic algorithms in a graph"):
  with members:
    (none)

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