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 assisted theorem proving with millions of lemmas"):
  Abstract: Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such statements is named and re-used in later proofs by formal mathematicians. In this work, we suggest and implement criteria defining the estimated usefulness of the HOL Light lemmas for proving further theorems. We use these criteria to mine the large inference graph of the lemmas in the HOL Light and Flyspeck libraries, adding up to millions of the best lemmas to the pool of statements that can be re-used in later proofs. We show that in combination with learning-based relevance filtering, such methods significantly strengthen automated theorem proving of new conjectures over large formal mathematical libraries such as Flyspeck.

Includes members:
  Member "mizar 40 for mizar 40":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description")
  Member "premise selection for mathematics by corpus analysis and kernel methods":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "machine learner for automated reasoning 0 4 and 0 5":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "holist an environment for machine learning of higher order theorem proving")
  Member "lemma mining over hol light":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proof mining with dependent types")
  Member "blistr the blind strategymaker":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning of theorem proving")
  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.AI(Artificial Intelligence)