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: "simulation over one counter nets is pspace complete"
  Abstract: One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other semantic equivalences, strong and weak simulation preorder are decidable for OCN, but the computational complexity was an open problem. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.

Connected through hyperedge HE-1 (induced by source paper "simulation problems over one counter nets"):
  with members:
    - "infinite state energy games"
    - "decidability of weak simulation on one counter nets"
    - "beyond language equivalence on visibly pushdown automata"
    - "equivalence checking on infinite state systems techniques and results"

Connected through hyperedge HE-2 (induced by source paper "verification for timed automata extended with unbounded discrete data structures"):
  with members:
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-3 (induced by source paper "infinite state energy games"):
  with members:
    - "solving parity games on integer vectors"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "hyperplane separation technique for multidimensional mean payoff games"
    - "mean payoff pushdown games"
    - "reachability games on extended vector addition systems with states"
    - "generalized mean payoff and energy games"
    - "energy parity games"

Connected through hyperedge HE-4 (induced by source paper "trace inclusion for one counter nets revisited"):
  with members:
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "decidability of weak simulation on one counter nets"
    - "equivalence of deterministic one counter automata is nl complete"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "ltl with the freeze quantifier and register automata"

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)