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 scalable module system"
  Abstract: Symbolic and logic computation systems ranging from computer algebra systems to theorem provers are finding their way into science, technology, mathematics and engineering. But such systems rely on explicitly or implicitly represented mathematical knowledge that needs to be managed to use such systems effectively. #R##N#While mathematical knowledge management (MKM) "in the small" is well-studied, scaling up to large, highly interconnected corpora remains difficult. We hold that in order to realize MKM "in the large", we need representation languages and software architectures that are designed systematically with large-scale processing in mind. #R##N#Therefore, we have designed and implemented the MMT language -- a module system for mathematical theories. MMT is designed as the simplest possible language that combines a module system, a foundationally uncommitted formal semantics, and web-scalable implementations. Due to a careful choice of representational primitives, MMT allows us to integrate existing representation languages for formal mathematical knowledge in a simple, scalable formalism. In particular, MMT abstracts from the underlying mathematical and logical foundations so that it can serve as a standardized representation format for a formal digital library. Moreover, MMT systematically separates logic-dependent and logic-independent concerns so that it can serve as an interface layer between computation systems and MKM systems.

Connected through hyperedge HE-1 (induced by source paper "building on the diamonds between theories theory presentation combinators"):
  with members:
    - "rapid prototyping formal systems in mmt 5 case studies"
    - "biform theories project description"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "theory presentation combinators"
    - "the mathscheme library some preliminary experiments"
    - "type classes for mathematics in type theory"
    - "on duplication in mathematical repositories"

Connected through hyperedge HE-2 (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"
    - "a query language for formal mathematical libraries"
    - "type classes for mathematics in type theory"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-3 (induced by source paper "a definitional implementation of the lax logical framework llfp in coq for supporting fast and loose reasoning"):
  with members:
    - "proceedings 13th international workshop on verification of infinite state systems"
    - "a coinductive semantics of the unlimited register machine"

Connected through hyperedge HE-4 (induced by source paper "big math and the one brain barrier a position paper and architecture proposal"):
  with members:
    - "isabelle jedit as ide for domain specific formal languages and informal text documents"

Connected through hyperedge HE-5 (induced by source paper "gf mmt glf from language to semantics through lf"):
  with members:
    - "the mmt api a generic mkm system"

Connected through hyperedge HE-6 (induced by source paper "biform theories project description"):
  with members:
    - "hol light qe"
    - "incorporating quotation and evaluation into church s type theory"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "formalizing mathematical knowledge as a biform theory graph a case study"
    - "realms a structure for consolidating knowledge about mathematical theories"
    - "a universal machine for biform theory graphs"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"
    - "theory presentation combinators"

Connected through hyperedge HE-7 (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 query language for formal mathematical libraries"
    - "a foundational view on integration problems"

Connected through hyperedge HE-8 (induced by source paper "formalizing mathematical knowledge as a biform theory graph a case study"):
  with members:
    - "incorporating quotation and evaluation into church s type theory"
    - "theory morphisms in church s type theory with quotation and evaluation"
    - "incorporating quotation and evaluation into church s type theory syntax and semantics"
    - "the formalization of syntax based mathematical algorithms using quotation and evaluation"

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)