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: "better algorithms for satisfiability problems for formulas of bounded rank width"
  Abstract: We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer, Makowsky, and Ravve] -- with a single-exponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (since clique-width reaches up to exponentially higher values than rank-width), and can be of practical interest for small values of rank-width. We also provide an algorithm for the MAX-SAT problem along the same lines.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings"):
  with members:
    - "slightly superexponential parameterized problems"
    - "rank based approach on graphs with structured neighborhood"
    - "on weak odd domination and graph based quantum secret sharing"
    - "finding even subgraphs even faster"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-2 (induced by source paper "the complexity landscape of decompositional parameters for ilp"):
  with members:
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "structural parameterizations of the mixed chinese postman problem"
    - "backdoors to satisfaction"

Connected through hyperedge HE-3 (induced by source paper "solving maxsat and sat on structured cnf formulas"):
  with members:
    - "model counting for formulas of bounded clique width"
    - "recognizing interval bigraphs by forbidden patterns"
    - "homomorphic hashing for sparse coefficient extraction"

Connected through hyperedge HE-4 (induced by source paper "model counting for formulas of bounded clique width"):
  with members:
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "strong backdoors to bounded treewidth sat"

Connected through hyperedge HE-5 (induced by source paper "the rank width of edge coloured graphs"):
  with members:
    - "partitions versus sets a case of duality"
    - "are there any good digraph width measures"
    - "monadic second order model checking on decomposable matroids"
    - "on the expressive power of permanents and perfect matchings of matrices of bounded pathwidth cliquewidth"

Connected through hyperedge HE-6 (induced by source paper "satisfiability of acyclic and almost acyclic cnf formulas"):
  with members:
    - "hypertree decompositions and tractable queries"

Connected through hyperedge HE-7 (induced by source paper "backdoors to acyclic sat"):
  with members:
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "strong backdoors to bounded treewidth sat"
    - "strong backdoors to nested satisfiability"
    - "backdoors to satisfaction"
    - "randomized algorithms for the loop cutset problem"

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.DM(Discrete Mathematics)