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: "on hierarchical communication topologies in the pi calculus"
  Abstract: This paper is concerned with the shape invariants satisfied by the communication topology of $$\pi \text {-term}$$s, and the automatic inference of these invariants. A $$\pi \text {-term}$$P is hierarchical if there is a finite forest $$\mathcal {T}$$ such that the communication topology of every term reachable from P satisfies a $$\mathcal {T}$$-shaped invariant. We design a static analysis to prove a term hierarchical by means of a novel type system that enjoys decidable inference. The soundness proof of the type system employs a non-standard view of $$\pi \text {-calculus}$$ reactions. The coverability problem for hierarchical terms is decidable. This is proved by showing that every hierarchical term is depth-bounded, an undecidable property known in the literature. We thus obtain an expressive static fragment of the $$\pi \text {-calculus}$$ with decidable safety verification problems.

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"
    - "model checking parameterized asynchronous shared memory systems"
    - "automatic verification of erlang style concurrency"
    - "parameterized verification of asynchronous shared memory 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.PL(Programming Languages)