human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "kernelization lower bounds for finding constant size subgraphs"):
  Abstract: Kernelization is an important tool in parameterized algorithmics. The goal is to reduce the input instance of a parameterized problem in polynomial time to an equivalent instance of the same problem such that the size of the reduced instance only depends on the parameter and not on the size of the original instance. In this paper, we provide a first conceptual study on limits of kernelization for several polynomial-time solvable problems. For instance, we consider the problem of finding a triangle with negative sum of edge weights parameterized by the maximum degree of the input graph. We prove that a linear-time computable strict kernel of truly subcubic size for this problem violates the popular APSP-conjecture.

Includes members:
  Member "when can graph hyperbolicity be computed in linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast approximation and exact computation of negative curvature parameters of graphs")
  Member "the power of data reduction for matching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient and adaptive parameterized algorithms on modular decompositions")
  Member "linear time kernelization for feedback vertex set":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved analysis of highest degree branching for feedback vertex set")
  Member "diminishable parameterized problems and strict polynomial kernelization":
    also connected through other hyperedges:
      (none)
  Member "fully polynomial time parameterized computations for graphs and matrices of low treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimum cuts in surface graphs")
  Member "polynomial fixed parameter algorithms a case study for longest path on interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computing maximum matchings in temporal graphs")
  Member "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "graphs cannot be indexed in polynomial time for sub quadratic time string matching unless seth fails")
  Member "popular conjectures imply strong lower bounds for dynamic problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

Question: Please tell me which class the source paper 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)