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 "degrees of freedom of the three user rank deficient mimo interference channel"):
  Abstract: We provide the degrees of freedom (DoF) characterization for the three-user M#N# T#N# × M#N# R#N# multiple-input-multipleoutput (MIMO) interference channel (IC) with rank-deficient channel matrices, where each transmitter is equipped with M#N# T#N# antennas and each receiver with M#N# R#N# antennas, and the interfering channel matrices from each transmitter to the other two receivers are of ranks D#N# 1#N# and D#N# 2#N#, respectively. One important intermediate step for both the converse and achievability arguments is to convert the fully-connected rank-deficient channel into an equivalent partially-connected full-rank MIMO-IC by invertible linear transformations. As such, existing techniques developed for full-rank MIMO-IC can be incorporated to derive the DoF outer and inner bounds for the rank-deficient case. Our result shows that when the interfering links are weak in terms of the channel ranks, i.e., D#N# 1#N# + D#N# 2#N# ≤ min(M#N# T#N#, M#N# R#N#), zero forcing is sufficient to achieve the optimal DoF. On the other hand, when D#N# 1#N# + D#N# 2#N# > min(M#N# T#N# , M#N# R#N#), a combination of zero forcing and interference alignment is in general required for DoF optimality. The DoF characterization obtained in this paper unifies several existing results in the literature.

Includes members:
  Member "degrees of freedom of interference channels with comp transmission and reception":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")
  Member "subspace alignment chains and the degrees of freedom of the three user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit")
  Member "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "two user simo interference channel with tin improper signaling versus time sharing")
  Member "degrees of freedom of the k user m times n mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "noma an information theoretic perspective")
  Member "gaussian interference channel capacity to within one bit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)