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 "perfect interference alignment for an interference network with general message demands"):
  Abstract: Dimensionality requirement poses a major challenge for Interference alignment (IA) in practical systems. This work evaluates the necessary and sufficient conditions on channel structure of a fully connected general interference network to make perfect IA feasible within limited number of channel extensions. So far, IA feasibility literature have mainly focused on network topology, in contrast, this work makes use of the channel structure to achieve total number of degrees of freedom (DoF) of the considered network by extending the channel aided IA scheme to the case of interference channel with general message demands. We consider a single-hop interference network with $K$ transmitters and $N$ receivers each equipped with a single antenna. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. Obtained channel aiding conditions can be considered as the optimal DoF feasibility conditions on channel structure. As a byproduct, assuming optimal DoF assignment, it is proved that in a general interference network, there is no user with a unique maximum number of DoF.

Includes members:
  Member "the approximate sum capacity of the symmetric gaussian k user interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "ergodic fading interference channels sum capacity and separability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference regime enforcing rate maximization for non orthogonal multiple access noma")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "on feasibility of interference alignment in mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint optimization of signal design and resource allocation in wireless d2d edge computing")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "capacity bounds for the gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)