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 "monotone projection lower bounds from extended formulation lower bounds"):
  Abstract: In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta, Tiwari, & de Wolf (STOC 2012; J. ACM, 2015) and Rothvoss (STOC 2014; J. ACM, 2017), we obtain the following interesting consequences. #R##N#1. The Hamiltonian Cycle polynomial is not a monotone subexponential-size projection of the permanent; this both rules out a natural attempt at a monotone lower bound on the Boolean permanent, and shows that the permanent is not complete for non-negative polynomials in VNP$_{{\mathbb R}}$ under monotone p-projections. #R##N#2. The cut polynomials and the perfect matching polynomial (or "unsigned Pfaffian") are not monotone p-projections of the permanent. The latter, over the Boolean and-or semi-ring, rules out monotone reductions in one of the natural approaches to reducing perfect matchings in general graphs to perfect matchings in bipartite graphs. #R##N#As the permanent is universal for monotone formulas, these results also imply exponential lower bounds on the monotone formula size and monotone circuit size of these polynomials.

Includes members:
  Member "bipartite perfect matching is in quasi nc":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "some complete and intermediate polynomials in algebraic complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterized valiant s classes")
  Member "boundaries of vp and vnp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "lower bounds for monotone counting circuits":
    also connected through other hyperedges:
      (none)
  Member "the matching polytope has exponential extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "extended formulation lower bounds for refuting random csps")
  Member "a dichotomy theorem for homomorphism polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "some complete and intermediate polynomials in algebraic complexity theory")

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)