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: "ergodic fading one sided interference channels without state information at transmitters"
  Abstract: This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the receivers. A layered erasure model with one-sided interference and with arbitrary fading statistics is studied first, whose capacity region is completely determined as a polygon. Each dominant rate pair can be regarded as the outcome of a trade-off between the rate gain of the interference-free user and the rate loss of the other user due to interference. Using insights from the layered erasure model, inner and outer bounds of the capacity region are provided for the one-sided fading Gaussian interference channels. In particular, the inner bound is achieved by artificially creating layers in the signaling of the interference-free user. The outer bound is developed by characterizing a similar trade-off as in the erasure model by taking a "layered" view using the incremental channel approach. Furthermore, the gap between the inner and outer bounds is no more than 12.772 bits per channel use per user, regardless of the signal-to-noise ratios and fading statistics.

Connected through hyperedge HE-1 (induced by source paper "degrees of freedom regions of two user mimo z and full interference channels the benefit of 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"
    - "the degrees of freedom of mimo interference channels without state information at transmitters"
    - "mimo z interference channels capacity under strong and noisy interference"
    - "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-2 (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"
    - "aiming perfectly in the dark blind interference alignment through staggered antenna switching"
    - "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"
    - "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-3 (induced by source paper "the degrees of freedom of mimo interference channels without state information at transmitters"):
  with members:
    - "degrees of freedom regions of two user mimo z and full interference channels the benefit of reconfigurable antennas"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "capacity regions and sum rate capacities of vector gaussian interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "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"
    - "degrees of freedom of the k user m times n mimo interference channel"

Connected through hyperedge HE-4 (induced by source paper "estimation in gaussian noise properties of the minimum mean square error"):
  with members:
    - "lecture notes on network information theory"
    - "on mmse properties and i mmse implications in parallel mimo gaussian channels"
    - "hessian and concavity of mutual information differential entropy and entropy power in linear vector gaussian channels"
    - "fading broadcast channels with state information at the receivers"
    - "generalized entropy power inequalities and monotonicity properties of information"
    - "randomly spread cdma asymptotics via statistical physics"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-5 (induced by source paper "capacity region of layered erasure one sided interference channels without csit"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "diversity multiplexing tradeoff of the two user interference channel"
    - "ergodic layered erasure one sided interference channels"
    - "fading broadcast channels with state information at the receivers"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of fading mimo broadcast channels with imperfect transmitter side information"

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)