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: "the matching problem in general graphs is in quasi nc"
  Abstract: We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\log^3 n)$ time on $n^{O(\log^2 n)}$ processors. The result is obtained by a derandomization of the Isolation Lemma for perfect matchings, which was introduced in the classic paper by Mulmuley, Vazirani and Vazirani [1987] to obtain a Randomized NC algorithm. #R##N#Our proof extends the framework of Fenner, Gurjar and Thierauf [2016], who proved the analogous result in the special case of bipartite graphs. Compared to that setting, several new ingredients are needed due to the significantly more complex structure of perfect matchings in general graphs. In particular, our proof heavily relies on the laminar structure of the faces of the perfect matching polytope.

Connected through hyperedge HE-1 (induced by source paper "equivalence classes and conditional hardness in massively parallel computations"):
  with members:
    - "walking randomly massively and efficiently"
    - "log diameter rounds algorithms for 2 vertex and 2 edge connectivity"
    - "dynamic algorithms for the massively parallel computation model"
    - "a conditional lower bound on graph connectivity in mapreduce"
    - "efficient circuit simulation in mapreduce"
    - "exponentially faster massively parallel maximal matching"
    - "parallel batch dynamic graphs algorithms and lower bounds"
    - "massively parallel algorithms for finding well connected components in sparse graphs"

Connected through hyperedge HE-2 (induced by source paper "a generalized sylvester gallai type theorem for quadratic polynomials"):
  with members:
    - "reconstruction of real depth 3 circuits with top fan in 2"
    - "progress on polynomial identity testing ii"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "geometric complexity theory v efficient algorithms for noether normalization"
    - "algebraic independence and blackbox identity testing"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"

Connected through hyperedge HE-3 (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"
    - "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"
    - "generalized wong sequences and their applications to edmonds problems"

Connected through hyperedge HE-4 (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"
    - "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"
    - "bipartite perfect matching is in quasi nc"
    - "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-5 (induced by source paper "unique perfect matchings forbidden transitions and proof nets for linear logic with mix"):
  with members:
    - "complexity of correctness for pomset logic proof nets"
    - "constrained path finding and structure from acyclicity"
    - "proof nets and the identity of proofs"

Connected through hyperedge HE-6 (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"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "planar graph perfect matching is in nc"
    - "bipartite perfect matching is in quasi 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-7 (induced by source paper "near optimal bootstrapping of hitting sets for algebraic circuits"):
  with members:
    - "bipartite perfect matching is in quasi nc"

Connected through hyperedge HE-8 (induced by source paper "planar graph perfect matching is in nc"):
  with members:
    - "nc algorithms for perfect matching and maximum flow in one crossing minor free graphs"
    - "isolating a vertex via lattices polytopes with totally unimodular faces"
    - "nc algorithms for weighted planar perfect matching and related problems"
    - "bipartite perfect matching is in quasi nc"
    - "all pairs minimum cuts in near linear time for surface embedded graphs"

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)