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: "degrees of freedom of the rank deficient interference channel with feedback"
  Abstract: We study the sum degrees of freedom (DoFs) of the    $K$   -user rank-deficient interference channel with feedback. For the two-user case, we characterize the sum DoF by developing an achievable scheme and deriving a matching upper bound. For the three-user case, we develop a new achievable scheme which employs interference alignment to efficiently utilize the dimension of the received signal space. In addition, we derive an upper bound for the general    $K$   -user case and show the tightness of the bound when the number of antennas at each node is sufficiently large. As a consequence of these results, we show that feedback can increase the DoF when the number of antennas at each node is large enough as compared with the ranks of channel matrices. This finding is in contrast to the full-rank interference channel where feedback provides no DoF gain. The gain comes from using feedback to provide alternative signal paths, thereby effectively increasing the ranks of desired channel matrices.

Connected through hyperedge HE-1 (induced by source paper "on the symmetric k user interference channels with limited feedback"):
  with members:
    - "asymmetric compute and forward with csit"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "on the capacity region and the generalized degrees of freedom region for the mimo interference channel with feedback"
    - "the approximate sum capacity of the symmetric gaussian k user interference channel"
    - "wireless network information flow a deterministic approach"
    - "interference channels with rate limited feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"
    - "on channel output feedback in deterministic interference channels"

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:
    - "genie chains exploring outer bounds on the degrees of freedom of mimo interference networks"
    - "are generalized cut set bounds tight for the deterministic interference channel"
    - "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"

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)