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 parity of directed hamiltonian cycles"
  Abstract: We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a positive integer.

Connected through hyperedge HE-1 (induced by source paper "a tight lower bound for counting hamiltonian cycles via matrix rank"):
  with members:
    - "probabilistic rank and matrix rigidity"
    - "parameterizing the permanent genus apices minors evaluation mod 2 k"
    - "fast hamiltonicity checking via bases of perfect matchings"
    - "determinant sums for undirected hamiltonicity"

Connected through hyperedge HE-2 (induced by source paper "directed hamiltonicity and out branchings via generalized laplacians"):
  with members:
    - "on problems as hard as cnf sat"
    - "spotting trees with few leaves"
    - "fast algorithms for parameterized problems with relaxed disjointness constraints"
    - "mixing color coding related techniques"
    - "faster exponential time algorithms in graphs of bounded average degree"
    - "a new direction for counting perfect matchings"
    - "below all subsets for some permutational counting problems"
    - "fast hamiltonicity checking via bases of perfect matchings"

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)