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 "cache placement in two tier hetnets with limited storage capacity cache or buffer"):
  Abstract: In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first derived and then substituted into the original problem. The structure of the optimal caching strategy is presented, which shows that it is optimal to cache the files with high popularity instead of the files with big size. Based on this optimal structure, we propose an iterative algorithm with low complexity to obtain a suboptimal solution, where the closed-from expression is obtained in each step. Numerical results show the superiority of our solution compared to the conventional cache strategy without considering cache and buffer tradeoff in terms of delay.

Includes members:
  Member "optimal fairness aware time and power allocation in wireless powered communication networks":
    also connected through other hyperedges:
      (none)
  Member "energy efficient resource allocation in machine to machine communications with multiple access and energy harvesting for iot":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interplay between noma and other emerging technologies a survey")
  Member "cooperative edge caching in user centric clustered mobile networks":
    also connected through other hyperedges:
      (none)
  Member "association and load optimization with user priorities in load coupled heterogeneous networks":
    also connected through other hyperedges:
      (none)
  Member "on consideration of content preference and sharing willingness in d2d assisted offloading":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "individual preference aware caching policy design in wireless d2d networks")
  Member "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "caching at the wireless edge design aspects challenges and future directions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "wireless caching technical misconceptions and business barriers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)