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: "aiming perfectly in the dark blind interference alignment through staggered antenna switching"
  Abstract: We propose a blind interference alignment scheme for the vector broadcast channel where the transmitter is equipped with M antennas and there are K receivers, each equipped with a reconfigurable antenna capable of switching among M preset modes. Without any knowledge of the channel coefficient values at the transmitters and with only mild assumptions on the channel coherence structure we show that MK/M+K-1 degrees of freedom are achievable. The key to the blind interference alignment scheme is the ability of the receivers to switch between reconfigurable antenna modes to create short term channel fluctuation patterns that are exploited by the transmitter. The achievable scheme does not require cooperation between transmit antennas and is therefore applicable to the MxK X network as well. Only finite symbol extensions are used, and no channel knowledge at the receivers is required to null the interference.

Connected through hyperedge HE-1 (induced by source paper "linear degrees of freedom of mimo broadcast channels with reconfigurable antennas in the absence of csit"):
  with members:
    - "fundamental limits of spectrum sharing full duplex multicell networks"
    - "degrees of freedom of full duplex cellular networks with reconfigurable antennas at base station"
    - "real interference alignment exploiting the potential of single antenna systems"
    - "degrees of freedom of uplink downlink multiantenna cellular networks"
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "linear degrees of freedom of the mimo x channel with delayed csit"
    - "diophantine approach to blind interference alignment of homogeneous k user 2x1 miso broadcast channels"
    - "a new outer bound via interference localization and the degrees of freedom regions of mimo interference networks with no csit"

Connected through hyperedge HE-2 (induced by source paper "joint spatial division and multiplexing"):
  with members:
    - "a coordinated approach to channel estimation in large scale multiple antenna systems"
    - "network mimo with linear zero forcing beamforming large system analysis impact of channel estimation and reduced complexity scheduling"
    - "achieving massive mimo spectral efficiency with a not so large number of antennas"
    - "improved subspace estimation for multivariate observations of high dimension the deterministic signals case"
    - "completely stale transmitter channel state information is still very useful"
    - "training and feedback optimization for multiuser mimo downlink"
    - "multiuser mimo achievable rates with downlink training and channel state feedback"

Connected through hyperedge HE-3 (induced by source paper "degrees of freedom region for an interference network with general message demands"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "degrees of freedom regions of two user mimo z and full interference channels the benefit of reconfigurable antennas"
    - "interference alignment for the k user mimo interference channel"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "on the degrees of freedom regions of two user mimo z and full interference channels with reconfigurable antennas"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"

Connected through hyperedge HE-4 (induced by source paper "two user interference channels with local views on capacity regions of tdm dominating policies"):
  with members:
    - "sum capacity of interference channels with a local view impact of distributed decisions"
    - "wireless network information flow a deterministic approach"
    - "on achieving local view capacity via maximal independent graph scheduling"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "a coordinate system for gaussian networks"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "an axiomatic theory of fairness in network resource allocation"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"

Connected through hyperedge HE-5 (induced by source paper "the degrees of freedom regions of two user and certain three user mimo broadcast channels with delayed csit"):
  with members:
    - "the degrees of freedom region of the mimo interference channel with shannon feedback"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "completely stale transmitter channel state information is still very useful"
    - "retrospective interference alignment"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "on degrees of freedom region of mimo networks without csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "limited feedback based block diagonalization for the mimo broadcast channel"

Connected through hyperedge HE-6 (induced by source paper "on the degrees of freedom regions of two user mimo z and full interference channels with reconfigurable antennas"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "mimo z interference channels capacity under strong and noisy interference"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "on degrees of freedom region of mimo networks without csit"

Connected through hyperedge HE-7 (induced by source paper "retrospective interference alignment"):
  with members:
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "on the degrees of freedom of the compound mimo broadcast channels with finite states"
    - "isotropic mimo interference channels without csit the loss of degrees of freedom"
    - "on degrees of freedom region of mimo networks without csit"
    - "the degrees of freedom regions of mimo broadcast interference and cognitive radio channels with no csit"
    - "mimo broadcast channels with finite rate feedback"

Connected through hyperedge HE-8 (induced by source paper "interference alignment for the multi antenna compound wiretap channel"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "interference alignment for secrecy"
    - "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel"
    - "real interference alignment with real numbers"
    - "degraded compound multi receiver wiretap channels"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al"
    - "secure degrees of freedom for gaussian channels with interference structured codes outperform gaussian signaling"

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)