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 metalanguage for guarded iteration"):
  Abstract: Notions of guardedness serve to delineate admissible recursive definitions in various settings in a compositional manner. In recent work, we have introduced an axiomatic notion of guardedness in symmetric monoidal categories, which serves as a unifying framework for various examples from program semantics, process algebra, and beyond. In the present paper, we propose a generic metalanguage for guarded iteration based on combining this notion with the fine-grain call-by-value paradigm, which we intend as a unifying programming language for guarded and unguarded iteration in the presence of computational effects. We give a generic (categorical) semantics of this language over a suitable class of strong monads supporting guarded iteration, and show it to be in touch with the standard operational behaviour of iteration by giving a concrete big-step operational semantics for a certain specific instance of the metalanguage and establishing adequacy for this case.

Includes members:
  Member "guarded traced categories":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "differentiable causal computations via delayed trace")
  Member "a semantics for hybrid iteration":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an adequate while language for hybrid computation")
  Member "guard your daggers and traces properties of guarded co recursion":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "diamonds are not forever liveness in reactive programming with guarded recursion")
  Member "complete elgot monads and coalgebraic resumptions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "guarded and unguarded iteration for generalized processes")
  Member "a decidable weakening of compass logic based on cone shaped cardinal directions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "interval vs point temporal logic model checking an expressiveness comparison")
  Member "a hoare logic for the coinductive trace based big step semantics of while":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "guarded and unguarded iteration for generalized processes")
  Member "intensionality definability and computation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "local local reasoning a bi hyperdoctrine for full ground store")

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)