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 "affine reductions for lps and sdps"):
  Abstract: We define a reduction mechanism for LP and SDP formulations that degrades approximation factors in a controlled fashion. Our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of PCP theorems. As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) for many problems. In particular we obtain a $3/2-\varepsilon$ inapproximability for VertexCover answering an open question in [arXiv:1309.0563] and we answer a weak version of our sparse graph conjecture posed in [arXiv:1311.4001] showing an inapproximability factor of $1/2+\varepsilon$ for bounded degree IndependentSet. In the case of SDPs, we obtain inapproximability results for these problems relative to the SDP-inapproximability of MaxCUT. Moreover, using our reduction framework we are able to reproduce various results for CSPs from [arXiv:1309.0563] via simple reductions from Max-2-XOR.

Includes members:
  Member "average case polyhedral complexity of the maximum stable set problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nondeterministic communication complexity of random boolean functions")
  Member "extension complexity of independent set polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "strong reductions for extended formulations":
    also connected through other hyperedges:
      (none)
  Member "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting")
  Member "the matching problem has no small symmetric sdp":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the bit complexity of sum of squares proofs")
  Member "no small linear program approximates vertex cover within a factor 2 epsilon":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong reductions for extended formulations")
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")

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)