human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "building on the diamonds between theories theory presentation combinators"):
  Abstract: To build a large library of mathematics, it seems more efficient to take advantage of the inherent structure of mathematical theories. Various theory presentation combinators have been proposed, and some have been implemented, in both legacy and current systems. Surprisingly, the ``standard library'' of most systems do not make pervasive use of these combinators.  We present a set of combinators optimized for reuse, via the tiny theories approach. Our combinators draw their power from the inherent structure already present in the \emph{category of contexts} associated to a dependently typed language. The current work builds on ideas originating in CLEAR and Specware and their descendents (both direct and intellectual). Driven by some design criteria for user-centric library design, our library-building experience via the systematic use of combinators has fed back into the semantics of these combinators, and later into an updated syntax for them.

Includes members:
  Member "rapid prototyping formal systems in mmt 5 case studies":
    also connected through other hyperedges:
      (none)
  Member "biform theories project description":
    also connected through other hyperedges:
      (none)
  Member "the biequivalence of locally cartesian closed categories and martin lof type theories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cubical language for bishop sets")
  Member "theory presentation combinators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies")
  Member "the mathscheme library some preliminary experiments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "biform theories project description")
  Member "type classes for mathematics in type theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tabled typeclass resolution")
  Member "a scalable module system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies")
  Member "on duplication in mathematical repositories":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "theory presentation combinators")

Question: Please tell me which class the source paper 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)