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 generalized modality for recursion"):
  Abstract: Nakano's later modality allows types to express that the output of a function does not immediately depend on its input, and thus that computing its fixpoint is safe. This idea, guarded recursion, has proved useful in various contexts, from functional programming with infinite data structures to formulations of step-indexing internal to type theory. Categorical models have revealed that the later modality corresponds in essence to a simple reindexing of the discrete time scale.   Unfortunately, existing guarded type theories suffer from significant limitations for programming purposes. These limitations stem from the fact that the later modality is not expressive enough to capture precise input-output dependencies of functions. As a consequence, guarded type theories reject many productive definitions.   Combining insights from guarded type theories and synchronous programming languages, we propose a new modality for guarded recursion. This modality can apply any well-behaved reindexing of the time scale to a type. We call such reindexings time warps. Several modalities from the literature, including later, correspond to fixed time warps, and thus arise as special cases of ours.

Includes members:
  Member "a light modality for recursion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lewis meets brouwer constructive strict implication")
  Member "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "guarded dependent type theory with coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proof nets coends and the yoneda isomorphism")
  Member "guarded cubical type theory path equality for guarded recursion":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "denotational semantics of recursive types in synthetic guarded domain theory")
  Member "first steps in synthetic guarded domain theory step indexing in the topos of trees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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.PL(Programming Languages)