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: "no small linear program approximates vertex cover within a factor 2 epsilon"
  Abstract: The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor $2 - \epsilon$, assuming the Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. Without resorting to the UGC, the best inapproximability result for the problem is due to Dinur and Safra (2002): vertex cover is NP-hard to approximate within a factor 1.3606. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor $2-\epsilon$ has super-polynomially many inequalities. As a direct consequence of our methods, we also establish that LP relaxations (as well as SDP relaxations) that approximate the independent set problem within any constant factor have super-polynomial size.

Connected through hyperedge HE-1 (induced by source paper "strong reductions for extended formulations"):
  with members:
    - "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"
    - "extension complexity mso logic and treewidth"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "sparsest cut on bounded treewidth graphs algorithms and hardness results"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"

Connected through hyperedge HE-2 (induced by source paper "affine reductions for lps and sdps"):
  with members:
    - "average case polyhedral complexity of the maximum stable set problem"
    - "extension complexity of independent set polytopes"
    - "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"
    - "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)