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: "on the capacity of compound state dependent channels with states known at the transmitter"
  Abstract: This paper investigates the capacity of compound state-dependent channels with non-causal state information available at only the transmitter. A new lower bound on the capacity of this class of channels is derived. This bound is shown to be tight for the special case of compound channels with stochastic degraded components, yielding the full characterization of the capacity. Specific results are derived for the compound Gaussian Dirty-Paper (GDP) channel. This model consists of an additive white Gaussian noise (AWGN) channel corrupted by an additive Gaussian interfering signal, known at the transmitter only, where the input and the state signals are affected by fading coefficients whose realizations are unknown at the transmitter. Our bounds are shown to be tight for specific cases. Applications of these results arise in a variety of wireless scenarios as multicast channels, cognitive radio and problems with interference cancellation.

Connected through hyperedge HE-1 (induced by source paper "on the capacity of the carbon copy onto dirty paper channel"):
  with members:
    - "on capacity of the dirty paper channel with fading dirt in the strong fading regime"
    - "the impact of phase fading on the dirty paper channel"
    - "is non unique decoding necessary"
    - "an achievability scheme for the compound channel with state noncausally available at the encoder"
    - "dirty paper coding for fading channels with partial transmitter side information"
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "carbon copying onto dirty paper"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-2 (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"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-3 (induced by source paper "parallel gaussian networks with a common state cognitive helper"):
  with members:
    - "on the achievable rate regions for state dependent gaussian interference channel"
    - "secret key agreement with channel state information at the transmitter"
    - "the state dependent semideterministic broadcast channel"
    - "bounds on the capacity of the relay channel with noncausal state at source"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "distributed interference cancellation in multiple access channels"
    - "lattice strategies for the dirty multiple access channel"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-4 (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"
    - "coding for the feedback gel fand pinsker channel and the feedforward wyner ziv source"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-5 (induced by source paper "on capacity of the dirty paper channel with fading dirt in the strong fading regime"):
  with members:
    - "writing on dirty paper with resizing and its application to quasi static fading broadcast channels"
    - "carbon copying onto dirty paper"

Connected through hyperedge HE-6 (induced by source paper "on the compound broadcast channel multiple description coding and interference decoding"):
  with members:
    - "is non unique decoding necessary"
    - "simultaneous nonunique decoding is rate optimal"

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)