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 "graded monads and graded logics for the linear time branching time spectrum"):
  Abstract: State-based models of concurrent systems are traditionally considered under a variety of notions of process equivalence. In the particular case of labelled transition systems, these equivalences range from trace equivalence to (strong) bisimilarity, and are organized in what is known as the linear time -- branching time spectrum. A combination of universal coalgebra and graded monads provides a generic framework in which the semantics of concurrency can be parametrized both over the branching type of the underlying transition systems and over the granularity of process equivalence. We show in the present paper that this framework of graded semantics does subsume the most important equivalences from the linear time -- branching time spectrum. An important feature of graded semantics is that it allows for the principled extraction of characteristic modal logics. We have established invariance of these graded logics under the given graded semantics in earlier work; in the present paper, we extend the logical framework with an explicit propositional layer and provide a generic expressiveness criterion that generalizes the classical Hennessy-Milner theorem to coarser notions of process equivalence. We extract graded logics for a range of graded semantics on labelled transition systems and probabilistic systems, and give exemplaric proofs of their expressiveness based on our generic criterion.

Includes members:
  Member "convex language semantics for nondeterministic probabilistic automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "non deterministic weighted automata evaluated over markov chains")
  Member "coalgebraic trace semantics via forgetful logics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tree automata as algebras minimisation and determinisation")
  Member "a linear time branching time spectrum of behavioral specification theories":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing branching distances using quantitative games")
  Member "automata theory in nominal sets":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond sets with atoms definability in first order logic")
  Member "coalgebraic trace semantics for continuous probabilistic transition systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "almost sure productivity")
  Member "sound and complete axiomatizations of coalgebraic language equivalence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward a uniform theory of effectful state machines")
  Member "from branching to linear time coalgebraically":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource aware automata and games for optimal synthesis")
  Member "generalizing determinization from automata to coalgebras":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "toward a uniform theory of effectful state machines")

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)