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 "practical bounds on optimal caching with variable object sizes"):
  Abstract: Many recent caching systems aim to improve hit ratios, but there is no good sense among practitioners of how much further hit ratios can be improved. In other words, should the systems community continue working on this problem? Currently, there is no principled answer to this question. Most prior work assumes that objects have the same size, but in practice object sizes often vary by several orders of magnitude. The few known results for variable object sizes provide very weak guarantees and are impractical to compute on traces of realistic length. We propose a new method to compute the offline optimal hit ratio under variable object sizes. Our key insight is to represent caching as a min-cost flow problem, hence we call our method the flow-based offline optimal (FOO). We show that, under simple independence assumptions and Zipf popularities, FOO's bounds become tight as the number of objects goes to infinity. From FOO we develop fast, practical methods to compute nearly tight bounds for the optimal hit ratio, which we call practical flow-based offline optimal (P-FOO). P-FOO enables the first analysis of optimal caching on realistic traces with hundreds of millions of requests. We evaluate P-FOO on several production traces, where results show that recent caching systems are still far from optimal.

Includes members:
  Member "adaptive caching networks with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a ttl based approach for content placement in edge networks")
  Member "general caching is hard even with small pages":
    also connected through other hyperedges:
      (none)
  Member "tinylfu a highly efficient cache admission policy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a hybrid cache architecture for meeting per tenant performance goals in a private cloud")
  Member "a nearly linear time ptas for explicit fractional packing and covering linear programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic incentive aware learning robust pricing in contextual auctions")
  Member "exact analysis of ttl cache networks the case of caching policies driven by stopping times":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "jointly optimal routing and caching for arbitrary network topologies")
  Member "a combinatorial tilde o m 3 2 time algorithm for the min cost flow problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "faster parallel algorithm for approximate shortest path")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")
  Member "performance evaluation of the random replacement policy for networks of caches":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalization of lru cache replacement policy with applications to video streaming")

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.PF(Performance)