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 "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"):
  Abstract: We present the guarded lambda-calculus, an extension of the simply typed#N#lambda-calculus with guarded recursive and coinductive types. The use of#N#guarded recursive types ensures the productivity of well-typed programs.#N#Guarded recursive types may be transformed into coinductive types by a#N#type-former inspired by modal logic and Atkey-McBride clock quantification,#N#allowing the typing of acausal functions. We give a call-by-name operational#N#semantics for the calculus, and define adequate denotational semantics in the#N#topos of trees. The adequacy proof entails that the evaluation of a program#N#always terminates. We introduce a program logic with L\"ob induction for#N#reasoning about the contextual equivalence of programs. We demonstrate the#N#expressiveness of the calculus by showing the definability of solutions to#N#Rutten's behavioural differential equations.

Includes members:
  Member "cubical type theory a constructive interpretation of the univalence axiom":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cubical language for bishop sets")
  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 "constructive modalities with provability smack":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lewis meets brouwer constructive strict implication")
  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")

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)