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 optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space"):
  Abstract: In this paper, the scheduling of downlink file transmission in one cell with the assistance of cache nodes with finite cache space is studied. Specifically, requesting users arrive randomly and the base station (BS) reactively multicasts files to the requesting users and selected cache nodes. The latter can offload the traffic in their coverage areas from the BS. We consider the joint optimization of the abovementioned file placement and delivery within a finite lifetime subject to the cache space constraint. Within the lifetime, the allocation of multicast power and symbol number for each file transmission at the BS is formulated as a dynamic programming problem with a random stage number. Note that there are no existing solutions to this problem. We develop an asymptotically optimal solution framework by transforming the original problem to an equivalent finite-horizon Markov decision process (MDP) with a fixed stage number. A novel approximation approach is then proposed to address the curse of dimensionality, where the analytical expressions of approximate value functions are provided. We also derive analytical bounds on the exact value function and approximation error. The approximate value functions depend on some system statistics, e.g., requesting users' distribution. One reinforcement learning algorithm is proposed for the scenario where these statistics are unknown.

Includes members:
  Member "joint downlink scheduling for file placement and delivery in cache assisted wireless networks with finite file lifetime":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mdp based scheduling design for mobile edge computing systems with random user arrival")
  Member "optimal caching designs for perfect imperfect and unknown file popularity distributions in large scale multi tier wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis and optimization of caching and multicasting for multi quality videos in large scale wireless networks")
  Member "online user scheduling and resource allocation for mobile edge computing systems":
    also connected through other hyperedges:
      (none)
  Member "cooperative job dispatching in edge computing network with unpredictable uploading delay":
    also connected through other hyperedges:
      (none)
  Member "mdp based scheduling design for mobile edge computing systems with random user arrival":
    also connected through other hyperedges:
      (none)
  Member "modeling analysis and optimization of coded caching in small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "caching at base stations with multi cluster multicast wireless backhaul via accelerated first order algorithm")
  Member "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint downlink scheduling for file placement and delivery in cache assisted wireless networks with finite file lifetime")
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.IT(Information Theory)