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 "joint pushing and caching for bandwidth utilization maximization in wireless networks"):
  Abstract: Joint pushing and caching is recognized as an efficient remedy to the problem of spectrum scarcity incurred by tremendous mobile data traffic. In this paper, by exploiting storage resources at end users and predictability of user demand processes, we design the optimal joint pushing and caching policy to maximize bandwidth utilization, which is of fundamental importance to mobile telecom carriers. In particular, we formulate the stochastic optimization problem as an infinite horizon average cost Markov Decision Process (MDP), for which there generally exist only numerical solutions without many insights. By structural analysis, we show how the optimal policy achieves a balance between the current transmission cost and the future average transmission cost. In addition, we show that the optimal average transmission cost decreases with the cache size, revealing a tradeoff between the cache size and the bandwidth utilization. Then, due to the fact that obtaining a numerical optimal solution suffers the curse of dimensionality and implementing it requires a centralized controller and global system information, we develop a decentralized policy with polynomial complexity w.r.t. the numbers of users and files as well as cache size, by a linear approximation of the value function and optimization relaxation techniques. Next, we propose an online decentralized algorithm to implement the proposed low-complexity decentralized policy using the technique of Q-learning, when priori knowledge of user demand processes is not available. Finally, using numerical results, we demonstrate the advantage of the proposed solutions over some existing designs. The results in this paper offer useful guidelines for designing practical cache-enabled content-centric wireless networks.

Includes members:
  Member "policy optimization for content push via energy harvesting small cells in heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "air ground integrated vehicular network slicing with content pushing and caching")
  Member "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "wireless content caching for small cell and d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a unified framework for constructing centralized coded caching schemes")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled heterogeneous wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "analysis and optimization of caching and multicasting in large scale cache enabled wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "multicast aware caching for small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on mobile edge networks convergence of computing caching and communications")
  Member "cache enabled small cell networks modeling and tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint content delivery and caching placement via dynamic programming")

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.IT(Information Theory)