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: "optimal decentralized dynamic policies for video streaming over wireless channels"
  Abstract: The problem addressed is that of optimally controlling, in a decentralized fashion, the download of mobile video, which is expected to comprise 75 % of total mobile data traffic by 2020. The server can dynamically choose which packets to download to clients, from among several packets which encode their videos at different resolutions, as well as the power levels of their transmissions. This allows it to control packet delivery probabilities, and thereby, for example, avert imminent video outages at clients. It must however respect the access point's constraints on bandwidth and average transmission power. The goal is to maximize video "Quality of Experience" (QoE), which depends on several factors such as (i) outage duration when the video playback buffer is empty, (ii) number of outage periods, (iii) how many frames downloaded are of lower resolution, (iv) temporal variations in resolution, etc. #R##N#It is shown that there exists an optimal decentralized solution where the AP announces the price of energy, and each client distributedly and dynamically maximizes its own QoE subject to the cost of energy. A distributed iterative algorithm to solve for optimal decentralized policy is also presented. Further, for the client-level QoE optimization, the optimal choice of video-resolution and power-level of packet transmissions has a simple monotonicity and threshold structure vis-a-vis video playback buffer level. When the number of orthogonal channels is less than the number of clients, there is an index policy for prioritizing packet transmissions. When the AP has to simply choose which clients' packets to transmit, the index policy is asymptotically optimal as the number of channels is scaled up with clients.

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.NI(Networking and Internet Architecture)