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: "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.

Connected through hyperedge HE-1 (induced by source paper "de morgan dual nominal quantifiers modelling private names in non commutative logic"):
  with members:
    - "subatomic proof systems splittable systems"
    - "private names in non commutative logic"
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "interaction and depth against nondeterminism in proof search"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-2 (induced by source paper "subatomic proof systems splittable systems"):
  with members:
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "interaction and depth against nondeterminism in proof search"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-3 (induced by source paper "private names in non commutative logic"):
  with members:
    - "a deep inference system with a self dual binder which is complete for linear lambda calculus"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae"
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-4 (induced by source paper "a cirquent calculus system with clustering and ranking"):
  with members:
    - "the computational complexity of propositional cirquent calculus"
    - "extracting verified decision procedures dpll and resolution"
    - "a propositional system induced by japaridze s approach to if logic"
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "from formulas to cirquents in computability logic"
    - "the countable versus uncountable branching recurrences in computability logic"
    - "soundness and completeness of the cirquent calculus system cl6 for computability logic"

Connected through hyperedge HE-5 (induced by source paper "a propositional system induced by japaridze s approach to if logic"):
  with members:
    - "the taming of recurrences in computability logic through cirquent calculus part ii"
    - "the parallel versus branching recurrences in computability logic"
    - "from formulas to cirquents in computability logic"
    - "the countable versus uncountable branching recurrences in computability logic"
    - "soundness and completeness of the cirquent calculus system cl6 for computability logic"
    - "in the beginning was game semantics"
    - "cirquent calculus deepened"

Connected through hyperedge HE-6 (induced by source paper "interaction and depth against nondeterminism in proof search"):
  with members:
    - "a system of interaction and structure"
    - "a system of interaction and structure ii the need for deep inference"

Connected through hyperedge HE-7 (induced by source paper "a quasipolynomial cut elimination procedure in deep inference via atomic flows and threshold formulae"):
  with members:
    - "a system of interaction and structure"

Connected through hyperedge HE-8 (induced by source paper "a system of interaction and structure iv the exponentials and decomposition"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "a system of interaction and structure"
    - "from proof nets to the free autonomous category"
    - "a system of interaction and structure ii the need for deep inference"

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.CC(Computational Complexity)