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 "on the proof complexity of deep inference"):
  Abstract: We obtain two results about the proof complexity of deep inference: (1) Deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; (2) there are analytic deep-inference proof systems that exhibit an exponential speedup over analytic Gentzen proof systems that they polynomially simulate.

Includes members:
  Member "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private names in non commutative logic")
  Member "cirquent calculus deepened":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamentals of computability 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.CC(Computational Complexity)