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 "precoding for outage probability minimization on block fading channels"):
  Abstract: The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain. With linear precoding, full diversity on a block fading channel can be achieved without error-correcting code. However, the effect of precoding on the coding gain is not well known, mainly due to the complicated expression of the outage probability. Using a geometric approach, this paper establishes simple upper bounds on the outage probability, the minimization of which yields to precoding matrices that achieve very good performance. For discrete alphabets, it is shown that the combination of constellation expansion and precoding is sufficient to closely approach the minimum possible outage achieved by an i.i.d. Gaussian input distribution, thus essentially maximizing the coding gain.

Includes members:
  Member "high snr asymptotics of mutual information for discrete constellations with applications to bicm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "introducing enumerative sphere shaping for optical communication systems with short blocklengths")
  Member "low density graph codes for coded cooperation on slow fading relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "outage limit approaching protograph ldpc codes for slow fading wireless communications")
  Member "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "mimo precoding with x and y codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "space time coding techniques with bit interleaved coded modulations for mimo block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)