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 the sparsely spread mc cdma downlink with discrete alphabet inputs"):
  Abstract: Sparse signatures have been proposed for the code-division multiple-access (CDMA) uplink to reduce multiuser detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this paper, we propose multicarrier CDMA (MC-CDMA) downlink communication whereby regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station (BS), subject to minimum symbol error probability (SEP) requirements at the mobile stations (MSs). In the algorithm, signature sparsity is shown to be crucial for reducing precoding complexity. Numerical results confirm system-load-dependent power reduction gain from the proposed precoding over the zero-forcing (ZF) precoding and the regularized ZF (RZF) precoding with optimized regularization parameter under the same SEP targets. For a fixed system load, it is also demonstrated that sparse MC-CDMA with a proper choice of sparsity level attains almost the same power efficiency and link throughput as that of dense MC-CDMA yet with reduced precoding complexity due to the sparse signatures.

Includes members:
  Member "optimal multiuser transmit beamforming a difficult problem with a simple solution structure":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "massive mimo has unlimited capacity")
  Member "vector precoding for wireless mimo systems and its replica analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expectation propagation for approximate inference free probability framework")
  Member "sparsely spread cdma a statistical mechanics based analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fundamental limits of low density spreading noma with fading")
  Member "analysis of belief propagation for non linear problems the example of cdma or how to prove tanaka s formula":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding phase transitions via mutual information and mmse")

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)