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: "Learning Recursive Sequences via Evolution of Machine-Language Programs"
  Abstract: We use directed search techniques in the space of computer programs to learn recursive sequences of positive integers. Specifically, the integer sequences of squares, x 2 ; cubes, x 3 ; factorial, x!; and Fibonacci numbers are studied. Given a small finite prefix of a sequence, we show that three directed searches|machine-language genetic programming with crossover, exhaustive iterative hill climbing, and a hybrid (crossover and hill climbing)|can automatically discover programs that exactly reproduce the finite target prefix and, moreover, that correctly produce the remaining sequence up to the underlying machine's precision. Our machine-language representation is generic|it contains instructions for arithmetic, register manipulation and comparison, and control flow. We also introduce an output instruction that allows variable-length sequences as result values. Importantly, this representation does not contain recursive operators; recursion, when needed, is automatically synthesized from primitive instructions. For a fixed set of search parameters (e.g., instruction set, program size, fitness criteria), we compare the efficiencies of the three directed search techniques on the four sequence problems. For this parameter set, an evolutionary-based search always outperforms exhaustive hill climbing as well as undirected random search. Since only the prefix of the target sequence is variable in our experiments, we posit that this approach to sequence induction is potentially quite general.

Connected through hyperedge HE-1 (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"
    - "The Schema Theorem and Price's Theorem"
    - "An Experimental Analysis of Schema Creation, Propagation and Disruption in Genetic Programming"
    - "A Comparison of Crossover and Mutation in Genetic Programming"

Connected through hyperedge HE-2 (induced by source paper "Toward Simulated Evolution of Machine-Language Iteration"):
  with members:
    - "Fitness Landscapes and Difficulty in Genetic Programming"

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