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: "automatic verification of erlang style concurrency"
  Abstract: This paper presents an approach to verify safety properties of Erlang-style, higher-order concurrent programs automatically. Inspired by Core Erlang, we introduce λ Actor, a prototypical functional language with pattern-matching algebraic data types, augmented with process creation and asynchronous message-passing primitives. We formalise an abstract model of λ Actor programs called Actor Communicating System (ACS) which has a natural interpretation as a vector addition system, for which some verification problems are decidable. We give a parametric abstract interpretation framework for λ Actor and use it to build a polytime computable, flow-based, abstract semantics of λ Actor programs, which we then use to bootstrap the ACS construction, thus deriving a more accurate abstract model of the input program.

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

Connected through hyperedge HE-2 (induced by source paper "bounded symbolic execution for runtime error detection of erlang programs"):
  with members:
    - "predicate pairing for program verification"

Connected through hyperedge HE-3 (induced by source paper "approaching the coverability problem continuously"):
  with members:
    - "demystifying reachability in vector addition systems"
    - "incremental inductive coverability"

Connected through hyperedge HE-4 (induced by source paper "occam s razor applied to the petri net coverability problem"):
  with members:
    - "approaching the coverability problem continuously"

Connected through hyperedge HE-5 (induced by source paper "optimizing abstract abstract machines"):
  with members:
    - "introspective pushdown analysis of higher order programs"
    - "abstracting abstract machines a systematic approach to higher order program analysis"
    - "systematic abstraction of abstract machines"
    - "cfa2 a context free approach to control flow analysis"
    - "higher order symbolic execution via contracts"

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)