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: "effective capacity in mimo channels with arbitrary inputs"
  Abstract: Recently, communication systems that are both spectrum and energy efficient have attracted significant attention. Different from the existing research, we investigate the throughput and energy efficiency of a general class of multiple-input and multiple-output systems with arbitrary inputs when they are subject to statistical quality-of-service (QoS) constraints, which are imposed as limits on the delay violation and buffer overflow probabilities. We employ the effective capacity as the performance metric. We obtain the optimal input covariance matrix that maximizes the effective capacity under a short-term average power constraint. Following that, we perform an asymptotic analysis of the effective capacity in the low signal-to-noise ratio and large-scale antenna regimes. In the low signal-to-noise ratio regime analysis, we utilize the first and second derivatives of the effective capacity when the signal-to-noise ratio approaches zero in order to determine the minimum energy-per-bit and also the slope of the effective capacity versus energy-per-bit curve at the minimum energy-per-bit. We observe that the minimum energy-per-bit is independent of the input distribution, whereas the slope depends on the input distribution. In the large-scale antenna analysis, we show that the effective capacity approaches the average transmission rate in the channel with the increasing number of transmit and/or receive antennas. Particularly, the gap between the effective capacity and the average transmission rate in the channel, which is caused by the QoS constraints, is minimized with the number of antennas. In addition, we put forward the non-asymptotic backlog and delay violation bounds by utilizing the effective capacity. Finally, we substantiate our analytical results through numerical illustrations.

Connected through hyperedge HE-1 (induced by source paper "vlc systems with fixed rate transmissions under statistical queueing constraints"):
  with members:
    - "link selection in hybrid rf vlc systems under statistical queueing constraints"
    - "design of a cognitive vlc network with illumination and handover requirements"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"
    - "outage probability of the gaussian mimo free space optical channel with ppm"

Connected through hyperedge HE-2 (induced by source paper "hybrid rf vlc systems under qos constraints"):
  with members:
    - "design of a cognitive vlc network with illumination and handover requirements"
    - "effective capacity in cognitive radio broadcast channels"
    - "effective capacity analysis of cognitive radio channels for quality of service provisioning"
    - "on the capacity of free space optical intensity channels"

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)