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: "Optimal Alignments in Linear Space using Automaton-derived Cost Functions (Extended Abstract) Submitted to CPM'96"
  Abstract: In a previous paper [SM95], we showed how finite automata could be used to define objective functions for assessing the quality of an alignment of two (or more) sequences. In this paper, we show some results of using such cost functions. We also show how to extend Hischberg's linear space algorithm [Hir75] to this setting, thus generalizing a result of Myers and Miller [MM88b].

Connected through hyperedge HE-1 (induced by source paper "Using Dirichlet Mixture Priors to Derive Hidden Markov Models for Protein Families"):
  with members:
    - "The megaprior heuristic for discovering protein sequence patterns"
    - "Minimum-Risk Profiles of Protein Families Based on Statistical Decision Theory"
    - "Homology Detection via Family Pairwise Search a straightforward generalization of pairwise sequence comparison algorithms to"
    - "Hidden Markov Models in Computational Biology: Applications to Protein Modeling UCSC-CRL-93-32 Keywords: Hidden Markov Models,"
    - "Finding Genes in DNA with a Hidden Markov Model"
    - "Dirichlet Mixtures: A Method for Improving Detection of Weak but Significant Protein Sequence Homology"
    - "Protein Secondary Structure Modelling with Probabilistic Networks (Extended Abstract)"
    - "Towards a Better Understanding of Memory-Based Reasoning Systems"

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