human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit"):
  with members:
    - "degrees of freedom of the k user miso interference channel with delayed local csit"
    - "on the degrees of freedom of the k user miso interference channel with imperfect delayed csit"
    - "retrospective interference alignment for the 3 user mimo interference channel with delayed csit"
    - "ergodic interference alignment with delayed feedback"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "transmit optimization with improper gaussian signaling for interference channels"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-2 (induced by source paper "replication based outer bounds and the optimality of half the cake for rank deficient mimo interference networks"):
  with members:
    - "are generalized cut set bounds tight for the deterministic interference channel"
    - "degrees of freedom of the rank deficient interference channel with feedback"
    - "feasibility of interference alignment for the mimo interference channel"
    - "the dof of the asymmetric mimo interference channel with square direct link channel matrices"
    - "the feasibility conditions for interference alignment in mimo networks"
    - "genie tree and degrees of freedom of the symmetric mimo interfering broadcast channel"
    - "a feasibility test for linear interference alignment in mimo channels with constant coefficients"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"

Connected through hyperedge HE-3 (induced by source paper "the dof of the asymmetric mimo interference channel with square direct link channel matrices"):
  with members:
    - "feasibility of interference alignment for the mimo interference channel"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "settling the feasibility of interference alignment for the mimo interference channel the symmetric square case"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "geometry of the 3 user mimo interference channel"
    - "interference alignment for the k user mimo interference channel"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-4 (induced by source paper "the dof of the 3 user p p 1 mimo interference channel"):
  with members:
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "interference alignment for the k user mimo interference channel"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on feasibility of interference alignment in mimo interference networks"
    - "ergodic interference alignment"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"

Connected through hyperedge HE-5 (induced by source paper "genie tree and degrees of freedom of the symmetric mimo interfering broadcast channel"):
  with members:
    - "feasibility of interference alignment for the mimo interference channel"
    - "the feasibility conditions for interference alignment in mimo networks"
    - "alternating rate profile optimization in single stream mimo interference channels"
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "degrees of freedom of mimo cellular networks decomposition and linear beamforming design"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "a feasibility test for linear interference alignment in mimo channels with constant coefficients"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"

Question: Please tell me which class the center node 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)