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 "multisource transmission for wireless relay networks with linear complexity"):
  Abstract: This paper considers transmission schemes in multiaccess relay networks (MARNs) where J single-antenna sources send independent information to one N-antenna destination through one M-antenna relay. For complexity considerations, we propose a linear framework, where the relay linearly transforms its received signals to generate the forwarded signals without decoding and the destination uses its multiantennas to fully decouple signals from different sources before decoding, by which the decoding complexity is linear in the number of sources. To achieve a high symbol rate, we first propose a scheme called ConcurrentS→R→D-ICD in which all sources' information streams are concurrently transmitted in both the source-relay link and the relay-destination link. In this scheme, distributed space-time coding (DSTC) is applied at the relay, which satisfies the linear constraint. DSTC also allows the destination to conduct the zero-forcing interference cancellation (IC) scheme originally proposed for multiantenna systems to fully decouple signals from different sources. Our analysis shows that the symbol rate of ConcurrentS→R→D-ICD is 1/2 symbols/source/channel use and the diversity gain of the scheme is upperbounded by M-J+1. To achieve a higher diversity gain, we propose another scheme called ConcurrentR→D-ICD in which the sources time-share the source-relay link. The relay coherently combines the signals on its antennas to maximize the signal-to-noise ratio (SNR) of each source, then concurrently forwards all sources' information. The destination performs zero-forcing IC. It is shown through both analysis and simulation that when N ≥ 2J-1, ConcurrentR→D-ICD achieves the same maximum diversity gain as the full TDMA scheme in which information streams from each source are assigned to orthogonal channels in both links, but with a higher symbol rate.

Includes members:
  Member "interference cancellation at the relay for multi user wireless cooperative networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "power allocation and pricing in multi user relay networks using stackelberg and bargaining games")
  Member "performance analysis of multiple antenna multi user detection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on designs of full diversity space time block codes for two user mimo interference channels")
  Member "power bandwidth tradeoff in dense multi antenna relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "collaborative broadcast in o log log n rounds")

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)