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: "Functional Programming by Analogy"
  Abstract: In this paper we describe how the principles of problem solving by analogy can be applied to the domain of functional program synthesis. For this reason, we treat programs as syntactical structures. We discuss two different methods to handle these structures: (a) a graph metric for determining the distance between two program schemes, and (b) the Structure Mapping Engine (an existing system to examine analogical processing). Furthermore we show experimental results and discuss them.

Connected through hyperedge HE-1 (induced by source paper "The Structure-Mapping Engine: Algorithm and Examples"):
  with members:
    - "Utilizing Prior Concepts for Learning"
    - "The Case for Graph-Structured Representations"
    - "MAC/FAC: A Model of Similarity-based Retrieval"
    - "The Role of Generic Models in Conceptual Change"
    - "Adapting Abstract Knowledge"
    - "Role of Stories 1"
    - "Is analogical problem solving always analogical? The case for imitation. Second draft Is analogical problem"
    - "Modeling Analogical Problem Solving in a Production System Architecture"

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: Case_Based