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: "generalized wong sequences and their applications to edmonds problems"
  Abstract: We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B of the n by n matrices over some field F, we consider the following problems: symbolic matrix rank (SMR) is the problem to determine the maximum rank among matrices in B, symbolic determinant identity testing (SDIT) is the question to decide whether there exists a nonsingular matrix in B. The constructive versions of these problems are asking to find a matrix of maximum rank, respectively a nonsingular matrix, if there exists one. #R##N#Our first algorithm solves the constructive SMR when B is spanned by unknown rank one matrices, answering an open question of Gurvits. Our second algorithm solves the constructive SDIT when B is spanned by triangularizable matrices, but the triangularization is not given explicitly. Both algorithms work over finite fields of size at least n+1 and over the rational numbers, and the first algorithm actually solves (the non-constructive) SMR independently from the field size. Our main tool to obtain these results is to generalize Wong sequences, a classical method to deal with pairs of matrices, to the case of pairs of matrix spaces.

Connected through hyperedge HE-1 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions"):
  with members:
    - "linear algebraic analogues of the graph isomorphism problem and the erd h o s r enyi model"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the matching problem in general graphs is in quasi nc"
    - "bipartite perfect matching is in quasi nc"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "graph isomorphism in quasipolynomial time"
    - "a deterministic polynomial time algorithm for non commutative rational identity testing"
    - "non commutative edmonds problem and matrix semi invariants"

Connected through hyperedge HE-2 (induced by source paper "operator scaling via geodesically convex optimization invariant theory and polynomial identity testing"):
  with members:
    - "alternating minimization scaling algorithms and the null cone problem from invariant theory"
    - "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing"
    - "the paulsen problem continuous operator scaling and smoothed analysis"
    - "much faster algorithms for matrix scaling"
    - "matrix scaling and balancing via box constrained newton s method and interior point methods"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"

Connected through hyperedge HE-3 (induced by source paper "finding a low rank basis in a matrix subspace"):
  with members:
    - "complete dictionary recovery over the sphere i overview and the geometric picture"
    - "complete dictionary recovery over the sphere ii recovery by riemannian trust region method"
    - "finding a sparse vector in a subspace linear sparsity using alternating directions"
    - "complete dictionary recovery over the sphere"
    - "tensor decompositions for signal processing applications from two way to multiway component analysis"
    - "rounding sum of squares relaxations"
    - "exact recovery of sparsely used dictionaries"
    - "the power of convex relaxation near optimal matrix completion"

Connected through hyperedge HE-4 (induced by source paper "operator scaling theory and applications"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "non commutative edmonds problem and matrix semi invariants"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"

Connected through hyperedge HE-5 (induced by source paper "non commutative edmonds problem and matrix semi invariants"):
  with members:
    - "operator scaling theory and applications"
    - "constructive noncommutative rank computation is in deterministic polynomial time"
    - "on generating the ring of matrix semi invariants"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "deterministic polynomial time algorithms for matrix completion problems"
    - "geometric complexity theory ii towards explicit obstructions for embeddings among class varieties"

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)