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: "coalgebraic trace semantics for continuous probabilistic transition systems"
  Abstract: Coalgebras in a Kleisli category yield a generic definition of trace#N#semantics for various types of labelled transition systems. In this paper we#N#apply this generic theory to generative probabilistic transition systems, short#N#PTS, with arbitrary (possibly uncountable) state spaces. We consider the#N#sub-probability monad and the probability monad (Giry monad) on the category of#N#measurable spaces and measurable functions. Our main contribution is that the#N#existence of a final coalgebra in the Kleisli category of these monads is#N#closely connected to the measure-theoretic extension theorem for sigma-finite#N#pre-measures. In fact, we obtain a practical definition of the trace measure#N#for both finite and infinite traces of PTS that subsumes a well-known result#N#for discrete probabilistic transition systems. Finally we consider two example#N#systems with uncountable state spaces and apply our theory to calculate their#N#trace measures.

Connected through hyperedge HE-1 (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"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "from branching to linear time coalgebraically"
    - "generalizing determinization from automata to coalgebras"
    - "generic trace logics"

Connected through hyperedge HE-2 (induced by source paper "almost sure productivity"):
  with members:
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "proving termination of probabilistic programs using patterns"
    - "data oblivious stream productivity"

Connected through hyperedge HE-3 (induced by source paper "trace semantics via determinization for probabilistic transition systems"):
  with members:
    - "up to techniques for weighted systems extended version"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-4 (induced by source paper "behavioural equivalences for timed systems"):
  with members:
    - "weak bisimulation for coalgebras over order enriched monads"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "on coalgebras with internal moves"
    - "lax functors and coalgebraic weak bisimulation"
    - "gsos for non deterministic processes with quantitative aspects"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "coinduction up to in a fibrational setting"

Connected through hyperedge HE-5 (induced by source paper "quantitative simulations by matrices"):
  with members:
    - "coalgebraic trace semantics via forgetful logics"
    - "coalgebraic infinite traces and kleisli simulations"
    - "coinduction up to in a fibrational setting"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "computation of the greatest simulations and bisimulations between fuzzy automata"
    - "bisimulations for fuzzy automata"
    - "simulation vs equivalence"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-6 (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"
    - "from branching to linear time coalgebraically"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-7 (induced by source paper "behavioural equivalences for coalgebras with unobservable moves"):
  with members:
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "weak bisimulation for coalgebras over order enriched monads"
    - "on coalgebras with internal moves"
    - "gsos for non deterministic processes with quantitative aspects"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "generalizing determinization from automata to coalgebras"

Connected through hyperedge HE-8 (induced by source paper "coalgebraic infinite traces and kleisli simulations"):
  with members:
    - "quantitative simulations by matrices"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "generic trace semantics via coinduction"

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)