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: "successive integer forcing and its sum rate optimality"
  Abstract: Integer-forcing receivers generalize traditional linear receivers for the multiple-input multiple-output channel by decoding integer-linear combinations of the transmitted streams, rather then the streams themselves. Previous works have shown that the additional degree of freedom in choosing the integer coefficients enables this receiver to approach the performance of maximum-likelihood decoding in various scenarios. Nonetheless, even for the optimal choice of integer coefficients, the additive noise at the equalizer's output is still correlated. In this work we study a variant of integer-forcing, termed successive integer-forcing, that exploits these noise correlations to improve performance. This scheme is the integer-forcing counterpart of successive interference cancellation for traditional linear receivers. Similarly to the latter, we show that successive integer-forcing is capacity achieving when it is possible to optimize the rate allocation to the different streams. In comparison to standard successive interference cancellation receivers, the successive integer-forcing receiver offers more possibilities for capacity achieving rate tuples, and in particular, ones that are more balanced.

Connected through hyperedge HE-1 (induced by source paper "integer forcing architectures for uplink cloud radio access networks"):
  with members:
    - "achievability performance bounds for integer forcing source coding"
    - "green heterogeneous cloud radio access networks potential techniques performance trade offs and challenges"
    - "on the optimal fronthaul compression and decoding strategies for uplink cloud radio access networks"
    - "outage behavior of integer forcing with random unitary pre processing"
    - "fronthaul compression and transmit beamforming optimization for multi antenna uplink c ran"
    - "system architecture and key technologies for 5g heterogeneous cloud radio access networks"
    - "cloud radio access network virtualizing wireless access for dense heterogeneous systems"
    - "optimized backhaul compression for uplink cloud radio access network"

Connected through hyperedge HE-2 (induced by source paper "improved upper bounds on the hermite and kz constants"):
  with members:
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-3 (induced by source paper "simple bounds for the symmetric capacity of the rayleigh fading multiple access channel"):
  with members:
    - "what will 5g be"
    - "five disruptive technology directions for 5g"
    - "the jacobi mimo channel"

Connected through hyperedge HE-4 (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"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "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"
    - "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-5 (induced by source paper "gaussian multiple access via compute and forward"):
  with members:
    - "a joint typicality approach to algebraic network information theory"
    - "asymmetric compute and forward with csit"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "nested lattice codes for gaussian relay networks with interference"
    - "integer forcing linear receivers"
    - "lattice strategies for the dirty multiple access channel"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-6 (induced by source paper "on the kz reduction"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "boosted kz and lll algorithms"
    - "a modified kz reduction algorithm"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-7 (induced by source paper "integer forcing message recovering in interference channels"):
  with members:
    - "integer forcing and forward transceiver design for mimo multipair two way relaying"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "simplified compute and forward and its performance analysis"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-8 (induced by source paper "a kz reduction algorithm"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "an efficient optimal algorithm for the successive minima problem"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"
    - "improved analysis of kannan s shortest lattice vector algorithm"

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)