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 "a light modality for recursion"):
  Abstract: We investigate the interplay between a modality for controlling the behaviour of recursive functional programs on infinite structures which are completely silent in the syntax. The latter means that programs do not contain "marks" showing the application of the introduction and elimination rules for the modality. This shifts the burden of controlling recursion from the programmer to the compiler. To do this, we introduce a typed lambda calculus a la Curry with a silent modality and guarded recursive types. The typing discipline guarantees normalisation and can be transformed into an algorithm which infers the type of a program.

Includes members:
  Member "guarded dependent type theory with coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "programming and reasoning with guarded recursion for coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the size change principle for mixed inductive and coinductive types")
  Member "nominal coalgebraic data types with applications to lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the behaviour of coalgebras with side effects and algebras with effectful iteration")
  Member "first steps in synthetic guarded domain theory step indexing in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "continuous markovian logics axiomatization and quantified metatheory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a metalanguage for guarded iteration")

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)