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: "recycling proof patterns in coq case studies"
  Abstract: Development of Interactive Theorem Provers has led to the creation of big libraries and varied infrastructures for formal proofs. However, despite (or perhaps due to) their sophistication, the re-use of libraries by non-experts or across domains is a challenge. In this paper, we provide detailed case studies and evaluate the machine-learning tool ML4PG built to interactively data-mine the electronic libraries of proofs, and to provide user guidance on the basis of proof patterns found in the existing libraries.

Connected through hyperedge HE-1 (induced by source paper "learning to prove with tactics"):
  with members:
    - "tactictoe learning to reason with hol4 tactics"
    - "internal guidance for satallax"
    - "sepia search for proofs using inferred automata"
    - "machine learning in proof general interfacing interfaces"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-2 (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"
    - "lemma mining over hol light"
    - "proof pattern recognition and lemma discovery in acl2"
    - "machine learning in proof general interfacing interfaces"

Connected through hyperedge HE-3 (induced by source paper "tactictoe learning to reason with hol4 tactics"):
  with members:
    - "internal guidance for satallax"
    - "sepia search for proofs using inferred automata"
    - "learning assisted theorem proving with millions of lemmas"
    - "blistr the blind strategymaker"
    - "machine learning in proof general interfacing interfaces"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-4 (induced by source paper "proofpeer collaborative theorem proving"):
  with members:
    - "capturing hiproofs in hol light"
    - "isabelle jedit a prover ide within the pide framework"
    - "a web interface for matita"
    - "learning assisted automated reasoning with flyspeck"
    - "large formal wikis issues and solutions"
    - "slope one predictors for online rating based collaborative filtering"
    - "coase s penguin or linux and the nature of the firm"

Connected through hyperedge HE-5 (induced by source paper "hott formalisation in coq dependency graphs ml4pg"):
  with members:
    - "proof pattern recognition and lemma discovery in acl2"
    - "machine learning in proof general interfacing interfaces"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "type classes for mathematics in type theory"

Connected through hyperedge HE-6 (induced by source paper "proof pattern search in coq ssreflect"):
  with members:
    - "ml4pg in computer algebra verification"
    - "lemma mining over hol light"
    - "proof pattern recognition and lemma discovery in acl2"

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)