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: "integer forcing linear receivers"
  Abstract: Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper develops a new linear receiver architecture that uses the receive antennas to create an effective channel matrix with integer-valued entries. Rather than attempting to recover transmitted codewords directly, the decoder recovers integer combinations of the codewords according to the entries of the effective channel matrix. The codewords are all generated using the same linear code which guarantees that these integer combinations are themselves codewords. Provided that the effective channel is full rank, these integer combinations can then be digitally solved for the original codewords. This paper focuses on the special case where there is no coding across transmit antennas and no channel state information at the transmitter(s), which corresponds either to a multi-user uplink scenario or to single-user V-BLAST encoding. In this setting, the proposed integer-forcing linear receiver significantly outperforms conventional linear architectures such as the zero-forcing and linear MMSE receiver. In the high SNR regime, the proposed receiver attains the optimal diversity-multiplexing tradeoff for the standard MIMO channel with no coding across transmit antennas. It is further shown that in an extended MIMO model with interference, the integer-forcing linear receiver achieves the optimal generalized degrees-of-freedom.

Connected through hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac"):
  with members:
    - "noisy private information retrieval on separability of channel coding and information retrieval"
    - "asymptotically optimal scheduling for compute and forward"
    - "private information retrieval from mds coded data in distributed storage systems"
    - "the capacity of private information retrieval with partially known private side information"
    - "gaussian multiple access via compute and forward"
    - "the capacity of private information retrieval from byzantine and colluding databases"
    - "the necessity of scheduling in compute and forward"
    - "the capacity of robust private information retrieval with colluding databases"

Connected through hyperedge HE-2 (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-3 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo"):
  with members:
    - "boosted kz and lll algorithms"
    - "efficient integer coefficient search for compute and forward"
    - "encoding and indexing of lattice codes"
    - "an efficient optimal algorithm for the successive minima problem"
    - "full diversity unitary precoded integer forcing"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-4 (induced by source paper "on unlimited sampling and reconstruction"):
  with members:
    - "blind unwrapping of modulo reduced gaussian vectors recovering msbs from lsbs"
    - "above the nyquist rate modulo folding does not hurt"
    - "a modulo based architecture for analog to digital conversion"
    - "on unlimited sampling"

Connected through hyperedge HE-5 (induced by source paper "optimization of integer forcing precoding for multi user mimo downlink"):
  with members:
    - "on integer forcing precoding for the gaussian mimo broadcast channel"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"

Connected through hyperedge HE-6 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control"):
  with members:
    - "inference from randomized transmissions by many backscatter sensors"
    - "over the air function computation in sensor networks"
    - "communications and signals design for wireless power transmission"
    - "resource allocation in wireless powered relay networks a bargaining game approach"
    - "wireless powered communication opportunities and challenges"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"
    - "energy harvesting for physical layer security in ofdma networks"
    - "simultaneous wireless information and power transfer under different csi acquisition schemes"

Connected through hyperedge HE-7 (induced by source paper "some properties of successive minima and their applications"):
  with members:
    - "integer forcing architectures for uplink cloud radio access networks"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "a modified kz reduction algorithm"
    - "integer forcing source coding"
    - "an algebraic approach to physical layer network coding"
    - "partial lll reduction"

Connected through hyperedge HE-8 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach"):
  with members:
    - "lattice coding and decoding for multiple antenna ergodic fading channels"
    - "polar codes and polar lattices for independent fading channels"
    - "almost universal codes achieving ergodic mimo capacity within a constant gap"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "dispersion analysis of infinite constellations in ergodic fading channels"
    - "compute and forward harnessing interference through structured codes"

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)