human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "backdoors into heterogeneous classes of sat and csp"):
  Abstract: In this paper we extend the classical notion of strong and weak backdoor sets for SAT and CSP by allowing that different instantiations of the backdoor variables result in instances that belong to different base classes; the union of the base classes forms a heterogeneous base class. Backdoor sets to heterogeneous base classes can be much smaller than backdoor sets to homogeneous ones, hence they are much more desirable but possibly harder to find. We draw a detailed complexity landscape for the problem of detecting strong and weak backdoor sets into heterogeneous base classes for SAT and CSP. Introduction of Heterogeneous Base classes for SAT and CSP.Introduction of base classes for CSP defined via polymorphisms.Complete parameterized complexity classification for strong and weak backdoor set detection for SAT and CSP.The paper is a largely extended version of the paper with the same title, which appeared in the Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI'14). In addition to containing the full proofs and more detailed explanations, the paper has been extended by the following results:a complete parameterized complexity classification for strong backdoor set detection for SAT of heterogeneous base classes resulting from combinations of the well-known Schaefer classes,we now handle not only strong but also weak backdoor sets,the running times of all strong backdoor set detection algorithms for SAT have been improved from double to single exponential (parameter dependence),a comparision to related work has been added to the introduction,a complete comparision to partition backdoor sets has been added as an extra section.

Includes members:
  Member "combining treewidth and backdoors for csp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "structural decompositions of epistemic logic programs")
  Member "discovering archipelagos of tractability for constraint satisfaction and counting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "saving critical nodes with firefighters is fpt")
  Member "solving problems on graphs of high rank width":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a single exponential fixed parameter algorithm for distance hereditary vertex deletion")
  Member "meta kernelization using well structured modulators":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "measuring what matters a hybrid approach to dynamic programming with treewidth")
  Member "on backdoors to tractable constraint languages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "backdoors to tractable valued csp")
  Member "backdoors to abduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "strong backdoors for default logic")
  Member "strong backdoors to bounded treewidth sat":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "graph width measures for cnf encodings with auxiliary variables")
  Member "the tractability of csp classes defined by forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "testing unsatisfiability of constraint satisfaction problems via tensor products")

Question: Please tell me which class the source paper 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)