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 "cooperative relaying with state available at the relay"):
  Abstract: We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition capabilities, i.e, the relay in our model. In the discrete memoryless (DM) case, we derive lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that consists in a combination of codeword splitting, Gelpsilafand-Pinsker binning, and a decode-and-forward scheme. The upper bound is better than that obtained by assuming the availability of state at the source, the relay, and the destination. For the Gaussian case, we also derive lower and upper bounds on channel capacity. The lower bound, obtained by a coding scheme based on combination of codeword splitting and generalized dirty paper coding, is tight in some cases if the channel is physically degraded. The upper bound is also better than that obtained by assuming that the channel state is available at the source, the relay, and the destination.

Includes members:
  Member "multiaccess channels with state known to one encoder another case of degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "state dependent gaussian multiple access channels new outer bounds and capacity results")
  Member "rate regions for the partially cooperative relay broadcast channel with non causal side information":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on cooperative multiple access channels with delayed csi at transmitters")

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)