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: "large formal wikis issues and solutions"
  Abstract: We present several steps towards large formal mathematical wikis. The Coq proof assistant together with the CoRN repository are added to the pool of systems handled by the general wiki system described in [10]. A smart re-verification scheme for the large formal libraries in the wiki is suggested for Mizar/MML and Coq/CoRN, based on recently developed precise tracking of mathematical dependencies.We propose to use features of state-of-the-art filesystems to allow real-time cloning and sandboxing of the entire libraries, allowing also to extend the wiki to a true multi-user collaborative area. A number of related issues are discussed.

Connected through hyperedge HE-1 (induced by source paper "documentation generator focusing on symbols for the html ized mizar library"):
  with members:
    - "pide for asynchronous interaction with coq"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "pide as front end technology for coq"
    - "isabelle jedit a prover ide within the pide framework"
    - "atp and presentation service for mizar formalizations"
    - "licensing the mizar mathematical library"
    - "a wiki for mizar motivation considerations and initial prototype"

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

Connected through hyperedge HE-3 (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"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "a scalable module system"

Connected through hyperedge HE-4 (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"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "atp and presentation service for mizar formalizations"
    - "automated reasoning and presentation support for formalizing mathematics in mizar"

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"
    - "lemma mining over hol light"
    - "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"

Connected through hyperedge HE-6 (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"
    - "dependencies in formal mathematics applications and extraction for coq and mizar"
    - "mizar items exploring fine grained dependencies in the mizar mathematical library"

Connected through hyperedge HE-7 (induced by source paper "learning assisted automated reasoning with flyspeck"):
  with members:
    - "encoding monomorphic and polymorphic types"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "blistr the blind strategymaker"
    - "a synthesis of the procedural and declarative styles of interactive theorem proving"
    - "theorem proving in large formal mathematics as an emerging ai field"
    - "atp and presentation service for mizar formalizations"
    - "automated reasoning and presentation support for formalizing mathematics in mizar"
    - "proviola a tool for proof re animation"

Connected through hyperedge HE-8 (induced by source paper "proof in context web editing with rich modeless contextual feedback"):
  with members:
    - "read eval print in parallel and asynchronous proof checking"
    - "point and write documenting formal mathematics by reference"
    - "a web interface for matita"
    - "understanding the learners actions when using mathematics learning tools"
    - "atp and presentation service for mizar formalizations"
    - "proviola a tool for proof re animation"

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.DL(Digital Libraries)