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 and achievable rate of wide band multi cell multiple access channels with no csit"):
  Abstract: This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF) of the considered channel is $\frac{\beta -1}{\beta}K$ with $\beta \geq 2$ when the number of users per cell is sufficiently large, where $\beta$ is the ratio of the maximum channel-impulse-response (CIR) length of desired links to that of interfering links in each cell. Our finding implies that even without instantaneous CSIT, \textit{interference-free DoF per cell} is achievable as $\beta$ approaches infinity with a sufficiently large number of users per cell. This achievability is shown by a blind interference management method that exploits the relativity in delay spreads between desired and interfering links. In this method, all inter-cell-interference signals are aligned to the same direction by using a discrete-Fourier-transform-based precoding with cyclic prefix that only depends on the number of CIR taps. Using this method, we also characterize the achievable sum rate of the considered channel, in a closed-form expression.

Includes members:
  Member "interference free ofdm rethinking ofdm for interference networks with inter symbol interference":
    also connected through other hyperedges:
      (none)
  Member "spectral efficiency of dynamic coordinated beamforming a stochastic geometry approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "area spectral efficiency and sinr scaling laws in multi antenna cellular networks")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "a practical cooperative multicell mimo ofdma network based on rank coordination":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond dirty paper coding for multi antenna broadcast channel with partial csit a rate splitting approach")
  Member "opportunistic interference alignment for mimo interfering multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi stream opportunistic network decoupling relay selection and interference management")
  Member "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "achievable dof regions of three user mimo broadcast channel with delayed csit")
  Member "not too delayed csit achieves the optimal degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "feedback aided coded caching for the miso bc with small caches")
  Member "a new outer bound via interference localization and the degrees of freedom regions of mimo interference networks with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit")

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)