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: "non existence of polynomial kernels for the test cover problem"
  Abstract: The input of the Test Cover problem consists of a set $V$ of vertices, and a collection ${\cal E}=\{E_1,..., E_m\}$ of distinct subsets of $V$, called tests. A test $E_q$ separates a pair $v_i,v_j$ of vertices if $|\{v_i,v_j\}\cap E_q|=1.$ A subcollection ${\cal T}\subseteq {\cal E}$ is a test cover if each pair $v_i,v_j$ of distinct vertices is separated by a test in ${\cal T}$. The objective is to find a test cover of minimum cardinality, if one exists. This problem is NP-hard. #R##N#We consider two parameterizations the Test Cover problem with parameter $k$: (a) decide whether there is a test cover with at most $k$ tests, (b) decide whether there is a test cover with at most $|V|-k$ tests. Both parameterizations are known to be fixed-parameter tractable. We prove that none have a polynomial size kernel unless $NP\subseteq coNP/poly$. Our proofs use the cross-composition method recently introduced by Bodlaender et al. (2011) and parametric duality introduced by Chen et al. (2005). The result for the parameterization (a) was an open problem (private communications with Henning Fernau and Jiong Guo, Jan.-Feb. 2012). We also show that the parameterization (a) admits a polynomial size kernel if the size of each test is upper-bounded by a constant.

Connected through hyperedge HE-1 (induced by source paper "fixed parameter tractable algorithms for tracking shortest paths"):
  with members:
    - "parameterized and approximation complexity of partial vc dimension"
    - "parameterizations of test cover with bounded test sizes"
    - "parameterized study of the test cover problem"

Connected through hyperedge HE-2 (induced by source paper "alternative parameterizations of metric dimension"):
  with members:
    - "identification location domination and metric dimension on interval and permutation graphs ii algorithms and complexity"
    - "a polynomial turing kernel for weighted independent set in bull free graphs"
    - "metric dimension of bounded tree length graphs"
    - "metric dimension parameterized by max leaf number"
    - "characterizing the easy to find subgraphs from the viewpoint of polynomial time algorithms kernels and turing kernels"
    - "metric dimension for gabriel unit disk graphs is np complete"
    - "kernelization lower bounds by cross composition"
    - "parameterized study of the test cover problem"

Connected through hyperedge HE-3 (induced by source paper "frameworks for solving turing kernel lower bound problem and finding natural candidate problems in np intermediate"):
  with members:
    - "turing kernelization for finding long paths and cycles in restricted graph classes"
    - "abusing the tutte matrix an algebraic instance compression for the k set cycle problem"
    - "point line cover the easy kernel is essentially tight"
    - "kernelization lower bounds by cross composition"
    - "kernelization of packing problems"
    - "clique cover and graph separation new incompressibility results"
    - "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem"
    - "vertex cover kernelization revisited upper and lower bounds for a refined parameter"

Connected through hyperedge HE-4 (induced by source paper "parameterizations of test cover with bounded test sizes"):
  with members:
    - "parameterized study of the test cover problem"
    - "max cut parameterized above the edwards erd h o s bound"
    - "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application"
    - "betweenness parameterized above tight lower bound"
    - "solving max r sat above a tight lower bound"

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)