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 "fair simulation for nondeterministic and probabilistic buechi automata a coalgebraic perspective"):
  Abstract: Notions of simulation, among other uses, provide a computationally tractable#N#and sound (but not necessarily complete) proof method for language inclusion.#N#They have been comprehensively studied by Lynch and Vaandrager for#N#nondeterministic and timed systems; for B\"{u}chi automata the notion of fair#N#simulation has been introduced by Henzinger, Kupferman and Rajamani. We#N#contribute to a generalization of fair simulation in two different directions:#N#one for nondeterministic tree automata previously studied by Bomhard; and the#N#other for probabilistic word automata with finite state spaces, both under the#N#B\"{u}chi acceptance condition. The former nondeterministic definition is#N#formulated in terms of systems of fixed-point equations, hence is readily#N#translated to parity games and is then amenable to Jurdzi\'{n}ski's algorithm;#N#the latter probabilistic definition bears a strong ranking-function flavor.#N#These two different-looking definitions are derived from one source, namely our#N#coalgebraic modeling of B\"{u}chi automata. Based on these coalgebraic#N#observations, we also prove their soundness: a simulation indeed witnesses#N#language inclusion.

Includes members:
  Member "quantitative simulations by matrices":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coalgebraic infinite traces and kleisli simulations")
  Member "coalgebraic trace semantics for buechi and parity automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a coalgebraic take on regular and omega regular behaviours")
  Member "coalgebraic infinite traces and kleisli simulations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "guarded and unguarded iteration for generalized processes")
  Member "coalgebraic trace semantics for continuous probabilistic transition systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graded monads and graded logics for the linear time branching time spectrum")
  Member "from branching to linear time coalgebraically":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resource aware automata and games for optimal synthesis")
  Member "generic trace semantics via coinduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "preservation of equations by monoidal monads")

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)