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 graphings"
  Abstract: In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of our setting. This third paper extends this approach by considering a generalization of graphs named graphings, which is in some way a geometric realization of a graph. This very general framework leads to a number of new models of multiplicative-additive linear logic which generalize Girard's geometry of interaction models and opens several new lines of research. As an example, we exhibit a family of such models which account for second-order quantification without suffering the same limitations as Girard's models.

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 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"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "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 full linear logic"
    - "interaction graphs exponentials"

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

Connected through hyperedge HE-5 (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"
    - "logic programming and logarithmic space"
    - "interaction graphs multiplicatives"
    - "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"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "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 full linear logic"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

Connected through hyperedge HE-8 (induced by source paper "memoization for unary logic programming characterizing ptime"):
  with members:
    - "characterizing co nl by a group action"
    - "unification and logarithmic space"
    - "logic programming and logarithmic space"
    - "simulation of two way pushdown automata revisited"
    - "an implicit characterization of pspace"
    - "light types for polynomial time computation in lambda calculus"

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)