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: "large scale mimo is capable of eliminating power thirsty channel coding for wireless transmission of hevc h 265 video"
  Abstract: A wireless video transmission architecture relying on the emerging LS-MIMO technique is proposed. Upon using the most advanced high efficiency video coding (also known as H.265), we demonstrate that the proposed architecture invoking the low-complexity linear zero-forcing detector and dispensing with any channel coding is capable of significantly outperforming the conventional small-scale MIMO-based architecture, even if the latter employs the high-complexity optimal maximum likelihood detector and a rate- 1/3 recursive systematic convolutional channel codec. Specifically, compared to the conventional small-scale MIMO system, the effective system throughput of the proposed LS-MIMO-based scheme is increased by a factor of up to three, and the quality of reconstructed video quantified in terms of the PSNR is improved by about 22.5 dB at a channel SNR of Eb/N0 ~ 6 dB for delay-tolerant video file delivery applications, and about 20 dB for lip-synchronized real-time interactive video applications. Alternatively, viewing the attainable improvement from a power-saving perspective, a channel SNR gain as high as δEb/N0 ~ 5 dB is observed at a PSNR of 36 dB for the scenario of delay-tolerant video applications, and again, an even higher channel SNR gain is achieved in the real-time video application scenario. Therefore, we envisage that LS-MIMO-aided wireless multimedia communications is capable of dispensing with the power-thirsty channel codec altogether!

Connected through hyperedge HE-1 (induced by source paper "energy efficient ofdma networks maintaining statistical qos guarantees for delay sensitive traffic"):
  with members:
    - "distributed energy spectral efficiency optimization for partial full interference alignment in multi user multi relay multi cell mimo systems"
    - "spectral and energy spectral efficiency optimization of joint transmit and receive beamforming based multi relay mimo ofdma cellular networks"
    - "maximizing energy efficiency in multi relay ofdma cellular networks"
    - "achieving maximum energy efficiency in multi relay ofdma cellular networks a fractional programming approach"
    - "qos aware base station selections for distributed mimo links in broadband wireless networks"
    - "statistical delay control and qos driven power allocation over two hop wireless relay links"
    - "the impact of qos constraints on the energy efficiency of fixed rate wireless transmissions"

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)