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 "general caching is hard even with small pages"):
  Abstract: Caching (also known as paging) is a classical problem concerning page replacement policies in two-level memory systems. General caching is the variant with pages of different sizes and fault costs. We give the first NP-hardness result for general caching with small pages: General caching is (strongly) NP-hard even when page sizes are limited to {1, 2, 3}. It holds already in the fault model (each page has unit fault cost) as well as in the bit model (each page has the same fault cost as size). We also give a very short proof of the strong NP-hardness of general caching with page sizes restricted to {1, 2, 3} and arbitrary costs.

Includes members:
  Member "a constant factor approximation algorithm for unsplittable flow on paths":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "breaking the barrier of 2 for the storage allocation problem")
  Member "on line file caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cache optimization models and algorithms")
  Member "competitive paging algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online metric algorithms with untrusted predictions")

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)