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: "games and full completeness for multiplicative linear logic"
  Abstract: We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of {\em history-free} strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass et al.

Connected through hyperedge HE-1 (induced by source paper "interaction laws of monads and comonads"):
  with members:
    - "runners in action"
    - "notions of computation as monoids"
    - "linear usage of state"
    - "free applicative functors"
    - "handling algebraic effects"
    - "programming interfaces and basic topology"

Connected through hyperedge HE-2 (induced by source paper "truly concurrent bisimilarities are game equivalent"):
  with members:
    - "completeness for game logic"
    - "algebra of concurrent games"
    - "games for bisimulations and abstraction"
    - "algebraic laws for true concurrency"

Connected through hyperedge HE-3 (induced by source paper "a game model for proofs with costs"):
  with members:
    - "tight typings and split bounds"
    - "relating reasoning methodologies in linear logic and process algebra"
    - "a proof theoretic study of soft concurrent constraint programming"

Connected through hyperedge HE-4 (induced by source paper "operational semantics of games"):
  with members:
    - "completeness for game logic"

Connected through hyperedge HE-5 (induced by source paper "a game semantic model of computation"):
  with members:
    - "dynamic games and strategies"
    - "games for dependent types"
    - "intensionality definability and computation"

Connected through hyperedge HE-6 (induced by source paper "introduction to clarithmetic ii"):
  with members:
    - "a logical basis for constructive systems"
    - "toggling operators in computability logic"
    - "towards applied theories based on computability logic"
    - "many concepts and two logics of algorithmic reduction"
    - "in the beginning was game semantics"
    - "sequential operators in computability logic"
    - "cirquent calculus deepened"
    - "the logic of interactive turing reduction"

Connected through hyperedge HE-7 (induced by source paper "information processes and games"):
  with members:
    - "what are the fundamental structures of concurrency we still don t know"
    - "retracing some paths in process algebra"
    - "a game semantics for generic polymorphism"
    - "a structural approach to reversible computation"
    - "physical traces quantum vs classical information processing"

Connected through hyperedge HE-8 (induced by source paper "on the system cl12 of computability logic"):
  with members:
    - "introduction to clarithmetic ii"
    - "the computational complexity of propositional cirquent calculus"
    - "a propositional system induced by japaridze s approach to if logic"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "separating the basic logics of the basic recurrences"
    - "a new face of the branching recurrence of computability logic"
    - "a logical basis for constructive systems"

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)