human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "message and state cooperation in a relay channel when the relay has strictly causal state information"):
  Abstract: A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between source and relay on both transmission of message and state information to the destination. First, an achievable scheme, inspired by noisy network coding, is proposed that exploits both message and state cooperation. Next, based on the given achievable rate and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation.

Includes members:
  Member "multiple access channels with states causally known at transmitters":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cooperative multiple access channels with distributed state information")
  Member "message and state cooperation in a relay channel when only the relay knows the state":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cooperative binning for semideterministic channels")
  Member "message and state cooperation in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiple access channels with states causally known at transmitters")
  Member "noisy network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an information theoretic analysis of the gaussian multicast channel with interactive user cooperation")
  Member "lecture notes on network information theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the required number of antennas in a point to point large but finite mimo system outage limited scenario")
  Member "capacity of a class of modulo sum relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new coding paradigm for the primitive relay channel")
  Member "multiaccess channels with state known to some encoders and independent messages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "gaussian multiple access via compute and forward")

Question: Please tell me which class the source paper 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)