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 "characterizing co nl by a group action"):
  Abstract: In a recent paper, Girard ( 2012 ) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard  2011 ) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class  co-NL  can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.

Includes members:
  Member "interaction graphs multiplicatives":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "probabilistic complexity classes through semantics")
  Member "sublogarithmic uniform boolean proof nets":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a type assignment of linear erasure and duplication")
  Member "interaction graphs additives":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "probabilistic complexity classes through semantics")
  Member "bounded linear logic revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "orthomodular lattices foulis semigroups and dagger kernel categories":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "light logics and higher order processes")

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)