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 "parameterised complexity of abduction in schaefer s framework"):
  Abstract: Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version asking for sets of variables as explanations, we study, besides asking for existence of the set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to). In this paper, we present a thorough two-dimensional classification of these problems. The first dimension is regarding the parameterised complexity under a wealth of different parameterisations. The second dimension spans through all possible Boolean fragments of these problems in Schaefer's constraint satisfaction framework with co-clones (STOC 1978). Thereby, we almost complete the parameterised picture started by Fellows et al. (AAAI 2012), partially building on results of Nordh and Zanuttini (Artif. Intell. 2008). In this process, we outline a fine-grained analysis of the inherent parameterised intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.

Includes members:
  Member "parameterised complexity for abduction":
    also connected through other hyperedges:
      (none)
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "parameterized exact and approximation algorithms for maximum k set cover and related satisfiability problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "k core minimization a game theoretic approach")
  Member "paradigms for parameterized enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized valiant s classes")
  Member "generalized satisfiability for the description logic alc":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized complexity of alc subsumption")
  Member "the complexity of satisfiability for fragments of hybrid logic part i":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "generalized satisfiability for the description logic alc")
  Member "complexity classifications for propositional abduction in post s framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the weight in enumeration")
  Member "complexity of propositional abduction for restricted sets of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the complexity of second best abductive explanations")

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)