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: "tree rules in probabilistic transition system specifications with negative and quantitative premises"
  Abstract: Probabilistic transition system specifications (PTSSs) in the nt f /nt x format provide structural operational semantics for Segala-type systems that exhibit both probabilistic and nondeterministic behavior and guarantee that bisimilarity is a congruence. Similar to the nondeterministic case of the rule format tyft/tyxt, we show that the well-foundedness requirement is unnecessary in the probabilistic setting. To achieve this, we first define a generalized version of the nt f /nt x format in which quantitative premises and conclusions include nested convex combinations of distributions. Also this format guarantees that bisimilarity is a congruence. Then, for a given (possibly non-well-founded) PTSS in the new format, we construct an equivalent well-founded PTSS consisting of only rules of the simpler (well-founded) probabilistic ntree format. Furthermore, we develop a proof-theoretic notion for these PTSSs that coincides with the existing stratification-based meaning in case the PTSS is stratifiable. This continues the line of research lifting structural operational semantic results from the nondeterministic setting to systems with both probabilistic and nondeterministic behavior.

Connected through hyperedge HE-1 (induced by source paper "compositional bisimulation metric reasoning with probabilistic process calculi"):
  with members:
    - "logical characterization of bisimulation metrics"
    - "fixed point characterization of compositionality properties of probabilistic processes combinators"
    - "compositionality of approximate bisimulation for probabilistic systems"

Connected through hyperedge HE-2 (induced by source paper "rooted branching bisimulation as a congruence for probabilistic transition systems"):
  with members:
    - "gsos for non deterministic processes with quantitative aspects"
    - "deciding probabilistic automata weak bisimulation in polynomial time"

Connected through hyperedge HE-3 (induced by source paper "sos rule formats for convex and abstract probabilistic bisimulations"):
  with members:
    - "rooted branching bisimulation as a congruence for probabilistic transition systems"

Connected through hyperedge HE-4 (induced by source paper "structural operational semantics for non deterministic processes with quantitative aspects"):
  with members:
    - "killing epsilons with a dagger a coalgebraic study of systems with algebraic label structure"
    - "behavioural equivalences for coalgebras with unobservable moves"
    - "a definition scheme for quantitative bisimulation"
    - "distributive laws and decidable properties of sos specifications"
    - "on coalgebras with internal moves"
    - "gsos for non deterministic processes with quantitative aspects"
    - "coalgebraic weak bisimulation from recursive equations over monads"
    - "weak bisimulations for labelled transition systems weighted over semirings"

Connected through hyperedge HE-5 (induced by source paper "gsos for non deterministic processes with quantitative aspects"):
  with members:
    - "on coalgebras with internal moves"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "abstract gsos rules and a modular treatment of recursive definitions"
    - "bisimulation of labeled state to function transition systems of stochastic process languages"
    - "uniform labeled transition systems for nondeterministic probabilistic and stochastic process calculi"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-6 (induced by source paper "fixed point characterization of compositionality properties of probabilistic processes combinators"):
  with members:
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "computing distances between probabilistic automata"
    - "congruence from the operator s point of view compositionality requirements on process semantics"

Connected through hyperedge HE-7 (induced by source paper "compositionality of approximate bisimulation for probabilistic systems"):
  with members:
    - "computing distances between probabilistic automata"

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.PL(Programming Languages)