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 to tractable answer set programming"):
  Abstract: Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP. Although the main problems of ASP are of high computational complexity, located at the second level of the Polynomial Hierarchy, several restrictions of ASP have been identified in the literature, under which ASP problems become tractable. #R##N#In this paper we use the concept of backdoors to identify new restrictions that make ASP problems tractable. Small backdoors are sets of atoms that represent "clever reasoning shortcuts" through the search space and represent a hidden structure in the problem input. The concept of backdoors is widely used in the areas of propositional satisfiability and constraint satisfaction. We show that it can be fruitfully adapted to ASP. We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature. Furthermore, we show how backdoors allow us to deploy recent algorithmic results from parameterized complexity theory to the domain of answer set programming.

Includes members:
  Member "guarantees and limits of preprocessing in constraint satisfaction and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "diversity in combinatorial optimization")
  Member "the parameterized complexity of reasoning problems beyond np":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "results in workflow resiliency complexity new formulation and asp encoding")
  Member "backdoors to normality for disjunctive logic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "backdoors to tractable valued csp")
  Member "numvc an efficient local search algorithm for minimum vertex cover":
    also connected through other hyperedges:
      (none)
  Member "backdoors to abduction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "backdoors into heterogeneous classes of sat and csp")
  Member "the good the bad and the odd cycles in answer set programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "backdoors to normality for disjunctive logic programs")
  Member "strong backdoors to bounded treewidth sat":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graph width measures for cnf encodings with auxiliary variables")
  Member "strong backdoors to nested satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "strong backdoors to bounded treewidth sat")

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.CC(Computational Complexity)