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 "cellular interference alignment"):
  Abstract: Interference alignment promises that, in Gaussian interference channels, each link can support half of a degree of freedom (DoF) per pair of transmit-receive antennas. However, in general, this result requires to precode the data bearing signals over a signal space of asymptotically large diversity, e.g., over an infinite number of dimensions for time-frequency varying fading channels, or over an infinite number of rationally independent signal levels, in the case of time-frequency invariant channels. In this work we consider a wireless cellular system scenario where the promised optimal DoFs are achieved with linear precoding in one-shot (i.e., over a single time-frequency slot). We focus on the uplink of a symmetric cellular system, where each cell is split into three sectors with orthogonal intra-sector multiple access. In our model, interference is "local", i.e., it is due to transmitters in neighboring cells only. We consider a message-passing backhaul network architecture, in which nearby sectors can exchange already decoded messages and propose an alignment solution that can achieve the optimal DoFs. To avoid signaling schemes relying on the strength of interference, we further introduce the notion of \emph{topologically robust} schemes, which are able to guarantee a minimum rate (or DoFs) irrespectively of the strength of the interfering links. Towards this end, we design an alignment scheme which is topologically robust and still achieves the same optimum DoFs.

Includes members:
  Member "cellular interference alignment omni directional antennas and asymmetric configurations":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved converses and gap results for coded caching")
  Member "feasibility of interference alignment for the mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "interference channels with half duplex source cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the gaussian interference channel with half duplex causal cognition")
  Member "cognitive wyner networks with clustered decoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of dynamic interference management with flexible message assignments")
  Member "flexible backhaul design and degrees of freedom for linear interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wyner s network on caches combining receiver caching with a flexible backhaul")
  Member "on the optimality of treating interference as noise":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "degrees of freedom of mimo cellular networks decomposition and linear beamforming design":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "relay aided mimo cellular networks using opposite directional interference alignment")

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)