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: "parameterized verification of asynchronous shared memory systems"
  Abstract: We characterize the complexity of the safety verification problem for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributors. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically.#R##N##R##N#We analyze the complexity of the safety verification problem when processes are modeled by finite-state machines, pushdown machines, and Turing machines. The problem is coNP-complete when all processes are finite-state machines, and is PSPACE-complete when they are pushdown machines. The complexity remains coNP-complete when each Turing machine is allowed boundedly many interactions with the register. Our proofs use combinatorial characterizations of computations in the model, and in case of pushdown-systems, some language-theoretic constructions of independent interest.

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 "promptness and bounded fairness in concurrent and parameterized systems"):
  with members:
    - "distributed synthesis for parameterized temporal logics"
    - "analyzing guarded protocols better cutoffs more systems more expressivity"
    - "tight cutoffs for guarded protocols with fairness"
    - "parameterized synthesis case study amba ahb"
    - "decidability problems for actor systems"
    - "parameterized model checking of timed systems with conjunctive guards"
    - "parametric linear dynamic logic"
    - "parameterized model checking of token passing systems"

Connected through hyperedge HE-3 (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"
    - "kernelization lower bounds by cross composition"
    - "context bounded analysis for concurrent programs with dynamic creation of threads"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-4 (induced by source paper "parameterized verification of synchronization in constrained reconfigurable broadcast networks"):
  with members:
    - "reachability in networks of register protocols under stochastic schedulers"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-5 (induced by source paper "abstract interpretation of stateful networks"):
  with members:
    - "verifying reachability in networks with mutable datapaths"
    - "symnet scalable symbolic execution for modern networks"

Connected through hyperedge HE-6 (induced by source paper "reachability for dynamic parametric processes"):
  with members:
    - "model checking parameterized asynchronous shared memory systems"
    - "reachability under contextual locking"
    - "parameterised pushdown systems with non atomic writes"

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

Connected through hyperedge HE-8 (induced by source paper "keeping a crowd safe on the complexity of parameterized verification corrected version"):
  with members:
    - "the power of well structured 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.LO(Logic in Computer Science)