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 "algebraic branching programs border complexity and tangent spaces"):
  Abstract: Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of noncommutative polynomials with ABP width complexity at most $k$ is Zariski-closed, an important property in geometric complexity theory. It follows that approximations cannot help to reduce the required ABP width. #R##N#It was mentioned by Forbes that this result would probably break when going from single-(source,sink) ABPs to trace ABPs. We prove that this is correct. Moreover, we study the commutative monotone setting and prove a result similar to Nisan, but concerning the analytic closure. We observe the same behavior here: The set of polynomials with ABP width complexity at most $k$ is closed for single-(source,sink) ABPs and not closed for trace ABPs. The proofs reveal an intriguing connection between tangent spaces and the vector space of flows on the ABP. We close with additional observations on VQP and the closure of VNP which allows us to establish a separation between the two classes.

Includes members:
  Member "strongly exponential separation between monotone vp and monotone vnp":
    also connected through other hyperedges:
      (none)
  Member "on top fan in vs formal degree for depth 3 arithmetic circuits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the complexity of evaluating highest weight vectors")
  Member "the complexity of factors of multivariate polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the complexity of evaluating highest weight vectors")
  Member "on algebraic branching programs of small width":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "discovering the roots uniform closure results for algebraic classes under factoring")
  Member "geometric complexity theory and matrix powering":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the computational complexity of plethysm coefficients")
  Member "boundaries of vp and vnp":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the complexity of evaluating highest weight vectors")
  Member "identity testing and lower bounds for read k oblivious algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for special cases of syntactic multilinear abps")
  Member "a lower bound for the determinantal complexity of a hypersurface":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on algebraic branching programs of small width")

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)