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: "polynomial kernels for weighted problems"
  Abstract: Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations for Subset Sum and Knapsack when parameterized by the number $n$ of items. #R##N#We answer both questions affirmatively by using an algorithm for compressing numbers due to Frank and Tardos (Combinatorica 1987). This result had been first used by Marx and V\'egh (ICALP 2013) in the context of kernelization. We further illustrate its applicability by giving polynomial kernels also for weighted versions of several well-studied parameterized problems. Furthermore, when parameterized by the different item sizes we obtain a polynomial kernelization for Subset Sum and an exponential kernelization for Knapsack. Finally, we also obtain kernelization results for polynomial integer programs.

Connected through hyperedge HE-1 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs"):
  with members:
    - "a complexity dichotomy for hitting connected minors on bounded treewidth graphs the chair and the banner draw the boundary"
    - "feedback vertex set inspired kernel for chordal vertex deletion"
    - "approximation and kernelization for chordal vertex deletion"
    - "linear recognition of almost interval graphs"
    - "large induced subgraphs via triangulations and cmso"
    - "data reduction for graph coloring problems"
    - "interval deletion is fixed parameter tractable"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-2 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem"):
  with members:
    - "on the computational complexity of length and neighborhood constrained path problems"
    - "the parameterized complexity of finding secluded solutions to some classical optimization problems on graphs"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "finding connected secluded subgraphs"
    - "parameterized complexity of secluded connectivity problems"
    - "route planning in transportation networks"
    - "parameterized complexity of the k arc chinese postman problem"
    - "parameterized complexity of k chinese postman problem"

Connected through hyperedge HE-3 (induced by source paper "polynomial time data reduction for weighted problems beyond additive goal functions"):
  with members:
    - "parameterized algorithms and data reduction for the short secluded s t path problem"
    - "fixed parameter algorithms for maximum profit facility location under matroid constraints"
    - "on approximate data reduction for the rural postman problem theory and experiments"
    - "fair knapsack"
    - "parameterized power vertex cover"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "parameterized algorithms for power efficient connected symmetric wireless sensor networks"
    - "new algorithms for minimizing the weighted number of tardy jobs on a single machine"

Connected through hyperedge HE-4 (induced by source paper "single machine batch scheduling to minimize the weighted number of tardy jobs"):
  with members:
    - "new algorithms for minimizing the weighted number of tardy jobs on a single machine"
    - "losing weight by gaining edges"

Connected through hyperedge HE-5 (induced by source paper "on approximate data reduction for the rural postman problem theory and experiments"):
  with members:
    - "parameterized algorithms and data reduction for the short secluded s t path problem"
    - "revisiting connected vertex cover fpt algorithms and lossy kernels"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "constant factor approximations for capacitated arc routing without triangle inequality"
    - "fixed parameter algorithms for minimum cost edge connectivity augmentation"
    - "new inapproximability bounds for tsp"

Connected through hyperedge HE-6 (induced by source paper "parameterized resiliency problems via integer linear programming"):
  with members:
    - "combinatorial n fold integer programming and applications"
    - "a multivariate approach for checking resiliency in access control"
    - "an approach to parameterized resiliency problems using integer linear programming"
    - "the online disjoint set cover problem and its applications"
    - "parameterized integer quadratic programming variables and coefficients"
    - "a structural approach to kernels for ilps treewidth and total unimodularity"
    - "the parameterized complexity of reasoning problems beyond np"
    - "a quasi polynomial time partition oracle for graphs with an excluded minor"

Connected through hyperedge HE-7 (induced by source paper "approximation and parameterized algorithms for geometric independent set with shrinking"):
  with members:
    - "subexponential parameterized algorithms for planar and apex minor free graphs via low treewidth pattern covering"
    - "on approximating maximum independent set of rectangles"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"

Connected through hyperedge HE-8 (induced by source paper "pattern matching and consensus problems on weighted sequences and profiles"):
  with members:
    - "efficient index for weighted sequences"
    - "streaming k mismatch with error correcting and applications"
    - "probabilistic threshold indexing for uncertain strings"
    - "fast average case pattern matching on weighted sequences"

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)