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 "integer forcing message recovering in interference channels"):
  Abstract: In this paper, we propose a scheme referred to as integer-forcing message recovering (IFMR) to enable receivers to recover their desirable messages in interference channels. Compared to the state-of-the- art integer-forcing linear receiver (IFLR), our proposed IFMR approach needs to decode considerably less number of messages. In our method, each receiver recovers independent linear integer combinations of the desirable messages each from two independent equations. We propose an efficient algorithm to sequentially find the equations and integer combinations with maximum rates. We evaluate the performance of our scheme and compare the results with the minimum mean-square error (MMSE) and zero-forcing (ZF), as well as the IFLR schemes. The results indicate that our IFMR scheme outperforms the MMSE and ZF schemes, in terms of achievable rate, considerably. Also, compared to IFLR, the IFMR scheme achieves slightly less rates in moderate signal-to-noise ratios, with significantly less implementation complexity.

Includes members:
  Member "integer forcing and forward transceiver design for mimo multipair two way relaying":
    also connected through other hyperedges:
      (none)
  Member "successive integer forcing and its sum rate optimality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "integer forcing architectures for uplink cloud radio access networks")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "simplified compute and forward and its performance analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polynomially solvable instances of the shortest and closest vector problems with applications to compute and forward")
  Member "on complex lll algorithm for integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer forcing linear receivers a design criterion for full diversity stbcs")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private information retrieval over gaussian mac")
  Member "integer forcing mimo linear receivers based on lattice reduction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "steepest gradient based orthogonal precoder for integer forcing mimo")
  Member "integer forcing linear receivers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)