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 "ergodic interference alignment"):
  Abstract: This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading. At any particular time, each receiver will see a superposition of the transmitted signals plus noise. The standard approach to such a scenario results in each transmitter-receiver pair achieving a rate proportional to 1/K its interference-free ergodic capacity. However, given two well-chosen time indices, the channel coefficients from interfering users can be made to exactly cancel. By adding up these two observations, each receiver can obtain its desired signal without any interference. If the channel gains have independent, uniform phases, this technique allows each user to achieve at least 1/2 its interference-free ergodic capacity at any signal-to-noise ratio. Prior interference alignment techniques were only able to attain this performance as the signal-to-noise ratio tended to infinity. Extensions are given for the case where each receiver wants a message from more than one transmitter as well as the "X channel" case (with two receivers) where each transmitter has an independent message for each receiver. Finally, it is shown how to generalize this strategy beyond Gaussian channel models. For a class of finite field interference channels, this approach yields the ergodic capacity region.

Includes members:
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "private information retrieval over gaussian mac")
  Member "on the degrees of freedom achievable through interference alignment in a mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "delay rate tradeoff in ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymptotic sum capacity of random gaussian interference networks using interference alignment")
  Member "the ergodic capacity of phase fading interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on cooperation and interference in the weak interference regime full version with detailed proofs")
  Member "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "generalized interference alignment part i theoretical framework")
  Member "interference alignment based sum capacity bounds for random dense gaussian interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "delay rate tradeoff in ergodic interference alignment")
  Member "ergodic fading interference channels sum capacity and separability":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")

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)