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 tree and degrees of freedom of the symmetric mimo interfering broadcast channel"
  Abstract: In this paper, we study the information theoretic maximal degrees of freedom (DoF) for the symmetric multi-input-multi-output (MIMO) interfering broadcast channel (IBC) with arbitrary antenna configurations. For the G-cell K-user MXN MIMO-IBC network, we find that the information theoretic maximal DoF per user are related to three DoF bounds: 1) the decomposition DoF bound d^{Decom}=MN/(M+KN), a lower-bound of linear interference alignment (IA) with infinite time/frequency extensions (called asymptotic IA); 2) the proper DoF bound d^{Proper}=(M+N)/(GK+1), an upper-bound of linear IA without time/frequency extensions (called linear IA); and 3) the quantity DoF bound d^{Quan}, a zigzag piecewise linear function of M and N. The whole region of M/N can be divided into two regions, Region I and Region II. Specifically, for most configurations in Region I, the information theoretic maximal DoF are the decomposition DoF bound and can be achieved by the asymptotic IA. For all configurations in Region II, the information theoretic maximal DoF are the quantity DoF bound and can be achieved by the linear IA. To obtain the tight upper-bound, we propose a unified way to construct genies, where the genies help each base station or user resolve the maximal number of interference. According to the feature that the designed genies with the same dimension can derive identical DoF upper-bound, we convert the information theoretic DoF upper-bound problem into a linear algebra problem and obtain the closed-form DoF upper-bound expression. Moreover, we develop a non-iterative linear IA transceiver to achieve the DoF upper-bound for the networks with antenna configurations in Region II, which means that the derived DoF upper-bound is tightest. The basic principles to derive the DoF upper-bound and design the linear IA transceiver to achieve the DoF upper-bound can be extended into general asymmetric networks.

Connected through hyperedge HE-1 (induced by source paper "on the degrees of freedom of the miso interference broadcast channel with delayed csit"):
  with members:
    - "achievable dof delay trade offs for the k user mimo interference channel with delayed csit"
    - "achievable sum dof of the k user mimo interference channel with delayed csit"
    - "retrospective interference alignment for the mimo interference broadcast channel"
    - "optimal use of current and outdated channel state information degrees of freedom of the miso bc with mixed csit"
    - "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"
    - "mimo broadcast channels with finite rate feedback"

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"
    - "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"
    - "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 "degrees of freedom of uplink downlink multiantenna cellular networks"):
  with members:
    - "degrees of freedom of full duplex multiantenna cellular networks"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "cellular interference alignment"
    - "hetnets and massive mimo modeling potential gains and performance analysis"
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "genie chain and degrees of freedom of symmetric mimo interference broadcast channels"
    - "degrees of freedom of mimo cellular networks decomposition and linear beamforming design"
    - "regularized zero forcing interference alignment for the two cell mimo interfering broadcast channel"

Connected through hyperedge HE-4 (induced by source paper "on non integer linear degrees of freedom of constant two cell mimo cellular networks"):
  with members:
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "genie chain and degrees of freedom of symmetric mimo interference broadcast channels"
    - "maximum rate transmission with improved diversity gain for interference networks"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "spatial degrees of freedom of the multicell mimo multiple access channel"
    - "downlink interference alignment"
    - "interference alignment with asymmetric complex signaling settling the host madsen nosratinia conjecture"

Connected through hyperedge HE-5 (induced by source paper "on the degrees of freedom of asymmetric mimo interference broadcast channels"):
  with members:
    - "on the feasibility of linear interference alignment for mimo interference broadcast channels with constant coefficients"
    - "on the degrees of freedom achievable through interference alignment in a mimo interference channel"
    - "subspace alignment chains and the degrees of freedom of the three user mimo interference channel"
    - "geometry of the 3 user mimo interference channel"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on feasibility of interference alignment in mimo interference networks"
    - "degrees of freedom of the k user m times n 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)