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: "multiple access channels with cooperative encoders and channel state information"
  Abstract: The two-user Multiple Access Channel (MAC) with cooperative encoders and Channel State Information (CSI) is considered where two different scenarios are investigated: A two-user MAC with common message (MACCM) and a two-user MAC with conferencing encoders (MACCE). For both situations, the two cases where the CSI is known to the encoders either non-causally or causally are studied. Achievable rate regions are established for both discrete memoryless channels and Gaussian channels with additive interference. The achievable rate regions derived for the Gaussian models with additive interference known non-causally to the encoders are shown to coincide with the capacity region of the same channel with no interference. Therefore, the capacity region for such channels is established.

Connected through hyperedge HE-1 (induced by source paper "a new and more general capacity theorem for the gaussian channel with two sided input noise dependent state information"):
  with members:
    - "achievable rate regions for the dirty multiple access channel with partial side information at the transmitters"
    - "joint source channel coding with correlated interference"

Connected through hyperedge HE-2 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters"):
  with members:
    - "capacity results for binary fading interference channels with delayed csit"
    - "multiple access channels with states causally known at transmitters"
    - "secure degrees of freedom of mimo x channels with output feedback and delayed csit"
    - "estimation with a helper who knows the interference"
    - "wyner ziv type versus noisy network coding for a state dependent mac"
    - "on achievable degrees of freedom for mimo x channels"
    - "wireless network information flow a deterministic approach"
    - "the state dependent semideterministic broadcast channel"

Connected through hyperedge HE-3 (induced by source paper "multi layer gelfand pinsker strategies for the generalized multiple access channel"):
  with members:
    - "multiple access channels with states causally known at transmitters"
    - "capacity region of multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "capacity bounds for multiuser channels with non causal channel state information at the transmitters"
    - "multiple access channel with states known noncausally at one encoder and only strictly causally at the other encoder"
    - "the state dependent multiple access channel with states available at a cribbing encoder"
    - "multiaccess channels with state known to some encoders and independent messages"

Connected through hyperedge HE-4 (induced by source paper "optimal packet scheduling in energy harvesting multiple access channels with common data"):
  with members:
    - "on online energy harvesting in multiple access communication systems"
    - "two way communication with energy exchange"
    - "on the transfer of information and energy in multi user systems"
    - "transmission with energy harvesting nodes in fading wireless channels optimal policies"
    - "optimal packet scheduling in an energy harvesting communication system"
    - "joint source channel coding over a fading multiple access channel with partial channel state information"

Connected through hyperedge HE-5 (induced by source paper "achievable rate region for multiple access channel with correlated channel states and cooperating encoders"):
  with members:
    - "the state dependent multiple access channel with states available at a cribbing encoder"
    - "multiaccess channels with state known to one encoder another case of degraded message sets"
    - "technical report achievable rates for the mac with correlated channel state 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)