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 "radio resource allocation for multicarrier low density spreading multiple access"):
  Abstract: Multicarrier low-density-spreading multiple access (MC-LDSMA) is a promising multiple access technique that enables near-optimal multiuser detection. In MC-LDSMA, each user's symbol is spread over a small set of subcarriers, and each subcarrier is shared by multiple users. The unique structure of MC-LDSMA makes the radio resource allocation more challenging compared with some well-known multiple access techniques. In this paper, we study the radio resource allocation for a single-cell MC-LDSMA system. First, we consider the single-user case and derive the optimal power allocation and subcarriers partitioning schemes. Then, by capitalizing on the optimal power allocation of the Gaussian multiple-access channel, we provide an optimal solution for MC-LDSMA that maximizes the users' weighted sum rate under relaxed constraints. Due to the prohibitive complexity of the optimal solution, suboptimal algorithms are proposed based on the guidelines inferred by the optimal solution. The performance of the proposed algorithms and the effect of subcarrier loading and spreading are evaluated through Monte Carlo simulations. Numerical results show that the proposed algorithms significantly outperform conventional static resource allocation, and MC-LDSMA can improve the system performance in terms of spectral efficiency and fairness in comparison with orthogonal frequency-division multiple access.

Includes members:
  Member "sparsely spread cdma a statistical mechanics based analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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)