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: "deciding probabilistic automata weak bisimulation in polynomial time"
  Abstract: Deciding in an efficient way weak probabilistic bisimulation in the context of Probabilistic Automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the existence of a weak combined transition satisfying the step condition of the bisimulation. We also present several extensions of weak combined transitions, such as hyper-transitions and the new concepts of allowed weak combined and hyper-transitions and of equivalence matching, that turn out to be verifiable in polynomial time as well. These results set the ground for the development of more effective compositional analysis algorithms for probabilistic systems.

Connected through hyperedge HE-1 (induced by source paper "rooted branching bisimulation as a congruence for probabilistic transition systems"):
  with members:
    - "gsos for non deterministic processes with quantitative aspects"
    - "tree rules in probabilistic transition system specifications with negative and quantitative premises"

Connected through hyperedge HE-2 (induced by source paper "probabilistic bisimulation naturally on distributions"):
  with members:
    - "robust synchronization in markov decision processes"
    - "when equivalence and bisimulation join forces in probabilistic automata"
    - "bisimulations meet pctl equivalences for probabilistic automata"
    - "late weak bisimulation for markov automata"
    - "mean field for markov decision processes from discrete to continuous optimization"
    - "qualitative analysis of partially observable markov decision processes"

Connected through hyperedge HE-3 (induced by source paper "lattice structures for bisimilar probabilistic automata"):
  with members:
    - "bisimilarity of probabilistic pushdown automata"

Connected through hyperedge HE-4 (induced by source paper "when equivalence and bisimulation join forces in probabilistic automata"):
  with members:
    - "on the complexity of the equivalence problem for probabilistic automata"
    - "algorithms for game metrics"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

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.FL(Formal Languages and Automata Theory)