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: "full diversity unitary precoded integer forcing"
  Abstract: We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to independent lattice codewords drawn from the same codebook. Each lattice codeword is then multiplied by a unitary precoding matrix ${\bf P}$ and sent through the channel. At the receiver side, an integer-forcing (IF) linear receiver is employed. We denote this scheme as unitary precoded integer-forcing (UPIF). We show that UPIF can achieve full-diversity under a constraint based on the shortest vector of a lattice generated by the precoding matrix ${\bf P}$. This constraint and a simpler version of that provide design criteria for two types of full-diversity UPIF. Type I uses a unitary precoder that adapts at each channel realization. Type II uses a unitary precoder, which remains fixed for all channel realizations. We then verify our results by computer simulations in $2\times2$, and $4\times 4$ MIMO using different QAM constellations. We finally show that the proposed Type II UPIF outperform the MIMO precoding X-codes at high data rates.

Connected through hyperedge HE-1 (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"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "integer forcing linear receivers"
    - "mimo precoding with x and y codes"

Connected through hyperedge HE-2 (induced by source paper "integer forcing linear receivers a design criterion for full diversity stbcs"):
  with members:
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mmse mimo receivers"
    - "integer forcing linear receivers"

Connected through hyperedge HE-3 (induced by source paper "robust successive compute and forward over multi user multi relay networks"):
  with members:
    - "compute and forward finding the best equation"
    - "phase precoded compute and forward with partial feedback"
    - "lattices from codes for harnessing interference an overview and generalizations"
    - "compute and forward two way relaying"
    - "compute and forward on a multi user multi relay channel"
    - "successive integer forcing and its sum rate optimality"
    - "asynchronous physical layer network coding with quasi cyclic codes"
    - "convolutional network coded cooperation in multi source networks with a multi antenna relay"

Connected through hyperedge HE-4 (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"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "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-5 (induced by source paper "on integer forcing precoding for the gaussian mimo broadcast channel"):
  with members:
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "optimal multiuser transmit beamforming a difficult problem with a simple solution structure"
    - "uplink downlink duality for integer forcing"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "an algebraic approach to physical layer network coding"
    - "reverse compute and forward a low complexity architecture for downlink distributed antenna systems"
    - "compute and forward strategies for cooperative distributed antenna systems"
    - "integer forcing linear receivers"

Connected through hyperedge HE-6 (induced by source paper "locally diverse constellations from the special orthogonal group"):
  with members:
    - "multi dimensional and non uniform constellation optimization via the special orthogonal group"
    - "scma codebook design"
    - "rotating non uniform and high dimensional constellations using geodesic flow on lie groups"

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)