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 "identity testing for constant width and any order read once oblivious arithmetic branching programs"):
  Abstract: We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best previously known hitting set for this case had size $(nw)^{O(\log n)}$ where $n$ is the number of variables and $w$ is the width of the ROABP. Even for a constant-width ROABP, nothing better than a quasi-polynomial bound was known. We improve the hitting-set size for the known-order case to $n^{O(\log w)}$. In particular, this gives the first polynomial-size hitting set for constant-width ROABP (known-order). However, our hitting set only works when the characteristic of the field is zero or large enough. To construct the hitting set, we use the concept of the rank of the partial derivative matrix. Unlike previous approaches which build up from mapping variables to monomials, we map variables to polynomials directly. #R##N#The second case we consider is that of polynomials computable by width-$w$ ROABPs in any order of the variables. The best previously known hitting set for this case had size $d^{O(\log w)}(nw)^{O(\log \log w)}$, where $d$ is the individual degree. We improve the hitting-set size to $(ndw)^{O(\log \log w)}$.

Includes members:
  Member "identity testing for constant width and commutative read once oblivious abps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "small hitting sets for tiny arithmetic circuits or how to turn bad designs into good")
  Member "identity testing and lower bounds for read k oblivious algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algebraic branching programs border complexity and tangent spaces")
  Member "hitting sets for roabp and sum of set multilinear circuits":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lower bounds for matrix factorization")
  Member "deterministic identity testing for sum of read once oblivious arithmetic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")
  Member "arithmetic circuits the chasm at depth four gets wider":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bounds for matrix factorization")

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)