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: "strong backdoors to nested satisfiability"
  Abstract: Knuth (1990) introduced the class of nested formulas and showed that their satisfiability can be decided in polynomial time. We show that, parameterized by the size of a smallest strong backdoor set to the target class of nested formulas, checking the satisfiability of any CNF formula is fixed-parameter tractable. Thus, for any k>0, the satisfiability problem can be solved in polynomial time for any formula F for which there exists a variable set B of size at most k such that for every truth assignment t to B, the formula F[t] is nested; moreover, the degree of the polynomial is independent of k. #R##N#Our algorithm uses the grid-minor theorem of Robertson and Seymour (1986) to either find that the incidence graph of the formula has bounded treewidth - a case that is solved using model checking for monadic second order logic - or to find many vertex-disjoint obstructions in the incidence graph. For the latter case, new combinatorial arguments are used to find a small backdoor set. Combining both cases leads to an approximation algorithm producing a strong backdoor set whose size is upper bounded by a function of the optimum. Going through all assignments to this set of variables and using Knuth's algorithm, the satisfiability of the input formula is decided.

Connected through hyperedge HE-1 (induced by source paper "strong backdoors to bounded treewidth sat"):
  with members:
    - "linear kernels and single exponential algorithms via protrusion decompositions"
    - "backdoors to satisfaction"
    - "backdoors to acyclic sat"
    - "finding topological subgraphs is fixed parameter tractable"
    - "almost 2 sat is fixed parameter tractable"
    - "cutset sampling for bayesian networks"

Connected through hyperedge HE-2 (induced by source paper "homomorphic hashing for sparse coefficient extraction"):
  with members:
    - "determinant sums for undirected hamiltonicity"
    - "solving max r sat above a tight lower bound"

Connected through hyperedge HE-3 (induced by source paper "backdoors to tractable answer set programming"):
  with members:
    - "guarantees and limits of preprocessing in constraint satisfaction and reasoning"
    - "the parameterized complexity of reasoning problems beyond np"
    - "backdoors to normality for disjunctive logic programs"
    - "numvc an efficient local search algorithm for minimum vertex cover"
    - "backdoors to abduction"
    - "the good the bad and the odd cycles in answer set programs"
    - "strong backdoors to bounded treewidth sat"
    - "directed subset feedback vertex set is fixed parameter tractable"

Connected through hyperedge HE-4 (induced by source paper "backdoors to satisfaction"):
  with members:
    - "the good the bad and the odd cycles in answer set programs"
    - "strong backdoors to bounded treewidth sat"
    - "augmenting tractable fragments of abstract argumentation"
    - "backdoors to acyclic sat"
    - "3 sat faster and simpler unique sat bounds for ppsz hold in general"
    - "backdoors to tractable answer set programming"
    - "limits of preprocessing"
    - "subset feedback vertex set is fixed parameter tractable"

Connected through hyperedge HE-5 (induced by source paper "backdoors to acyclic sat"):
  with members:
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "strong backdoors to bounded treewidth sat"
    - "backdoors to satisfaction"
    - "better algorithms for satisfiability problems for formulas of bounded rank width"
    - "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.DS(Data Structures and Algorithms)