human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "joint downlink scheduling for file placement and delivery in cache assisted wireless networks with finite file lifetime"
  Abstract: In this paper, downlink transmission scheduling of popular files is optimized with the assistance of wireless cache nodes. Specifically, the requests of each file, which is further divided into a number of segments, are modeled as a Poisson point process within its finite lifetime. Two downlink transmission modes are considered: (1) the base station reactively multicasts the file segments to the requesting users and selected cache nodes; (2) the base station proactively multicasts some file segments to the selected cache nodes without requests. The cache nodes with decoded file segments can help to offload the traffic via other spectrum. Without the proactive multicast, we formulate the downlink transmission resource minimization as a dynamic programming problem with random stage number, which can be approximated via a finite-horizon Markov decision process (MDP) with fixed stage number. To address the prohibitively huge state space, we propose a low-complexity scheduling policy by linearly approximating the value functions of the MDP, where the bound on the approximation error is derived. Moreover, we propose a learning-based algorithm to evaluate the approximated value functions for unknown geographical distribution of requesting users. Finally, given the above reactive multicast policy, a proactive multicast policy is introduced to exploit the temporal diversity of shadowing effect. It is shown by simulation that the proposed low-complexity reactive multicast policy can significantly reduce the resource consumption at the base station, and the proactive multicast policy can further improve the performance.

Connected through 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"):
  with members:
    - "optimal caching designs for perfect imperfect and unknown file popularity distributions in large scale multi tier wireless networks"
    - "online user scheduling and resource allocation for mobile edge computing systems"
    - "cooperative job dispatching in edge computing network with unpredictable uploading delay"
    - "mdp based scheduling design for mobile edge computing systems with random user arrival"
    - "modeling analysis and optimization of coded caching in small cell networks"
    - "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"
    - "wireless device to device caching networks basic principles and system performance"
    - "optimal caching and user association in cache enabled heterogeneous wireless networks"

Connected through hyperedge HE-2 (induced by source paper "mdp based scheduling design for mobile edge computing systems with random user arrival"):
  with members:
    - "joint pushing and caching for bandwidth utilization maximization in wireless networks"
    - "delay optimal computation task scheduling for mobile edge computing systems"
    - "dynamic computation offloading for mobile edge computing with energy harvesting devices"
    - "power delay tradeoff in multi user mobile edge computing systems"
    - "decentralized computation offloading game for mobile cloud computing"
    - "efficient multi user computation offloading for mobile edge cloud computing"

Connected through hyperedge HE-3 (induced by source paper "cooperative job dispatching in edge computing network with unpredictable uploading delay"):
  with members:
    - "stochastic control of computation offloading to a helper with a dynamically loaded cpu"
    - "dynamic computation offloading for mobile edge computing with energy harvesting devices"
    - "efficient multi user computation offloading for mobile edge cloud computing"
    - "queue aware distributive resource control for delay sensitive two hop mimo cooperative systems"

Question: Please tell me which class the center node 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)