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: "relational parametricity for computational effects"
  Abstract: According to Strachey, a polymorphic program is parametric if it applies a#N#uniform algorithm independently of the type instantiations at which it is#N#applied. The notion of relational parametricity, introduced by Reynolds, is one#N#possible mathematical formulation of this idea. Relational parametricity#N#provides a powerful tool for establishing data abstraction properties, proving#N#equivalences of datatypes, and establishing equalities of programs. Such#N#properties have been well studied in a pure functional setting. Many programs,#N#however, exhibit computational effects, and are not accounted for by the#N#standard theory of relational parametricity. In this paper, we develop a#N#foundational framework for extending the notion of relational parametricity to#N#programming languages with effects.

Connected through hyperedge HE-1 (induced by source paper "synthesising strategy improvement and recursive algorithms for solving 2 5 player parity games"):
  with members:
    - "symmetric strategy improvement"
    - "lazy probabilistic model checking without determinisation"
    - "non oblivious strategy improvement"
    - "gist a solver for probabilistic games"
    - "solving simple stochastic games with few random vertices"

Connected through hyperedge HE-2 (induced by source paper "infinitary combinatory reduction systems normalising reduction strategies"):
  with members:
    - "infinitary combinatory reduction systems confluence"

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)