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: "fading broadcast channels with state information at the receivers"
  Abstract: Despite considerable progress on the information-theoretic broadcast channel, the capacity region of fading broadcast channels with channel state known at the receivers but unknown at the transmitter remains unresolved. We address this subject by introducing a layered erasure broadcast channel model in which each component channel has a state that specifies the received signal levels in an instance of a deterministic binary expansion channel. We find the capacity region of this class of broadcast channels. The capacity achieving strategy assigns each signal level to the user that derives the maximum expected rate from that level. The outer bound is based on a channel enhancement that creates a degraded broadcast channel for which the capacity region is known. This same approach is then used to find inner and outer bounds to the capacity region of fading Gaussian broadcast channels. The achievability scheme employs a superposition of binary inputs. For intermittent AWGN channels and for Rayleigh fading channels, the achievable rates are observed to be with 1-2 bits of the outer bound at high SNR. We also prove that the achievable rate region is within 6.386 bits/s/Hz of the capacity region for all fading AWGN broadcast channels.

Connected through hyperedge HE-1 (induced by source paper "interference and x networks with noisy cooperation and feedback"):
  with members:
    - "on the degrees of freedom of k user siso interference and x channels with delayed csit"
    - "degrees of freedom region of the mimo interference channel with output feedback and delayed csit"
    - "on x channels with feedback and delayed csi"
    - "the degrees of freedom region of the mimo interference channel with shannon feedback"
    - "interference alignment for the mimo interference channel with delayed local csit"
    - "the degrees of freedom region and interference alignment for the mimo interference channel with delayed csi"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "interference channels with destination cooperation"

Connected through hyperedge HE-2 (induced by source paper "capacity bounds for wireless ergodic fading broadcast channels with partial csit"):
  with members:
    - "the capacity region of the wireless ergodic fading interference channel with partial csit to within one bit"
    - "private broadcasting over independent parallel channels"
    - "the two user gaussian fading broadcast channel"
    - "interference networks with general message sets a random coding scheme"
    - "ergodic fading interference channels sum capacity and separability"
    - "a note on outer bounds for broadcast channel"
    - "fading cognitive multiple access channels with confidential messages"
    - "capacity bounds for broadcast channels with confidential messages"

Connected through hyperedge HE-3 (induced by source paper "streaming transmitter over block fading channels with delay constraint"):
  with members:
    - "erasure coding for real time streaming"
    - "diversity embedded streaming erasure codes de sco constructions and optimality"

Connected through hyperedge HE-4 (induced by source paper "capacity of multiple unicast in wireless networks a polymatroidal approach"):
  with members:
    - "real interference alignment exploiting the potential of single antenna systems"
    - "multiuser broadcast erasure channel with feedback capacity and algorithms"
    - "degrees of freedom of interference channels with comp transmission and reception"
    - "multicommodity flows and cuts in polymatroidal networks"
    - "wireless network information flow a deterministic approach"
    - "computation alignment capacity approximation without noise accumulation"
    - "the degrees of freedom of the 2 hop 2 user interference channel with feedback"
    - "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"

Connected through hyperedge HE-5 (induced by source paper "a digital interface for gaussian relay and interference networks lifting codes from the discrete superposition model"):
  with members:
    - "wireless network information flow a deterministic approach"
    - "a digital interface for gaussian relay networks lifting codes from the discrete superposition model to gaussian relay networks"
    - "noisy network coding"
    - "on approximating gaussian relay networks by deterministic networks"
    - "a new outer bound and the noisy interference sum rate capacity for gaussian interference channels"
    - "capacity bounds for the gaussian interference channel"
    - "approximate capacity of the two way relay channel a deterministic approach"
    - "the two user gaussian interference channel a deterministic view"

Connected through hyperedge HE-6 (induced by source paper "on interference alignment and the deterministic capacity for cellular channels with weak symmetric cross links"):
  with members:
    - "interference channels with source cooperation"
    - "the approximate capacity of the many to one and one to many gaussian interference channels"
    - "the two user gaussian interference channel a deterministic view"
    - "a deterministic approach to wireless relay networks"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "aligned interference neutralization and the degrees of freedom of the 2x2x2 interference channel"):
  with members:
    - "distributed data storage with minimum storage regenerating codes exact and functional repair are asymptotically equally efficient"
    - "exploiting channel correlations simple interference alignment schemes with no csit"
    - "sum capacity and the unique separability of the parallel gaussian mac z bc network"
    - "error exponents for the gaussian channel with active noisy feedback"
    - "capacity bounds for two hop interference networks"
    - "real interference alignment with real numbers"
    - "on the degrees of freedom of the k user gaussian interference channel"
    - "on the sum capacity of a class of cyclically symmetric deterministic interference channels"

Connected through hyperedge HE-8 (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"
    - "ergodic fading one sided interference channels without state information at transmitters"
    - "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"

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)