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 "narrow proofs may be maximally long"):
  Abstract: We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must have a proof in size n^O(w) is essentially tight. Moreover, our lower bound generalizes to polynomial calculus resolution (PCR) and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. Our results do not extend all the way to Lasserre, however, where the formulas we study have proofs of constant rank and size polynomial in both n and w.

Includes members:
  Member "a generalized method for proving polynomial calculus degree lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps")
  Member "tight size degree bounds for sums of squares proofs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sherali adams and the binary encoding of combinatorial principles")
  Member "communication lower bounds via critical block sensitivity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "on the complexity of finding narrow proofs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the speed of constraint propagation and the time complexity of arc consistency testing")
  Member "hypercontractivity sum of squares proofs and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sum of squares bounds for the ordering principle")
  Member "approximability and proof complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficiently learning structured distributions from untrusted batches")
  Member "clause learning algorithms with many restarts and bounded width resolution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "towards a complexity theoretic understanding of restarts in sat solvers")
  Member "understanding space in proof complexity separations and trade offs via substitutions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps")

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)