human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "generalized compute compress and forward"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "lattice codes for many to one interference channels with and without cognitive messages"
    - "asymmetric compute and forward with csit"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "successive integer forcing and its sum rate optimality"
    - "an algebraic approach to physical layer network coding"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "a simple proof for the existence of good pairs of nested lattices"

Connected through hyperedge HE-2 (induced by source paper "an efficient optimal algorithm for the successive minima problem"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "full diversity unitary precoded integer forcing"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"

Connected through hyperedge HE-3 (induced by source paper "lossy compression for compute and forward in limited backhaul uplink multicell processing"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "optimized backhaul compression for uplink cloud radio access network"
    - "compute and forward on a multi user multi relay channel"
    - "successive integer forcing and its sum rate optimality"
    - "multihop backhaul compression for the uplink of cloud radio access networks"
    - "compute and forward on a multiaccess relay channel coding and symmetric rate optimization"
    - "uplink multicell processing with limited backhaul via per base station successive interference cancellation"
    - "robust and efficient distributed compression for cloud radio access networks"

Question: Please tell me which class the center node 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)