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: "the foundation of a generic theorem prover"
  Abstract: Isabelle is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a meta-logic (or `logical framework') in which the object-logics are formalized. Isabelle is now based on higher-order logic -- a precise and well-understood foundation. Examples illustrate use of this meta-logic to formalize logics and proofs. Axioms for first-order logic are shown sound and complete. Backwards proof is formalized by meta-reasoning about object-level entailment. Higher-order logic has several practical advantages over other meta-logics. Many proof techniques are known, such as Huet's higher-order unification procedure.

Connected through hyperedge HE-1 (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"
    - "natural deduction as higher order resolution"

Connected through hyperedge HE-2 (induced by source paper "functional programming with λ tree syntax"):
  with members:
    - "reasoning about higher order relational specifications"
    - "a framework for specifying prototyping and reasoning about computational systems"
    - "combining generic judgments with recursive definitions"

Connected through hyperedge HE-3 (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"
    - "natural deduction as higher order resolution"
    - "inductive analysis of the internet protocol tls"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-4 (induced by source paper "an extended type system with lambda typed lambda expressions"):
  with members:
    - "an extended type system with lambda typed lambda expressions extended version"

Connected through hyperedge HE-5 (induced by source paper "robust computer algebra theorem proving and oracle ai"):
  with members:
    - "deepmath deep sequence models for premise selection"

Connected through hyperedge HE-6 (induced by source paper "a proof strategy language and proof script generation for isabelle hol"):
  with members:
    - "close encounters of the higher kind emulating constructor classes in standard ml"
    - "sepia search for proofs using inferred automata"
    - "a formally verified compiler back end"

Connected through hyperedge HE-7 (induced by source paper "machine checked proofs for realizability checking algorithms"):
  with members:
    - "towards realizability checking of contracts using theories"

Connected through hyperedge HE-8 (induced by source paper "proof driven development"):
  with members:
    - "coq in a hurry"

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)