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: "natural deduction as higher order resolution"
  Abstract: An interactive theorem prover, Isabelle, is under development. In LCF, each inference rule is represented by one function for forwards proof and another (a tactic) for backwards proof. In Isabelle, each inference rule is represented by a Horn clause. Resolution gives both forwards and backwards proof, supporting a large class of logics. Isabelle has been used to prove theorems in Martin-L\"of's Constructive Type Theory. Quantifiers pose several difficulties: substitution, bound variables, Skolemization. Isabelle's representation of logical syntax is the typed lambda-calculus, requiring higher- order unification. It may have potential for logic programming. Depth-first subgoaling along inference rules constitutes a higher-order Prolog.

Connected through hyperedge HE-1 (induced by source paper "generating correctness proofs with neural networks"):
  with members:
    - "learning to prove theorems via interacting with proof assistants"
    - "holist an environment for machine learning of higher order theorem proving"
    - "gamepad a learning environment for theorem proving"
    - "a survey of machine learning for big code and naturalness"
    - "deep network guided proof search"
    - "holstep a machine learning dataset for higher order logic theorem proving"
    - "tactictoe learning to reason with hol4 tactics"
    - "towards proof synthesis guided by neural machine translation for intuitionistic propositional logic"

Connected through hyperedge HE-2 (induced by source paper "from lcf to isabelle hol"):
  with members:
    - "deciding univariate polynomial problems using untrusted certificates in isabelle hol"
    - "interaction with formal mathematical documents in isabelle pide"
    - "computational logic its origins and applications"
    - "verifying strong eventual consistency in distributed systems"
    - "read eval print in parallel and asynchronous proof checking"
    - "integrating testing and interactive theorem proving"
    - "a formally verified compiler back end"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-3 (induced by source paper "formalising mathematics in simple type theory"):
  with members:
    - "computational logic its origins and applications"
    - "formalization of the fundamental group in untyped set theory using auto2"
    - "constructing recursion operators in intuitionistic type theory"
    - "mechanizing coinduction and corecursion in higher order logic"

Connected through hyperedge HE-4 (induced by source paper "computational logic its origins and applications"):
  with members:
    - "formalization of the fundamental group in untyped set theory using auto2"
    - "a formally verified proof of the central limit theorem"
    - "the foundation of a generic theorem prover"
    - "inductive analysis of the internet protocol tls"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-5 (induced by source paper "proof search specifications of bisimulation and modal logics for the pi calculus"):
  with members:
    - "formalising the pi calculus using nominal logic"
    - "induction and co induction in sequent calculus"
    - "the bedwyr system for model checking over syntactic expressions"
    - "focusing and polarization in intuitionistic logic"
    - "reasoning with higher order abstract syntax in a logical framework"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-6 (induced by source paper "constructing recursion operators in intuitionistic type theory"):
  with members:
    - "proving termination of normalization functions for conditional expressions"

Connected through hyperedge HE-7 (induced by source paper "isabelle the next 700 theorem provers"):
  with members:
    - "the foundation of a generic theorem prover"

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.LO(Logic in Computer Science)