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 "a system of interaction and structure iv the exponentials and decomposition"):
  Abstract: We study a system, called NEL, which is the mixed commutative/non-commutative linear logic BV augmented with linear logic's exponentials. Equivalently, NEL is MELL augmented with the non-commutative self-dual connective seq. In this paper, we show a basic compositionality property of NEL, which we call decomposition. This result leads to a cut-elimination theorem, which is proved in the next paper of this series. To control the induction measure for the theorem, we rely on a novel technique that extracts from NEL proofs the structure of exponentials, into what we call !-?-Flow-Graphs.

Includes members:
  Member "games and full completeness for multiplicative linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interaction laws of monads and comonads")
  Member "on the proof complexity of deep inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")
  Member "a system of interaction and structure":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")
  Member "from proof nets to the free autonomous category":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proof nets coends and the yoneda isomorphism")
  Member "a system of interaction and structure ii the need for deep inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic")

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)