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: "planar graph perfect matching is in nc"
  Abstract: Is perfect matching in NC? That is, is there a deterministic fast parallel algorithm for it? This has been an outstanding open question in theoretical computer science for over three decades, ever since the discovery of RNC matching algorithms. Within this question, the case of planar graphs has remained an enigma: On the one hand, counting the number of perfect matchings is far harder than finding one (the former is #P-complete and the latter is in P), and on the other, for planar graphs, counting has long been known to be in NC whereas finding one has resisted a solution. #R##N#In this paper, we give an NC algorithm for finding a perfect matching in a planar graph. Our algorithm uses the above-stated fact about counting matchings in a crucial way. Our main new idea is an NC algorithm for finding a face of the perfect matching polytope at which $\Omega(n)$ new conditions, involving constraints of the polytope, are simultaneously satisfied. Several other ideas are also needed, such as finding a point in the interior of the minimum weight face of this polytope and finding a balanced tight odd set in NC.

Connected through hyperedge HE-1 (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"
    - "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-2 (induced by source paper "new algorithms and lower bounds for all pairs max flow in undirected graphs"):
  with members:
    - "more consequences of falsifying seth and the orthogonal vectors conjecture"
    - "faster algorithms for all pairs bounded min cuts"
    - "on nondeterministic derandomization of freivalds algorithm consequences avenues and algorithmic progress"
    - "conditional lower bounds for all pairs max flow"
    - "computing maximum flow with augmenting electrical flows"
    - "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation"

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"
    - "bipartite perfect matching is in quasi nc"
    - "the complexity of the comparator circuit value problem"

Connected through hyperedge HE-4 (induced by source paper "finding big matchings in planar graphs quickly"):
  with members:
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"

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"
    - "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-6 (induced by source paper "parametric shortest paths in planar graphs"):
  with members:
    - "nc algorithms for weighted planar perfect matching and related problems"
    - "fare evasion in transit networks"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-7 (induced by source paper "counting shortest two disjoint paths in cubic planar graphs with an nc algorithm"):
  with members:
    - "shortest k disjoint paths via determinants"
    - "shortest vertex disjoint two face paths in planar 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.DS(Data Structures and Algorithms)