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: "The Schema Theorem and Price's Theorem"
  Abstract: Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implications. Here, dissenting arguments are reviewed and elaborated upon, explaining why the Schema Theorem has no implications for how well a GA is performing. Interpretations of the Schema Theorem have implicitly assumed that a correlation exists between parent and offspring fitnesses, and this assumption is made explicit in results based on Price's Covariance and Selection Theorem. Schemata do not play a part in the performance theorems derived for representations and operators in general. However, schemata re-emerge when recombination operators are used. Using Geiringer's recombination distribution representation of recombination operators, a "missing" schema theorem is derived which makes explicit the intuition for when a GA should perform well. Finally, the method of "adaptive landscape" analysis is examined and counterexamples offered to the commonly used correlation statistic. Instead, an alternative statistic | the transmission function in the fitness domain | is proposed as the optimal statistic for estimating GA performance from limited samples.

Connected through hyperedge HE-1 (induced by source paper "Evolution in Time and Space The Parallel Genetic Algorithm"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Island Model Genetic Algorithms and Linearly Separable Problems"
    - "A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems"
    - "Recombination Operator, its Correlation to the Fitness Landscape and Search Performance"
    - "Genetic Algorithm Programming Environments"
    - "A Survey of Parallel Genetic Algorithms"
    - "Staged Hybrid Genetic Search for Seismic Data Imaging"
    - "Self-Adaptation in Genetic Algorithms of external parameters of a GA is seen as a first"

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 "An Experimental Analysis of Schema Creation, Propagation and Disruption in Genetic Programming"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "The Troubling Aspects of a Building Block Hypothesis for Genetic Programming"
    - "Evolution-based Discovery of Hierarchical Behaviors"
    - "Genetic Programming with One-Point Crossover and Point Mutation"
    - "How Fitness Structure Affects Subsolution Acquisition in Genetic Programming"

Connected through hyperedge HE-4 (induced by source paper "Modeling Building-Block Interdependency  Dynamical and Evolutionary Machine Organization Group"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance"
    - "When Will a Genetic Algorithm Outperform Hill Climbing?"

Connected through hyperedge HE-5 (induced by source paper "Fitness Landscapes and Difficulty in Genetic Programming"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Genetic Programming and Redundancy"
    - "Effects of Occam's Razor in Evolving Sigma-Pi Neural Nets"
    - "A Simulation of Adaptive Agents in a Hostile Environment"
    - "Toward Simulated Evolution of Machine-Language Iteration"
    - "Evolving Non-Determinism: An Inventive and Efficient Tool for Optimization and Discovery of Strategies"
    - "Incremental Co-evolution of Organisms: A New Approach for Optimization and Discovery of Strategies"
    - "Complexity Compression and Evolution"

Connected through hyperedge HE-6 (induced by source paper "Price's Theorem and the MAX Problem"):
  with members:
    - "The Troubling Aspects of a Building Block Hypothesis for Genetic Programming"
    - "Genetic Programming with One-Point Crossover and Point Mutation"

Connected through hyperedge HE-7 (induced by source paper "The Troubling Aspects of a Building Block Hypothesis for Genetic Programming"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "Genetic Programming Exploratory Power and the Discovery of Functions"
    - "Program Search with a Hierarchical Variable Length Representation: Genetic Programming, Simulated Annealing and Hill Climbing"
    - "The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance"
    - "Towards Automatic Discovery of Building Blocks in Genetic Programming"
    - "An Experimental Analysis of Schema Creation, Propagation and Disruption in Genetic Programming"
    - "A Comparison of Crossover and Mutation in Genetic Programming"
    - "An Analysis of the MAX Problem in Genetic Programming hold only in some cases, in"

Connected through hyperedge HE-8 (induced by source paper "An Analysis of the MAX Problem in Genetic Programming hold only in some cases, in"):
  with members:
    - "The Troubling Aspects of a Building Block Hypothesis for Genetic Programming"
    - "Modeling the Evolution of Motivation"
    - "Evolutionary Programming and Evolution Strategies: Similarities and Differences"
    - "Genetic Programming with One-Point Crossover and Point Mutation"

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