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: "on identity testing of tensors low rank recovery and compressed sensing"
  Abstract: We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms for depth-3 set-multilinear circuits (over arbitrary fields). This class of circuits has an efficient, deterministic, white-box polynomial identity testing algorithm (due to Raz and Shpilka [36]), but has no known such black-box algorithm. We recast this problem as a question of finding a low-dimensional subspace H, spanned by rank 1 tensors, such that any non-zero tensor in the dual space ker(H) has high rank. We obtain explicit constructions of essentially optimal-size hitting sets for tensors of degree 2 (matrices), and obtain the first quasi-polynomial sized hitting sets for arbitrary tensors. We also show connections to the task of performing low-rank recovery of matrices, which is studied in the field of compressed sensing. Low-rank recovery asks (say, over R) to recover a matrix M from few measurements, under the promise that M is rank ≤ r. In this work, we restrict our attention to recovering matrices that are exactly rank ≤ r using deterministic, non-adaptive, linear measurements, that are free from noise. Over R, we provide a set (of size 4nr) of such measurements, from which M can be recovered in O(rn2+r3n) field operations, and the number of measurements is essentially optimal. Further, the measurements can be taken to be all rank-1 matrices, or all sparse matrices. To the best of our knowledge no explicit constructions with those properties were known prior to this work.   We also give a more formal connection between low-rank recovery and the task of sparse (vector) recovery: any sparse-recovery algorithm that exactly recovers vectors of length n and sparsity 2r, using m non-adaptive measurements, yields a low-rank recovery scheme for exactly recovering n x n matrices of rank ≤ r, making 2nm non-adaptive measurements. Furthermore, if the sparse-recovery algorithm runs in time τ, then the low-rank recovery algorithm runs in time O(rn2+nτ). We obtain this reduction using linear-algebraic techniques, and not using convex optimization, which is more commonly seen in compressed sensing algorithms.   Finally, we also make a connection to rank-metric codes, as studied in coding theory. These are codes with codewords consisting of matrices (or tensors) where the distance of matrices M and N is rank(M-N), as opposed to the usual hamming metric. We obtain essentially optimal-rate codes over matrices, and provide an efficient decoding algorithm. We obtain codes over tensors as well, with poorer rate, but still with efficient decoding.

Connected through hyperedge HE-1 (induced by source paper "lower bounds for matrix factorization"):
  with members:
    - "non malleable extractors and non malleable codes partially optimal constructions"
    - "static data structure lower bounds imply rigidity"
    - "matrix rigidity and the croot lev pach lemma"
    - "crossing the logarithmic barrier for dynamic boolean data structure lower bounds"
    - "probabilistic rank and matrix rigidity"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "the cell probe complexity of dynamic range counting"

Connected through hyperedge HE-2 (induced by source paper "succinct hitting sets and barriers to proving algebraic circuits lower bounds"):
  with members:
    - "towards an algebraic natural proofs barrier via polynomial identity testing"
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "proof complexity lower bounds from algebraic circuit complexity"
    - "bipartite perfect matching is in quasi nc"
    - "boundaries of vp and vnp"
    - "unifying known lower bounds via geometric complexity theory"
    - "progress on polynomial identity testing ii"
    - "subexponential size hitting sets for bounded depth multilinear formulas"

Connected through hyperedge HE-3 (induced by source paper "small hitting sets for tiny arithmetic circuits or how to turn bad designs into good"):
  with members:
    - "on the complexity of partial derivatives"
    - "bipartite perfect matching is in quasi nc"
    - "the chasm at depth four and tensor rank old results new insights"
    - "identity testing for constant width and commutative read once oblivious abps"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "progress on polynomial identity testing ii"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "algebraic independence and blackbox identity testing"

Connected through hyperedge HE-4 (induced by source paper "on the list decodability of random linear rank metric codes"):
  with members:
    - "average radius list recovery of random linear codes it really ties the room together"
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "every list decodable code for high noise has abundant near optimal rate puncturings"
    - "on the list decodability of random linear codes with large error rates"
    - "bounds on list decoding gabidulin codes"
    - "restricted isometry of fourier matrices and list decodability of random linear codes"
    - "on the list decodability of random linear codes"
    - "a rank metric approach to error control in random network coding"

Connected through hyperedge HE-5 (induced by source paper "proof complexity lower bounds from algebraic circuit complexity"):
  with members:
    - "functional lower bounds for arithmetic circuits and connections to boolean circuit complexity"
    - "an exponential lower bound for homogeneous depth 5 circuits over finite fields"
    - "identity testing and lower bounds for read k oblivious algebraic branching programs"
    - "circuit complexity proof complexity and polynomial identity testing"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"

Connected through hyperedge HE-6 (induced by source paper "a new class of rank metric codes and their list decoding beyond the unique decoding radius"):
  with members:
    - "some gabidulin codes cannot be list decoded efficiently at any radius"
    - "list and unique error erasure decoding of interleaved gabidulin codes with interpolation techniques"
    - "bounds on list decoding of rank metric codes"
    - "list decoding subspace codes from insertions and deletions"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "folded codes from function field towers and improved optimal rate list decoding"
    - "subspace evasive sets"
    - "error correcting codes in projective spaces via rank metric codes and ferrers diagrams"

Connected through hyperedge HE-7 (induced by source paper "sums of products of polynomials in few variables lower bounds and polynomial identity testing"):
  with members:
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "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"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "jacobian hits circuits hitting sets lower bounds for depth d occur k formulas depth 3 transcendence degree k circuits"
    - "arithmetic circuits the chasm at depth four gets wider"

Connected through hyperedge HE-8 (induced by source paper "progress on polynomial identity testing ii"):
  with members:
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "hitting sets for low distance multilinear depth 3"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "algebraic independence in positive characteristic a p adic calculus"
    - "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"

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)