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: "paradigms for parameterized enumeration"
  Abstract: The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different notions of efficient enumeration in the context of parameterized complexity. Second we show how different algorithmic paradigms can be used in order to get parameter-efficient enumeration algorithms in a number of examples. These paradigms use well-known principles from the design of parameterized decision as well as enumeration techniques, like for instance kernelization and self-reducibility. The concept of kernelization, in particular, leads to a characterization of fixed-parameter tractable enumeration problems.

Connected through hyperedge HE-1 (induced by source paper "parameterized valiant s classes"):
  with members:
    - "a fixed parameter perspective on bis"
    - "homomorphisms are a good basis for counting small subgraphs"
    - "counting restricted homomorphisms via m obius inversion over matroid lattices"
    - "on the relative power of reduction notions in arithmetic circuit complexity"
    - "some complete and intermediate polynomials in algebraic complexity theory"
    - "algebraic complexity classes"
    - "complexity of counting subgraphs only the boundedness of the vertex cover number counts"
    - "narrow sieves for parameterized paths and packings"

Connected through hyperedge HE-2 (induced by source paper "parameterised complexity of abduction in schaefer s framework"):
  with members:
    - "parameterised complexity for abduction"
    - "analysis of boolean functions"
    - "parameterized exact and approximation algorithms for maximum k set cover and related satisfiability problems"
    - "generalized satisfiability for the description logic alc"
    - "the complexity of satisfiability for fragments of hybrid logic part i"
    - "complexity classifications for propositional abduction in post s framework"
    - "complexity of propositional abduction for restricted sets of boolean functions"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-3 (induced by source paper "efficiently enumerating hitting sets of hypergraphs arising in data profiling"):
  with members:
    - "the minimal hitting set generation problem algorithms and computation"
    - "exploiting hidden structure in selecting dimensions that distinguish vectors"
    - "randomised enumeration of small witnesses using a decision oracle"
    - "efficient enumeration of solutions produced by closure operations"
    - "a polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs"
    - "efficient algorithms for dualizing large scale hypergraphs"
    - "new results on monotone dualization and generating hypergraph transversals"
    - "incremental recompilation of knowledge"

Connected through hyperedge HE-4 (induced by source paper "enumeration in incremental fpt time"):
  with members:
    - "default logic and bounded treewidth"
    - "efficient enumeration of solutions produced by closure operations"
    - "new results on monotone dualization and generating hypergraph transversals"

Connected through hyperedge HE-5 (induced by source paper "counting complexity for reasoning in abstract argumentation"):
  with members:
    - "qbf as an alternative to courcelle s theorem"
    - "dynpartix a dynamic programming reasoner for abstract argumentation"

Connected through hyperedge HE-6 (induced by source paper "parameterized aspects of triangle enumeration"):
  with members:
    - "an adaptive version of brandes algorithm for betweenness centrality"
    - "data reduction for maximum matching on real world graphs theory and experiments"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "kernelization lower bounds for finding constant size subgraphs"
    - "when can graph hyperbolicity be computed in linear time"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "polynomial fixed parameter algorithms a case study for longest path on interval graphs"
    - "joins via geometric resolutions worst case and beyond"

Connected through hyperedge HE-7 (induced by source paper "enumeration complexity of poor man s propositional dependence logic"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "complexity of propositional independence and inclusion logic"
    - "dependence and independence"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"
    - "the complexity of poor man s logic"

Connected through hyperedge HE-8 (induced by source paper "default logic and bounded treewidth"):
  with members:
    - "dynasp2 5 dynamic programming on tree decompositions in action"
    - "answer set solving with bounded treewidth revisited"
    - "strong backdoors for default logic"

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