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 "upper and lower bounds on the capacity of amplitude constrained mimo channels"):
  Abstract: In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output channels with amplitude constraints is considered. The bounds are shown to be within a constant gap if the channel matrix is invertible and are tight in the high amplitude regime for arbitrary channel matrices. Moreover, in the high amplitude regime, it is shown that the capacity scales linearly with the minimum between the number of transmit and receive antennas, similarly to the case of average power-constrained inputs.

Includes members:
  Member "the capacity of gaussian mimo channels under total and per antenna power constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "an upper bound for the capacity of amplitude constrained scalar awgn channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computable upper bounds on the capacity of finite state channels")
  Member "interference as noise friend or foe":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on linearly precoded rate splitting for mimo broadcast channels")
  Member "capacity bounds for discrete time amplitude constrained additive white gaussian noise channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computable upper bounds on the capacity of finite state channels")
  Member "on the capacity of vector gaussian channels with bounded inputs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite blocklength analysis of gaussian random coding in awgn channels under covert constraints")
  Member "miso capacity with per antenna power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "on the boundedness of the support of optimal input measures for rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the capacity of the awgn channel with additive radar interference")

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)