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: "a query language for formal mathematical libraries"
  Abstract: One of the most promising applications of mathematical knowledge management is search: Even if we restrict attention to the tiny fragment of mathematics that has been formalized, the amount exceeds the comprehension of an individual human. #R##N#Based on the generic representation language MMT, we introduce the mathematical query language QMT: It combines simplicity, expressivity, and scalability while avoiding a commitment to a particular logical formalism. QMT can integrate various search paradigms such as unification, semantic web, or XQuery style queries, and QMT queries can span different mathematical libraries. #R##N#We have implemented QMT as a part of the MMT API. This combination provides a scalable indexing and query engine that can be readily applied to any library of mathematical knowledge. While our focus here is on libraries that are available in a content markup language, QMT naturally extends to presentation and narration markup languages.

Connected through hyperedge HE-1 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies"):
  with members:
    - "the mmt api a generic mkm system"
    - "theory presentation combinators"
    - "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 "alignment based translations across formal systems using interface theories"):
  with members:
    - "interoperability in the opendreamkit project the math in the middle approach"
    - "matching concepts across hol libraries"
    - "realms a structure for consolidating knowledge about mathematical theories"
    - "a foundational view on integration problems"
    - "a scalable module system"

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"
    - "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-4 (induced by source paper "the mmt api a generic mkm system"):
  with members:
    - "a scalable module system"
    - "towards mkm in the large modular representation and scalable software architecture"

Connected through hyperedge HE-5 (induced by source paper "a scalable module system"):
  with members:
    - "a universal machine for biform theory graphs"
    - "a foundational view on integration problems"
    - "stexide an integrated development environment for stex collections"
    - "towards mkm in the large modular representation and scalable software architecture"

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)