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: "the mmt api a generic mkm system"
  Abstract: The MMT language has been developed as a scalable representation and interchange language for formal mathematical knowledge. It permits natural representations of the syntax and semantics of virtually all declarative languages while making MMT-based MKM services easy to implement. It is foundationally unconstrained and can be instantiated with specific formal languages. #R##N#The MMT API implements the MMT language along with multiple backends for persistent storage and frontends for machine and user access. Moreover, it implements a wide variety of MMT-based knowledge management services. The API and all services are generic and can be applied to any language represented in MMT. A plugin interface permits injecting syntactic and semantic idiosyncrasies of individual formal languages.

Connected through hyperedge HE-1 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies"):
  with members:
    - "theory presentation combinators"
    - "a query language for formal mathematical libraries"
    - "type classes for mathematics in type theory"
    - "a scalable module system"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-2 (induced by source paper "gf mmt glf from language to semantics through lf"):
  with members:
    - "a scalable module system"

Connected through hyperedge HE-3 (induced by source paper "sharing hol4 and hol light proof knowledge"):
  with members:
    - "the common hol platform"
    - "premise selection and external provers for hol4"
    - "structure formation in large theories"
    - "matching concepts across hol libraries"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-4 (induced by source paper "a logic independent ide"):
  with members:
    - "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"
    - "large formal wikis issues and solutions"
    - "a scalable module system"

Connected through hyperedge HE-5 (induced by source paper "matching concepts across hol libraries"):
  with members:
    - "proof pattern search in coq ssreflect"
    - "lemma mining over hol light"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-6 (induced by source paper "a universal machine for biform theory graphs"):
  with members:
    - "a scalable module system"
    - "integrating multiple sources to answer questions in algebraic topology"

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.LO(Logic in Computer Science)