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: "backdoors to abduction"
  Abstract: Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, and automated planning. Unfortunately, Abduction is of high computational complexity; even propositional Abduction is \Sigma_2^P-complete and thus harder than NP and coNP. This complexity barrier rules out the existence of a polynomial transformation to propositional satisfiability (SAT). In this work we use structural properties of the Abduction instance to break this complexity barrier. We utilize the problem structure in terms of small backdoor sets. We present fixed-parameter tractable transformations from Abduction to SAT, which make the power of today's SAT solvers available to Abduction.

Connected through hyperedge HE-1 (induced by source paper "backdoors into heterogeneous classes of sat and csp"):
  with members:
    - "combining treewidth and backdoors for csp"
    - "discovering archipelagos of tractability for constraint satisfaction and counting"
    - "solving problems on graphs of high rank width"
    - "meta kernelization using well structured modulators"
    - "on backdoors to tractable constraint languages"
    - "strong backdoors to bounded treewidth sat"
    - "the tractability of csp classes defined by forbidden patterns"
    - "backdoors to satisfaction"

Connected through hyperedge HE-2 (induced by source paper "strong backdoors for default logic"):
  with members:
    - "backdoors to normality for disjunctive logic programs"
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "backdoors to satisfaction"
    - "backdoors to tractable answer set programming"
    - "the complexity of propositional implication"

Connected through hyperedge HE-3 (induced by source paper "backdoors to normality for disjunctive logic programs"):
  with members:
    - "dual normal logic programs the forgotten class"
    - "the third open answer set programming competition"
    - "the parameterized complexity of reasoning problems beyond np"
    - "the good the bad and the odd cycles in answer set programs"
    - "backdoors to satisfaction"
    - "backdoors to tractable answer set programming"
    - "detecting inconsistencies in large biological networks with answer set programming"
    - "trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs"

Connected through hyperedge HE-4 (induced by source paper "the parameterized complexity of reasoning problems beyond np"):
  with members:
    - "backdoors to normality for disjunctive logic programs"
    - "on minimal constraint networks"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-5 (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"
    - "the good the bad and the odd cycles in answer set programs"
    - "strong backdoors to bounded treewidth sat"
    - "strong backdoors to nested satisfiability"
    - "directed subset feedback vertex set is fixed parameter tractable"

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.AI(Artificial Intelligence)