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 "learning to prove with tactics"):
  Abstract: We implement a automated tactical prover TacticToe on top of the HOL4 interactive theorem prover. TacticToe learns from human proofs which mathematical technique is suitable in each proof situation. This knowledge is then used in a Monte Carlo tree search algorithm to explore promising tactic-level proof paths. On a single CPU, with a time limit of 60 seconds, TacticToe proves 66.4 percent of the 7164 theorems in HOL4's standard library, whereas E prover with auto-schedule solves 34.5 percent. The success rate rises to 69.0 percent by combining the results of TacticToe and E prover.

Includes members:
  Member "tactictoe learning to reason with hol4 tactics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "teaching temporal logics to neural networks")
  Member "internal guidance for satallax":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enigmawatch proofwatch meets enigma")
  Member "sepia search for proofs using inferred automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to prove theorems via interacting with proof assistants")
  Member "recycling proof patterns in coq case studies":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proof mining with dependent types")
  Member "machine learning in proof general interfacing interfaces":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "qed at large a survey of engineering of formally verified software")
  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.AI(Artificial Intelligence)