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: "isabelle the next 700 theorem provers"
  Abstract: Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory, and higher-order logic. This survey of Isabelle serves as an introduction to the literature. It explains why generic theorem proving is beneficial. It gives a thorough history of Isabelle, beginning with its origins in the LCF system. It presents an account of how logics are represented, illustrated using classical logic. The approach is compared with the Edinburgh Logical Framework. Several of the Isabelle object-logics are presented.

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 "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"
    - "the foundation of a generic theorem prover"
    - "inductive analysis of the internet protocol tls"

Connected through hyperedge HE-3 (induced by source paper "applications of the gauss jordan algorithm done right"):
  with members:
    - "a framework for the verification of certifying computations"
    - "misfortunes of a mathematicians trio using computer algebra systems can we trust"

Connected through hyperedge HE-4 (induced by source paper "specifying and executing optimizations for parallel programs"):
  with members:
    - "a formally verified compiler back end"

Connected through hyperedge HE-5 (induced by source paper "a graphical language for proof strategies"):
  with members:
    - "towards automated proof strategy generalisation"

Connected through hyperedge HE-6 (induced by source paper "computer assisted human oriented inductive theorem proving by descente infinie a manifesto"):
  with members:
    - "hilbert s epsilon as an operator of indefinite committed choice"
    - "the foundation of a generic theorem prover"
    - "syntactic confluence criteria for positive negative conditional term rewriting systems"

Connected through hyperedge HE-7 (induced by source paper "isabelle pide as platform for educational tools"):
  with members:
    - "a wiki for mizar motivation considerations and initial prototype"

Connected through hyperedge HE-8 (induced by source paper "lim delta and non permutability of beta steps"):
  with members:
    - "hilbert s epsilon as an operator of indefinite committed choice"

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)