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: "parameterised pushdown systems with non atomic writes"
  Abstract: We consider the master/slave parameterised reachability problem for networks of pushdown systems, where communication is via a global store using only non-atomic reads and writes. We show that the control-state reachability problem is decidable. As part of the result, we provide a constructive extension of a theorem by Ehrenfeucht and Rozenberg to produce an NFA equivalent to certain kinds of CFG. Finally, we show that the non-parameterised version is undecidable.

Connected through hyperedge HE-1 (induced by source paper "liveness in broadcast networks"):
  with members:
    - "parity to safety in polynomial time for pushdown and collapsible pushdown systems"
    - "parameterized verification of synchronization in constrained reconfigurable broadcast networks"
    - "fine grained complexity of safety verification"
    - "a short counterexample property for safety and liveness verification of fault tolerant distributed algorithms"
    - "reachability in networks of register protocols under stochastic schedulers"
    - "on hierarchical communication topologies in the pi calculus"
    - "model checking parameterized asynchronous shared memory systems"
    - "automatic verification of erlang style concurrency"

Connected through hyperedge HE-2 (induced by source paper "fine grained complexity of safety verification"):
  with members:
    - "slightly superexponential parameterized problems"
    - "effect summaries for thread modular analysis"
    - "on problems as hard as cnf sat"
    - "on parametrized verification of asynchronous shared memory pushdown systems"
    - "model checking parameterized asynchronous shared memory systems"
    - "parameterized verification of asynchronous shared memory systems"
    - "kernelization lower bounds by cross composition"
    - "context bounded analysis for concurrent programs with dynamic creation of threads"

Connected through hyperedge HE-3 (induced by source paper "parameterized verification of synchronization in constrained reconfigurable broadcast networks"):
  with members:
    - "reachability in networks of register protocols under stochastic schedulers"
    - "parameterized verification of asynchronous shared memory systems"

Connected through hyperedge HE-4 (induced by source paper "the diagonal problem for higher order recursion schemes is decidable"):
  with members:
    - "on word and frontier languages of unsafe higher order grammars"
    - "unboundedness and downward closures of higher order pushdown automata"
    - "ordered tree pushdown systems"
    - "an approach to computing downward closures"
    - "using models to model check recursive schemes"
    - "a characterization for decidable separability by piecewise testable languages"
    - "finite automata for the sub and superword closure of cfls descriptional and computational complexity"
    - "computing downward closures for stacked counter automata"

Connected through hyperedge HE-5 (induced by source paper "on parametrized verification of asynchronous shared memory pushdown systems"):
  with members:
    - "reachability in networks of register protocols under stochastic schedulers"
    - "model checking parameterized asynchronous shared memory systems"
    - "sequentializing parameterized programs"
    - "context bounded analysis for concurrent programs with dynamic creation of threads"

Connected through hyperedge HE-6 (induced by source paper "reachability in networks of register protocols under stochastic schedulers"):
  with members:
    - "tight cutoffs for guarded protocols with fairness"
    - "model checking parameterized asynchronous shared memory systems"
    - "an automata theoretic approach to the verification of distributed algorithms"

Connected through hyperedge HE-7 (induced by source paper "reachability for dynamic parametric processes"):
  with members:
    - "model checking parameterized asynchronous shared memory systems"
    - "reachability under contextual locking"
    - "parameterized verification of asynchronous shared memory systems"

Connected through hyperedge HE-8 (induced by source paper "model checking parameterized asynchronous shared memory systems"):
  with members:
    - "parameterized verification of asynchronous shared memory systems"
    - "the computational power of population protocols"
    - "the existential theory of equations with rational constraints in free groups is pspace complete"

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)