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 "robust successive compute and forward over multi user multi relay networks"):
  Abstract: This paper develops efficient Compute-and-forward (CMF) schemes in multi-user multi-relay networks. To solve the rank failure problem in CMF setups and to achieve full diversity of the network, we introduce two novel CMF methods, namely, extended CMF and successive CMF. The former, having low complexity, is based on recovering multiple equations at relays. The latter utilizes successive interference cancellation (SIC) to enhance the system performance compared to the state-of-the-art schemes. Both methods can be utilized in a network with different number of users, relays, and relay antennas, with negligible feedback channels or signaling overhead. We derive new concise formulations and explicit framework for the successive CMF method as well as an approach to reduce its computational complexity. Our theoretical analysis and computer simulations demonstrate the superior performance of our proposed CMF methods over the conventional schemes. Furthermore, based on our simulation results, the successive CMF method yields additional signal-to-noise ratio gains and shows considerable robustness against channel estimation error, compared to the extended CMF method.

Includes members:
  Member "full diversity unitary precoded integer forcing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "compute and forward finding the best equation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotically optimal scheduling for compute and forward")
  Member "phase precoded compute and forward with partial feedback":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compute compress and forward exploiting asymmetry of wireless relay networks")
  Member "lattices from codes for harnessing interference an overview and generalizations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "construction pi_a and pi_d lattices construction goodness and decoding algorithms")
  Member "compute and forward two way relaying":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing and forward transceiver design for mimo multipair two way relaying")
  Member "compute and forward on a multi user multi relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "signal aligned network coding in k user mimo interference channels with limited receiver cooperation")
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "asynchronous physical layer network coding with quasi cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "physical layer network coding a random coding error exponent perspective")

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)