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 "monte carlo tableau proof search"):
  Abstract: We study Monte Carlo Tree Search to guide proof search in tableau calculi. This includes proposing a number of proof-state evaluation heuristics, some of which are learnt from previous proofs. We present an implementation based on the leanCoP prover. The system is trained and evaluated on a large suite of related problems coming from the Mizar proof assistant, showing that it is capable to find new and different proofs.

Includes members:
  Member "internal guidance for satallax":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enigmawatch proofwatch meets enigma")
  Member "leopard a generic platform for the implementation of higher order reasoners":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "designing normative theories of ethical reasoning formal framework methodology and tool support")
  Member "mizar 40 for mizar 40":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description")
  Member "certified connection tableaux proofs for hol light and tptp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards finding longer proofs")
  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 "learning assisted automated reasoning with flyspeck":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)