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 coalgebraic approach to quantitative linear time logics"):
  Abstract: We define quantitative fixpoint logics for reasoning about linear time properties of states in systems with branching behaviour. We model such systems as coalgebras whose type arises as the composition of a branching monad with one or more polynomial endofunctors on the category of sets. The domain of truth values for our logics is determined by the choice of branching monad, as is the special modality used to abstract away branching in the semantics of the logics. To justify our choice of syntax and semantics for the logics, we prove the equivalence between their step-wise semantics and an alternative path-based semantics for the fixpoint-free fragments of the logics. Instances of these logics support reasoning about the possibility, probability or minimal cost of exhibiting a given linear time property. We conclude with two examples of logics that have a linear time flavour but do not admit a path-based semantics, namely a logic for reasoning about resource usage in infinitely-running computations, and a quantitative logic for reasoning about component interaction.

Includes members:
  Member "coalgebraic trace semantics via forgetful logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tree automata as algebras minimisation and determinisation")
  Member "from branching to linear time coalgebraically":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "resource aware automata and games for optimal synthesis")
  Member "exptime tableaux for the coalgebraic mu calculus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "np reasoning in the monotone mu calculus")

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)