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 "compute compress and forward exploiting asymmetry of wireless relay networks"):
  Abstract: Compute-and-forward (CF) harnesses interference in a wireless network by allowing relays to compute combinations of source messages. The computed message combinations at relays are correlated, and so directly forwarding these combinations to a destination generally incurs information redundancy and spectrum inefficiency. To address this issue, we propose a novel relay strategy, termed compute-compress-and-forward (CCF). In CCF, source messages are encoded using nested lattice codes constructed on a chain of nested coding and shaping lattices. A key difference of CCF from CF is an extra compressing stage inserted in between the computing and forwarding stages of a relay, so as to reduce the forwarding information rate of the relay. The compressing stage at each relay consists of two operations: first to quantize the computed message combination on an appropriately chosen lattice (referred to as a quantization lattice), and then to take modulo on another lattice (referred to as a modulo lattice). We study the design of the quantization and modulo lattices and propose successive recovering algorithms to ensure the recoverability of source messages at destination. Based on that, we formulate a sum-rate maximization problem that is in general an NP-hard mixed integer program. A low-complexity algorithm is proposed to give a suboptimal solution. Numerical results are presented to demonstrate the superiority of CCF over the existing CF schemes.

Includes members:
  Member "asymmetric compute and forward with csit":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generalized compute compress and forward")
  Member "mimo multiway relaying with clustered full data exchange signal space alignment and degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal dof region for the asymmetric two pair mimo two way relay channel")
  Member "towards the asymptotic sum capacity of the mimo cellular two way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mimo multiway distributed relay channel with full data exchange an achievable rate perspective")
  Member "phase precoded compute and forward with partial feedback":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust successive compute and forward over multi user multi relay networks")
  Member "phase precoding for the compute and forward protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient integer coefficient search for compute and forward")
  Member "mimo multiway relaying with pairwise data exchange a degrees of freedom perspective":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")
  Member "multilevel coding schemes for compute and forward with flexible decoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "mobile lattice coded physical layer network coding with practical channel alignment")
  Member "degrees of freedom for the mimo multi way relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "degrees of freedom of the mimo three way channel with node intermittency")

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)