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: "extension complexity of independent set polytopes"
  Abstract: We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity larger than exponential in $\Theta(\sqrt{n})$. Our construction is inspired by a relatively little-known connection between extended formulations and (monotone) circuit depth.

Connected through hyperedge HE-1 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity"):
  with members:
    - "near optimal lower bounds on quantifier depth and weisfeiler leman refinement steps"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "space proof complexity for random 3 cnfs"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "communication lower bounds via critical block sensitivity"

Connected through hyperedge HE-2 (induced by source paper "quasi popular matchings optimality and extended formulations"):
  with members:
    - "understanding popular matchings via stable matchings"
    - "unpopularity factor in the marriage and roommates problems"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "popular edges and dominant matchings"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-3 (induced by source paper "extension complexity of the correlation polytope"):
  with members:
    - "improved bounds for the excluded grid theorem"
    - "communication complexity for algorithm designers"
    - "extended formulation for csp that is compact for instances of bounded treewidth"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-4 (induced by source paper "lower bounds for approximating the matching polytope"):
  with members:
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "information equals amortized communication"

Connected through hyperedge HE-5 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting"):
  with members:
    - "the matching polytope does not admit fully polynomial size relaxation schemes"
    - "subgraph polytopes and independence polytopes of count matroids"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"

Connected through hyperedge HE-6 (induced by source paper "extension complexity of stable set polytopes of bipartite graphs"):
  with members:
    - "fooling sets and the spanning tree polytope"
    - "communication complexity for algorithm designers"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-7 (induced by source paper "small extended formulation for knapsack cover inequalities from monotone circuits"):
  with members:
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "addition is exponentially harder than counting for shallow monotone circuits"
    - "a 4 approximation for scheduling on a single machine with general cost function"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "the geometry of scheduling"

Connected through hyperedge HE-8 (induced by source paper "affine reductions for lps and sdps"):
  with members:
    - "average case polyhedral complexity of the maximum stable set problem"
    - "strong reductions for extended formulations"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "the matching polytope does not admit fully polynomial size relaxation schemes"
    - "the matching problem has no small symmetric sdp"
    - "no small linear program approximates vertex cover within a factor 2 epsilon"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"

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)