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 "proof mining with dependent types"):
  Abstract: Several approaches exist to data-mining big corpora of formal proofs. Some of these approaches are based on statistical machine learning, and some -- on theory exploration. However, most are developed for either untyped or simply-typed theorem provers. In this paper, we present a method that combines statistical data mining and theory exploration in order to analyse and automate proofs in dependently typed language of Coq.

Includes members:
  Member "goal translation for a hammer for coq extended abstract":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "concrete semantics with coq and coqhammer")
  Member "sepia search for proofs using inferred automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning to prove theorems via interacting with proof assistants")
  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 "hipster integrating theory exploration in a proof assistant":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "qed at large a survey of engineering of formally verified software")
  Member "mining state based models from proof corpora":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sepia search for proofs using inferred automata")
  Member "recycling proof patterns in coq case studies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to prove with tactics")
  Member "lemma mining over hol light":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning assisted theorem proving with millions of lemmas")
  Member "proof pattern recognition and lemma discovery in acl2":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "lifter language to encode induction heuristics for isabelle hol")

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.PL(Programming Languages)