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 "online tree caching"):
  Abstract: We study a natural and practically relevant new variant of online caching with bypassing where the to-be-cached items can have dependencies. We assume that the universe is a tree T and items are tree nodes; we require that if a node v is cached then T(v) is cached as well. This theoretical problem finds an immediate application in the context of forwarding table optimization in IP routing and software-defined networks. We present an O(height(T) kONL/(kONL-kOPT+ 1))-competitive deterministic algorithm TC, where kONL and kOPT denote the cache sizes of an online and the optimal offline algorithm, respectively. The result is optimal up to a factor of O(height(T)).

Includes members:
  Member "compressing ip forwarding tables towards entropy bounds and beyond":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal compression for two field entries in fixed width memories")
  Member "online companion caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient distributed workload re embedding")
  Member "on line file caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cache optimization models and algorithms")
  Member "the k server dual and loose competitiveness for paging":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cache optimization models and algorithms")
  Member "competitive paging algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.DS(Data Structures and Algorithms)