human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "interaction graphs nondeterministic automata":
    also connected through other hyperedges:
      (none)
  Member "characterizing co nl by a group action":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic complexity classes through semantics")
  Member "interaction graphs full linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "probabilistic complexity classes through semantics")
  Member "towards a complexity through realizability theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistic complexity classes through semantics")
  Member "interaction graphs exponentials":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "probabilistic complexity classes through semantics")
  Member "interaction graphs multiplicatives":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic complexity classes through semantics")
  Member "interaction graphs additives":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "probabilistic complexity classes through semantics")

Question: Please tell me which class the source paper 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)