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: "approximation limits of linear programs beyond hierarchies"
  Abstract: We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for approximations of semidefinite programs by linear programs. Our main ingredient is a quantitative improvement of Razborov's rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjointness matrix.

Connected through hyperedge HE-1 (induced by source paper "compressing permutation groups into grammars and polytopes a graph embedding approach"):
  with members:
    - "optimal regular expressions for permutations"
    - "arithmetic branching programs with memory"

Connected through hyperedge HE-2 (induced by source paper "subexponential lps approximate max cut"):
  with members:
    - "sherali adams strikes back"
    - "approximating rectangles by juntas and weakly exponential lower bounds for lp relaxations of csps"
    - "rounding semidefinite programming hierarchies via global correlation"
    - "approximating csps with global cardinality constraints using sdp hierarchies"

Connected through hyperedge HE-3 (induced by source paper "on modeling hard combinatorial optimization problems as linear programs refutations of the unconditional impossibility claims"):
  with members:
    - "some upper and lower bounds on psd rank"
    - "on the existence of 0 1 polytopes with high semidefinite extension complexity"
    - "how to solve ksat in polynomial time"
    - "the traveling salesman problem a linear programming formulation of"

Connected through hyperedge HE-4 (induced by source paper "extended formulations for radial cones"):
  with members:
    - "subgraph polytopes and independence polytopes of count matroids"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-5 (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"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-6 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting"):
  with members:
    - "extension complexity of independent set polytopes"
    - "the matching polytope does not admit fully polynomial size relaxation schemes"
    - "subgraph polytopes and independence polytopes of count matroids"
    - "the matching polytope has exponential extension complexity"

Connected through hyperedge HE-7 (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"
    - "the matching polytope does not admit fully polynomial size relaxation schemes"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "small extended formulation for knapsack cover inequalities from monotone circuits"):
  with members:
    - "extension complexity of independent set polytopes"
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "addition is exponentially harder than counting for shallow monotone circuits"
    - "a 4 approximation for scheduling on a single machine with general cost function"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "the geometry of scheduling"

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)