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 "what when and where to cache a unified optimization approach"):
  Abstract: Caching algorithms are usually described by the eviction method and analyzed using a metric of hit probability. Since contents have different importance (e.g. popularity), the utility of a high hit probability, and the cost of transmission can vary across contents. In this paper, we consider timer-based (TTL) policies across a cache network, where contents have differentiated timers over which we optimize. Each content is associated with a utility measured in terms of the corresponding hit probability. We start our analysis from a linear cache network: we propose a utility maximization problem where the objective is to maximize the sum of utilities and a cost minimization problem where the objective is to minimize the content transmission cost across the network. These frameworks enable us to design online algorithms for cache management, for which we prove achieving optimal performance. Informed by the results of our analysis, we formulate a non-convex optimization problem for a general cache network. We show that the duality gap is zero, hence we can develop a distributed iterative primal-dual algorithm for content management in the network. Finally, we consider two applications of our cache network model: (i) directly mapping to content distribution and (ii) generalization to wireless sensor network by jointly considering content caching and content compression. We characterize the tradeoff among caching, compression and communication via a nonlinear non-convex optimization problem. We show that it can be transformed into an equivalent convex problem. The obtained numerical results provide us with insights into how to optimize the performance.

Includes members:
  Member "lru cache under stationary requests":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network cache design under stationary requests exact analysis and poisson approximation")
  Member "jointly optimal routing and caching for arbitrary network topologies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online convex optimization for caching networks")
  Member "network cache design under stationary requests exact analysis and poisson approximation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint data compression and caching approaching optimality with guarantees")
  Member "accurate learning or fast mixing dynamic adaptability of caching algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cache optimization models and algorithms")
  Member "a utility optimization approach to network cache design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "online convex optimization for caching networks")
  Member "adaptive caching networks with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a ttl based approach for content placement in edge networks")
  Member "on the complexity of optimal routing and content caching in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a ttl based approach for content placement in edge networks")
  Member "a unified approach to the performance analysis of caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the design of dynamic probabilistic caching with time varying content popularity")

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.NI(Networking and Internet Architecture)