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: "bisimulation of labeled state to function transition systems of stochastic process languages"
  Abstract: Labeled state-to-function transition systems, FuTS for short, admit multiple transition schemes from states to functions of finite support over general semirings. As such they constitute a convenient modeling instrument to deal with stochastic process languages. In this paper, the notion of bisimulation induced by a FuTS is addressed from a coalgebraic point of view. A correspondence result is proven stating that FuTS-bisimulation coincides with the behavioral equivalence of the asso- ciated functor. As generic examples, the concrete existing equivalences for the core of the stochastic process algebras PEPA and IML are related to the bisimulation of specific FuTS, providing via the correspondence result coalgebraic justification of the equivalences of these calculi.

Connected through hyperedge HE-1 (induced by source paper "bisimulation of labelled state to function transition systems coalgebraically"):
  with members:
    - "gsos for non deterministic processes with quantitative aspects"
    - "relating coalgebraic notions of bisimulation"

Connected through hyperedge HE-2 (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"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"
    - "uniform labeled transition systems for nondeterministic probabilistic and stochastic process calculi"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-3 (induced by source paper "coalgebraic weak bisimulation from recursive equations over monads"):
  with members:
    - "weak bisimulation for coalgebras over order enriched monads"
    - "weak bisimulations for labelled transition systems weighted over semirings"
    - "relating coalgebraic notions of bisimulation"
    - "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)