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 "shallow embedding of type theory is morally correct"):
  Abstract: There are multiple ways to formalise the metatheory of type theory. For some purposes, it is enough to consider specific models of a type theory, but sometimes it is necessary to refer to the syntax, for example in proofs of canonicity and normalisation. One option is to embed the syntax deeply, by using inductive definitions in a proof assistant. However, in this case the handling of definitional equalities becomes technically challenging. Alternatively, we can reuse conversion checking in the metatheory by shallowly embedding the object theory. In this paper, we consider the standard model of a type theoretic object theory in Agda. This model has the property that all of its equalities hold definitionally, and we can use it as a shallow embedding by building expressions from the components of this model. However, if we are to reason soundly about the syntax with this setup, we must ensure that distinguishable syntactic constructs do not become provably equal when shallowly embedded. First, we prove that shallow embedding is injective up to definitional equality, by modelling the embedding as a syntactic translation targeting the metatheory. Second, we use an implementation hiding trick to disallow illegal propositional equality proofs and constructions which do not come from the syntax. We showcase our technique with very short formalisations of canonicity and parametricity for Martin-Lof type theory. Our technique only requires features which are available in all major proof assistants based on dependent type theory.

Includes members:
  Member "pointers in recursion exploring the tropics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cubical language for bishop sets")
  Member "canonicity and normalisation for dependent type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cubical syntax for reflection free extensional equality")
  Member "axioms for modelling cubical type theory in a topos":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parametric cubical type theory")
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a cubical language for bishop sets")
  Member "quotient inductive inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming")
  Member "normalisation by evaluation for type theory in type theory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constructing higher inductive types as groupoid quotients")
  Member "first steps in synthetic guarded domain theory step indexing in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")

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)