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 has exponential extension complexity"
  Abstract: A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a polynomial. After two decades of standstill, recent years have brought amazing progress in showing lower bounds for the so called extension complexity, which for a polytope P denotes the smallest number of inequalities necessary to describe a higher dimensional polytope Q that can be linearly projected on P. #R##N#However, the central question in this field remained wide open: can the perfect matching polytope be written as an LP with polynomially many constraints? #R##N#We answer this question negatively. In fact, the extension complexity of the perfect matching polytope in a complete n-node graph is 2^Omega(n). By a known reduction this also improves the lower bound on the extension complexity for the TSP polytope from 2^Omega(n^1/2) to 2^Omega(n).

Connected through hyperedge HE-1 (induced by source paper "extended formulation lower bounds for refuting random csps"):
  with members:
    - "sum of squares lower bounds for refuting any csp"
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "strongly refuting random csps below the spectral threshold"
    - "how to refute a random csp"
    - "complexity theoretic limitations on learning halfspaces"
    - "tensor prediction rademacher complexity and random 3 xor"
    - "lower bounds on the size of semidefinite programming relaxations"

Connected through hyperedge HE-2 (induced by source paper "quasi popular matchings optimality and extended formulations"):
  with members:
    - "understanding popular matchings via stable matchings"
    - "unpopularity factor in the marriage and roommates problems"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "extension complexity of independent set polytopes"
    - "popular edges and dominant matchings"

Connected through hyperedge HE-3 (induced by source paper "on the power of symmetric linear programs"):
  with members:
    - "definable inapproximability new challenges for duplicator"
    - "a nearly tight sum of squares lower bound for the planted clique problem"
    - "on symmetric circuits and fixed point logics"
    - "approximate constraint satisfaction requires large lp relaxations"

Connected through hyperedge HE-4 (induced by source paper "on the extension complexity of scheduling"):
  with members:
    - "a quasi polynomial approximation for the restricted assignment problem"

Connected through hyperedge HE-5 (induced by source paper "extended formulations for radial cones"):
  with members:
    - "subgraph polytopes and independence polytopes of count matroids"
    - "approximation limits of linear programs beyond hierarchies"

Connected through hyperedge HE-6 (induced by source paper "computing the nucleolus of weighted cooperative matching games in polynomial time"):
  with members:
    - "the stable fixtures problem with payments"
    - "the cooperative game theory foundations of network bargaining games"

Connected through hyperedge HE-7 (induced by source paper "introduction to nonnegative matrix factorization"):
  with members:
    - "the non convex geometry of low rank matrix optimization"
    - "on the complexity of robust pca and l1 norm low rank matrix approximation"
    - "on restricted nonnegative matrix factorization"
    - "matrix completion has no spurious local minimum"
    - "low rank approximation with entrywise ell_1 norm error"
    - "input sparsity and hardness for robust subspace approximation"
    - "sketching as a tool for numerical linear algebra"
    - "a practical algorithm for topic modeling with provable guarantees"

Connected through hyperedge HE-8 (induced by source paper "parameterized shifted combinatorial optimization"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "the parameterized complexity of the minimum shared edges problem"
    - "extension complexity mso logic and treewidth"
    - "finding a collective set of items from proportional multirepresentation to group recommendation"
    - "parameterized algorithms for modular width"
    - "algorithmic meta theorems"

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)