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

Connected through hyperedge HE-1 (induced by source paper "regular resolution for cnf of bounded incidence treewidth with few long clauses"):
  with members:
    - "understanding the complexity of sat using knowledge compilation"
    - "understanding model counting for beta acyclic cnf formulas"
    - "on the read once property of branching programs and cnfs of bounded treewidth"

Connected through hyperedge HE-2 (induced by source paper "automating resolution is np hard"):
  with members:
    - "resolution lower bounds for refutation statements"
    - "the constant inapproximability of the parameterized dominating set problem"

Connected through hyperedge HE-3 (induced by source paper "circular yet sound proofs"):
  with members:
    - "size degree trade offs for sums of squares and positivstellensatz proofs"
    - "on tackling the limits of resolution in sat solving"

Connected through hyperedge HE-4 (induced by source paper "proof complexity meets algebra"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the power of sherali adams relaxations for general valued csps"
    - "the limits of sdp relaxations for general valued csps"
    - "a note on semi algebraic proofs and gaussian elimination over prime fields"

Connected through hyperedge HE-5 (induced by source paper "tight size degree bounds for sums of squares proofs"):
  with members:
    - "sum of squares proofs and the quest toward optimal algorithms"
    - "the complexity of proving that a graph is ramsey"
    - "communication lower bounds via critical block sensitivity"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"

Connected through hyperedge HE-6 (induced by source paper "from small space to small width in resolution"):
  with members:
    - "pebble games proof complexity and time space trade offs"
    - "understanding space in proof complexity separations and trade offs via substitutions"

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)