human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "lemma mining over hol light"
  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 all lemmas in the core HOL Light library, adding thousands of the best lemmas to the pool of named statements that can be re-used in later proofs. The usefulness of the new lemmas is then evaluated by comparing the performance of automated proving of the core HOL Light theorems with and without such added lemmas.

Connected through hyperedge HE-1 (induced by source paper "proof mining with dependent types"):
  with members:
    - "goal translation for a hammer for coq extended abstract"
    - "sepia search for proofs using inferred automata"
    - "learning assisted theorem proving with millions of lemmas"
    - "hipster integrating theory exploration in a proof assistant"
    - "mining state based models from proof corpora"
    - "recycling proof patterns in coq case studies"
    - "proof pattern recognition and lemma discovery in acl2"
    - "machine learning in proof general interfacing interfaces"

Connected through hyperedge HE-2 (induced by source paper "learning assisted theorem proving with millions of lemmas"):
  with members:
    - "mizar 40 for mizar 40"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "machine learner for automated reasoning 0 4 and 0 5"
    - "blistr the blind strategymaker"
    - "hol y hammer online atp service for hol light"
    - "theorem proving in large formal mathematics as an emerging ai field"
    - "learning assisted automated reasoning with flyspeck"
    - "atp and presentation service for mizar formalizations"

Connected through hyperedge HE-3 (induced by source paper "matching concepts across hol libraries"):
  with members:
    - "proof pattern search in coq ssreflect"
    - "the mmt api a generic mkm system"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-4 (induced by source paper "proof pattern search in coq ssreflect"):
  with members:
    - "ml4pg in computer algebra verification"
    - "recycling proof patterns in coq case studies"
    - "proof pattern recognition and lemma discovery in acl2"

Connected through hyperedge HE-5 (induced by source paper "hol y hammer online atp service for hol light"):
  with members:
    - "encoding monomorphic and polymorphic types"
    - "mizar 40 for mizar 40"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "blistr the blind strategymaker"
    - "formal mathematics on display a wiki for flyspeck"
    - "workingwiki a mediawiki based platform for collaborative research"
    - "learning assisted automated reasoning with flyspeck"
    - "atp and presentation service for mizar formalizations"

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