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: "augmenting tractable fragments of abstract argumentation"
  Abstract: We present a new and compelling approach to the efficient solution of important computational problems that arise in the context of abstract argumentation. Our approach makes known algorithms defined for restricted fragments generally applicable, at a computational cost that scales with the distance from the fragment. Thus, in a certain sense, we gradually augment tractable fragments. Surprisingly, it turns out that some tractable fragments admit such an augmentation and that others do not. #R##N#More specifically, we show that the problems of credulous and skeptical acceptance are fixed-parameter tractable when parameterized by the distance from the fragment of acyclic argumentation frameworks. Other tractable fragments such as the fragments of symmetrical and bipartite frameworks seem to prohibit an augmentation: the acceptance problems are already intractable for frameworks at distance 1 from the fragments. #R##N#For our study we use a broad setting and consider several different semantics. For the algorithmic results we utilize recent advances in fixed-parameter tractability.

Connected through hyperedge HE-1 (induced by source paper "the complexity of planning revisited a parameterized analysis"):
  with members:
    - "the complexity of planning problems with simple causal graphs"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "taming numbers and durations in the model checking integrated planning system"
    - "structure and complexity in planning with unary operators"

Connected through hyperedge HE-2 (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"
    - "strong backdoors to nested satisfiability"

Connected through hyperedge HE-3 (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"
    - "strong backdoors to nested satisfiability"
    - "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"

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)