human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "deterministic identity testing of read once algebraic branching programs"
  Abstract: In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas ($\Sigma_k$-RO-formulas). We show that $\Sigma_k$-RO-ABPs are strictly more powerful than $\Sigma_k$-RO-formulas, for any $k \leq \lfloor n/2\rfloor$, where $n$ is the number of variables. We obtain the following results: #R##N#1) Given free access to the RO-ABPs in the sum, we get a deterministic algorithm that runs in time $O(k^2n^7s) + n^{O(k)}$, where $s$ bounds the size of any largest RO-ABP given on the input. This implies we have a deterministic polynomial time algorithm for testing whether the sum of a constant number of RO-ABPs computes the zero polynomial. #R##N#2) Given black-box access to the RO-ABPs computing the individual polynomials in the sum, we get a deterministic algorithm that runs in time $k^2n^{O(\log n)} + n^{O(k)}$. #R##N#3) Finally, given only black-box access to the polynomial computed by the sum of the $k$ RO-ABPs, we obtain an $n^{O(k + \log n)}$ time deterministic algorithm.

Connected through hyperedge HE-1 (induced by source paper "identity testing and lower bounds for read k oblivious algebraic branching programs"):
  with members:
    - "some lower bound results for set multilinear arithmetic computations"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "the limits of depth reduction for arithmetic formulas it s all about the top fan in"
    - "pseudorandomness for regular branching programs via fourier analysis"

Connected through hyperedge HE-2 (induced by source paper "on the expressive power of read once determinants"):
  with members:
    - "deterministic polynomial time algorithms for matrix completion problems"

Connected through hyperedge HE-3 (induced by source paper "hitting sets for roabp and sum of set multilinear circuits"):
  with members:
    - "progress on polynomial identity testing ii"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "hitting sets for low distance multilinear depth 3"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "on identity testing of tensors low rank recovery and compressed sensing"

Connected through hyperedge HE-4 (induced by source paper "deterministic identity testing for sum of read once oblivious arithmetic branching programs"):
  with members:
    - "progress on polynomial identity testing ii"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"
    - "an almost optimal rank bound for depth 3 identities"

Connected through hyperedge HE-5 (induced by source paper "hitting sets for low distance multilinear depth 3"):
  with members:
    - "progress on polynomial identity testing ii"
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "jacobian hits circuits hitting sets lower bounds for depth d occur k formulas depth 3 transcendence degree k circuits"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"
    - "the power of depth 2 circuits over algebras"
    - "an almost optimal rank bound for depth 3 identities"

Connected through hyperedge HE-6 (induced by source paper "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"):
  with members:
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "almost settling the hardness of noncommutative determinant"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"
    - "deterministic black box identity testing pi ordered algebraic branching programs"

Question: Please tell me which class the center node 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)