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 additives"
  Abstract: Geometry of Interaction (GoI) is a kind of semantics of linear logic proofs that aims at accounting for the dynamical aspects of cut-elimination. We present here a parametrized construction of a Geometry of Interaction for Multiplicative Additive Linear Logic (MALL) in which proofs are represented by families of directed weighted graphs. Contrarily to former constructions dealing with additive connectives, we are able to solve the known issue of obtaining a denotational semantics for MALL by introducing a notion of observational equivalence. Moreover, our setting has the advantage of being the first construction dealing with additives where proofs of MALL are interpreted by finite objects. The fact that we obtain a denotational model of MALL relies on a single geometric property, which we call the trefoil property, from which we obtain, for each value of the parameter, adjunctions. We then proceed to show how this setting is related to Girard's various constructions: particular choices of the parameter respectively give a combinatorial version of his latest GoI, a refined version of older Geometries of Interaction based on nilpotency. This shows the importance of the trefoil property underlying our constructions since all known GoI construction to this day rely on particular cases of it.

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 multiplicatives"
    - "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 multiplicatives"

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 multiplicatives"

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 multiplicatives"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-5 (induced by source paper "loop quasi invariant chunk motion by peeling with statement composition"):
  with members:
    - "interaction graphs full linear logic"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-6 (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 multiplicatives"

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

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

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)