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 parameterized asynchronous shared memory systems"
  Abstract: We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes. 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#We analyze the case in which processes are modeled by finite-state machines or pushdown machines and the property is given by a B\"uchi automaton over the alphabet of read and write actions of the leader. We show that the problem is decidable, and has a surprisingly low complexity: it is NP-complete when all processes are finite-state machines, and is PSPACE-hard and in NEXPTIME when they are pushdown machines. This complexity is lower than for the non-parameterized case: liveness verification of finitely many finite-state machines is PSPACE-complete, and undecidable for two pushdown machines. #R##N#For finite-state machines, our proofs characterize infinite behaviors using existential abstraction and semilinear constraints. For pushdown machines, we show how contributor computations of high stack height can be simulated by computations of many contributors, each with low stack height. Together, our results characterize the complexity of verification for parameterized systems under the assumptions of anonymity and asynchrony.

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"
    - "automatic verification of erlang style concurrency"
    - "parameterized verification of asynchronous shared memory systems"

Connected through hyperedge HE-2 (induced by source paper "complexity of liveness in parameterized systems"):
  with members:
    - "fine grained complexity of safety verification"
    - "a short counterexample property for safety and liveness verification of fault tolerant distributed algorithms"

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"
    - "parameterized verification of 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 "on parametrized verification of asynchronous shared memory pushdown systems"):
  with members:
    - "reachability in networks of register protocols under stochastic schedulers"
    - "sequentializing parameterized programs"
    - "context bounded analysis for concurrent programs with dynamic creation of threads"
    - "parameterised pushdown systems with non atomic writes"

Connected through hyperedge HE-5 (induced by source paper "reachability in networks of register protocols under stochastic schedulers"):
  with members:
    - "tight cutoffs for guarded protocols with fairness"
    - "an automata theoretic approach to the verification of distributed algorithms"
    - "parameterised pushdown systems with non atomic writes"

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

Connected through hyperedge HE-7 (induced by source paper "proving liveness of parameterized programs"):
  with members:
    - "termination analysis by learning terminating programs"
    - "linear ranking for linear lasso programs"

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.DC(Distributed, Parallel, and Cluster Computing)