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: "on the existence of 0 1 polytopes with high semidefinite extension complexity"
  Abstract: In Rothvo\ss{} it was shown that there exists a 0/1 polytope (a polytope whose vertices are in \{0,1\}^{n}) such that any higher-dimensional polytope projecting to it must have 2^{\Omega(n)} facets, i.e., its linear extension complexity is exponential. The question whether there exists a 0/1 polytope with high PSD extension complexity was left open. We answer this question in the affirmative by showing that there is a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a semidefinite cone of dimension~2^{\Omega(n)} and an affine space. Our proof relies on a new technique to rescale semidefinite factorizations.

Connected through hyperedge HE-1 (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"
    - "approximation limits of linear programs beyond hierarchies"
    - "how to solve ksat in polynomial time"
    - "the traveling salesman problem a linear programming formulation of"

Connected through hyperedge HE-2 (induced by source paper "computing approximate psd factorizations"):
  with members:
    - "the matching problem has no small symmetric sdp"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "the matching polytope has exponential extension complexity"
    - "computing a nonnegative matrix factorization provably"
    - "on the complexity of nonnegative matrix factorization"

Connected through hyperedge HE-3 (induced by source paper "extension complexity of formal languages"):
  with members:
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "streaming algorithms for language recognition problems"

Connected through hyperedge HE-4 (induced by source paper "the matching polytope does not admit fully polynomial size relaxation schemes"):
  with members:
    - "average case polyhedral complexity of the maximum stable set problem"
    - "affine reductions for lps and sdps"
    - "lower bounds on the size of semidefinite programming relaxations"
    - "exponential lower bounds on the size of approximate formulations in the natural encoding for capacitated facility location"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "extended formulations for polygons"

Connected through hyperedge HE-5 (induced by source paper "the matching problem has no small symmetric sdp"):
  with members:
    - "the matching polytope does not admit fully polynomial size relaxation schemes"
    - "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"
    - "an algebraic approach to symmetric extended formulations"

Connected through hyperedge HE-6 (induced by source paper "no small linear program approximates vertex cover within a factor 2 epsilon"):
  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"
    - "polynomial integrality gaps for strong sdp relaxations of densest k subgraph"
    - "integrality gaps of linear and semi definite programming relaxations for knapsack"

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

Connected through hyperedge HE-8 (induced by source paper "lower bounds on the size of semidefinite programming relaxations"):
  with members:
    - "analysis of boolean functions"
    - "sum of squares proofs and the quest toward optimal algorithms"
    - "rounding sum of squares relaxations"
    - "approximate constraint satisfaction requires large lp relaxations"
    - "the matching polytope has exponential extension complexity"
    - "approximation limits of linear programs beyond hierarchies"
    - "hypercontractivity sum of squares proofs and their applications"
    - "approximability and proof complexity"

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)