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 full linear logic"
  Abstract: Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all "Geometry of Interaction" (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite), provides a model for full linear logic with second order quantification.

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"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "interaction graphs exponentials"
    - "interaction graphs multiplicatives"
    - "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"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "interaction graphs exponentials"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

Connected through hyperedge HE-3 (induced by source paper "lower bounds for prams over z"):
  with members:
    - "prams over integers do not compute maxflow efficiently"
    - "interaction graphs graphings"
    - "interaction graphs exponentials"

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"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "logic programming and logarithmic space"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"
    - "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 additives"
    - "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"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "logic programming and logarithmic space"
    - "interaction graphs exponentials"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

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

Connected through hyperedge HE-8 (induced by source paper "interaction graphs graphings"):
  with members:
    - "interaction graphs nondeterministic automata"
    - "characterizing co nl by a group action"
    - "towards a complexity through realizability theory"
    - "interaction graphs exponentials"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

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)