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 "strong reductions for extended formulations"):
  Abstract: We generalize the reduction mechanism between linear programming problems from [1] in two ways 1 relaxing the requirement of affineness, and 2 extending to fractional optimization problems.#R##N##R##N#As applications we provide several new LP-hardness and SDP-hardness results, e.g., for the SparsestCut problem, the BalancedSeparator problem, the MaxCut problem and the Matching problem on 3-regular graphs. We also provide a new, very strong Lasserre integrality gap for the IndependentSet problem, which is strictly greater than the best known LP approximation, showing that the Lasserre hierarchy does not always provide the tightest SDP relaxation.

Includes members:
  Member "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "list decodable subspace recovery")
  Member "the matching polytope does not admit fully polynomial size relaxation schemes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting")
  Member "extension complexity mso logic and treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity")
  Member "no small linear program approximates vertex cover within a factor 2 epsilon":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "affine reductions for lps and sdps")
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "approximate constraint satisfaction requires large lp relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  Member "sparsest cut on bounded treewidth graphs algorithms and hardness results":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the parameterized complexity of sparsest cut and small set expansion problems")
  Member "the matching polytope has exponential extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "extended formulation lower bounds for refuting random csps")

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)