human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "certified connection tableaux proofs for hol light and tptp"):
  Abstract: In the recent years, the Metis prover based on ordered paramodulation and model elimination has replaced the earlier built-in methods for general-purpose proof automation in HOL4 and Isabelle/HOL. In the annual CASC competition, the leanCoP system based on connection tableaux has however performed better than Metis. In this paper we show how the leanCoP's core algorithm can be implemented inside HOLLight. leanCoP's flagship feature, namely its minimalistic core, results in a very simple proof system. This plays a crucial role in extending the MESON proof reconstruction mechanism to connection tableaux proofs, providing an implementation of leanCoP that certifies its proofs. We discuss the differences between our direct implementation using an explicit Prolog stack, to the continuation passing implementation of MESON present in HOLLight and compare their performance on all core HOLLight goals. The resulting prover can be also used as a general purpose TPTP prover. We compare its performance against the resolution based Metis on TPTP and other interesting datasets.

Includes members:
  Member "premise selection and external provers for hol4":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep reinforcement learning for synthesizing functions in higher order logic")
  Member "mizar 40 for mizar 40":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description")
  Member "learning assisted theorem proving with millions of lemmas":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "holist an environment for machine learning of higher order theorem proving")
  Member "machine learning of coq proof guidance first experiments":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "elementary logic in linear space")
  Member "premise selection for mathematics by corpus analysis and kernel methods":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "hol y hammer online atp service for hol light":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description")
  Member "theorem proving in large formal mathematics as an emerging ai field":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on theorem provers in formal methods")
  Member "learning assisted automated reasoning with flyspeck":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")

Question: Please tell me which class the source paper 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)