human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "lower bound on the sum rate of decremental beam selection algorithm for beamspace mimo systems"):
  Abstract: In general, the zero-forcing (ZF) precoding suffers from a severe receive signal-to-noise ratio (SNR) degradation in the high interference regime. However, recent evidences from realistic measurements demonstrated that millimeter wave (mmWave) systems are mainly noise-limited as high gain antennas behave as spatial filters to the interference signal. This makes ZF precoding equally attractive as that of other linear precoding counterparts. Considering ZF precoding, this paper aims to derive a lower bound on the sum-rate achieved by a decremental beam selection (BS) algorithm in a beamspace MIMO (B-MIMO) system operating at mmWave frequencies. This bound relates Frobenious norms of precoding matrices of full and reduced dimensional (i.e. after BS) B-MIMO systems through a deterministic square-hyperbolic function. Note that, both ZF precoding and decremental BS are not new concepts. However, the derived sum-rate bound provides a new insight to the topic. Given a particular full dimensional B-MIMO channel, the presented bound can be used to understand limits of BS algorithms.

Includes members:
  Member "a comparison of hybrid beamforming and digital beamforming with low resolution adcs for multiple users and imperfect csi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "advanced receiver architectures for millimeter wave communications with low resolution adcs")
  Member "spatially sparse precoding in millimeter wave mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficient hybrid precoding design for integrated multicast unicast millimeter wave communications with swipt")

Question: Please tell me which class the source paper 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)