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: "dependencies in formal mathematics applications and extraction for coq and mizar"
  Abstract: Two methods for extracting detailed formal dependencies from the Coq and Mizar system are presented and compared. The methods are used for dependency extraction from two large mathematical repositories: the Coq Repository at Nijmegen and the Mizar Mathematical Library. Several applications of the detailed dependency analysis are described and proposed. Motivated by the different applications, we discuss the various kinds of dependencies that we are interested in, and the suitability of various dependency extraction methods.

Connected through hyperedge HE-1 (induced by source paper "a logic independent ide"):
  with members:
    - "the mmt api a generic mkm system"
    - "isabelle jedit a prover ide within the pide framework"
    - "a query language for formal mathematical libraries"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "large formal wikis issues and solutions"
    - "a scalable module system"

Connected through hyperedge HE-2 (induced by source paper "hott formalisation in coq dependency graphs ml4pg"):
  with members:
    - "recycling proof patterns in coq case studies"
    - "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"
    - "type classes for mathematics in type theory"

Connected through hyperedge HE-3 (induced by source paper "premise selection for mathematics by corpus analysis and kernel methods"):
  with members:
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "atp and presentation service for mizar formalizations"
    - "large formal wikis issues and solutions"
    - "automated reasoning and presentation support for formalizing mathematics in mizar"

Connected through hyperedge HE-4 (induced by source paper "machine learning of coq proof guidance first experiments"):
  with members:
    - "initial experiments with tptp style automated theorem provers on acl2 problems"
    - "hol y hammer online atp service for hol light"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"

Connected through hyperedge HE-5 (induced by source paper "eliciting implicit assumptions of mizar proofs by property omission"):
  with members:
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "large formal wikis issues and solutions"
    - "mizar items exploring fine grained dependencies in the mizar mathematical library"

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