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 "policy optimization for content push via energy harvesting small cells in heterogeneous networks"):
  Abstract: Motivated by the rapid development of energy harvesting technology and content-aware communication in access networks, this paper considers the push mechanism design in small-cell base stations (SBSs) powered by renewable energy. A user request can be satisfied by either push or unicast from the SBS. If the SBS cannot handle the request, the user is blocked by the SBS and is served by the macro-cell BS (MBS) instead, which typically consumes more energy. We aim to minimize the ratio of user requests blocked by the SBS. With finite battery capacity, Markov decision process based problem is formulated, and the optimal policy is found by dynamic programming (DP). Two threshold-based policies are proposed: the push-only threshold-based (POTB) policy and the energy-efficient threshold-based (EETB) policy, and the closed-form blocking probabilities with infinite battery capacity are derived. Numerical results show that the proposed policies outperform the conventional non-push policy if the content popularity changes slowly or the content request generating rate is high, and can achieve the performance of the greedy optimal threshold-based (GOTB) policy. In addition, the performance gap between the threshold-based policies and the DP optimal policy is small when the energy arrival rate is low or the request generating rate is high.

Includes members:
  Member "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "on the tradeoff between energy harvesting and caching in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the 5g cellular backhaul management dilemma to cache or to serve")
  Member "greendelivery proactive content caching and push with energy harvesting based small cells":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the effective throughput of coded caching a game theoretic perspective")
  Member "proactive push with energy harvesting based small cells in heterogeneous networks":
    also connected through other hyperedges:
      (none)
  Member "energy harvesting small cell networks feasibility deployment and operation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "energy efficient optimization of wireless powered 5g full duplex cellular networks a mean field game approach")
  Member "learning based optimization of cache content in a small cell base station":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal scheduling of content caching subject to deadline")
  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")

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)