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 "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.

Includes members:
  Member "on coalgebras with internal moves":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a coalgebraic take on regular and omega regular behaviours")
  Member "weak bisimulations for labelled transition systems weighted over semirings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "behavioural equivalences for timed systems")
  Member "abstract gsos rules and a modular treatment of recursive definitions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "companions causality and codensity")
  Member "tree rules in probabilistic transition system specifications with negative and quantitative premises":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "compositional bisimulation metric reasoning with probabilistic process calculi")
  Member "bisimulation of labeled state to function transition systems of stochastic process languages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bisimulation of labelled state to function transition systems coalgebraically")
  Member "uniform labeled transition systems for nondeterministic probabilistic and stochastic process calculi":
    also connected through other hyperedges:
      (none)
  Member "approximating a behavioural pseudometric without discount for probabilistic systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computing probabilistic bisimilarity distances for probabilistic automata")

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)