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: "interaction graphs multiplicatives"
  Abstract: We introduce a graph-theoretical representation of proofs of multiplicative linear logic which yields both a denotational semantics and a notion of truth. For this, we use a locative approach (in the sense of ludics) related to game semantics and the Danos-Regnier interpretation of GoI operators as paths in proof nets. We show how we can retrieve from this locative framework both a categorical semantics for MLL with distinct units and a notion of truth. Moreover, we show how a restricted version of our model can be reformulated in the exact same terms as Girard's latest geometry of interaction. This shows that this restriction of our framework gives a combinatorial approach to J.-Y. Girard's geometry of interaction in the hyperfinite factor, while using only graph-theoretical notions.

Connected through hyperedge HE-1 (induced by source paper "probabilistic complexity classes through semantics"):
  with members:
    - "prams over integers do not compute maxflow efficiently"
    - "characterizing co nl by a group action"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "interaction graphs exponentials"
    - "interaction graphs additives"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

Connected through hyperedge HE-2 (induced by source paper "zeta functions and the linear logic of markov processes"):
  with members:
    - "prams over integers do not compute maxflow efficiently"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "interaction graphs exponentials"
    - "interaction graphs additives"

Connected through hyperedge HE-3 (induced by source paper "coherent interaction graphs"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "interaction graphs graphings"
    - "interaction graphs additives"

Connected through hyperedge HE-4 (induced by source paper "prams over integers do not compute maxflow efficiently"):
  with members:
    - "characterizing co nl by a group action"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "logic programming and logarithmic space"
    - "interaction graphs additives"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-5 (induced by source paper "interaction graphs nondeterministic automata"):
  with members:
    - "characterizing co nl by a group action"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "logic programming and logarithmic space"
    - "interaction graphs exponentials"
    - "interaction graphs additives"

Connected through hyperedge HE-6 (induced by source paper "characterizing co nl by a group action"):
  with members:
    - "sublogarithmic uniform boolean proof nets"
    - "interaction graphs additives"
    - "bounded linear logic revisited"
    - "orthomodular lattices foulis semigroups and dagger kernel categories"

Connected through hyperedge HE-7 (induced by source paper "from dynamic to static semantics quantitatively"):
  with members:
    - "interaction graphs full linear logic"
    - "interaction graphs graphings"
    - "interaction graphs additives"

Connected through hyperedge HE-8 (induced by source paper "weak topologies for linear logic"):
  with members:
    - "mackey complete spaces and power series a topological model of differential 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)