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: "optimizing quality of experience of dynamic video streaming over fading wireless networks"
  Abstract: We address the problem of video streaming packets from an Access Point (AP) to multiple clients over a shared wireless channel with fading. In such systems, each client maintains a buffer of packets from which to play the video, and an outage occurs in the streaming whenever the buffer is empty. Clients can switch to a lower-quality of video packet, or request packet transmission at a higher energy level in order to minimize the number of outages plus the number of outage periods and the number of low quality video packets streamed, while there is an average power constraint on the AP. #R##N#We pose the problem of choosing the video quality and transmission power as a Constrained Markov Decision Process (CMDP). We show that the problem involving $N$ clients decomposes into $N$ MDPs, each involving only a single client, and furthermore that the optimal policy has a threshold structure, in which the decision to choose the video-quality and power-level of transmission depends solely on the buffer-level.

Connected through hyperedge HE-1 (induced by source paper "optimal information updating based on value of information"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age optimal information updates in multihop networks"
    - "remote estimation of the wiener process over a channel with random delay"
    - "index policies for optimal mean variance trade off of inter delivery times in real time sensor networks"
    - "decentralized throughput maximizing policies for deadline constrained wireless networks"
    - "a high reliability asymptotic approach for packet inter delivery time optimization in cyber physical systems"
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"

Connected through hyperedge HE-2 (induced by source paper "qflow a reinforcement learning approach to high qoe video streaming over wireless networks"):
  with members:
    - "lift reinforcement learning in computer systems by learning from demonstrations"
    - "deep reinforcement learning with double q learning"

Connected through hyperedge HE-3 (induced by source paper "broadcasting real time flows in integrated backhaul and access 5g networks"):
  with members:
    - "investigation of performance in integrated access and backhaul networks"
    - "throughput optimal broadcast in wireless networks with dynamic topology"

Connected through hyperedge HE-4 (induced by source paper "optimal decentralized dynamic policies for video streaming over wireless channels"):
  with members:
    - "analysis of buffer starvation with application to objective qoe optimization of streaming services"

Connected through hyperedge HE-5 (induced by source paper "throughput optimal decentralized scheduling of multi hop networks with end to end deadline constraints unreliable links"):
  with members:
    - "pathwise performance of debt based policies for wireless networks with hard delay constraints"
    - "scheduling periodic real time tasks with heterogeneous reward requirements"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"
    - "utility maximization for delay constrained qos in wireless"
    - "rethinking information theory for mobile ad hoc networks"

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)