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 "deterministic identity testing for sum of read once oblivious arithmetic branching programs"):
  Abstract: A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding blackbox algorithm with quasi-polynomial time complexity $n^{O(\log n)}$. In both the cases, our time complexity is double exponential in the number of ROABPs. #R##N#ROABPs are a generalization of set-multilinear depth-$3$ circuits. The prior results for the sum of constantly many set-multilinear depth-$3$ circuits were only slightly better than brute-force, i.e. exponential-time. #R##N#Our techniques are a new interplay of three concepts for ROABP: low evaluation dimension, basis isolating weight assignment and low-support rank concentration. We relate basis isolation to rank concentration and extend it to a sum of two ROABPs using evaluation dimension (or partial derivatives).

Includes members:
  Member "progress on polynomial identity testing ii":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "subexponential size hitting sets for bounded depth multilinear formulas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a note on polynomial identity testing for depth 3 circuits")
  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 "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "derandomization and absolute reconstruction for sums of powers of linear forms")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bounds for matrix factorization")
  Member "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials")
  Member "deterministic identity testing of read once algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "identity testing and lower bounds for read k oblivious algebraic branching programs")
  Member "an almost optimal rank bound for depth 3 identities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds")

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)