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: "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.

Connected through hyperedge HE-1 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting"):
  with members:
    - "extension complexity of independent set polytopes"
    - "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-2 (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"
    - "extension complexity mso logic and treewidth"
    - "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"
    - "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-3 (induced by source paper "extension complexity of independent set polytopes"):
  with members:
    - "communication complexity for algorithm designers"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "communication lower bounds via critical block sensitivity"

Connected through hyperedge HE-4 (induced by source paper "average case polyhedral complexity of the maximum stable set problem"):
  with members:
    - "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"

Connected through hyperedge HE-5 (induced by source paper "the matching problem has no small symmetric sdp"):
  with members:
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "on the existence of 0 1 polytopes with high semidefinite extension complexity"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "an algebraic approach to symmetric extended formulations"

Connected through hyperedge HE-6 (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 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"

Connected through hyperedge HE-7 (induced by source paper "the matching polytope has exponential extension complexity"):
  with members:
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "on the existence of 0 1 polytopes with high semidefinite extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "extended formulations for polygons"
    - "extended formulations non negative factorizations and randomized communication protocols"

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)