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: "polynomial time algorithms for multi type branching processes and stochastic context free grammars"
  Abstract: We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\epsilon), where \epsilon > 0 is the desired additive error bound of the solution. (The model of computation is the standard Turing machine model.) #R##N#We use this result to resolve several open problems regarding the computational complexity of computing key quantities associated with some classic and heavily studied stochastic processes, including multi-type branching processes and stochastic context-free grammars.

Connected through hyperedge HE-1 (induced by source paper "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes"):
  with members:
    - "analysis of probabilistic basic parallel processes"
    - "model checking stochastic branching processes"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"
    - "qualitative reachability in stochastic bpa games"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-2 (induced by source paper "zero reachability in probabilistic multi counter automata"):
  with members:
    - "stochastic parity games on lossy channel systems"
    - "model checking vector addition systems with one zero test"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "efficient analysis of probabilistic programs with an unbounded counter"
    - "reachability games on extended vector addition systems with states"
    - "one counter stochastic games"
    - "one counter markov decision processes"
    - "decisive markov chains"

Connected through hyperedge HE-3 (induced by source paper "stochastic context free grammars regular languages and newton s method"):
  with members:
    - "upper bounds for newton s method on monotone polynomial systems and p time model checking of probabilistic one counter automata"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"
    - "computing the least fixed point of positive polynomial systems"
    - "computing least fixed points of probabilistic systems of polynomials"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-4 (induced by source paper "upper bounds for newton s method on monotone polynomial systems and p time model checking of probabilistic one counter automata"):
  with members:
    - "exact algorithms for solving stochastic games"
    - "efficient analysis of probabilistic programs with an unbounded counter"
    - "computing the least fixed point of positive polynomial systems"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-5 (induced by source paper "a note on the complexity of comparing succinctly represented integers with an application to maximum probability parsing"):
  with members:
    - "the expressibility of functions on the boolean domain with applications to counting csps"
    - "approximating the tutte polynomial of a binary matroid and other related combinatorial polynomials"

Connected through hyperedge HE-6 (induced by source paper "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"):
  with members:
    - "approximating the termination value of one counter mdps and stochastic games"
    - "computing the least fixed point of positive polynomial systems"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-7 (induced by source paper "model checking stochastic branching processes"):
  with members:
    - "on probabilistic parallel programs with process creation and synchronisation"
    - "computing the least fixed point of positive polynomial systems"
    - "computing least fixed points of probabilistic systems of polynomials"

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.CC(Computational Complexity)