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: "fixed point characterization of compositionality properties of probabilistic processes combinators"
  Abstract: Bisimulation metric is a robust behavioural semantics for probabilistic processes. Given any SOS specification of probabilistic processes, we provide a meth od to compute for each operator of the language its respective metric compositionality property. The compositionality property of an operator is defined as its modulus of continuity which gives the re lative increase of the distance between processes when they are combined by that operator. The compositionality property of an operator is computed by recursively counting how many times the combined processes are copied along their evolution. The compositionality properties allow to derive an upper bound on the distance between processes by purely inspecting the operators used to specify those processes.

Connected through hyperedge HE-1 (induced by source paper "equational reasonings in wireless network gossip protocols"):
  with members:
    - "a probabilistic calculus of cyber physical systems"
    - "modelling mac layer communications in wireless systems"
    - "a process algebra for wireless mesh networks"
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "an analytical model of information dissemination for a gossip based protocol"

Connected through hyperedge HE-2 (induced by source paper "logical characterization of bisimulation metrics"):
  with members:
    - "divide and congruence ii from decomposition of modal formulas to preservation of delay and weak bisimilarity"
    - "modal characterisations of behavioural pseudometrics"
    - "topologies of stochastic markov models computational aspects"
    - "probabilistic bisimulation naturally on distributions"
    - "when equivalence and bisimulation join forces in probabilistic automata"
    - "continuous markovian logics axiomatization and quantified metatheory"
    - "logical metric and algorithmic characterisations of probabilistic bisimulation"
    - "characterising probabilistic processes logically"

Connected through hyperedge HE-3 (induced by source paper "compositional bisimulation metric reasoning with probabilistic process calculi"):
  with members:
    - "logical characterization of bisimulation metrics"
    - "compositionality of approximate bisimulation for probabilistic systems"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"

Connected through hyperedge HE-4 (induced by source paper "metric reasoning about λ terms the affine case long version"):
  with members:
    - "step indexed logical relations for probability"
    - "church a language for generative models"
    - "program equivalence in linear contexts"

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)