human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "from branching to linear time coalgebraically"
  Abstract: We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with branching is able to exhibit a particular linear-time behaviour. This instantiates to measuring the probability of a specific behaviour occurring in a probabilistic system, or measuring the minimal cost of exhibiting a specific behaviour in the case of weighted computations.

Connected through hyperedge HE-1 (induced by source paper "resource aware automata and games for optimal synthesis"):
  with members:
    - "parity games with weights"
    - "a coalgebraic approach to quantitative linear time logics"
    - "decidability problems for actor systems"
    - "parity and streett games with costs"
    - "energy parity games"

Connected through hyperedge HE-2 (induced by source paper "graded monads and graded logics for the linear time branching time spectrum"):
  with members:
    - "convex language semantics for nondeterministic probabilistic automata"
    - "coalgebraic trace semantics via forgetful logics"
    - "a linear time branching time spectrum of behavioral specification theories"
    - "automata theory in nominal sets"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "generalizing determinization from automata to coalgebras"
    - "generic trace logics"

Connected through hyperedge HE-3 (induced by source paper "fair simulation for nondeterministic and probabilistic buechi automata a coalgebraic perspective"):
  with members:
    - "quantitative simulations by matrices"
    - "coalgebraic trace semantics for buechi and parity automata"
    - "coalgebraic infinite traces and kleisli simulations"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-4 (induced by source paper "coalgebraic trace semantics via forgetful logics"):
  with members:
    - "simplified coalgebraic trace equivalence"
    - "generalizing determinization from automata to coalgebras"
    - "generic trace logics"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-5 (induced by source paper "a coalgebraic approach to quantitative linear time logics"):
  with members:
    - "coalgebraic trace semantics via forgetful logics"
    - "exptime tableaux for the coalgebraic mu calculus"

Question: Please tell me which class the center node 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)