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: "decidability problems for actor systems"
  Abstract: We introduce a nominal actor-based language and study its expressive power.#N#We have identified the presence/absence of fields as a crucial feature: the#N#dynamic creation of names in combination with fields gives rise to Turing#N#completeness. On the other hand, restricting to stateless actors gives rise to#N#systems for which properties such as termination are decidable. This#N#decidability result still holds for actors with states when the number of#N#actors is bounded and the state is read-only.

Connected through hyperedge HE-1 (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"
    - "parameterized model checking of timed systems with conjunctive guards"
    - "parametric linear dynamic logic"
    - "parameterized model checking of token passing systems"
    - "parameterized verification of asynchronous shared memory systems"

Connected through hyperedge HE-2 (induced by source paper "resource aware automata and games for optimal synthesis"):
  with members:
    - "parity games with weights"
    - "a coalgebraic approach to quantitative linear time logics"
    - "from branching to linear time coalgebraically"
    - "parity and streett games with costs"
    - "energy parity games"

Connected through hyperedge HE-3 (induced by source paper "analyzing guarded protocols better cutoffs more systems more expressivity"):
  with members:
    - "bounded cycle synthesis"
    - "tight cutoffs for guarded protocols with fairness"
    - "parameterized synthesis case study amba ahb"
    - "parameterized model checking of token passing systems"

Connected through hyperedge HE-4 (induced by source paper "percentile queries in multi dimensional markov decision processes"):
  with members:
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "the complexity of the kth largest subset problem and related problems"
    - "exact and approximate determinization of discounted sum automata"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "quantitative games with interval objectives"
    - "markov decision processes with multiple long run averageobjectives"
    - "to reach or not to reach efficient algorithms for total payoff games"

Connected through hyperedge HE-5 (induced by source paper "parameterized synthesis case study amba ahb"):
  with members:
    - "parameterized synthesis case study amba ahb extended version"
    - "parameterized model checking of token passing systems"
    - "ltl to b uchi automata translation fast and more deterministic"

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)