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: "nc algorithms for weighted planar perfect matching and related problems"
  Abstract: Consider a planar graph $G=(V,E)$ with polynomially bounded edge weight function $w:E\to [0, poly(n)]$. The main results of this paper are NC algorithms for the following problems: #R##N#- minimum weight perfect matching in $G$, #R##N#- maximum cardinality and maximum weight matching in $G$ when $G$ is bipartite, #R##N#- maximum multiple-source multiple-sink flow in $G$ where $c:E\to [1, poly(n)]$ is a polynomially bounded edge capacity function, #R##N#- minimum weight $f$-factor in $G$ where $f:V\to [1, poly(n)]$, #R##N#- min-cost flow in $G$ where $c:E\to [1, poly(n)]$ is a polynomially bounded edge capacity function and $b:V\to [1, poly(n)]$ is a polynomially bounded vertex demand function. #R##N#There have been no known NC algorithms for any of these problems previously (Before this and independent paper by Anari and Vazirani). In order to solve these problems we develop a new relatively simple but versatile framework that is combinatorial in spirit. It handles the combinatorial structure of matchings directly and needs to only know weights of appropriately defined matchings from algebraic subroutines.

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"
    - "planar graph perfect matching is in nc"
    - "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 "min cost flow in unit capacity planar graphs"):
  with members:
    - "a faster algorithm for minimum cost bipartite matching in minor free graphs"
    - "improved bounds for shortest paths in dense distance graphs"
    - "structured recursive separator decompositions for planar graphs in linear time"
    - "multiple source shortest paths in embedded graphs"
    - "multiple source multiple sink maximum flow in directed planar graphs in near linear time"
    - "shortest paths in planar graphs with real lengths in o n log 2n log log n time"
    - "faster approximate lossy generalized flow via interior point algorithms"

Connected through hyperedge HE-3 (induced by source paper "parametric shortest paths in planar graphs"):
  with members:
    - "planar graph perfect matching is in nc"
    - "fare evasion in transit networks"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-4 (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"
    - "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"

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)