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: "model checking vector addition systems with one zero test"
  Abstract: We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm yields decision proce- dures for several problems for these systems, open until now, such as place-boundedness or LTL model-checking. The proof techniques to handle the zero-test are based on two new notions of cover: the refined and the filtered cover. The refined cover is a hybrid between the reachability set and the classical cover. It inherits properties of the reachability set: equality of two refined covers is undecidable, even for usual Vector Addition Systems (with no zero-test), but the refined cover of a Vector Addition System is a recursive set. The second notion of cover, called the filtered cover, is the central tool of our algorithms. It inherits properties of the classical cover, and in particular, one can effectively compute a finite representation of this set, even for Vector Addition Systems with one zero-test.

Connected through hyperedge HE-1 (induced by source paper "an approach to computing downward closures"):
  with members:
    - "on infinite words determined by indexed languages"
    - "computing downward closures for stacked counter automata"
    - "regular cost functions part i logic and algebra over words"
    - "silent transitions in automata with storage"

Connected through hyperedge HE-2 (induced by source paper "a note on decidable separability by piecewise testable languages"):
  with members:
    - "on the state complexity of closures and interiors of regular languages with subwords and superwords"
    - "demystifying reachability in vector addition systems"
    - "an approach to computing downward closures"
    - "computing downward closures for stacked counter automata"
    - "the power of well structured systems"
    - "the separation problem for regular languages by piecewise testable languages"
    - "separating regular languages by piecewise testable and unambiguous languages"
    - "piecewise testable tree languages"

Connected through hyperedge HE-3 (induced by source paper "zero reachability in probabilistic multi counter automata"):
  with members:
    - "stochastic parity games on lossy channel systems"
    - "polynomial time algorithms for multi type branching processes and stochastic context free grammars"
    - "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"

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.DM(Discrete Mathematics)