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 hoare logic for the coinductive trace based big step semantics of while"):
  Abstract: In search for a foundational framework for reasoning about observable#N#behavior of programs that may not terminate, we have previously devised a#N#trace-based big-step semantics for While. In this semantics, both traces and#N#evaluation (relating initial states of program runs to traces they produce) are#N#defined coinductively. On terminating runs, this semantics agrees with the#N#standard inductive state-based semantics. Here we present a Hoare logic#N#counterpart of our coinductive trace-based semantics and prove it sound and#N#complete. Our logic subsumes the standard partial-correctness state-based Hoare#N#logic as well as the total-correctness variation: they are embeddable. In the#N#converse direction, projections can be constructed: a derivation of a Hoare#N#triple in our trace-based logic can be translated into a derivation in the#N#state-based logic of a translated, weaker Hoare triple. Since we work with a#N#constructive underlying logic, the range of program properties we can reason#N#about has a fine structure; in particular, we can distinguish between#N#termination and nondivergence, e.g., unbounded classically total search fails#N#to be terminating, but is nonetheless nondivergent. Our meta-theory is entirely#N#constructive as well, and we have formalized it in Coq.

Includes members:
  Member "resumptions weak bisimilarity and big step semantics for while with interactive i o an exercise in mixed induction coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interaction trees representing recursive and impure programs in coq")
  Member "mechanized semantics for the clight subset of the c language":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "skeletal semantics and their interpretations")
  Member "coinductive big step operational semantics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "program sketching with live bidirectional evaluation")
  Member "generic trace semantics via coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "preservation of equations by monoidal monads")
  Member "general recursion via coinductive types":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "soundness conditions for big step semantics")

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)