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 "steepest gradient based orthogonal precoder for integer forcing mimo"):
  Abstract: In this paper, we develop an orthogonal precoding scheme for integer-forcing (IF) linear receivers using the steepest gradient algorithm. Although this scheme can be viewed as a special case of the unitary precoded integer-forcing (UPIF), it has two major advantages. First, the orthogonal precoding outperforms its unitary counterpart in terms of achievable rate, outage probability, and error rate. We verify this advantage via theoretical and numerical analyses. Second, it exhibits lower complexity as the dimension of orthogonal matrices is half that of unitary matrices in the real-valued domain. For finding ``good'' orthogonal precoder matrices, we propose an efficient algorithm based on the steepest gradient algorithm that exploits the geometrical properties of orthogonal matrices as a Lie group. The proposed algorithm has low complexity and can be easily applied to an arbitrary MIMO configuration. We also confirm numerically that the proposed orthogonal precoding outperforms UPIF type II in some scenarios and the X-precoder in high-order QAM schemes, e.g., $64$- and $256$-QAM.

Includes members:
  Member "boosted kz and lll algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on low complexity lattice reduction algorithms for large scale mimo detection the blessing of sequential reduction")
  Member "efficient integer coefficient search for compute and forward":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "low complexity coefficient selection algorithms for compute and forward")
  Member "encoding and indexing of lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "leech constellations of construction a lattices")
  Member "an efficient optimal algorithm for the successive minima problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a kz reduction algorithm")
  Member "full diversity unitary precoded integer forcing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "integer forcing linear receivers a design criterion for full diversity stbcs")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved upper bounds on the hermite and kz constants")
  Member "integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "private information retrieval over gaussian mac")

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)