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 multi quality multicast for 360 virtual reality video"
  Abstract: A 360 virtual reality (VR) video, recording a scene of interest in every direction, provides VR users with immersive viewing experience. However, transmission of a 360 VR video which is of a much larger size than a traditional video to mobile users brings a heavy burden to a wireless network. In this paper, we consider multi-quality multicast of a 360 VR video from a single server to multiple users using time division multiple access (TDMA). To improve transmission efficiency, tiling is adopted, and each tile is pre-encoded into multiple representations with different qualities. We optimize the quality level selection, transmission time allocation and transmission power allocation to maximize the total utility of all users under the transmission time and power allocation constraints as well as the quality smoothness constraints for mixed-quality tiles. The problem is a challenging mixed discrete-continuous opti-mization problem. We propose two low-complexity algorithms to obtain two suboptimal solutions, using continuous relaxation and DC programming, respectively. Finally, numerical results demonstrate the advantage of the proposed solutions.

Connected through hyperedge HE-1 (induced by source paper "optimal transmission of multi quality tiled 360 vr video by exploiting multicast opportunities"):
  with members:
    - "optimal multicast of tiled 360 vr video"
    - "optimal multicast of tiled 360 vr video in ofdma 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)