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: "A NN Algorithm for Boolean Satisfiability Problems"
  Abstract: Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary boolean expression true. This paper compares a neural network algorithm (NNSAT) with GSAT [4], a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are difficult for traditional satisfiability algorithms. Results suggest that NNSAT scales better as the number of variables increase, solving at least as many hard SAT problems.

Connected through hyperedge HE-1 (induced by source paper "Simulated Annealing for Hard Satisfiability Problems"):
  with members:
    - "Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems"
    - "Optimal Mutation Rates in Genetic Search"

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