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: "deterministically isolating a perfect matching in bipartite planar graphs"
  Abstract: We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al. 1987) achieves the same for general graphs using a randomized weighting scheme, whereas we can do it deterministically when restricted to bipartite planar graphs. As a consequence, we reduce both decision and construction versions of the matching problem to testing whether a matrix is singular, under the promise that its determinant is 0 or 1, thus obtaining a highly parallel SPL algorithm for bipartite planar graphs. This improves the earlier known bounds of non-uniform SPL by (Allender et al. 1999) and $NC^2$ by (Miller and Naor 1995, Mahajan and Varadarajan 2000). It also rekindles the hope of obtaining a deterministic parallel algorithm for constructing a perfect matching in non-bipartite planar graphs, which has been open for a long time. Our techniques are elementary and simple.

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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "the matching problem in general graphs is in quasi nc"):
  with members:
    - "bipartite perfect matching is in quasi nc"
    - "derandomizing the isolation lemma and lower bounds for circuit size"

Connected through hyperedge HE-3 (induced by source paper "isolating a vertex via lattices polytopes with totally unimodular faces"):
  with members:
    - "entropy optimization and counting"

Connected through hyperedge HE-4 (induced by source paper "bipartite perfect matching is in quasi nc"):
  with members:
    - "derandomizing the isolation lemma and lower bounds for circuit size"
    - "reducing randomness via irrational numbers"

Connected through hyperedge HE-5 (induced by source paper "reachability is in dynfo"):
  with members:
    - "on the quantifier free dynamic complexity of reachability"
    - "dynamic graph queries"
    - "dynamic complexity of planar 3 connected graph isomorphism"
    - "space complexity of perfect matching in bounded genus bipartite graphs"

Connected through hyperedge HE-6 (induced by source paper "planarity testing revisited"):
  with members:
    - "3 connected planar graph isomorphism is in log space"

Connected through hyperedge HE-7 (induced by source paper "space complexity of perfect matching in bounded genus bipartite graphs"):
  with members:
    - "derandomizing the isolation lemma and lower bounds for circuit size"

Connected through hyperedge HE-8 (induced by source paper "log space algorithms for paths and matchings in k trees"):
  with members:
    - "longest paths in planar dags in unambiguous logspace"
    - "on the expressive power of planar perfect matching and permanents of bounded treewidth matrices"

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)