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 "rapid prototyping formal systems in mmt 5 case studies"):
  Abstract: Logical frameworks are meta-formalisms in which the syntax and semantics of object logics and related formal systems can be defined. This allows object logics to inherit implementations from the framework including, e.g., parser, type checker, or module system. But if the desired object logic falls outside the comfort zone of the logical framework, these definitions may become cumbersome or infeasible.#R##N#Therefore, the MMT system abstracts even further than previous frameworks: it assumes no type system or logic at all and allows its kernel algorithms to be customized by almost arbitrary sets of rules. In particular, this allows implementing standard logical frameworks like LF in MMT. But#R##N#it does so without chaining users to one particular meta-formalism: users can flexibly adapt MMT whenever the object logic demands it.#R##N#In this paper, we present a series of case studies that do just that, defining increasingly complex object logics in MMT. We use elegant declarative logic definitions wherever possible, but inject entirely new rules into the kernel when necessary. Our experience shows that the MMT approach allows deriving prototype implementations of very diverse formal systems very easily and quickly.

Includes members:
  Member "the mmt api a generic mkm system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gf mmt glf from language to semantics through lf")
  Member "theory presentation combinators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "building on the diamonds between theories theory presentation combinators")
  Member "a query language for formal mathematical libraries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "alignment based translations across formal systems using interface theories")
  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 "building on the diamonds between theories theory presentation combinators")
  Member "the abella interactive theorem prover system description":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "formalization of metatheory of the quipper quantum programming language in a linear logic")

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)