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: "on polynomial kernels for integer linear programs covering packing and feasibility"
  Abstract: We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility problem admits no polynomial kernelization when parameterized by both the number of variables and the number of constraints, unless NP \subseteq coNP/poly. This extends to the restricted cases of bounded variable degree and bounded number of variables per constraint, and to covering and packing ILPs. Second, we give a polynomial kernelization for the Cover ILP problem, asking for a solution to Ax >= b with c^Tx <= k, parameterized by k, when A is row-sparse; this generalizes a known polynomial kernelization for the special case with 0/1-variables and coefficients (d-Hitting Set).

Connected through hyperedge HE-1 (induced by source paper "scheduling kernels via configuration lp"):
  with members:
    - "parameterized algorithms and data reduction for the short secluded s t path problem"
    - "multitype integer monoid optimization and applications"
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "scheduling meets n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "interval scheduling and colorful independent sets"
    - "on polynomial kernels for sparse integer linear programs"

Connected through hyperedge HE-2 (induced by source paper "polynomial kernels for weighted problems"):
  with members:
    - "fixed parameter algorithms for minimum cost edge connectivity augmentation"
    - "kernelization lower bounds by cross composition"
    - "reducing a target interval to a few exact queries"
    - "parameterizing by the number of numbers"

Connected through hyperedge HE-3 (induced by source paper "a structural approach to kernels for ilps treewidth and total unimodularity"):
  with members:
    - "on polynomial kernels for sparse integer linear programs"
    - "kernelization lower bounds by cross composition"
    - "linear kernels and single exponential algorithms via protrusion decompositions"

Connected through hyperedge HE-4 (induced by source paper "on polynomial kernels for sparse integer linear programs"):
  with members:
    - "bidimensionality and kernels"
    - "kernelization lower bounds by cross composition"
    - "representative sets and irrelevant vertices new tools for kernelization"
    - "cross composition a new technique for kernelization lower bounds"

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)