human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "otter 3 3 reference manual"
  Abstract: OTTER is a resolution-style theorem-proving program for first-order logic with equality. OTTER includes the inference rules binary resolution, hyperresolution, UR-resolution, and binary paramodulation. Some of its other abilities and features are conversion from first-order formulas to clauses, forward and back subsumption, factoring, weighting, answer literals, term ordering, forward and back demodulation, evaluable functions and predicates, Knuth-Bendix completion, and the hints strategy. OTTER is coded in ANSI C, is free, and is portable to many different kinds of computer.

Connected through hyperedge HE-1 (induced by source paper "the space of mathematical software systems a survey of paradigmatic systems"):
  with members:
    - "hol y hammer online atp service for hol light"

Connected through hyperedge HE-2 (induced by source paper "on first order model based reasoning"):
  with members:
    - "semantically guided evolution of mathcal shi aboxes"
    - "dual hoops have unique halving"
    - "interpolation in local theory extensions"

Connected through hyperedge HE-3 (induced by source paper "theorem proving in large formal mathematics as an emerging ai field"):
  with members:
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "atp and presentation service for mizar formalizations"
    - "a wiki for mizar motivation considerations and initial prototype"
    - "mace4 reference manual and guide"

Connected through hyperedge HE-4 (induced by source paper "exploiting first order regression in inductive policy selection"):
  with members:
    - "spudd stochastic planning using decision diagrams"
    - "inductive policy selection for first order mdps"
    - "implementation and comparison of solution methods for decision processes with non markovian rewards"

Connected through hyperedge HE-5 (induced by source paper "closed nominal rewriting and efficiently computable nominal algebra equality"):
  with members:
    - "nominal unification from a higher order perspective"
    - "nominal logic programming"

Connected through hyperedge HE-6 (induced by source paper "new results on rewrite based satisfiability procedures"):
  with members:
    - "abstract canonical inference"
    - "processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic"

Connected through hyperedge HE-7 (induced by source paper "checking the quality of clinical guidelines using automated reasoning tools"):
  with members:
    - "bayesian logic programs"
    - "mace 2 0 reference manual and guide"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.SC(Symbolic Computation)