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: "semantics of interaction"
  Abstract: This is an introduction to Game Semantics based on some lecture notes given at the CLiCS II summer school in Cambridge in 1995. We will focus on the recent (1994) work on Game semantics, which has led to some striking advances in the Full Abstraction problem for PCF and other programming languages. Our aim is to give a genuinely elementary first introduction; we therefore present a simplified version of game semantics, which nonetheless contains most of the essential concepts. The more complex game semantics used by Abramsky, Jagadeesan and Malacaria and by Hyland and Ong to construct fully abstract models for PCF can be seen as refinements of what we present. Some background in category theory, type theory and linear logic would be helpful in reading these notes.

Connected through hyperedge HE-1 (induced by source paper "retracing some paths in process algebra"):
  with members:
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-2 (induced by source paper "a process algebra for games"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "asynchronous games innocence without alternation"
    - "sequentiality vs concurrency in games and logic"

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

Connected through hyperedge HE-4 (induced by source paper "sequentiality vs concurrency in games and logic"):
  with members:
    - "axioms for definability and full completeness"
    - "games and full completeness for multiplicative linear logic"

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.LO(Logic in Computer Science)