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 "extension complexity of independent set polytopes"):
  Abstract: We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity larger than exponential in $\Theta(\sqrt{n})$. Our construction is inspired by a relatively little-known connection between extended formulations and (monotone) circuit depth.

Includes members:
  Member "the matching polytope does not admit fully polynomial size relaxation schemes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lifting linear extension complexity bounds to the mixed integer setting")
  Member "communication complexity for algorithm designers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "lower bounds on the size of semidefinite programming relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "approximate constraint satisfaction requires large lp relaxations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "new dependencies of hierarchies in polynomial optimization")
  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 "communication lower bounds via critical block sensitivity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)