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: "ludics with repetitions exponentials interactive types and completeness"
  Abstract: Ludics is peculiar in the panorama of game semantics: we first have the#N#definition of interaction-composition and then we have semantical types, as a#N#set of strategies which "behave well" and react in the same way to a set of#N#tests. The semantical types which are interpretations of logical formulas enjoy#N#a fundamental property, called internal completeness, which characterizes#N#ludics and sets it apart also from realizability. Internal completeness entails#N#standard full completeness as a consequence. A growing body of work start to#N#explore the potential of this specific interactive approach. However, ludics#N#has some limitations, which are consequence of the fact that in the original#N#formulation, strategies are abstractions of MALL proofs. On one side, no#N#repetitions are allowed. On the other side, the proofs tend to rely on the very#N#specific properties of the MALL proof-like strategies, making it difficult to#N#transfer the approach to semantical types into different settings. In this#N#paper, we provide an extension of ludics which allows repetitions and show that#N#one can still have interactive types and internal completeness. From this, we#N#obtain full completeness w.r.t. a polarized version of MELL. In our extension,#N#we use less properties than in the original formulation, which we believe is of#N#independent interest. We hope this may open the way to applications of ludics#N#approach to larger domains and different settings.

Connected through hyperedge HE-1 (induced by source paper "on the meaning of logical completeness"):
  with members:
    - "the duality of computation under focus"
    - "abstract machines for dialogue games"
    - "introduction to linear logic and ludics part ii"

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)