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 "generalized compute compress and forward"):
  Abstract: Compute-and-forward (CF) harnesses interference in wireless communications by exploiting structured coding. The key idea of CF is to compute integer combinations of codewords from multiple source nodes, rather than to decode individual codewords by treating others as noise. Compute-compress-and-forward (CCF) can further enhance the network performance by introducing compression operations at receivers. In this paper, we develop a more general compression framework, termed generalized compute-compress-and-forward (GCCF), where the compression function involves multiple quantization-and-modulo lattice operations. We show that GCCF achieves a broader compression rate region than CCF. We also compare our compression rate region with the fundamental Slepian-Wolf (SW) region. We show that GCCF is optimal in the sense of achieving the minimum total compression rate. We also establish the criteria under which GCCF achieves the SW region. In addition, we consider a two-hop relay network employing the GCCF scheme. We formulate a sum-rate maximization problem and develop an approximate algorithm to solve the problem. Numerical results are presented to demonstrate the performance superiority of GCCF over CCF and other schemes.

Includes members:
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "compute compress and forward exploiting asymmetry of wireless relay networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an efficient optimal algorithm for the successive minima problem")
  Member "lattice codes for many to one interference channels with and without cognitive messages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the sum capacity of many to one and one to many gaussian interference channels")
  Member "asymmetric compute and forward with csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward")
  Member "optimized backhaul compression for uplink cloud radio access network":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "an algebraic approach to physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "lattice coding for downlink multiuser transmission")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")

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)