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 exponentials"
  Abstract: This paper is the fourth of a series exposing a systematic combinatorial approach to Girard's Geometry of Interaction program. This program aims at obtaining particular realizability models for linear logic that accounts for the dynamics of cut-elimination. This fourth paper tackles the complex issue of defining exponential connectives in this framework. In order to succeed in this, we use the notion of graphings, a generalization of graphs which was defined in earlier work. We explain how we can use this framework to define a GoI for Elementary Linear Logic (ELL) with second-order quantification, a sub-system of linear logic that captures the class of elementary time computable functions.

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

Connected through hyperedge HE-4 (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 multiplicatives"
    - "interaction graphs additives"

Connected through hyperedge HE-5 (induced by source paper "interaction graphs full linear logic"):
  with members:
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "games and full completeness for multiplicative linear logic"
    - "interaction graphs multiplicatives"
    - "quantitative classical realizability"
    - "interaction graphs additives"

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

Connected through hyperedge HE-7 (induced by source paper "interaction graphs graphings"):
  with members:
    - "interaction graphs nondeterministic automata"
    - "characterizing co nl by a group action"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "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)