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 "genie chains exploring outer bounds on the degrees of freedom of mimo interference networks"):
  Abstract: In this paper, we propose a novel “genie chains” approach to obtain information theoretic degrees of freedom (DoF) outer bounds for MIMO wireless interference networks. This new approach creates a chain of mappings from genie signals provided to a receiver to the exposed signal spaces at that receiver, and then the exposed signal spaces serve as the genie signals for the next receiver in the chain subject to certain linear independence requirements. Our approach essentially converts an information theoretic DoF outer bound problem into a linear algebra problem. Several applications of the genie chains approach are presented.

Includes members:
  Member "feasibility of interference alignment for the mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  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 "a feasibility test for linear interference alignment in mimo channels with constant coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "role of interference alignment in wireless cellular network optimization")
  Member "degrees of freedom of mimo x networks spatial scale invariance one sided decomposability and linear feasibility":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degrees of freedom of interference networks with transmitter side caches")
  Member "degrees of freedom of interference channels with comp transmission and reception":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit")
  Member "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalized interference alignment part i theoretical framework")
  Member "geometry of the 3 user mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "channel diversity needed for vector space 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)