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: "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit"
  Abstract: The    $K$   -user multiple-input and multiple-output (MIMO) broadcast channel (BC) with no channel state information at the transmitter is considered, where each receiver is assumed to be equipped with either conventional antennas or reconfigurable antennas in which each reconfigurable antenna is capable of choosing a subset of receiving modes from several preset modes. Under general antenna configurations, the sum linear degrees of freedom (DoFs) of the    $K$   -user MIMO BC with reconfigurable antennas are completely characterized, which corresponds to the maximum sum DoF achievable by linear coding strategies.

Connected through hyperedge HE-1 (induced by source paper "throughput region of spatially correlated interference packet networks"):
  with members:
    - "optimal sum dof of the k user miso bc with current and delayed feedback"
    - "optimal dof of the k user broadcast channel with delayed and imperfect current csit"
    - "when does spatial correlation add value to delayed channel state information"
    - "two user erasure interference channels with local delayed csit"
    - "transmit beamforming for miso broadcast channels with statistical and delayed csit"
    - "informational bottlenecks in two unicast wireless networks with delayed csit"
    - "secure degrees of freedom region of the two user miso broadcast channel with alternating csit"
    - "capacity results for binary fading interference channels with delayed csit"

Connected through hyperedge HE-2 (induced by source paper "degrees of freedom of full duplex cellular networks with reconfigurable antennas at base station"):
  with members:
    - "prototyping real time full duplex radios"
    - "degrees of freedom of full duplex multiantenna cellular networks"
    - "degrees of freedom of uplink downlink multiantenna cellular networks"
    - "the feasibility of interference alignment for reverse tdd systems in mimo cellular networks"
    - "in band full duplex wireless challenges and opportunities"
    - "diophantine approach to blind interference alignment of homogeneous k user 2x1 miso broadcast channels"
    - "experiment driven characterization of full duplex wireless systems"
    - "downlink interference alignment"

Connected through hyperedge HE-3 (induced by source paper "topological interference management with reconfigurable antennas"):
  with members:
    - "linear degrees of freedom for k user miso interference channels with blind interference alignment"
    - "topological interference management with just retransmission what are the best topologies"
    - "when does an ensemble of matrices with randomly scaled rows lose rank"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "topological interference management with alternating connectivity"
    - "index coding capacity how far can one go with only shannon inequalities"
    - "index coding an interference alignment perspective"

Connected through hyperedge HE-4 (induced by source paper "linear degrees of freedom for k user miso interference channels with blind interference alignment"):
  with members:
    - "achievable degrees of freedom of the k user siso interference channel with blind interference alignment using staggered antenna switching"
    - "achievable degrees of freedom through blind interference alignment using staggered antenna switching for the k user siso interference channel"
    - "exploiting channel correlations simple interference alignment schemes with no csit"

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)