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: "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"
  Abstract: We consider both channel coding and source coding, with perfect past feedback/feedforward, in the presence of side information. It is first observed that feedback does not increase the capacity of the Gel'fand-Pinsker channel, nor does feedforward improve the achievable rate-distortion performance in the Wyner-Ziv problem. We then focus on the Gaussian case showing that, as in the absence of side information, feedback/feedforward allows to efficiently attain the respective performance limits. In particular, we derive schemes via variations on that of Schalkwijk and Kailath. These variants, which are as simple as their origins and require no binning, are shown to achieve, respectively, the capacity of Costa's channel, and the Wyner-Ziv rate distortion function. Finally, we consider the finite-alphabet setting and derive schemes for both the channel and the source coding problems that attain the fundamental limits, using variations on schemes of Ahlswede and Ooi and Wornell, and of Martinian and Wornell, respectively.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of communication over state dependent channels with feedback"):
  with members:
    - "the zero error feedback capacity of state dependent channels"

Connected through hyperedge HE-2 (induced by source paper "error free communication over state dependent channels with variable length feedback"):
  with members:
    - "the zero error feedback capacity of state dependent channels"

Connected through hyperedge HE-3 (induced by source paper "the zero error feedback capacity of state dependent channels"):
  with members:
    - "causal state communication"

Connected through hyperedge HE-4 (induced by source paper "concatenated coding using linear schemes for gaussian broadcast channels with noisy channel output feedback"):
  with members:
    - "the awgn bc with mac feedback a reduction to noiseless feedback via interaction"
    - "on the noisy feedback capacity of gaussian broadcast channels"
    - "mimo mac bc duality with linear feedback coding schemes"
    - "an achievable rate region for the broadcast channel with feedback"
    - "capacity of all nine models of channel output feedback for the two user interference channel"
    - "using channel output feedback to increase throughput in hybrid arq"
    - "lqg control approach to gaussian broadcast channels with feedback"
    - "feedback capacity of the gaussian interference channel to within 2 bits"

Connected through hyperedge HE-5 (induced by source paper "capacity regions of families of continuous time multi user gaussian channels"):
  with members:
    - "extensions of the i mmse relation"
    - "recent results in continuous time network information theory"
    - "wireless network information flow a deterministic approach"
    - "on the gaussian mac with imperfect feedback"
    - "capacity bounds for the gaussian interference channel"
    - "gaussian interference channel capacity to within one bit"
    - "on the capacity of multiple access channels with state information and feedback"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-6 (induced by source paper "asynchronous transmission over single user state dependent channels"):
  with members:
    - "on the multiple access channel with asynchronous cognition"
    - "secret key agreement with channel state information at the transmitter"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-7 (induced by source paper "capacity achieving feedback schemes for gaussian finite state markov channels with channel state information"):
  with members:
    - "convergence of fundamental limitations in feedback communication estimation and feedback control over gaussian channels"
    - "on the capacity of time varying channels with periodic feedback"
    - "the capacity of channels with feedback"
    - "feedback capacity of the first order moving average gaussian channel"

Connected through hyperedge HE-8 (induced by source paper "on channels with asynchronous side information"):
  with members:
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "on the capacity of compound state dependent channels with states known at the transmitter"
    - "carbon copying onto dirty paper"

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)