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: "gsos for non deterministic processes with quantitative aspects"
  Abstract: Recently, some general frameworks have been proposed as unifying theories for processes combining non-determinism with quantitative aspects (such as probabilistic or stochastically timed executions), aiming to provide general results and tools. This paper provides two contributions in this respect. First, we present a general GSOS specification format (and a corresponding notion of bisimulation) for non-deterministic processes with quantitative aspects. These specifications define labelled transition systems according to the ULTraS model, an extension of the usual LTSs where the transition relation associates any source state and transition label with state reachability weight functions (like, e.g., probability distributions). This format, hence called Weight Function SOS (WFSOS), covers many known systems and their bisimulations (e.g. PEPA, TIPP, PCSP) and GSOS formats (e.g. GSOS, Weighted GSOS, Segala-GSOS, among others). #R##N#The second contribution is a characterization of these systems as coalgebras of a class of functors, parametric on the weight structure. This result allows us to prove soundness of the WFSOS specification format, and that bisimilarities induced by these specifications are always congruences.

Connected through hyperedge HE-1 (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"
    - "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"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"

Connected through hyperedge HE-2 (induced by source paper "lean and full congruence formats for recursion"):
  with members:
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "musings on encodings and expressiveness"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-3 (induced by source paper "endofunctors modelling higher order behaviours"):
  with members:
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"
    - "generic trace semantics via coinduction"

Connected through hyperedge HE-4 (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"
    - "structural operational semantics for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "generalizing determinization from automata to coalgebras"

Connected through hyperedge HE-5 (induced by source paper "well stratified linked data for well behaved data citation"):
  with members:
    - "distributed execution of bigraphical reactive systems"
    - "a csp implementation of the bigraph embedding problem"
    - "structural operational semantics for non deterministic processes with quantitative aspects"

Connected through hyperedge HE-6 (induced by source paper "rooted branching bisimulation as a congruence for probabilistic transition systems"):
  with members:
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"
    - "deciding probabilistic automata weak bisimulation in polynomial time"

Connected through hyperedge HE-7 (induced by source paper "bisimulation of labelled state to function transition systems coalgebraically"):
  with members:
    - "bisimulation of labeled state to function transition systems of stochastic process languages"
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-8 (induced by source paper "a definition scheme for quantitative bisimulation"):
  with members:
    - "relating coalgebraic notions of bisimulation"

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)