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: "full abstraction for nominal general references"
  Abstract: Game semantics has been used with considerable success in formulating fully#N#abstract semantics for languages with higher-order procedures and a wide range#N#of computational effects. Recently, nominal games have been proposed for#N#modelling functional languages with names. These are ordinary, stateful games#N#cast in the theory of nominal sets developed by Pitts and Gabbay. Here we take#N#nominal games one step further, by developing a fully abstract semantics for a#N#language with nominal general references.

Connected through hyperedge HE-1 (induced by source paper "regular behaviours with names"):
  with members:
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "nominal coalgebraic data types with applications to lambda calculus"
    - "algebraic theories over nominal sets"
    - "rational streams coalgebraically"

Connected through hyperedge HE-2 (induced by source paper "intensionality definability and computation"):
  with members:
    - "information processes and games"
    - "what are the fundamental structures of concurrency we still don t know"
    - "axioms for definability and full completeness"
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-3 (induced by source paper "game semantics for access control"):
  with members:
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-4 (induced by source paper "algebraic theories over nominal sets"):
  with members:
    - "strongly complete logics for coalgebras"

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)