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 "the matching polytope does not admit fully polynomial size relaxation schemes"):
  Abstract: The groundbreaking work of Rothvos [2014] established that every linear program expressing the matching polytope has an exponential number of inequalities (formally the matching polytope has exponential extension complexity). We generalize this result by deriving strong bounds on the polyhedral inapproximability of the matching polytope: for fixed 0 < e < 1, every polyhedral (1 + e/n)-approximation requires an exponential number of inequalities, where n is the number of vertices. This is sharp given the well-known ρ-approximation of size O((nρ/(ρ−1))) provided by the odd-sets of size up to ρ/(ρ − 1). Thus matching is the first problem in P, whose natural linear encoding does not admit a fully polynomial-size relaxation scheme (the polyhedral equivalent of an FPTAS), which provides a sharp separation from the polynomial-size relaxation scheme obtained e.g., via constant-sized odd-sets mentioned above.#R##N##R##N#Our approach reuses ideas from Rothvos [2014], however the main lower bounding technique is different. While the original proof is based on the hyperplane separation bound (also called the rectangle corruption bound), we employ the information-theoretic notion of common information as introduced in Braun and Pokutta [2013], which allows to analyze perturbations of slack matrices. It turns out that the high extension complexity for the matching polytope stems from the same source of hardness as for the correlation polytope: a direct sum structure.

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 "affine reductions for lps and sdps":
    also connected through other hyperedges:
      (none)
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "exponential lower bounds on the size of approximate formulations in the natural encoding for capacitated facility location":
    also connected through other hyperedges:
      (none)
  Member "approximate constraint satisfaction requires large lp relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  Member "on the existence of 0 1 polytopes with high semidefinite extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on modeling hard combinatorial optimization problems as linear programs refutations of the unconditional impossibility claims")
  Member "the matching polytope has exponential extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extended formulation lower bounds for refuting random csps")
  Member "approximation limits of linear programs beyond hierarchies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "compressing permutation groups into grammars and polytopes a graph embedding approach")

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)