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: "bipartite perfect matching is in quasi nc"
  Abstract: We show that the bipartite perfect matching problem is in quasi-NC$^2$. That is, it has uniform circuits of quasi-polynomial size $n^{O(\log n)}$, and $O(log^2 n)$ depth. Previously, only an exponential upper bound was known on the size of such circuits with poly-logarithmic depth. #R##N#We obtain our result by an almost complete derandomization of the famous Isolation Lemma when applied to yield an efficient randomized parallel algorithm for the bipartite perfect matching problem.

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"
    - "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"
    - "generalized wong sequences and their applications to edmonds problems"

Connected through hyperedge HE-2 (induced by source paper "matching is as easy as the decision problem in the nc model"):
  with members:
    - "nc algorithms for perfect matching and maximum flow in one crossing minor free graphs"
    - "the matching problem in general graphs is in quasi nc"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "planar graph perfect matching is in nc"
    - "nc algorithms for weighted planar perfect matching and related problems"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "algorithmic applications of baur strassen s theorem shortest cycles diameter and matchings"
    - "deterministically isolating a perfect matching in bipartite planar graphs"

Connected through hyperedge HE-3 (induced by source paper "nc algorithms for popular matchings in one sided preference systems and related problems"):
  with members:
    - "parallel and distributed algorithms for the housing allocation problem"
    - "popular matching in roommates setting is np hard"
    - "popular matchings and limits to tractability"
    - "planar graph perfect matching is in nc"
    - "the complexity of the comparator circuit value problem"

Connected through hyperedge HE-4 (induced by source paper "subspace arrangements graph rigidity and derandomization through submodular optimization"):
  with members:
    - "operator scaling theory and applications"
    - "progress on polynomial identity testing ii"
    - "deterministic polynomial time algorithms for matrix completion problems"

Connected through hyperedge HE-5 (induced by source paper "nc algorithms for perfect matching and maximum flow in one crossing minor free graphs"):
  with members:
    - "finding maximal sets of laminar 3 separators in planar graphs in linear time"
    - "the matching problem in general graphs is in quasi nc"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "planar graph perfect matching is in nc"
    - "all pairs minimum cuts in near linear time for surface embedded graphs"
    - "mimicking networks and succinct representations of terminal cuts"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"

Connected through hyperedge HE-6 (induced by source paper "near optimal bootstrapping of hitting sets for algebraic circuits"):
  with members:
    - "the matching problem in general graphs is in quasi nc"

Connected through hyperedge HE-7 (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"
    - "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"
    - "hitting sets for roabp and sum of set multilinear circuits"

Connected through hyperedge HE-8 (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"
    - "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"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "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"

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)