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 methods for miso broadcast channel with delayed csit"):
  Abstract: Recent information theoretic results suggest that precoding on the multi-user downlink MIMO channel with delayed channel state information at the transmitter (CSIT) could lead to data rates much beyond the ones obtained without any CSIT, even in extreme situations when the delayed channel feedback is made totally obsolete by a feedback delay exceeding the channel coherence time. This surprising result is based on the ideas of interference repetition and alignment which allow the receivers to reconstruct information symbols which canceling out the interference completely, making it an optimal scheme in the infinite SNR regime. In this paper, we formulate a similar problem, yet at finite SNR. We propose a first construction for the precoder which matches the previous results at infinite SNR yet reaches a useful trade-off between interference alignment and signal enhancement at finite SNR, allowing for significant performance improvements in practical settings. We present two general precoding methods with arbitrary number of users by means of virtual MMSE and mutual information optimization, achieving good compromise between signal enhancement and interference alignment. Simulation results show substantial improvement due to the compromise between those two aspects.

Includes members:
  Member "interference alignment for the mimo interference channel with delayed local csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "achievable sum dof of the k user mimo interference channel with delayed csit")
  Member "multi user mimo with outdated csi training feedback and scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity and degrees of freedom regions of two user mimo interference channels with limited receiver cooperation")
  Member "completely stale transmitter channel state information is still very useful":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "cooperative algorithms for mimo interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the capacity and optimal signaling for gaussian mimo channels under interference constraints full version")
  Member "balancing egoism and altruism on the interference channel the mimo case":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "signal processing and optimal resource allocation for the interference channel")

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)